An effective algorithm for delay constrained least cost unicast routing

Author

Jin, Xin ; Liu, Xiande ; Xiao, Shiyuan

Author_Institution

Opt. Eng. Dept., Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2005

fDate

23-26 May 2005

Firstpage

3251

Abstract

This paper discusses the NP-complete delay constrained least cost path problem, and a distributed heuristic algorithm based on mobile agent, which is called the mobile agent routing algorithm based on residual evaluation is presented. And several algorithm instances with different path selecting strategies are examined through computerized simulations. The results indicate that the presented solution is scaleable. An appropriate path selecting strategy can improve network performance. And the algorithm can provide satisfying call acceptance performance.

Keywords

distributed algorithms; mobile agents; telecommunication network routing; NP-completeness; call acceptance performance; delay constrained unicast routing; distributed heuristic algorithm; least cost path problem; least cost unicast routing; mobile agent routing algorithm; network performance; residual evaluation; scaleable path selecting strategy; Bandwidth; Computational modeling; Computer simulation; Costs; Delay effects; Heuristic algorithms; Mobile agents; Quality of service; Routing; Unicast;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Print_ISBN

0-7803-8834-8

Type

conf

DOI

10.1109/ISCAS.2005.1465321

Filename

1465321