skip to main content
10.1145/1095921.1095931acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
Article

Implementation and performance measurements of a delay-bounded HPD algorithm in an ALTQ-based router

Published: 24 October 2005 Publication History

Abstract

In this paper we show the first working implementation of an adaptive, measurement-based scheduling algorithm called delay-bounded hybrid proportional delay (DBHPD) in a FreeBSD based ALTQ prototype router. We describe how we have implemented DBHPD and discuss what kind of difficulties were encountered in the implementation. We present measurement results of the DBHPD implementation with FTP, HTTP, Video Streaming and VoIP traffic in underload, overload and heavy overload conditions. We show that the algorithm operates well according to the theoretical model and preserves the desired delay-bound as well as the delay ratios between the classes. We also compare DBHPD to an existing Class-Based-Queueing (CBQ) algorithm that is widely used both in research and in the industry. We show that DBHPD is able to achieve at least as good link utilization as CBQ and in addition results in much better and predictable differentiation in terms of delays and more controlled packet losses.

References

[1]
J. Antila and M. Luoma. Scheduling and quality differentiation in differentiated services. In Proceedings of MIPS 2003, pages 119--130, November 2003.
[2]
J. Antila and M. Luoma. Adaptive scheduling for improved quality differentiation. In Proceedings of MIPS 2004, November 2004.
[3]
J. Antila and M. Luoma. Robust delay estimation of an adaptive scheduling algorithm. In Proceedings of QoS-IP 2005, February 2005.
[4]
K. Cho. Managing traffic with ALTQ. In Proceedings of USENIX 1999 Annual Technical Conference. USENIX, June 1999.
[5]
K. Cho. Fitting theory into reality in the altq case. In Proceedings of ASIA BSD conference. USENIX, March 2004.
[6]
N. Christin, J. Liebeherr, and T. Abdelzaher. A quantitative assured forwarding service. In Proceedings of IEEE INFOCOM 2002, volume 2, pages 864--873, New York, NY, June 2002.
[7]
K. C. Claffy, G. C. Polyzos, and H.-W. Braun. Application of sampling methodologies to network traffic characterization. In SIGCOMM, pages 194--203, 1993.
[8]
C. Dovrolis, D. Stiliadis, and P. Ramanathan. Proportional differentiated services: delay differentiation and packet scheduling. IEEE/ACM Trans. Netw., 10(1):12--26, 2002.
[9]
S. Floyd and V. Jacobson. Link-sharing and resource management for packet networks. IEEE/ACM Transactions on Networking, 3(4):365--386, August 1995.
[10]
M. Luoma and J. Antila. Differentiation of the internet traffic. In Proceedings of ICN 2004, February 2004.
[11]
A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking, 2(2):137--150, April 1994.
[12]
M. Shreedhar and G. Varghese. Effiecient fair queuing using deficit round robin. In Proceedings of SIGCOMM'95, pages 231--242. ACM, 1995.
[13]
I. Stoica, H. Zhang, and T. S. E. Ng. A hierarchical fair service curve algorithm for link-sharing, real-time and priority service. In Proceedings of SIGCOMM'97. ACM, 1997.

Cited By

View all
  • (2007)Implementation and Simulation of DBHPD and CBQ scheduling - A Comparative Study2007 IEEE International Conference on Communications10.1109/ICC.2007.92(524-529)Online publication date: Jun-2007

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology
October 2005
318 pages
ISBN:159593197X
DOI:10.1145/1095921
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. adaptive scheduling
  2. implementation
  3. measurements

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2007)Implementation and Simulation of DBHPD and CBQ scheduling - A Comparative Study2007 IEEE International Conference on Communications10.1109/ICC.2007.92(524-529)Online publication date: Jun-2007

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media