The Earliest Deadline First Scheduling with Active Buffer Management for Real-Time Traffic in the Internet
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 showthat 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.
KeywordsEarliest Deadline First Fairness Index Random Early Detection Active Queue Management First Come First Serve
Unable to display preview. Download preview PDF.
- 1.Peterson, Larry L., Davie, Bruce S.: Computer networks: a systems approach. 2nd edition, San Francisco: Morgan Kaufmann Publishers, 2000.Google Scholar
- 2.Jain, Raj: The art of computer systems performance analysis: techniques for experimental design, measurement, simulation, and modeling. New York: Wiley, 1991.Google Scholar
- 7.Braden, B., et al.: Recommendations on Queue Management and Congestion Avoidance in the Internet. RFC 2309, Internet Engineering Task Force, April 1998.Google Scholar
- 12.Pan, R., Prabhakar, B., Psounis, K.: CHOKe: a stateless active queue management scheme for approximating fair bandwidth allocation. Proceeding of INFOCOM’ 2000, March 2000.Google Scholar
- 13.NS (Network Simulator): http://www.isi.edu/nsnam/ns/.