Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
A Probabilistic Scheme for Hierarchical QoS Routing
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Rate-distortion based link state update
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
It is well known that the delay-constrained least-cost (DCLC) routing problem is NP-complete, hence various heuristic methods have been proposed for this problem. However, these heuristic methods have poor scalability as the network scale increases. In this paper we propose a new method based on the Markov Decision Process (MDP) theory and the hierarchical routing scheme to address the scalability issue of the DCLC routing problem. We construct a new two-level hierarchy MDP model and apply an infinite-horizon discounted cost model to the upper level for the end-to-end inter-domain link selection. Since the infinite-horizon discounted cost model is independent of network scale, the scalability problem is resolved. With the proposed model, we further give the algorithm of solving the optimal policy to obtain the DCLC routing. Simulation results show that the proposed method improves the scalability significantly.