Achieving differentiated services through multi-class probabilistic priority scheduling

Tham, Chen-Khong; Yao, Qian; Jiang, Yuming

doi:10.1016/s1389-1286(02)00309-2

Cited by 15 publications

(15 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A PP scheduling discipline (see e.g. Tham (2002)) serves a given number of priority queues in a probabilistic manner. Each priority queue is assigned a parameter p i , which determines the probability that a packet from that priority queue is served next.…”

mentioning

confidence: 99%

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Walraevens

Steyaert

Bruneel

2005

Telecommunication Systems

View full text Add to dashboard Cite

mentioning

confidence: 99%

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Walraevens

Steyaert

Bruneel

2005

Telecommunication Systems

View full text Add to dashboard Cite

“…A PP scheduling discipline (see e.g. Tham et al (2002)) serves a given number of priority queues in a probabilistic manner. Each priority queue is assigned a parameter p i , which determines the probability that a packet from that priority queue is served next.…”

Section: Introductionmentioning

confidence: 99%

Delay Analysis of a HOL Priority Queue

et al. 2005

View full text Add to dashboard Cite

Priority scheduling for packets is a hot topic, as interactive (voice,video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the probability generating functions of the packet delays. From these functions, some performance measures (such as moments and approximate probabilities) are calculated. We illustrate the performance measures by means of some numerical examples and show how to apply the theoretical results to a queue that handles arriving multimedia traffic.

show abstract

“…The authors in [5,6,9] showed that this algorithm exhibits the following properties that are very desirable to achieve service differentiation in a multi-class network by (a) providing diverse delay differentiation between classes, (b) supporting for weighted max-min fairness among classes, (c) overcoming the starvation problem inherent in SP, (d) supporting relative differentiated services, and (e) providing explicit bandwidth reservation guarantees by appropriate setting of a parameter…”

Section: Related Workmentioning

confidence: 99%

“…However the problem of deadline violation probability associated with randomness and suitable priority assignment to provide relative differentiated services were not addressed in these works. Reference [9] implemented PP on Linux machines but their design prohibits dynamic control of and thus is not scalable for large number of classes due to pre-calculation of all possible network states which increase exponentially with the number of classes.…”

Section: Related Workmentioning

confidence: 99%

“…In this section, we aim to reduce the time given up to the lower priority classes by the higher priority classes ("slack" in probabilistic scheduling) by setting a rate of approaching strict prioritization using the relationship between delays of different classes. In particular, we use the following propositions of average delay of class i, i W proven in [9] 1 to affect . , and of probability to be served is transferred from class k, Proposition (a) states that only the probabilities of the class served and its immediate higher priority class will change while the other classes will maintain the original PP configurations at the initial stages after the algorithm begins while proposition (b) states that higher class priority will approach the configuration of SP, i.e.…”

Section: Flexible Ticket Transfer Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Efficient implementation of relative differentiated services using proportional probabilistic priority

Tan

Tham

The 11th IEEE International Conference on Networks, 2003. ICON2003.

View full text Add to dashboard Cite

Abstract-This paper studies the design and performance of the Probabilistic Priority (PP) [5] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [10] to bandwidth allocation in a strict priority sense. We then propose a Multiwinner PP (MPP) scheduler using multi-winner lottery scheduling to improve the throughput and response time accuracy and a flexible ticket transfer algorithm to improve the deadline violation probability in probabilistic scheduling. Finally, we investigate the issue of parameter assignment for an MPP scheduler and use our techniques to implement a prototype Assured Forwarding (AF) mechanism.

show abstract

Achieving differentiated services through multi-class probabilistic priority scheduling

Cited by 15 publications

References 18 publications

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

A Packet Switch with a Priority Scheduling Discipline: Performance Analysis

Delay Analysis of a HOL Priority Queue

Efficient implementation of relative differentiated services using proportional probabilistic priority

Contact Info

Product

Resources

About