Low latency and efficient packet scheduling for streaming applications

Eire Hsiao Kuang Wu, Hsu Te Lai, Meng Feng Tsai, Cheng Fu Chou

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations


Adequate bandwidth allocations and strict delay requirements are critical for real time applications. Packet scheduling algorithms like Class Based Queue (CBQ), Nested Deficit Round Robin (Nested-DRR) are designed to ensure the bandwidth reservation function. However, they might cause unsteady packet latencies and introduce extra application handling overhead, such as allocating a large buffer for playing the media stream. High and unstable latency of packets might jeopardize the corresponding Quality of Service since real-time applications prefer low playback latency. Existing scheduling algorithms which keep latency of packets stable require knowing the details of individual flows. GPS (General Processor Sharing)like algorithms does not consider the real behavior of a stream. A real stream is not perfectly smooth after forwarded by routers. GPS-like algorithms will introduce extra delay on the stream which is not perfectly smooth. This thesis presents an algorithm which provides low latency and efficient packet scheduling service tor streaming applications called LLEPS.

Original languageEnglish
Pages (from-to)1963-1967
Number of pages5
JournalConference Record - International Conference on Communications
StatePublished - 2004
Event2004 IEEE International Conference on Communications - Paris, France
Duration: 20 Jun 200424 Jun 2004


Dive into the research topics of 'Low latency and efficient packet scheduling for streaming applications'. Together they form a unique fingerprint.

Cite this