A novel low latency packet scheduling scheme for broadband networks

Authors:
Eric Hsiao-Kuang Wu;Ming-I Hsieh;Hsu-Te Lai
Affiliations:
Department of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan;Department of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan;Department of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan
Venue:
PCM'05 Proceedings of the 6th Pacific-Rim conference on Advances in Multimedia Information Processing - Volume Part II
Year:
2005

Citing 15
Cited 0

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
How fair is fair queuing

Journal of the ACM (JACM)
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Delay guarantee of virtual clock server

IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Performance of a Linux Implementation of Class Based Queueing

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks

Start-Time Fair Queuing: A Scheduling Algorithm for Integrated ServicesPacket Switching Networks
A framework for alternate queueing: towards traffic management by PC-UNIX based routers

ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
WF2Q: worst-case fair weighted fair queueing

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 report on recent developments in TCP congestion control

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adequate bandwidth allocations and strict delay requirements are required for real time flows, such as streaming audio and video data. Most of commonly known packet scheduling algorithms like Weighted Fair Queueing (WFQ) and Start-Time Fair Queueing (SFQ) were mainly designed to ensure the bandwidth reservation function. They only guarantee the queueing delay under a certain threshold. It may cause unsteady packet latencies and introduces extra handling overheads for streaming applications. A few packet scheduling algorithms were proposed in recent years to address this problem like Low Latency Queueing (LLQ) which may suffer from low priority traffic starvation problem. In this paper, we will show the unsteady queueing delay problem, ”The buffer underrun problem” for most well known packet scheduling algorithms. We propose a novel packet scheduling algorithm with history support, LLEPS, to ensure low latency and efficient packet scheduling for streaming applications via monitoring the behavior of queues and traffics.