DocumentCode :
2596092
Title :
Optimizing multi-path routing by avoiding Key Nodes
Author :
Junlong, Yang ; Hewei, Yu
Author_Institution :
Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
fYear :
2009
fDate :
18-20 Oct. 2009
Firstpage :
48
Lastpage :
51
Abstract :
In this paper, we propose a new routing algorithm which combines source routing and intermediate routing in order to meet the requirement of node disjointed path and scalability. We also discover the existing of key nodes which we call KN, KN are the transmission congestion host spots, also in multi-path routing, they will lead to a low performance in disjointed path. We give a simple, effective method to detect KN and avoid them. The result of simulation shows that this method can obtain a good performance on disjointed path, and can significantly improve network reliability.
Keywords :
telecommunication congestion control; telecommunication network routing; multipath routing optimization; network reliability; node disjointed path; transmission congestion host spot; Algorithm design and analysis; Bandwidth; Computer science; Delay; Fault tolerance; Feedback; Internet; Paper technology; Routing; Scalability; Disjoined path; Intermediate routing; Key nodes; Multi-path routing; Scalability; Source routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Broadband Network & Multimedia Technology, 2009. IC-BNMT '09. 2nd IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4590-5
Electronic_ISBN :
978-1-4244-4591-2
Type :
conf
DOI :
10.1109/ICBNMT.2009.5347851
Filename :
5347851
Link To Document :
بازگشت