HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/1930
Title: The earliest deadline first scheduling with active buffer management for real-time traffic in the Internet
Authors: Hei, Xiaojun
Tsang, Danny H. K.
Keywords: Scheduling
Earliest deadline first
Active buffer management
Real-time traffic
Issue Date: 2001
Citation: Networking - ICN 2001. First International Conference on Networking, Proceedings, Part 1 (Lecture Notes on Computer Science vol. 2093). Springer - Verlag. 2001, p. 45-54. Berlin, Germany
Abstract: We study the problem of QoS guarantee for differentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traffic. We propose to employ an EDF scheduler combined with an active buffer management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail buffer management which is commonly deployed in the traditional IP router.
Rights: The original publication is available at http://springerlink.metapress.com/link.asp?id=bfq1u7bhvrgnen46
URI: http://hdl.handle.net/1783.1/1930
Appears in Collections:ECE Conference Papers

Files in This Item:

File Description SizeFormat
realtime.pdfpre-published version179KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.