On the performance of generalized processor sharing under long-range dependent traffic

Fonseca, Nelson L. S. da; Pereira, Flávio de Melo; Arantes, Dalton Soares

doi:10.1109/glocom.2002.1189082

Cited by 12 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finalmente, se tienen algunos estudios más, aplicados en redes [32], [33], [34] y [35] en los cuales se aplica el concepto de GPS para lograr eficiencia en el desempeño.…”

Section: Si El Tipo De Tráfico I Se Retrasa En El In-unclassified

Estado Del Arte De Scheduling Algorithms (Algoritmos De Programación De Envío)

Suárez

Charry²,

Núñez³

2011

redes ing.

View full text Add to dashboard Cite

ResumenEl presente artículo presenta un estado del arte de los llamados algoritmos de programación de envío, o en inglés "scheduling algorithms" los cuales determinan el método en que un dispositivo de red envía paquetes al medio de transmisión. Estos algoritmos son importantes para la consecución de calidad de servicio en redes convergentes y la correcta comprensión de ellos es determinante para entender los fenómenos de tráfico y cumplir los requerimientos dados en los diferentes tipos de redes (Ethernet, TDM, WiMAX, Wireless, etc). AbstractThis article presents state-of-the-art scheduling algorithms, which are employed to determine the method for a network device to forward packets to the transmission medium. Such algorithms are important in achieving Quality of Service on convergent networks. A good understanding of these algorithms is crucial when studying the traffic phenomena and also when fulfilling the requirements associated to different types of networks (e.g. Ethernet, TDM, WiMAX, Wireless,etc).

show abstract

“…Finalmente, se tienen algunos estudios más, aplicados en redes [32], [33], [34] y [35] en los cuales se aplica el concepto de GPS para lograr eficiencia en el desempeño.…”

Section: Si El Tipo De Tráfico I Se Retrasa En El In-unclassified

Estado Del Arte De Scheduling Algorithms (Algoritmos De Programación De Envío)

Suárez

Charry²,

Núñez³

2011

redes ing.

View full text Add to dashboard Cite

show abstract

“…2 , the difference between the upper and lower bounds for the tail of the queue length distribution of the PQC traffic flow is the coefficients of exp(− 1 2 Y (t x )). Examining the upper and lower bounds corresponding to the SQC traffic flow reveals the same phenomenon.…”

Section: Loss Probabilities Of Individual Traffic Flowsmentioning

confidence: 99%

“…The fractal-like nature of LRD traffic has significantly different theoretical properties from those of the conventional Short-Range Dependent (SRD) processes (e.g., Poisson processes, Markov modulated fluid processes [15]). However, most existing studies based on analytical models have been limited to GPS systems subject to either SRD traffic or LRD traffic only, such as, [5,15,19] for SRD traffic and [2,3,8,18] for LRD traffic. Although packet loss probability, as one of the most important QoS metrics, plays a key role in the design, evaluation, and optimization of traffic scheduling mechanisms, no efforts have been reported in the open literature to analytically investigate the loss probability of GPS systems in the presence of heterogeneous LRD and SRD traffic.…”

Section: Introductionmentioning

confidence: 99%

Loss Probability of LRD and SRD Traffic in Generalized Processor Sharing Systems

Jin

Min

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…The possibility of controlling input traffic by leaky bucket regulators has been widely treated in literature, since early works considering only Markovian or short-range dependent traffic [9]- [11]. Later on, several authors extended research to leaky-bucket regulation of LRD traffic [12]- [18]. Most studies have proven that it is difficult to reduce long-range dependence by use of leaky bucket regulators.…”

Section: Introductionmentioning

confidence: 99%

Properties of the Traffic Output by a Leaky-Bucket Policer with Long-Range Dependent Input Traffic

Bregni

Giacomazzi

Saddemi

2007

2007 IEEE International Conference on Communications

View full text Add to dashboard Cite

 Long-range dependence (LRD) is a largely verified property of Internet traffic, which severely affects queuing performance in network buffers. A common approach for guaranteeing performance requirements is to control the statistical profile of the input traffic by regulators based on the leaky bucket scheme. In this paper, we investigate by simulation how the 1/f α power-law spectrum of LRD traffic is altered when traffic is regulated by a leaky bucket policer. Analysis of the traffic spectral characteristics is carried out mainly by means of the Modified Allan Variance, a time-domain quantity with demonstrated superior accuracy in fractional-noise parameter estimation, recently introduced also for traffic analysis. This approach allows to get a finer insight into power-law spectral characteristics of policed traffic. We also investigate some other properties of the leaky bucket fed with LRD traffic, such as its dropping probability and its effect on queuing delay in a following FIFO scheduler.Index Terms  Communication system traffic, fractional noise, Internet, long-range dependence, queuing analysis, traffic control (communication).

show abstract

On the performance of generalized processor sharing under long-range dependent traffic

Cited by 12 publications

References 13 publications

Estado Del Arte De Scheduling Algorithms (Algoritmos De Programación De Envío)

Estado Del Arte De Scheduling Algorithms (Algoritmos De Programación De Envío)

Loss Probability of LRD and SRD Traffic in Generalized Processor Sharing Systems

Properties of the Traffic Output by a Leaky-Bucket Policer with Long-Range Dependent Input Traffic

Contact Info

Product

Resources

About