State Dependent Routing: Traffic Dynamics and Performance Benefits
M.V. Hegde
Department of Electrical and Computer Engineering,
Louisiana State University, Baton Rouge, LA 70803
Email: bandit_AT_gate.ee.lsu.edu
P.S. Min
Department of Electrical Engineering, Washington University,
St. Louis, MO 63130
Email: psm_AT_ee.wustl.edu
A. Rayes
Bellcore
444 Hoes Lane
Piscataway, NJ 08854
Email: rayes_AT_cc.bellcore.com
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, non-adaptive 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 of various sizes and loads.
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 multi-link 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.
Keywords: state dependent routing; traffic management; trunk reservation.
JNSM: Vol. 2, No. 2, 1994
State Dependent Routing: Traffic Dynamics and Performance Benefits [Vol. 2, No. 2, 1994]
NOTE: only abstract of paper available on-line
Back to JNSM main page