[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

State dependent routing: Traffic dynamics and performance benefits

  • Papers
  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

State Dependent Routing (SDR) is an implementable adaptive routing scheme for circuit-switched networks that is expected to improve the performance considerably over the traditional, nonadaptive schemes. SDR is distinct from most other adaptive routing schemes reported in the literature in that the routing decision for each call is based specifically on the likelihood of future call blocking as a result of the specific disposition of the arrived call. This paper conducts an extensive study to investigate the anticipated benefits of SDR in symmetric, fully connected networks. Through the numerical results obtained by an iterative fixed point algorithm, significant insight is gained in understanding the traffic patterns in the network among single- and multlink calls. Distinguishing characteristics in the traffic patterns are identified and analytical models are formulated to explain the dynamics of the network. An attempt is made to quantify the effect of incorporating in SDR additional control mechanisms such as direct preference and trunk reservation, which are well known in the literature. The paper also addresses the survivability and the scalability of the network.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. P. Chaudhary, K. R. Krishnan, and C. D. Pack, Implementing dynamic routing in the local telephone companies of USA,International Teletraffic Congress, ITC-13, 1991.

  2. S. P. Chung, A. Kashper, and K. Ross, Computing approximate blocking probabilities for large loss networks with state-dependent routing.IEEE Trans. on Networking, Vol. 1, pp. 105–115, February 1993.

    Google Scholar 

  3. A. Girard and M. A. Bell, Blocking evaluation for networks with residual-capacity adaptive routing,IEEE Trans. on Commu., Vol. 37, No. 12, pp. 1372–1380, December 1989.

    Google Scholar 

  4. V. Marbukh, An asymptotic study of a large fully connected communication network with reroutes,Problemy Pederachi Informatsii, Vol. 3, pp. 89–95, 1981.

    Google Scholar 

  5. D. Mitra, R. J. Gibbens, and B. D. Huang, Analysis and optimal design of aggregated leastbusy-alternative routing on symmetric loss networks with trunk reservations,Int'l. Teletraffic Congress, Copenhagen Vol. 13, pp. 477–481, 1991.

    Google Scholar 

  6. D. Mitra, R. J. Gibbens, and B. D. Huang, State-dependent routing on symmetric loss networks with trunk reservations,IEEE Trans. on Commu., Vol. 41, No. 2, pp. 400–411, February 1993.

    Google Scholar 

  7. J. Regnier, P. Blondeau, and W. H. Cameron, Grade of service of a dynamic call-routing system,Int'l. Teletraffic Congress, Vol. 10, pp. 3.2.6.1–3.2.6.9, 1983.

    Google Scholar 

  8. E. W. M. Wong, and T. S. Yum, Maximum free circuit routing in circuit-switched networks,Proc. IEEE INFOCOM 1990, IEEE Computer Society Press, 934–937, 1990.

  9. A. Girard,Routing and Dimensioning in Circuit-Switched Networks, Addison-Wesley Publishing Company, 1990.

  10. T. J. Ott, and K. R. Krishnan, State-dependent routing of telephone traffic and the use of separable routing schemes,Int'l. Teletraffic Congress, Vol. 11, pp. 867–872, 1985.

    Google Scholar 

  11. V. Benes, Programming and control problems arising from optimal routing in telephone networks,Bell System Technical Journal, Vol. 45, pp. 1373–1439, 1966.

    Google Scholar 

  12. K. R. Krishnan, and T. J. Ott, State-dependent routing for telephone traffic: theory and results,25th IEEE Control and Decision Conf., pp. 2124–2128, Athens, December 1986.

  13. A. Rayes, P. S. Min, and M. V. Hedge, Analysis of state dependent routing (SDR) and modified SDR, Washington University Technical Report, Department of Electrical Engineering, WUEE 92-126, 1992.

  14. V. I. Istratescu,Fixed Point Theory, D. Reidel Publishing Company, Dordrecht, 1981.

    Google Scholar 

  15. E. V. Denardo, and H. Park, Efficient routing of telecommunications traffic, I & II, Yale University Report, August 1991.

  16. R. I. Wilkinson, Theories for toll traffic engineering in the USA.Bell System Technical Journal, Vol. 35, pp. 421–514, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, Louisiana State University, 70803, Baton Rouge, Louisiana

    M. V. Hegde

  2. Department of Electrical Engineering, Washington University, 63130, St. Louis, Missouri

    P. S. Min

  3. Bellcore, 08854, Piscataway, New Jersey

    A. Rayes

Authors
  1. M. V. Hegde
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. S. Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Rayes
    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

Hegde, M.V., Min, P.S. & Rayes, A. State dependent routing: Traffic dynamics and performance benefits. J Netw Syst Manage 2, 125–149 (1994). https://doi.org/10.1007/BF02139309

Download citation

  • Issue Date:

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

Key Words

Search

Navigation