DocumentCode :
2814571
Title :
An Algorithm for Acquiring Reliable Path in Abnormal Traffic Condition
Author :
Lee, Do-hyeon ; Kim, Doo-young ; Jung, Jae-il ; An, Young-soo
Author_Institution :
Dept. of Electron. & Comput. Eng., Hanyang Univ., Seoul
fYear :
2008
fDate :
28-30 Aug. 2008
Firstpage :
682
Lastpage :
686
Abstract :
Most Reliable Paths algorithm make it enable to select the most stable path on network by considering not only link cost but also link capacity, link operation probability and the size of message to be sent. But this algorithm uses a fixed value as link operation probability so that it can be applicable in the normal network state, not in the network state that traffic abnormally increase. To solve this problem, this thesis applies the packet drop probability of RED (Random Early Detection) method to the operation probability of the most reliable path algorithm so that the most reliable path can be guaranteed. For this purpose, we propose an All-Pairs Most Reliable Paths acquiring algorithm having time complexity thetas (n3) based on the All-Pairs Shortest Paths algorithm proposed by Floyd-Warshall.
Keywords :
computational complexity; probability; telecommunication congestion control; abnormal traffic condition; all-pairs most reliable paths acquiring algorithm; link capacity; link operation probability; most reliable path algorithm; packet drop probability; random early detection; time complexity; Bandwidth; Capacity planning; Computer network reliability; Computer networks; Costs; Delay; Shortest path problem; Telecommunication network reliability; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Convergence and Hybrid Information Technology, 2008. ICHIT '08. International Conference on
Conference_Location :
Daejeon
Print_ISBN :
978-0-7695-3328-5
Type :
conf
DOI :
10.1109/ICHIT.2008.284
Filename :
4622906
Link To Document :
بازگشت