The issue of Quality of Service (QoS) performance analysis in packet switched networks has drawn a lot of attention in the networking community in recent years. There is a lot of work including an elegant theory under the name of network calculus focusing on analysis of deterministic worst case QoS performance bounds. In the meantime, other researchers have studied the stochastic QoS performanc...

This paper discusses the preservation of some stochastic orders between two interdependent series and parallel systems when the survival and distribution functions of all components switch to the exponentiated model. For the series systems, the likelihood ratio, hazard rate, usual, aging faster, aging intensity, convex transform, star, superadditive and dispersive orderings, and for the paralle...

The service capacities of a source peer at different times in a peer-to-peer (P2P) network exhibit temporal correlation. Unfortunately, there is no analytical resultwhich clearly characterizes the expected download time from a source peer with stochastic and time-varying service capacity. The main contribution of this paper is to analyze the expected file download time in P2P networks with stoc...

This research is to develop a new form of stochastic network calculus for queuing system performance guarantees by making use of the Legendre transform at the sample-path level. A symmetrical formulation is resulted in through separate modeling of traffic flows and service capacities. Performance measures at single nodes and the service capacities of tandem systems are explicitly bounded at the...

Motivated by large-scale service systems with network structure and non-exponential customer abandonment, in a previous paper we introduced a non-Markovian time-varying open network of many-server fluid queues with customer abandonment from each queue and timevarying proportional routing among the queues, and showed how performance functions can be determined. The deterministic fluid model serv...

In this paper, we propose an ordinal optimization approach to solve for a good enough solution of the stochastic simulation optimization problem with huge decision-variable space. We apply the proposed ordinal optimization algorithm to G/G/1/K polling systems to solve for a good enough number-limited service discipline to minimize the weighting average waiting time. We have compared our results...