Efficient Algorithm for Finding Multi-Paths in Telecommunication Networks

Abstract:

Article Preview

Due to the growing of multimedia data traffic, the shortest path can not be met the requirements of the future integrated-service. Many researches have proved that multi-paths are useful in telecommunication networks for fault tolerance, increasing bandwidth, and achieving better load balance. In this paper, we proposed an efficient routing algorithm based on the integrated cost of path which is composed of delay cost and diversity cost to find multi-paths with the constraint of diversity threshold and path hops. It changed link cost continuously, and the cost is obtained by normal distribution function. We implemented this algorithm in NSF network topology comparing with edge split algorithm (ESA), and the results show that the proposed algorithm has lower integrated cost.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

2274-2278

DOI:

10.4028/www.scientific.net/KEM.474-476.2274

Citation:

J. X. Zhang et al., "Efficient Algorithm for Finding Multi-Paths in Telecommunication Networks", Key Engineering Materials, Vols. 474-476, pp. 2274-2278, 2011

Online since:

April 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.