By Topic

A distributed heuristic algorithm on delay-constrained least-cost unicast routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Zhengying ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Shi Bingxin ; Zou Ling

The delay-constrained least-cost unicast routing problem is NP-complete. We present a distributed heuristic algorithm, called the distributed DCLC unicast routing heuristic based on selection function (DCLC-DSF). DCLC-DSF, which is a dynamic routing algorithm with re-routing and negotiation mechanism, only requires the local information to be kept at each node: the delay and cost of neighbor links. In the worst case, for a network with e links and n nodes, the message complexity of DCLC-DSF is O(λe), and the computation complexity of each node is O(n2), where λ is the maximum node degree of the network, while for a stable network, the message complexity is O(e). The simulation results also show that, on the average, DCLC-DSF requires much fewer messages. Therefore, DCLC-DSF scales well to large-scale networks. We picture the protocol of DCLC-DSF by a finite state machine. We also use simulation to compare DCLC-DSF to the optimal DCLC algorithm CBF and the least-delay path algorithm LDP. The results show that DCLC-DSF path costs are within 5-8% from these of the optimal solution. Our work is ongoing

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:1 )

Date of Conference:

2000