skip to main content
research-article

Jitter regulation for multiple streams

Published: 28 December 2009 Publication History

Abstract

For widely used interactive communication, it is essential that traffic is kept as smooth as possible; the smoothness of the traffic is typically captured by its delay jitter, that is, the difference between the maximal and minimal end-to-end delays. The task of minimizing the jitter is done by jitter regulators that use a limited-size buffer in order to shape the traffic. In many real-life situations regulators must handle multiple streams simultaneously and provide low jitter on each of them separately. Moreover, communication links have limited capacity, and these may pose further restrictions on the choices made by the regulator. This article investigates the problem of minimizing jitter in such an environment, using a fixed-size buffer.
We show that the offline version of the problem can be solved in polynomial time, by introducing an efficient offline algorithm that finds a release schedule with optimal jitter. When regulating M streams in the online setting, we take a competitive analysis point of view and note that, in the upcapacitated case, previous results in Mansour and Patt-Shamir [2001] can be extended to an online algorithm that uses a buffer of size 2⋅MB and obtains the optimal jitter possible with a buffer of size B (and an offline algorithm). The question arises whether such a resource augmentation is essential. We answer this question in the affirmative, by proving a lower bound that is tight up to a factor of 2, thus showing that jitter regulation does not scale well as the number of streams increases unless the buffer is sized-up proportionally.

References

[1]
ATM Forum. 1999. Traffic Management Specification. The ATM Forum. Version 4.1, AF-TM-0121.000.
[2]
Borodin, A. and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press.
[3]
comScore Networks. 2006. comScore releases august U.S. video metrix rankings. http://www.comscore.com/press/release.asp?press=1035.
[4]
Davie, B., Charny, A., Bennett, J., Benson, K., Boudec, J. L., Courtney, W., Davari, S., Firoiu, V., and Stiliadis, D. 2002. An expedited forwarding PHB (per-hop behavior). Internet RFC 3246.
[5]
Golestani, S. 1990. A stop-and-go queueing framework for congestion management. In ACM SIGCOMM. 8--18.
[6]
Kalmanek, C., Kanakia, H., and Keshav, S. 1990. Rate controlled servers for very high-speed networks. In Proceedings of the Conference on Global Communications (GlobeCom). 12--20.
[7]
Kermani, P. and Kleinrock, L. 1979. Virtual cut-through: A new computer communication switching technique. Comput. Netw. 3, 267--286.
[8]
Keshav, S. 1997. An Engineering Approach to Computer Networking. Addison-Wesley Publishing.
[9]
Keslassy, I., Kodialam, M., Lakshman, T., and Stiliadis, D. 2005. On guaranteed smooth scheduling for input-queued switches. IEEE/ACM Trans. Netw. 13, 6, 1364--1375.
[10]
Koga, H. 2001. Jitter regulation in an internet router with delay constraint. J. Schedul. 4, 6, 355--377.
[11]
Mansour, Y. and Patt-Shamir, B. 2001. Jitter control in QoS networks. IEEE/ACM Trans. Netw. 9, 4, 492--502.
[12]
Partridge, C. 1991. Isochronous applications do not require jitter-controlled networks. Internet RFC 1257. September.
[13]
Sleator, D. and Tarjan, R. 1985. Amortized efficiency of list update and paging rules. Comm. ACM 28, 2, 202--208.
[14]
Tanenbaum, A. 2003. Computer Networks, Fourth ed. Prentice Hall.
[15]
Tassiulas, L. 1999. Cut-Through switching, pipelining, and scheduling for network evacuation. IEEE/ACM Trans. Netw. 7, 1, 88--97.
[16]
Verma, D., Zhang, H., and Ferrari, D. 1991. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of TriComm. 35--46.
[17]
Zhang, H. 1995. Service disciplines for guaranteed performance service in packet switching networks. Proc. IEEE 83, 10, 1374--1396.
[18]
Zhang, H. and Ferrari, D. 1994. Rate-Controlled service disciplines. J. High-Speed Netw. 3, 4, 389--412.

Cited By

View all
  • (2017)Elastic Scaling for Distributed Latency-Sensitive Data Stream Operators2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)10.1109/PDP.2017.31(61-68)Online publication date: 2017
  • (2015)On the rate-jitter performance of jitter-buffer in TDMoPSNPhotonic Network Communications10.1007/s11107-015-0486-230:1(108-130)Online publication date: 1-Aug-2015
  • (2014)Proposal and Evaluation of Attractor Perturbation-Based Rate Control for Stable End-to-End DelayBio-Inspired Models of Network, Information, and Computing Systems10.1007/978-3-319-06944-9_2(18-32)Online publication date: 9-Jul-2014
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms
ACM Transactions on Algorithms  Volume 6, Issue 1
December 2009
374 pages
ISSN:1549-6325
EISSN:1549-6333
DOI:10.1145/1644015
Issue’s Table of Contents
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 December 2009
Accepted: 01 March 2008
Revised: 01 January 2008
Received: 01 January 2007
Published in TALG Volume 6, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Jitter regulation
  2. buffer management
  3. competitive analysis
  4. online algorithms
  5. quality of service

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Elastic Scaling for Distributed Latency-Sensitive Data Stream Operators2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)10.1109/PDP.2017.31(61-68)Online publication date: 2017
  • (2015)On the rate-jitter performance of jitter-buffer in TDMoPSNPhotonic Network Communications10.1007/s11107-015-0486-230:1(108-130)Online publication date: 1-Aug-2015
  • (2014)Proposal and Evaluation of Attractor Perturbation-Based Rate Control for Stable End-to-End DelayBio-Inspired Models of Network, Information, and Computing Systems10.1007/978-3-319-06944-9_2(18-32)Online publication date: 9-Jul-2014
  • (2013)Novel rate-jitter control algorithms for TDMoIP2013 National Conference on Communications (NCC)10.1109/NCC.2013.6488028(1-5)Online publication date: Feb-2013

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media