Bandwidth utilization in sorted-priority schedulers

Authors:
Tae Joon Kim
Affiliations:
Kongju National University, Chungnam, Korea
Venue:
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
Year:
2006

Citing 3
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Rate-proportional servers: a design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks

IEEE/ACM Transactions on Networking (TON)

Latency-differentiable start-time fair queuing

CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper first introduces bandwidth utilization metric and then analyzes sorted-priority schedulers in the terms of the metric. The results show that the utilization is directly proportional to both the number of delay bound classes and the dependency of delay bound on rate but inversely proportional to packet size.