Managing Performance Using Weighted Round-Robin

Authors:
Jie Wang;Yonatan Levy
Affiliations:
-;-
Venue:
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Year:
2000

Citing 5
Cited 1

Analysis of cyclic service systems with limited service: bounds and approximations

Performance Evaluation
Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy

Performance Evaluation
The use of service limits for efficient operation of multistation single-medium communication systems

IEEE/ACM Transactions on Networking (TON)
Queueing analysis of polling models: progress in 1990-1994

Frontiers in queueing
Performance Evaluation of Cyclic Service Strategies - A Survey

Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation

Providing multiple hard latency and throughput guarantees for packet switching networks on chip

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Over the next few years, IP networks will evolve from today's best-effort Internet into multi-class networks supporting quality of service requirements of diverse applications. This paper addresses one of the challenges of these new IP networks: how to set control parameters to deliver differentiated performance. We study this problem in a simplified setup of a single link and a weighted round robin queuing discipline. After giving an exact formulation of the problem, we apply an approximation of the waiting times to gain insight into the feasible performance and behavior of service limits as a function of the traffic parameters. The methodology is illustrated with several numerical examples.