Abstract
In this paper, we study the problem of dynamic routing in multi-service circuitswitched 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 π0, with direct link routing only. The policy π0 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-linke model with two types 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Kolarov and J. Hui, Least cost routing in multiple-service networks,Proc. IEEE INFOCOM'94, Toronto, pp. 1482–1489, June 1994.
R. A. Howard,Dynamic Programming and Markov Processes, M.I.T. Press, 1960.
T. J. Ott and K. R. Krishnan, State dependent routing of telephone traffic and the use of separable routing schemes,Int'l. Teletraffic Congress, Kyoto, pp. 5.1A-5-1-5.1A-5-5, September 1985.
K. R. Krishnan and T. J. Ott, Forward-looking routing: A new state dependent routing scheme,Int'l Teletraffic Congress, Torino, pp. 1026–1032, June 1988.
K. R. Krishnan, Markov decision algorithms for dynamic routing,IEEE Commun. Mag. pp. 66–69, October 1990.
V. G. Lazarev and S. M. Starobinets, The use of dynamic programming for optimization of control in networks of commutation of channels.Eng. Cyber. Vol. 15, pp. 107–116, 1977.
G. R. Ash, J. S. Chen, A. E. Frey, and B. D. Huang, Real-time network routing in a dynamic class of service network,Int'l Teletraffic Congress, Copenhagen, pp. 187–194, June 1991.
S. Zachary, Control of stochastic loss networks, with applications.J. Roy. Statis. Soc. Ser. B, Vol. 50, pp. 61–73, 1988.
K. W. Ross and D. H. K. Tsang, Optimal circuit access policies in an ISDN environment: A Markov decision approach,IEEE Trans. on Commun., Vol. 37, pp. 934–939, September 1989.
K. W. Ross and D. H. K. Tsang, The stochastic knapsack problem,IEEE Trans. on Commun., Vol. 37, pp. 740–747, July 1989.
I. S. Gopal and T. E. Stern, Optimal call blocking policies in an integrated services environment, The John Hopkins University,Proc. CISS, pp. 383–388, March 1983.
K. E. Atkinson,An Introduction to Numerical Analysis, Second Edition. New York, John Wiley, 1989.
R. Cooper,Introduction to Queueing Theory, Second Edition, New York, Macmillan Co., 1981.
D. L. Jagerman, Some properties of the Erlang loss function,AT&T Bell Labs. Tech. Journal, Vol. 53, pp. 525–551, March 1974.
Author information
Authors and Affiliations
Additional information
The work was performed while A. Kolarov was a Ph.D. student at Rutgers University, and it was supported by an NSF PYI Grant NCR 90-58079-03 and by Bellcore and NEC C&C Lab. This paper was presented in part at IEEE INFOCOM '95.
Rights and permissions
About this article
Cite this article
Kolarov, A., Hui, J. On computing Markov decision theory-based cost for routing in circuit-switched broadband networks. J Netw Syst Manage 3, 405–426 (1995). https://doi.org/10.1007/BF02139532
Issue Date:
DOI: https://doi.org/10.1007/BF02139532