On Computing Markov Decision Theory-Based Cost for Routing in Circuit-Switched Broadband Networks
A. Kolarov
NEC USA Inc., C&C Research Laboratories
4 Independence Way, Princeton, NJ 08540, USA
Email: kolarov_AT_ccrl.nj.nec.com
J. Hui
Department of Electrical and Computer Engineering
Rutgers, The State University of New Jersey
P.O.Box 909, Piscataway, NJ 08855-0909, USA
Email: jhui_AT_ece.rutgers.edu
Abstract
In this paper, we study the problem of dynamic routing in
multi-service circuit-switched networks. In a previous work,
we have proposed a distributed, state dependent, dynamic
routing method, called Least Cost Routing in Multi-Service
Networks (LCRM), for multirate circuit-switched networks.
Broadband Integrated Services Digital Networks (BISDN) should
be capable of supporting a variety of traffic classes
(e.g. data, voice, video, facsimile), each of which has its
own traffic requirement (bandwidth requirement, call arrival
rate, and call holding time) and reward parameter. The LCRM
method is obtained through the policy iteration routine of
Markov decision theory. It represents a one-step policy
improvement on a base policy , with direct link routing only.
The policy also requires that each call class has a portion
of link bandwidth dedicated to it. In this paper, we look for
an efficient computational way to obtain the corresponding
relative cost values, which represent the cost of routing a
call over one link. We consider the one-link model with two
of traffic. We show that the system of linear equations
associated with the two-dimensional Markov chain can be
decomposed into a system of linear equation associated with
the one-dimensional Markov chain. Examples with two classes
of service are presented.
Keywords: B-ISDN; least cost routing; real-time network routing (RTNR); bandwidth allocation
JNSM: Vol. 3, No. 4, 1995
On Computing Markov Decision Theory-Based Cost for Routing in Circuit-Switched Broadband Networks [Vol. 3, No. 4, 1995]
NOTE: only abstract of paper available on-line
Back to JNSM main page