Output Rate-Controlled Scheduling Policy: End-to-End Delay Bounds Calculation

Hanada, Masaki; Nakazato, Hidenori

doi:10.1109/icact.2007.358612

Cited by 6 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…5 en donde se demuestra las mejoras de ORC-GPS vs GPS, en términos de los retardos contra la cantidad de tráfico en el sistema. Posteriormente, los mismos autores de [9] reaparecen en [10] para proponer una mejora a su propio algoritmo planteado anteriormente; esta mejora consiste en hacer que los ajustes necesarios para que planteamientos hechos en [9] apliquen no solo para un nodo sino para varios nodos como se muestra en la Fig. 6, y se mide el retardo del tráfico extremo a extremo en una red de prueba.…”

Section: Generalized Processor Sha-ring (Gps)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

Section: Generalized Processor Sha-ring (Gps)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

“…The well-known Generalized Processor Sharing (GPS) principle [19] and its variants have received tremendous research efforts (e.g., [4,5,10,11,18,21,23,[25][26][27][28]31, 32]) owing to the desirable properties including fairness, traffic isolation, and work conservation. In a GPS system, each traffic flow is assigned a weight that can guarantee a minimum service rate even though other traffic flows may be greedy in demanding service.…”

Section: Introductionmentioning

confidence: 99%

Performance modelling of generalized processor sharing systems with multiple self-similar traffic flows

Jin

Min

2008

Telecommun Syst

View full text Add to dashboard Cite

The Generalized Processor Sharing (GPS) is an important service differentiation scheme in telecommunication systems and has attracted great research interests due to the desirable properties of fairness, traffic isolation, and work conservation. The major limitation of the existing analytical performance models of GPS systems subject to selfsimilar traffic is that these models have been restricted to a simplified scenario with only two traffic flows. To overcome such a limitation, this study proposes a new flowdecomposition approach to modelling GPS systems subject to multiple self-similar traffic flows. We present and prove the existence of a feasible ordering of GPS systems based on the required and guaranteed service rates of traffic flows. With the aid of the feasible ordering, we decompose the GPS system into a group of single-queue systems and then derive the queue length distributions and loss probabilities of individual self-similar traffic flows in the original GPS system. Extensive simulation experiments are conducted to validate the accuracy of the developed analytical model.

show abstract

“…GPS is work conserving as it can redistribute the excess service to backlogged traffic flows in proportion to their guaranteed service rates. Many scheduling schemes based on the GPS principle have been proposed [6][7][8][9][10][11][12][13]. For instance, Hanada and Nakazato [6] designed a rate-based scheduling policy, namely output rate-controlled generalized processor sharing (ORC-GPS), in order to guarantee deterministic delay bounds.…”

Section: Introductionmentioning

confidence: 99%

“…Many scheduling schemes based on the GPS principle have been proposed [6][7][8][9][10][11][12][13]. For instance, Hanada and Nakazato [6] designed a rate-based scheduling policy, namely output rate-controlled generalized processor sharing (ORC-GPS), in order to guarantee deterministic delay bounds. Xu et al [13] developed a dynamic resource allocation scheme using the GPS fair service discipline to efficiently support real-time and non-real-time multimedia traffic in the uplink of a wideband code-division multiple access (CDMA) cellular network.…”

Section: Introductionmentioning

confidence: 99%

Analytical modelling and evaluation of generalized processor sharing systems with heterogeneous traffic

Jin

Min

2007

Int J Communication

View full text Add to dashboard Cite

SUMMARYGeneralized processor sharing (GPS) has been widely studied as an important scheme for providing differentiated quality of service. Realistic traffic in multi-service networks exhibits heterogeneous properties and can be categorized into two classes, namely, long range dependent (LRD) and short range dependent (SRD) traffic. Performance modelling and analysis of GPS systems subject to heterogeneous network traffic is an open and challenging problem. This paper develops an analytical performance model for GPS systems under heterogeneous LRD and SRD traffic. To this end, we propose a cost-efficient modelling method for GPS and further develop the analytical upper and lower bounds of the queue length distributions for individual traffic flows. Numerical examples and extensive simulation results are presented to validate the accuracy and merits of the analytical model.

show abstract

Output Rate-Controlled Scheduling Policy: End-to-End Delay Bounds Calculation

Cited by 6 publications

References 8 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)

Performance modelling of generalized processor sharing systems with multiple self-similar traffic flows

Analytical modelling and evaluation of generalized processor sharing systems with heterogeneous traffic

Contact Info

Product

Resources

About