IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A multi-class probabilistic priority scheduling discipline for differentiated services networks
Computer Communications
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
IEEE Journal on Selected Areas in Communications
Achieving differentiated services through multi-class probabilistic priority scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Operations Research
OCGRR: A New Scheduling Algorithm for Differentiated Services Networks
IEEE Transactions on Parallel and Distributed Systems
LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks
Computer Communications
Stochastic network calculus models under max-plus algebra
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optical MAN ring performance with traffic aggregations
Computer Communications
Performance of multicast packet aggregation in all optical slotted networks
Network performance engineering
A probabilistic task scheduling method for grid environments
Future Generation Computer Systems
Improving bandwidth efficiency in a multi-service slotted dual bus optical ring network
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Hi-index | 0.24 |
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.