Skip to main content
SpringerLink
Log in

Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic

  • Loss Networks
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Separable routing is the first of a number of routing schemes for circuit switched telephone traffic invented at Bellcore. These routing schemes are state dependent, in the sense that, for each call attempt, a routing decision is made on the basis of the state of the network (defined in terms of the numbers of busy and idle trunks in the various trunk groups at the moment of the call attempt). In this paper, we describe separable routing and its mathematical background. Simulation results we have presented elsewhere show that the family of state-dependent routing schemes, of which separable routing is a member, is very attractive in terms of blocking rate, built-in network management features, and behavior in the presence of traffic forecast error.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G.R. Ash, R.H. Cardwell and R.P. Murphy, Design and optimization of networks with dynamic routing, Bell Syst. Tech. J. 60(1981)1787–1820.

    Google Scholar 

  2. 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 

  3. G.R. Ash, Use of a trunk status map for real-time DNHR,Proc. ITC-12, Kyoto, Japan (September 1985).

  4. A.E. Bean and E. Szybicki, Advanced traffic routing in local telephone networks: Performance of proposed call routing algorithms,Proc. ITC-9, Torremolinos, Spain (1979).

    Google Scholar 

  5. V.E. Benes, Programming and control problems arising from optimal routing in telephone networks, Bell Syst. Tech. J. 45(1966)1373–1438.

    Google Scholar 

  6. V.E. Benes, Optimal routing in connecting networks over finite time intervals, Bell. Syst. Tech. J. 46(1967)2341–2352.

    Google Scholar 

  7. W.H. Cameron, J. Regnier, P. Galloy and A.M. Savoie, Dynamic routing for intercity telephone networks,Proc. ITC-10, Montreal (June 1983).

  8. CCIS, Bell Syst. Tech. J. 57(1978).

  9. R.B. Cooper,Introduction to Queueing Theory, 2nd ed. (North-Holland, 1981).

  10. V.P. Chaudhary, K.R. Krishnan and C.D. Pack, Implementing dynamic routing in the local telephone companies of USA,ITC-13, Copenhagen (June, 1991).

  11. R. Earle, A study of approximations used in state-dependent routing schemes. Bellcore Internal Memorandum (1987).

  12. R.J. Gibbons, Some aspects of dynamic routing in circuit-switched telecommunication networks, Rayleigh Prize Essay, University of Cambridge (1986).

  13. R.A. Howard,Dynamic Programming and Markov Processes (MIT Press, 1960).

  14. R.A. Howard,Dynamic Probabilistic Systems I: Markov Models (Wiley, 1971).

  15. R.A. Howard,Dynamic Probabilistic Systems II: Semi-Markov and Decision Processes (Wiley, 1971).

  16. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).

  17. P.B. Key, Optimal control and trunk reservation in loss networks, Prob. Eng. Info. Services 4(1990)203–242.

    Article  Google Scholar 

  18. K.R. Krishnan and T.J. Ott, Forward-looking routing: A new state-dependent routing scheme,Proc. ITC-12, Torino, Italy (June 1988).

  19. K.R. Krishnan, Adaptive state-dependent traffic routing using on-line trunk-group measurements,ITC-13 (June, 1991).

  20. V.G. Lazarev and S.M. Starobinets, The use of dynamic programming for optimization of control on networks of communication channels, Eng. Cybern. 15(1977)107–117.

    Google Scholar 

  21. Simple is the best for dynamic routing of telecommunications, Nature 323(1986)108.

  22. T.J. Ott and K.R. Krishnan, State-dependent routing of telephone traffic and the use of separable routing schemes,Proc. ITC-11 (1985), pp. 5.1.A.5.1–6.

  23. S.M. Ross,Applied Probability Models with Optimization Applications (Holden-Day, 1970).

  24. R.E. Story, Applications of hot switching to trunk engineering, Bell Laboratories TM-81-59514-5 (February, 1981).

  25. C.J. Truitt, Traffic engineering techniques for determining trunk requirements in alternate routed networks, Bell Syst. Tech. J. 33(1954)277–302.

    Google Scholar 

  26. J.H. Weber, Some traffic characteristics of communication networks with automatic alternate routing, Bell Syst. Tech. J. 41(1962)1201–1247.

    Google Scholar 

  27. R.J. Wilkinson, Theories for toll traffic engineering in the USA, Bell Syst. Tech. J. 35(1956)421–514.

    Google Scholar 

  28. T.G. Yum and M. Schwartz, Comparison of routing procedures for circuit-switched traffic in non-hierarchical networks, IEEE Trans. Commun. COM-35(1987)535–544.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bellcore, 445 South Street, P.O. Box 1910, 07960-1910, Morristown, NJ, USA

    Teunis J. Ott & K. R. Krishnan

Authors
  1. Teunis J. Ott
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. R. Krishnan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ott, T.J., Krishnan, K.R. Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic. Ann Oper Res 35, 43–68 (1992). https://doi.org/10.1007/BF02023090

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023090

Keywords

Search

Navigation