Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0140-3664(02)00005-1
Title: A probabilistic priority scheduling discipline for multi-service networks
Authors: Jiang, Y. 
Tham, C.-K. 
Ko, C.-C. 
Keywords: Delay bounds
Scheduling discipline
Service differentiation
Issue Date: 1-Aug-2002
Citation: Jiang, Y., Tham, C.-K., Ko, C.-C. (2002-08-01). A probabilistic priority scheduling discipline for multi-service networks. Computer Communications 25 (13) : 1243-1254. ScholarBank@NUS Repository. https://doi.org/10.1016/S0140-3664(02)00005-1
Abstract: This paper proposes a novel scheduling discipline for service differentiation among traffic classes in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. The PP discipline is based on the Strict Priority (SP) discipline with the difference that each priority queue is assigned a parameter as in Weighted Fair Queueing (WFQ) and Weighted Round Robin (WRR) disciplines. The parameter determines the probability with which its corresponding queue is served when it is polled by the server. Similar to WFQ and WRR, service differentiation as well as fairness among traffic classes can be achieved in PP by setting the assigned parameters properly. In addition, the PP discipline can be easily reduced to the ordinary SP discipline or to the reverse SP discipline. Moreover, the PP discipline can provide service segregation among groups of traffic classes while at the same time provide service differentiation among classes within each group. The proposed PP discipline may be used in controlling per-hop behavior in differentiated services networks. © 2002 Elsevier Science B.V. All rights reserved.
Source Title: Computer Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/54737
ISSN: 01403664
DOI: 10.1016/S0140-3664(02)00005-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.