A scalable algorithm for finding delay-constraint least-cost end-to-end path

Authors:
Yue Han;Zengji Liu;Mingwu Yao;Jungang Yang
Affiliations:
ISN State Key Lab, Xidian University, Xi'an, China,Xi'an Institute of Communications, Xi'an, China;ISN State Key Lab, Xidian University, Xi'an, China;ISN State Key Lab, Xidian University, Xi'an, China;ISN State Key Lab, Xidian University, Xi'an, China,Xi'an Institute of Communications, Xi'an, China
Venue:
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
Year:
2012

Citing 5
Cited 0

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
Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem

Journal of Heuristics
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Delay-Constrained Least-Cost(DCLC) routing problem is known to be 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 Markov Decision Process (MDP) theory to address the scalability issue of the DCLC routing problem. The proposed algorithm combines the benefit of the hierarchical routing with the advantage of the probabilistic routing in decreasing the advertisement of the network state information. Simulation results show that the proposed method improves the scalability significantly.