Annals of Operations Research

, Volume 35, Issue 1, pp 3–30 | Cite as

State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design

  • Debasis Mitra
  • Richard J. Gibbens
Loss Networks


We investigate a distributed, state-dependent, dynamic routing strategy for circuit-switched loss networks which we have called Aggregated-Least-Busy-Alternative (ALBA). The networks considered are symmetric and fully connected, the offered calls form Poisson streams and routes have at most two links. In ALBA(K), the states of each link are lumped intoK (K ≥ 2) aggregates and the route of each call is determined by local information on the aggregate-states of the links of the alternate routes. The last aggregate is always the set of states reserved for direct traffic and defined by the trunk reservation parameter. The particular case of ALBA in which there is no aggregation is Least-Busy-Alternative (LBA); ALBA(2) represents the other extreme of aggregation. We consider two separate asymptotic scalings based on Fixed Point Models for ALBA(K) which were obtained and investigated in an earlier paper. In the first, it is assumed that the number of network nodes, the offered traffic and trunk group size are all large; their ratios have been chosen to reflect practical interest. The results show that there exists a threshold which delineates fundamentally different behavior: for offered traffic below the threshold, the network loss probability decreases exponentially with increasing network size, while above the threshold the decrease is only polynomial. In the related second asymptotic scaling, the asymptotically optimum trunk reservation parameter is obtained as the solution of a simple equation. Such asymptotically optimal designs are compared to the outputs of exhaustive numerical searches for some realistically sized networks and found to perform very well.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Abramowitz and J.A. Stegun (eds.),Handbook of Mathematical Functions (Dover, New York, 1970), ch. 19.Google Scholar
  2. [2]
    J.M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing, AT&T Bell Labs. Tech. J. 63(1984)1261–1281.Google Scholar
  3. [3]
    G.R. Ash, R.H. Cardwell and R.P. Murray, Design and optimization of networks with dynamic routing, Bell. Syst. Tech. J. 60(1981)1787–1820.Google Scholar
  4. [4]
    G.R. Ash, A.H. Kafker and K.R. Krishnan, Servicing and real-time control of networks with dynamic routing, Bell Syst. Tech. J. 60(1981)1821–1845.Google Scholar
  5. [5]
    G.R. Ash, Use of a trunk status map for real-time DNHR,ITC 11, Kyoto (1985).Google Scholar
  6. [6]
    G.R. Ash, J.-S. Chen, A.E. Frey and B.D. Huang, Real-time network routing in an integrated network,ITC 13, Copenhagen, ed. A. Jensen and V.B. Iverson (Elsevier, 1991), pp. 187–194.Google Scholar
  7. [7]
    W.H. Cameron, J. Regnier, P. Galloy and A.M. Savoie, Dynamic routing for intercity telephone networks,ITC 10, Montreal (1983), Paper 3.2-3.Google Scholar
  8. [8]
    F. Caron, Results of the Telecom Canada high performance routing trial,ITC 12, Torino (1988), Paper 2.2A.2.Google Scholar
  9. [9]
    A. Girard, Blocking probability of noninteger groups with trunk reservation. IEEE Trans. Commun. COM-33(1985)113–120.CrossRefGoogle Scholar
  10. [10]
    R.J. Gibbens, Dynamic routing in circuit-switched networks: The dynamic alternative routing strategy, Ph.D. Thesis, University of Cambridge (1988).Google Scholar
  11. [11]
    R.J. Gibbens, F.P. Kelly and P.B. Key, Dynamic alternative routing — modelling and behavior,ITC 12, Torino (1988), Paper 3.4A.3.Google Scholar
  12. [12]
    A. Girard and M.-A. Bell, Blocking evaluation for networks with residual capacity adaptive routing, IEEE Trans. Commun. COM-37(1989)1372–1380.CrossRefGoogle Scholar
  13. [13]
    R.J. Gibbens and F.P. Kelly, Dynamic routing in fully connected networks, IMA J. Math. Control Info. 7(1990)77–111.MathSciNetGoogle Scholar
  14. [14]
    P.J. Hunt and F.P. Kelly, On critically loaded loss networks, Adv. Appl. Prob., to appear.Google Scholar
  15. [15]
    D.L. Jagerman, Some properties of the Erlang loss function, Bell Syst. Tech. J. 53(1974)525–557.Google Scholar
  16. [16]
    S. Katz, Statistical performance analysis of a switched communication network,ITC 5, New York (1967), pp. 566–575.Google Scholar
  17. [17]
    F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. Appl. Prob. 18(1986)473–505.Google Scholar
  18. [18]
    R.S. Krupp, Stabilization of alternate routing networks,Proc. IEEE Int. Conf. on Communications, Philadelphia (1982), Paper 31.2.Google Scholar
  19. [19]
    K.R. Krishnan and T.J. Ott, Forward-looking routing: A new state-dependent routing scheme,ITC 12, Torino (1988), Paper 3.4A.4.Google Scholar
  20. [20]
    V.G. Lazarev and S.M. Starobinets, The use of dynamic programming for optimization of control networks of commutation of channels, Eng. Cyber. 3(1977)107–116.Google Scholar
  21. [21]
    P.M. Lin, B.J. Leon and C.R. Stewart, Analysis of circuit switched networks employing originating office control with spill, IEEE Trans. Commun. COM-26(1978)754–765.CrossRefGoogle Scholar
  22. [22]
    V. Marbukh, An asymptotic study of a large fully connected communication network with reroutes, Problemy Peredachi Informatsii 3(1981)89–95.Google Scholar
  23. [23]
    V. Marbukh, Study of a fully connected channel communication network with many nodes and circumventing routes, Automatika i Telemakhanika 12(1983)86–94.Google Scholar
  24. [24]
    J. McKenna, D. Mitra and K.G. Ramakrishnan, A class of closed Markovian queueing networks: Integral representations, asymptotic expansions, generalizations, Bell. Syst. Tech. J. 60(1981)599–641.Google Scholar
  25. [25]
    D. Mitra and A. Weiss, The transient behavior in Erlang's model for large trunk groups and various traffic conditions,ITC 12, Torino (1988), Paper 5.1B.4.Google Scholar
  26. [26]
    D. Mitra, R.J. Gibbens and B.D. Huang, State-dependent routing on symmetric loss networks with trunk reservations, I. IEEE Trans. Commun., to appear.Google Scholar
  27. [27]
    D. Mitra, Optimal design of windows for high speed data networks,Proc. IEEE INFOCOM'90 (IEEE Computer Society Press, 1990), pp. 1156–1163.Google Scholar
  28. [28]
    D. Mitra and I. Mitrani, Asymptotic optimality of the go-back-n protocol in high speed data networks with small buffers,Data Communication Systems, ed. G. Pujolle and R. Puigjaner,Proc. 4th Int. Conf. on Data Communication Systems and Their Performance, IFIP, Barcelona (North-Holland, 1991), pp. 55–68.Google Scholar
  29. [29]
    T.J. Ott and K.R. Krishnan, State-dependent routing of telephone traffic and the use of separable routing schemes,ITC 11, Kyoto (1985).Google Scholar
  30. [30]
    M. Pioro, Design methods for non-hierarchical circuit switched networks with advanced routing, Wydawnictwa Politechniki Warszawskicj, Warszawa (1989).Google Scholar
  31. [31]
    M. Reiman, Asymptotically optimal trunk reservation for large trunk groups,Proc. 28th Conf. on Decision and Control, IEEE, Tampa (1989), pp. 2536–2541.Google Scholar
  32. [32]
    W. Whitt, Heavy traffic approximations for service systems with blocking, AT&T Tech. J. 63(1984)689–708.Google Scholar
  33. [33]
    W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Tech. J. 4(1985)1807–1856.Google Scholar
  34. [34]
    E.W.M. Wong and T.-S. Yum, Maximum free circuit routing in circuit-switched networks,Proc. IEEE INFOCOM'90 (IEEE Computer Society Press, 1990), pp. 934–937.Google Scholar

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1992

Authors and Affiliations

  • Debasis Mitra
    • 1
  • Richard J. Gibbens
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations