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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services, RFC 2475 (December 1998)
Nichols, K., Jacobson, V., Zhang, L.: Two-bit differentiated services architecture for the Internet, IETF RFC 2638 (July 1999)
Braden, R., Clark, D.: Integrated Services in the Internet Architecture: An Overview, RFC 1633 (July 1994)
Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource ReSerVation protocol (RSVP) – Version 1 Functional Specification, RFC 2205 (September 1997)
Parekh, K.: A generalized processor sharing approach to ow control in integrated services networks, Ph.D. thesis, Dept. Elec. Eng. Comput. Sci., MIT (1992)
Parekh, K., Gallagher, R.G.: A generalized processor sharing approach to ow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking (June 1993)
Zhang, L.: VirtualClock: A new tra_c control algorithm for packet switching networks. In: Proc. ACM SIGCOMM 1990 (August 1990)
Xie, G., Lam, S.: Delay guarantee of virtual clock server. IEEE/ACM Transactions on Networking (December 1995)
Floyd, S., Jacobson, V.: Link-Sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking (August 1995)
Loh, K.J., Gui, I., Chua, K.C.: Performance of a Linux Implementation of Class Based Queueing. In: Computer Communications and Networks Proceeding (October 1998)
Cho, K.: A Framework for Alternate Queueing: Towards Tra_c Management by PC-UNIX Based Routers. In: Annual Technical Conference, USENIX (1998)
Demers, A., Keshav, S., Shenker, S.: Design and Analysis of a fair queueing algorithm. In: Proceeding of ACM SIGCOMM (September 1989)
Bennett, J.C.R., Zhang, H.: Hierachical packet fair queueing algorithms. In: Proc. SIGCOMM 1996 (August 1996)
Golestani, S.J.: A self-clocked fair queueing scheme for broadband applications. In: Proceedings of IEEE INFOCOM (June 1994)
Goyal, P., Vin, H.M., Cheng, H.: Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks, TR-96-02, Dept. Comput. Sci., Univ. Texas at Austin (January 1996)
Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case Fair Weighted Fair Queueing. In: Proceedings IEEE INFOCOM 1996 (March 1996)
Fei, X., Marshall, A.: Delay Optimized Worst Case Fair WFQ (WF2Q) Packet Scheduling. In: IEEE International Conference ICC 2002 (2002)
Greenberg, A., Madras, N.: How fair is fair queueing. J. ACM (July 1992)
Keshav, S.: On the e_cient implementation of fair queueing. Internetworking: Research and Experience (September 1991)
Shreedhar, M., Varghese, G.: Efficient fair queueing Using deficit round robin. IEEE Transactions on Networking (Jane 1996)
Kanhere, S.S., Sethu, H.: Fair, Efficient and Low-Latency Packet Scheduling using Nested Deficit Round Robin. In: Proceedings of the IEEE Workshop on High-Performance Switching and Routing (HSPR) (May 2001)
Zhang, H., Ferrari, D.: Rate-Controlled service disciplines. Journal of High Speed Networks (1994)
Zhang, H., Ferrari, D.: Rate-Controlled static-priority queueing. In: Proc. IEEE INFOCOM 1993 (September 1993)
Jacobson, V.: Congestion Avoidance and Control. In: Proceeding of ACM SIGCOMM (August 1988)
Floyd, S., Jacobson, V.: Random early detection for congestion avoidance. IEEE/ACM Transactions on Networking (July 1993)
Ramakrishnan, K., Floyd, S.: Proposal to Add Explicit Congestions Notification (ECN) to IPRFC 2481 (January 1999)
Floyd, S.: A Report on Recent Developments in TCP Congestion Control. IEEE Communications Magazine (April 2001)
Sayenko, A., Hamalainen, T., Joutsensal, J., Siltanen, J.: On providing bandwidth and delay guarantees using the revenue criterion based adaptive WFQ. In: IEEE APCC 2003 (September 2003)
Tayyar, H., Alnuweiri, H.: The Complexity of Computing Virtual-Time in Weighted Fair Queuing Schedulers. In: IEEE ICC 2004, June 2004, vol. 14, pp. 1996–2002 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, E.HK., Hsieh, MI., Lai, HT. (2005). A Novel Low Latency Packet Scheduling Scheme for Broadband Networks. In: Ho, YS., Kim, HJ. (eds) Advances in Multimedia Information Processing - PCM 2005. PCM 2005. Lecture Notes in Computer Science, vol 3768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11582267_88
Download citation
DOI: https://doi.org/10.1007/11582267_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30040-3
Online ISBN: 978-3-540-32131-6
eBook Packages: Computer ScienceComputer Science (R0)