DocumentCode
423103
Title
Path probing relay routing for achieving high end-to-end performance
Author
Cheng, Chen-Mou ; Yu-Sheng Huan ; Kung, H.T. ; Wu, Chun-Hsin
Author_Institution
Div. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA, USA
Volume
3
fYear
2004
fDate
29 Nov.-3 Dec. 2004
Firstpage
1359
Abstract
We present an overlay network routing scheme, called path probing relay routing (PPRR), which is capable of promptly switching to alternative paths when the direct paths provided by the underlying IP networks suffer from serious performance degradation or outage. PPRR uses a randomized search algorithm to discover available alternative paths and employs an end-to-end, on-demand probing technique to determine their quality. To assess the effectiveness of PPRR, we conduct performance simulations using four sets of real-world traces, collected by various research groups at different times and places. Our simulation results show that the performance of PPRR is comparable to that of a typical link state relay routing algorithm. Compared with the latter, PPRR has lower probing overhead in the sense that the overhead remains constant as network size grows. In particular, PPRR avoids the need to flood the overlay network with link state updates.
Keywords
IP networks; search problems; telecommunication network routing; IP networks; link state relay routing algorithm; link state updates; overlay network routing scheme; path probing relay routing; probing overhead; randomized search algorithm; Computer science; Degradation; IP networks; Information science; Internet; Large-scale systems; Loss measurement; Relays; Routing; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE
Print_ISBN
0-7803-8794-5
Type
conf
DOI
10.1109/GLOCOM.2004.1378207
Filename
1378207
Link To Document