Results 1 - 10
of
34
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- Theory Appl
, 2000
"... ..."
(Show Context)
Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows
- Ann. Appl. Probab
"... We consider a fluid queue fed by multiple On–Off flows with heavy-tailed (regularly varying) On periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a “dominant ” subset of the flows, ..."
Abstract
-
Cited by 22 (10 self)
- Add to MetaCart
(Show Context)
We consider a fluid queue fed by multiple On–Off flows with heavy-tailed (regularly varying) On periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a “dominant ” subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a dominant set may be determined from a simple knapsack formulation. The dominant set consists of a “minimally critical ” set of On– Off flows with regularly varying On periods. In case the dominant set contains just a single On–Off flow, the exact asymptotics for the reduced system follow from known results. For the case of several On–Off flows, we exploit a powerful intuitive argument to obtain the exact asymptotics. Combined with the reduced-load equivalence, the results for the reduced system provide a characterization of the tail of the workload distribution for a wide range of traffic scenarios.
Capacity Regions for Network Multiplexers with Heavy-Tailed Fluid On-Off Sources
, 2001
"... Consider a network multiplexer with a finite buffer fed by a superposition of independent heterogeneous On-Off sources. An On-Off source consists of a sequence of alternating independent activity and silence periods. During its activity period a source produces fluid with constant rate. For this sys ..."
Abstract
-
Cited by 17 (6 self)
- Add to MetaCart
Consider a network multiplexer with a finite buffer fed by a superposition of independent heterogeneous On-Off sources. An On-Off source consists of a sequence of alternating independent activity and silence periods. During its activity period a source produces fluid with constant rate. For this system, under the assumption that the residual activity periods are intermediately regularly varying, we derive explicit and asymptotically exact formulas for approximating the stationary overflow probability and loss rate. The derived asymptotic formulas, in addition to their analytical tractability, exhibit excellent quantitative accuracy, which is illustrated by a number of simulation experiments. We demonstrate through examples how these results can be used for efficient computing of capacity regions for network switching elements. Furthermore, the results provide important insight into qualitative tradeoffs between the overflow probability, offered traffic load, available capacity, and buffer space. Overall, they provide a new set of tools for designing and provisioning of networks with heavytailed traffic streams. Keywords---Network multiplexer, Finite buffer fluid queue, On-Off process, Heavy-tailed distributions, Subexponential distributions, Long-range dependence I.
Overflow Behavior in Queues with Many Long-Tailed Inputs
- ADVANCES IN APPLIED PROBABILITY
, 1999
"... We consider a fluid queue fed by a superposition of n homogeneous on-off sources with generally distributed on- and off-periods. We scale buffer space B and link rate C by n, such that we get nb and nc, respectively. Then we let n grow large. In this regime, the overflow probability decays exponenti ..."
Abstract
-
Cited by 16 (7 self)
- Add to MetaCart
We consider a fluid queue fed by a superposition of n homogeneous on-off sources with generally distributed on- and off-periods. We scale buffer space B and link rate C by n, such that we get nb and nc, respectively. Then we let n grow large. In this regime, the overflow probability decays exponentially in the number of sources n; we specifically examine the situation in which also b is large. We explicitly compute asymptotics for the case in which the on-periods have a subexponential distribution, e.g., Pareto, Lognormal, or Weibull. We provide a detailed interpretation of our results. Crucial is the shape of the function v(t) := -log P(A* > t) for large t, A* being the residual on-period. If v(·) is slowly varying (e.g., Pareto, Lognormal), then, during the trajectory to overflow, the input rate will only slightly exceed the link rate. Consequently, the buffer will fill `slowly', and the typical time to overflow will be `more than linear' in the buffer size. In contrast, if v(·) ...
Asymptotic Loss Probability in a Finite Buffer Fluid Queue with Heterogeneous Heavy-Tailed On-Off Processes
, 2000
"... Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On-Off processes. An On-Off process consists of a sequence of alternating independent activity and silence periods. Successive activity, as well as silence, periods are identically distributed. The p ..."
Abstract
-
Cited by 14 (5 self)
- Add to MetaCart
(Show Context)
Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On-Off processes. An On-Off process consists of a sequence of alternating independent activity and silence periods. Successive activity, as well as silence, periods are identically distributed. The process is active with probability p on and during its activity period produces fluid with constant rate r. For this queueing system, under the assumption that the residual activity periods are intermediately regularly varying, we derive explicit and asymptotically exact formulas for approximating the stationary loss probability and loss rate. In the case of homogeneous sources with residual activity periods equal in distribution to on r , the queue overflow probability is asymptotically, as B !1, equal to P[Q B = B] = ` N k 0 ' p k 0 on P on r ? B k 0 (r \Gamma ae) +N ae \Gamma c k 0 (1 + o(1)); where ae = rp on , N ae ! c and k 0 is the smallest integer greater than (c...
Tail asymptotics for discriminatory processor sharing queues with heavy-tailed service requirements
- Performance Evaluation
, 2005
"... ..."
A Reduced-load Equivalence for Generalised Processor Sharing Networks with Heavy-tailed Input Flows
- Queueing Systems
, 2000
"... We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flo ..."
Abstract
-
Cited by 11 (6 self)
- Add to MetaCart
We consider networks where traffic is served according to the Generalised Processor Sharing (GPS) principle. GPS-based scheduling algorithms are considered important for providing differentiated quality of service in integrated-services networks. We are interested in the workload of a particular flow i at the bottleneck node on its path. Flow i is assumed to have long-tailed traffic characteristics. We distinguish between two traffic scenarios, (i) flow i generates instantaneous traffic bursts and (ii) flow i generates traffic according to an on/off process. In addition, we consider two configurations of feed-forward networks. First we focus on the situation where other flows join the path of flow i. Then we extend the model by adding flows which can branch off at any node, with cross traffic as a special case. We prove that under certain conditions the tail behaviour of the workload distribution of flow i is equivalent to that in a two-node tandem network where flow i is served in is...
Steady State Distribution Of The Buffer Content For M/G/infinity Input Fluid Queues
, 1999
"... . We consider a fluid queue with ON periods arriving according to a Poisson process and having a long--tailed distribution. This queue has long range dependence, and we compute the asymptotic behavior of the steady state distribution of the buffer content. The tail of this distribution is much heavi ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
. We consider a fluid queue with ON periods arriving according to a Poisson process and having a long--tailed distribution. This queue has long range dependence, and we compute the asymptotic behavior of the steady state distribution of the buffer content. The tail of this distribution is much heavier than the tail of the buffer content distribution of a queue which does not possess long range dependence and which has light tailed ON periods and the same traffic intensity. 1. Introduction and preliminaries We consider a model of a network server (multiplexer) defined as follows. Sessions arrive to the server according to a Poisson process with rate ? 0. Each session lasts a random length of time with distribution F that has a finite mean . The lengths of different sessions are independent of each other and of the Poisson arrival process. A session generates work or traffic or fluid at unit rate, commonly measured in some units of network traffic, e.g. packets; the work that cannot be ...
Asymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis
, 2001
"... Abstract: We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show t ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
(Show Context)
Abstract: We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and new fluid limits obtained for the GPS system that can be of interest by themselves.
Exact Queueing Asymptotics for Multiple Heavy-Tailed On-Off Flows
, 2001
"... We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying) On-periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a `dominant' subset of the flo ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying) On-periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a `dominant' subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a dominant set may be determined from a simple knapsack formulation. We exploit a powerful intuitive argument to obtain the exact asymptotics for the reduced system. Combined with the reduced-load equivalence, the results for the reduced system provide an asymptotic characterization of the buffer behavior. 2000 Mathematics Subject Classification: 60K25 (primary), 60F10, 90B18, 90B22 (secondary). Keywords and Phrases: fluid models, heavy-tailed distributions, knapsack problem, large deviations, queueing theory, reduced-load equivalence. I.
