IEEE/ACM Transactions on Networking (TON)
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
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)
A dynamic regulation and scheduling scheme for real-time traffic management
IEEE/ACM Transactions on Networking (TON)
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 report on recent developments in TCP congestion control
IEEE Communications Magazine
A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network
Proceedings of the 2007 ACM symposium on Applied computing
Review: A comprehensive survey on scheduler for VoIP over WLAN
Journal of Network and Computer Applications
Hi-index | 0.24 |
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.