Link access blocking in very large multi-media networks

ABSTRACT

This paper is concerned with performance models and approximations for very large, multi-media networks. Blocking is the traditional performance measure in circuit-switched networks, and will remain as such in multi-rate circuit-switched networks. It is also considered a likely performance measure candidate for resource management and dimensioning in broadband fast packet-switched networks, operated under virtual circuit mode. To gain some insight into network-wide blocking phenomena, we study in this paper the basic building block of any network, a single link. Multi-media traffic calls with Poisson arrivals, arbitrarily distributed service times, and different bandwidth requirements (in number of circuits), are offered to a system (link) of finite capacity. A call is rejected when the sharing policy doesn't allow it to be accommodated by the system. Under complete sharing policy, an aggregate state describing the number of occupied circuits is shown to exhibit a product form solution in steady state, when the capacity and traffic intensities become very large asymptotically. This structural property leads to the main result of this paper, an approximation which reduces the computation of the blocking probabilities for the different classes of traffic to the evaluation of a single Erlang formula and the determination of the root of a monotonous polynomial function. We provide comparison curves of the exact blocking probabilities and the approximations for some examples with 3 classes of traffic.

REFERENCES

• 1: G. R. Ash, "Traffic Network Routing, ControI, and Design for the ISDN area", Traffic Engineering for ISDN Design and Planning, M. Bonatti and M. Decina (Editors), Elsevier Science Publishers B.V. (North Holland), 1988.
• 2: G. Gallasi, G. Rigolio and L. Verri, "Resource Management and Dimensioning in ATM Networks", IEEE Net works. May 1990.
• 3: Andre Girard, Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 4: J. M. Aein, "A Multi-User-Class, Blocked-Calls- Cleared. Demand Access Model", IEEE Trans. Comm., Vol. COM-26, Mar. 1978.
• 5: E. Arthurs , J. S. Kaufman, Sizing a Message Store Subject to Blocking Criteria, Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems, p.547-564, February 06-08, 1979
• 6: j. S. Kaufman, "Blocking in a Shared Resource Environment". IEEE Trans. Comm., Vol COM-29, October 1981.
• 7: J. W Roberts, "A Service System with Heterogeneous User Requirements", Performance of Data Communication Systems and their Applications, G. Pujolle fed.), North Holland Pub Co, 1981.
• 8: W. Wang and E. Pinsky, "An Asymptotic Analysis of Complete Sharing Policy", Proc. IEEE INFOCOM '89, Apr. 1989.
• 9: J. W. Roberts, "Tetetrafiic Models for the Telecom 1 Integrated Services Network", Proc. lOth Int. Teletraftic Congress, Montreal, 1983.
• 10: G. J. Foschini and B. Gopia#tb., "Sharing Memory Optimally", IEEE Trans. Comm., Vol COM-31, March 1983.
• 11: B. Kraimeche and M. Schwartz, "Circuit Access Control Strategies in Integrated Digital Networks", Proc. IEEE INFOCOM '84, San-Francisco, CA, Apr. 1984.
• 12: K. W. Ross and D. Tsang, "The Stochastic Knapsack Problem", IEEE Trans. Comm., Vol COM-37, July 1989.
• 13: F. P. Kelly, "Blocking Probabilities in Large Circuit- Switching Networks", Adv. Appl. Prob., 18, 1986.
• 14: D. Mitra, "Asymptotic Analysis and Computational Methods for a Class of Simple, Circuit-Switched Networks with Blocking", Adv. Appl. Prob., 19, 1987.
• 15: D. Mitra and A. Weiss, "The Transient Behavior in Erlang's Model for Large Trunk Groups and Various Traffic Conditions", 1TC 12, Torino, June 1988.
• 16: G. Fiche, P. Le Gall and S. Ricupero, "Study of Blocking for Multislot Connections in Digital Link Systems", ITC 11, Kyoto, Sept. 1985.
• 17: F. P. Kelly, "Reversibility and Stochastic Networks", John Wiley & Sons, New York, 1979.
• 18: J-F. P. Labourdette & G. Hart, "Blocking Probabilities in Multitraffic Loss Systems: Insensitivity, Asymptotic Behavior, and Approximations", Technical Report, Center for Telecommunications Research, Columbia University.
• 19: T. Kailath, "Linear Systems", Prentice-Hall, Englewood Cliffs, N.J., 1980.
• 20: D. G. Luenberger, "Introduction to Dynamic Systems", John Wiley & sons, New York, 1979.
• 21: R. W. Wolff, "Stochastic Modeling and the Theory of Queues", Prentice Hall, 1980.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network communications
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

  D. Software
  D.4 OPERATING SYSTEMS
      D.4.8 Performance
          Subjects: Queueing theory

General Terms:
Algorithms, Design, Measurement, Performance