Advertisement

Abstract

Increases in bandwidths and processing capabilities of future packet switched networks will give rise to a dramatic increase in the types of applications using them. Many of these applications will require guaranteed quality of service (QOS) such as a bound on the maximum end-to-end packet delay and/or on the probability of packet loss. This poses exciting challenges to network designers. In this paper we discuss the QOS requirements of different applications and survey recent developments in the areas of call admission, link scheduling, and the interaction between the provision of QOS and call routing and traffic monitoring and policing. We identify what some of the important issues are in these areas and point out important directions for future research efforts.

Keywords

quality of service call admission real-time services link scheduling 

References

  1. [1]
    S. Akhtar. Congestion control in a fast packet switching network. Master's thesis, Washington University, St. Louis, Missouri, 1987.Google Scholar
  2. [2]
    J.-T. Amenyo, A.A. Lazar, and G. Pacific. Cooperative distributed scheduling for ats-based broadband networks. In INFOCOM'92, pages 333–342, May 1992.Google Scholar
  3. [3]
    D. Anick, D. Mitra, and M. M. Sondhi. Stochastic theory of a data-handling system with multiple sources. Bell System Technical Journal, 61:1871–1894, 1982.Google Scholar
  4. [4]
    Caglan M. Aras, Jim Kurose, Douglas Reeves, and Henning Schulzrinne. Real-time communication in packet-switched networks. To Appear in Proceedings of the IEEE, January 1994.Google Scholar
  5. [5]
    Ernst Biersack. Error recovery in high-speed networks. In Second International Workshop on Network and Operating System Support for Digital Audio and Video, page 222, 1991.Google Scholar
  6. [6]
    Hugh S. Bradlow. Performance measures for real-time continuous bit-stream oriented services: Application to packet reassembly. Computer Networks and ISDN systems, 20:15–26, 1990.Google Scholar
  7. [7]
    CCITT. Rec. I.121: Recommendation on broadband aspects of ISDN. 1988.Google Scholar
  8. [8]
    CCITT. Rec. I.371: Recommendation on traffic control and congestion control in B-ISDN. 1992.Google Scholar
  9. [9]
    C.-S. Chang. Stability, queue length and delay, part ii:stochastic queueing networks. Technical Report RC 17709, IBM.Google Scholar
  10. [10]
    R. Chipalkatti, J.F. Kurose, and D. Towsley. Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer. In IEEE INFOCOM'89, pages 774–783, April 1989.Google Scholar
  11. [11]
    D.D. Clark, S. Shenker, and L. Zhang. Supporting real-time applications in an integrated services packet network: architecture and mechanism. In ACM SIGCOMM'92, pages 14–26, 1992.Google Scholar
  12. [12]
    Rene Cruz. A calculus for network delay, part II: Network analysis. IEEE Transactions on Information Theory, 37:132–141, 1991.Google Scholar
  13. [13]
    A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Internetworking:Research and Experience, 1:3–26.Google Scholar
  14. [14]
    Anwar Elwalid and Debasis Mitra. Effective bandwidth of general Markovian traffic sources and admission control of high-speed networks. Submitted to ACM-IEEE Transactions on Networking, July 1992.Google Scholar
  15. [15]
    Domenico Ferrari and Dinesh Verma. A scheme for real-time channel establishment in wide-area networks. IEEE J. Select. Areas Commun., 8:368–379, April 1990.Google Scholar
  16. [16]
    G. Gallassi, G. Rigolio, and L. Fratta. ATM:bandwidth assignment and bandwidth enforcement policies. In GLOBECOM'89, pages 1788–1793, December 1989.Google Scholar
  17. [17]
    R. J. Gibbens and P. J. Hunt. Effective bandwidths for multi-type uas channel. QUESTA, 9:17–28, 1991.Google Scholar
  18. [18]
    André Girard. Routing and Dimensioning in Circuit-Switched Networks. Addison Wesley, 1990.Google Scholar
  19. [19]
    S. J. Golestani. A stop-and-go queueing framework for congestion management. In Proc. 1990 SIGCOMM, pages 8–18.Google Scholar
  20. [20]
    S. J. Golestani. Congestion-free transmission of real-time traffic in packet networks. In IEEE INFOCOM'90, pages 527–536, June 1990.Google Scholar
  21. [21]
    Roch Guerin et al. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Select. Areas Commun., 9(7):968–981, 1991.Google Scholar
  22. [22]
    Roch Guerin and Levent Gun. A unified approach to bandwidth allocation and access control in fast packet-switched networks. In INFOCOM'92, pages 01–12, 1992.Google Scholar
  23. [23]
    S. Keshav H. Zhang. Comparison of rate-based service disciplines. In SIGCOMM.Google Scholar
  24. [24]
    Harry Heffes and David Lucantoni. A markov modulated characterization of voice and data traffic and related statistical multiplexer performance. IEEE J.Select.Areas Commun., SAC-4:856–867, September 1986.Google Scholar
  25. [25]
    Joseph Y. Hui. Resource allocation for broadband networks. IEEE J.Select.Areas Commun., 6(9):1598–1608, December 1988.Google Scholar
  26. [26]
    Ren-Hung Hwang. Routing in high-speed networks. PhD thesis, University of Massachusetts, Amherst, 1993.Google Scholar
  27. [27]
    Jay M. Hyman et al. Real-time scheduling with quality of service constraints. IEEE J.Select.Areas Commun., 9(7):1052–1063, September 1991.Google Scholar
  28. [28]
    S. Jamin, S. Shenker, L. Zhang, and D.D Clark. An admission control algorithm for predictive real-time service(extended abstract). In Third International Workshop on network and operating system support for digital audio and video, pages 308–315, November 1992.Google Scholar
  29. [29]
    C.R. Kalmanek, H. Kanakia, and S. Keshav. Rate controlled servers for very high-speed networks. In Globecom'90, December 1990.Google Scholar
  30. [30]
    Gunnar Karlsson and Martin Vetterli. Packet video and its integration into the network architecture. IEEE J.Select. Areas Commun., 7(5):739–751, June 1989.Google Scholar
  31. [31]
    F. P. Kelly. Effective bandwidths at multi-class queues. QUESTA, 9:5–16, 1991.Google Scholar
  32. [32]
    S. Keshav. On the efficient implementation of fair queueing. Internetworking: Research and Experience, 2:157–173.Google Scholar
  33. [33]
    Jim Kurose. On computing per-session performance bounds in high-speed multi-hop computer networks. In ACM SIGMETRICS'92, pages 128–139, June 1992.Google Scholar
  34. [34]
    Z. Liu and D. Towsley. Burst reduction properties of the token bank in ATM networks. In IFIP workshop on modeling and performance evaluation of ATM technology.Google Scholar
  35. [35]
    Zhen Liu and Don Towsley. Burst reduction properties of rate-control throttles:departure process. To Appear in Annals of Operations Research.Google Scholar
  36. [36]
    Ramesh Nagarajan. Quality-of-service issues in high-speed networks. PhD thesis, University of Massachusetts, Amherst, 1993.Google Scholar
  37. [37]
    Pramod Pancha and Magda El Zarki. Bandwidth requirements of variable bit rate MPEG sources in ATM networks. In IFIP workshop on modeling and performance evaluation of ATM technology, pages 5.2.1–5.2.25, January 1993.Google Scholar
  38. [38]
    Abhay Parekh and Robert Gallager. A generalized processor sharing approach to flow control in integrated services networks — the single node case. In INFOCOM'92, pages 915–924, 1992.Google Scholar
  39. [39]
    V. Ramaswamy. Traffic performance modeling for packet communication whence, where and wither. In Third Australian Teletraffic Seminar, November 1988. Keynote Address.Google Scholar
  40. [40]
    V. Ramaswamy and Walter Willinger. Efficient traffic performance strategies for packet multiplexers. Computer Networks and ISDN systems, 20:401–407, 1990.Google Scholar
  41. [41]
    J.-F. Ren, J.W. Mark, and J.W. Wong. Performance analysis of a leaky-bucket controlled ATM multiplexer. To Appear in Performance Evaluation.Google Scholar
  42. [42]
    H. Saito. Call admission control in an ATM network using upper bound of cell loss probability. IEEE Transactions on Communications, 40(9):1512–1521, September 1992.Google Scholar
  43. [43]
    Nachum Shacham. Packet recovery in high-speed networks using coding and buffer management. In INFOCOM, pages 124–131, 1990.Google Scholar
  44. [44]
    M. Sidi, W. Liu, I.Cidon, and I. Gopal. Congestion control through input rate regulation. In GLOBECOM'89.Google Scholar
  45. [45]
    D. Towsley and F. Baccelli. Comparisons of service disciplines in a tandem queueing network with real-time constraints. OR Letters, 10.Google Scholar
  46. [46]
    J. Turner. New directions in communications (or which way to the information age). IEEE Communications Magazine, 24:8–15, 1986.Google Scholar
  47. [47]
    J.S. Turner. Managing bandwidth in ATM networks with bursty traffic. IEEE Network, 6(5):50–59, September 1992.Google Scholar
  48. [48]
    Dinesh Verma, Hui Zhang, and Domenico Ferrari. Delay jitter control for real-time communication in a packet switching network. In IEEE Tricomm'91, April 1991.Google Scholar
  49. [49]
    G.M. Woodruff and R. Kositpaiboon. Multimedia traffic management principles for guaranteed ATM network performance. IEEE J.Select. Areas Commun., 8.Google Scholar
  50. [50]
    Opher Yaron and Moshe Sidi. Calculating performance bounds in communication networks. In IEEE INFOCOM'93, pages 539–546, April 1993.Google Scholar
  51. [51]
    David Yates et al. On per-session end-to-end delay and the call admission problem for real-time applications with qos requirements. To appear in SIGCOMM'93.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Don Towsley
    • 1
  1. 1.Dept. of Computer ScienceUniversity of MassachusettsAmherstUSA

Personalised recommendations