Results 11  20
of
78
Exact asymptotics for fluid queues fed by multiple heavytailed onoff flows
 Ann. Appl. Probab
"... We consider a fluid queue fed by multiple On–Off flows with heavytailed (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 heavytailed (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 reducedload equivalence, the results for the reduced system provide a characterization of the tail of the workload distribution for a wide range of traffic scenarios.
Asymptotic Behavior of Generalized Processor Sharing with LongTailed Traffic Sources
 IN: PROC. INFOCOM 2000 CONFERENCE
, 1999
"... We analyze the asymptotic behavior of longtailed traffic sources under the Generalized Processor Sharing (GPS) discipline. GPSbased scheduling algorithms, such as Weighted Fair Queueing, have emerged as an important mechanism for achieving differentiated qualityofservice in integratedservices n ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
We analyze the asymptotic behavior of longtailed traffic sources under the Generalized Processor Sharing (GPS) discipline. GPSbased scheduling algorithms, such as Weighted Fair Queueing, have emerged as an important mechanism for achieving differentiated qualityofservice in integratedservices networks. Under certain conditions, we prove that in an asymptotic sense an individual source with longtailed traffic characteristics is effectively served at a constant rate, which may be interpreted as the maximum feasible average rate for that source to be stable. Thus, asymptotically, the source is only affected by the traffic characteristics of the other sources through their average rate. In particular, the source is essentially immune from excessive activity of sources with `heavier'tailed traffic characteristics. This suggests that GPSbased scheduling algorithms provide an effective mechanism for extracting high multiplexing gains, while protecting individual connections.
SelfSimilar Communication Models And Very Heavy Tails
, 1998
"... Several studies of file sizes either being downloaded or stored in the world wide web have commented that tails can be so heavy that not only are variances infinite, but so are means. Motivated by this fact, we study the infinite node Poisson model under the assumption that transmission times are h ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
Several studies of file sizes either being downloaded or stored in the world wide web have commented that tails can be so heavy that not only are variances infinite, but so are means. Motivated by this fact, we study the infinite node Poisson model under the assumption that transmission times are heavy tailed with infinite mean. The model is unstable but we are able to provide growth rates. Selfsimilar but nonstationary Gaussian process approximations are provided for the number of active sources, cumulative input, buffer content and time to buffer overflow.
Empirical Testing Of The Infinite Source Poisson Data Traffic Model
, 2000
"... The infinite source Poisson model is a fluid queue approximation of network data transmission that assumes that sources begin constant rate transmissions of data at Poisson time points for random lengths of time. This model has been a popular one as analysts attempt to provide explanations for obser ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
(Show Context)
The infinite source Poisson model is a fluid queue approximation of network data transmission that assumes that sources begin constant rate transmissions of data at Poisson time points for random lengths of time. This model has been a popular one as analysts attempt to provide explanations for observed features in telecommunications data such as selfsimilarity, long range dependence and heavy tails. We survey some features of this model in cases where transmission length distributions have (a) tails so heavy that means are infinite, (b) heavy tails with finite mean and infinite variance and (c) finite variance. We survey the selfsimilarity properties of various descriptor processes in this model and then present analyses of four data sets which show that certain features of the model are consistent with the data while others are contradicted. The data sets are 1) the Boston University 1995 study of web sessions, 2) the UC Berkeley home IP HTTP data collected in November 1996, 3) tr...
Capacity Regions for Network Multiplexers with HeavyTailed Fluid OnOff Sources
, 2001
"... Consider a network multiplexer with a finite buffer fed by a superposition of independent heterogeneous OnOff sources. An OnOff 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 OnOff sources. An OnOff 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. KeywordsNetwork multiplexer, Finite buffer fluid queue, OnOff process, Heavytailed distributions, Subexponential distributions, Longrange dependence I.
Reduced Load Equivalence under Subexponentiality
, 2001
"... A+B of a queue with capacity # loaded by two independent processes A and B is investigated. When the probability of load deviation in process A decays slower than both in B and e  , we show that W A+B is asymptotically equal to the reduced load queue W A , where b is the mean rate of B. This co ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
A+B of a queue with capacity # loaded by two independent processes A and B is investigated. When the probability of load deviation in process A decays slower than both in B and e  , we show that W A+B is asymptotically equal to the reduced load queue W A , where b is the mean rate of B. This complements the known result that this property does not hold when both processes have lighter than e  deviation decay rates. Furthermore, using the same methodology, we show that under an equivalent set of conditions the results on sampling at subexponential times hold. Keywords: Large deviations, nonCramer type conditions, reduced load equivalence, independent sampling, subexponential distributions 1
Dynamic bandwidth allocation algorithms for highspeed data wireless networks,” tech
, 2000
"... Nextgeneration wireless networks are expected to support a wide range of highspeed data services, with Web browsing as one of the major applications. Although high data rates have been shown feasible in a singleuser setting, the resource allocation issues that arise in a multipleuser context rema ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
Nextgeneration wireless networks are expected to support a wide range of highspeed data services, with Web browsing as one of the major applications. Although high data rates have been shown feasible in a singleuser setting, the resource allocation issues that arise in a multipleuser context remain extremely challenging. Compared with voice, data traffic is typically more bursty, while the users are less sensitive to delay. These characteristics require resource allocation strategies to operate in a fundamentally different manner if the spectrum is to be used efficiently. In this paper we propose several algorithms for scheduling the efficient transmission of data to multiple users. As a new feature, the various schemes exploit knowledge of the buffer contents to achieve high throughput, while maintaining fairness by providing quality of service (QoS) to individual users. The proposed algorithms are backward compatible with existing cellular and personal communications services (PCS) standards such as IS136. They provide a powerful approach to improving spectrum efficiency in forthcoming highspeed data cellular services. The extensive simulation experiments we present in this paper demonstrate that the algorithms significantly outperform conventional schemes.
Scheduling Strategies and LongRange Dependence
 Queueing Systems
, 1999
"... This paper is another contribution to understanding the effect that longrange dependent traffic can have on the performance of communication networks. Our goal here is to investigate the role of scheduling policies in controlling such effects. We carry out this investigation in the framework of a s ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
This paper is another contribution to understanding the effect that longrange dependent traffic can have on the performance of communication networks. Our goal here is to investigate the role of scheduling policies in controlling such effects. We carry out this investigation in the framework of a single server queuing model, described below
Asymptotic analysis of GPS systems fed by heterogeneous longtailed sources
 IN PROC. IEEE INFOCOM
, 2001
"... In this paper we consider a multibuffered system consisting of N buffers accessed by heterogeneous longtailed sessions and served according to the Generalized Processor Sharing (GPS) discipline with weights fOE i g. We assume that sessions arrive according to a Poisson process. A session of type i ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper we consider a multibuffered system consisting of N buffers accessed by heterogeneous longtailed sessions and served according to the Generalized Processor Sharing (GPS) discipline with weights fOE i g. We assume that sessions arrive according to a Poisson process. A session of type i transmits at rate r i and has a duration whose distribution is longtailed of the form P ( i ? t) ff i t \Gamma(1+fi i ) where ff i , fi i ? 0. We obtain the large buffer asymptotics under very general stability hypotheses. In particular we show that recent results on the GPS asymptotics obtained by Borst, Boxma and Jelenkovic can be recovered and there are important cases for which we obtain exact asymptotes for which the previous results do not apply. The methodology exploits the samplepath description of the workload evolution under GPS as well as the marked Poisson structure of the inputs.