• DocumentCode
    965184
  • Title

    An analytical model for adaptive routing networks

  • Author

    Ash, Gerald R. ; Huang, BaoSheng D.

  • Author_Institution
    AT&T Bell Labs., Holmdel, NJ, USA
  • Volume
    41
  • Issue
    11
  • fYear
    1993
  • fDate
    11/1/1993 12:00:00 AM
  • Firstpage
    1748
  • Lastpage
    1759
  • Abstract
    Real-time network routing (RTNR) is a new adaptive routing method. With RTNR, switches have a simple way of exchanging link status bit map information, thereby determining the availability and load conditions of the direct and all two-link paths to the destination. Link busy-idle status is exchanged between the network nodes using a bit map data exchange through the common channel signaling (CCS) network, and calls are set up where there is the most available capacity in the network. To date the analysis of RTNR networks has been limited to simulation models. The present authors develop an analytical model for the AT&T network under RTNR, which is shown to provide good agreement with simulation models. The analytical model for RTNR networks uses an Erlang fixed point method to solve the nonlinear equations describing dynamical network behavior. The equations include the link state probability, network flows, link arrival rates, adaptive trunk reservation level, and adaptive path selection depth. The link state model provides the aggregate link state probabilities through solution of the birth-death equations, and models the adaptive nature of trunk reservation. The network flow model provides a method to calculate the traffic flow using the least busy concept employed in RTNR, and also models the adaptive nature of the path selection depth. The analytical model addresses asymmetrical networks, and computational examples show the differences from the simulation model to be small. The authors also use the analytical model to examine key RTNR parameters over a range of values
  • Keywords
    telecommunication network routing; telecommunication traffic; AT&T network; Erlang fixed point method; adaptive routing networks; adaptive trunk reservation level; asymmetrical networks; availability; capacity; common channel signaling network; direct link paths; dynamical network behavior; link arrival rate; link busy-idle status; link state probability; link status bit map information; load conditions; network flow; network nodes; nonlinear equations; real-time network routing; switches; traffic flow; two-link paths; Adaptive systems; Aggregates; Analytical models; Carbon capture and storage; Computer networks; Nonlinear equations; Routing; Switches; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.241755
  • Filename
    241755