skip to main content
article
Free Access

Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models

Authors Info & Claims
Published:01 May 1994Publication History
Skip Abstract Section

Abstract

This paper demonstrates a new, efficient, and general approach for providing end-to-end performance guarantees in integrated services networks. This is achieved by modeling a traffic source with a family of bounding interval-dependent (BIND) random variables and by using a rate-controlled service discipline inside the network. The traffic model stochastically bounds the number of bits sent over time intervals of different length. The model captures different source behavior over different time scales by making the bounding distribution an explicit function of the interval length. The service discipline, RCSP, has the priority queueing mechanisms necessary to provide performance guarantees in integrated services networks. In addition, RCSP provides the means for efficiently extending the results from a single switch to a network of arbitrary topology. These techniques are derived analytically and then demonstrated with numerical examples.

References

  1. 1 D. Anick, D. Mitra, and M. Sondhi. Stochastic theory of a data-handling system with multiple sources. Bell System Technical Journal, 61:1971-1894, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2 A. Banerjea and S. Keshav. Queueing delays in rate controlled networks. In Proceedings of IEEE {NFO- COM'93, pages 547-556, San Francisco, CA, April 1993.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3 P. Brady. A techniques for investigating on-off patterns in speech. Bell System Technical Journal, 44:1-22, January 1965.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4 R. Cruz. A calculus for network delay, parts I and II. IEEE Transaction of Information Theory, 37(1):114- 141, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 D. Ferrari. Client requirements for real-time communication services. IEEE Communications Magazine, 28(11):65-72, November 1990.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 D. Ferrari and D. Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368- 379, April 1990.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 S. Golestani. A stop-and-go queueing framework for congestion management. In Proceedings of A CM SIG- COMM'90, pages 8-18, Philadelphia Pennsylvania, September 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 J. Hyman, A. Lazar, and G. Pacifici. Real-time scheduI- ing with quality of service constraints. IEEE Journal on Selected Areas of Communications, pages 1052-1063, September 1991.Google ScholarGoogle Scholar
  9. 9 C. Kalmanek, H. Kanakia, and S. Keshav. Rate controlled servers for very high-speed networks. In 1EEE Global Telecommunications Conference, pages 300.3.1 - 300.3.9, San Diego, California, December 1990.Google ScholarGoogle Scholar
  10. 10 J. Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In A CM SigMetrics'92, pages 128-139, Newport, Rhode Island, June 1992. Google ScholarGoogle Scholar
  11. 11 B. Maglaris, D. Anastassiou, P. Sen, G. Karlsson, and J.D. Robbins. Performance models of statistical multiplexing in packet video communications. IEEE Transactzon on Communzcataon, 36(7):834-844, July 1988.Google ScholarGoogle ScholarCross RefCross Ref
  12. 12 I. Nikolaidis and I. Akyildiz. Source characterization and statistical multiplexing in ATM networks. Technical Report GIT-CC-92/24, College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, 1992.Google ScholarGoogle Scholar
  13. 13 A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. In Proceedings of the INFOCOM'93, pages 521-530, San Francisco, CA, March 1993.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14 P. Pedler. Occupation times for two state Markov chains. Journal of Apphed Probability, 8:381-390, 1971.Google ScholarGoogle ScholarCross RefCross Ref
  15. 15 D. Verma, H. Zhang, and D. Ferrari. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of Tricomm'91, pages 35-46, Chapel Hill, North Carolina, April 1991.Google ScholarGoogle Scholar
  16. 16 O. Yaron and M. Sidi. Calculating performance bounds in communication networks. In Proceedings of IEEE IN- FOCOM'93, pages 539-546, San Francisco, CA, April 1993.Google ScholarGoogle ScholarCross RefCross Ref
  17. 17 O. Yaron and M. Sidi. Performance and stability of communication networks via robust exponential bounds. IEEE Transaction on Networking, 1(3):372- 385, June 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 H. Zhang. Service disciplines for integrated services packet-switching networks. PhD Dissertation. UCB/CSD-94-788, University of Califorma at Berkeley, November 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 H. Zhang and D. Ferrari. Rate-controlled static priority queueing. In Proceedings of INFOCOM'93, pages 227- 236, San Francisco, California, March 1992.Google ScholarGoogle Scholar
  20. 20 H. Zhang and D. Ferrari. Improving utilization for deterministic service in multimedia communication. In 199,4 Internatzonal Conference on Multzmedza Computing and Systems, Boston, MA, May 1994.Google ScholarGoogle Scholar
  21. 21 H. Zhang and K. Srinivasan.Comparison of ratebased service disciplines. In Proceedings of A CM SIGCOMM'91, pages 113-122, Zurich, Switzerland, September 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                • Published in

                  cover image ACM SIGMETRICS Performance Evaluation Review
                  ACM SIGMETRICS Performance Evaluation Review  Volume 22, Issue 1
                  May 1994
                  289 pages
                  ISSN:0163-5999
                  DOI:10.1145/183019
                  Issue’s Table of Contents
                  • cover image ACM Conferences
                    SIGMETRICS '94: Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
                    May 1994
                    294 pages
                    ISBN:089791659X
                    DOI:10.1145/183018

                  Copyright © 1994 ACM

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 May 1994

                  Check for updates

                  Qualifiers

                  • article

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!