Latency-differentiable start-time fair queuing

Authors:
Tae Joon Kim
Affiliations:
Kongju National University
Venue:
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Year:
2007

Citing 9
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
How fair is fair queuing

Journal of the ACM (JACM)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
Fair and Efficient Packet Scheduling Using Elastic Round Robin

IEEE Transactions on Parallel and Distributed Systems
Bandwidth utilization in sorted-priority schedulers

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
Efficiency of packet voice with deterministic delay

IEEE Communications Magazine
Low-latency guaranteed-rate scheduling using Elastic Round Robin

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair queuing algorithms providing Quality-of-Service (QoS) guarantees can be classified into two design methods in terms of the reference time used in calculating the timestamp of arriving packet: Start-Time (ST) and Finish-Time (FT). It was known that the former, even though yielding better bandwidth utilization, does not satisfy the requirements of isolating flows and providing differentiated QoS guarantees, while the latter is still suffering from a poor utilization. This paper proposes a ST-based algorithm satisfying those requirements, called Latency-Differentiable Start-time Fair Queuing (LDSFQ), in which the architecture of multiple ST servers in parallel is introduced. The evaluation results show that the LDSFQ scheduler yields better bandwidth utilization by up to 45% than that in the FT one under a practical internet phone scenario.