Markov decision algorithms for dynamic routing (telephone networks)

@article{Krishnan1990MarkovDA,
  title={Markov decision algorithms for dynamic routing (telephone networks)},
  author={K. R. Krishnan},
  journal={IEEE Communications Magazine},
  year={1990},
  volume={28},
  pages={66-69}
}
The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted. A state-dependent scheme seeks to route each call so as to minimize the risk of blocking future calls, and thus responds to the current state of the network on the basis of certain assumptions about future traffic demands. State-dependent routing is considered as a Markov decision process. How the relative costs can be determined for the case of direct routing is shown.<<ETX>> 
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Resource allocation and adaptive routing in multimedia low Earth orbit satellite mobile networks

2004 IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat. No.04TH8763) • 2004
View 4 Excerpts
Highly Influenced

Analyzing the relative cost concept in elastic optical networks

2017 International Conference on Computing, Networking and Communications (ICNC) • 2017
View 1 Excerpt

Offload (only) the right jobs: Robust offloading using the Markov decision processes

2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM) • 2015

Energy-aware dispatching in parallel queues with on-off energy consumption

30th IEEE International Performance Computing and Communications Conference • 2011
View 1 Excerpt

Similar Papers

Loading similar papers…