DocumentCode
3279966
Title
Impact of Overlay Routing on End-to-End Delay
Author
Zhang, Hui ; Tang, Li ; Li, Jun
Author_Institution
Dept. of Autom., Tsinghua Univ., Beijing
fYear
2006
fDate
9-11 Oct. 2006
Firstpage
435
Lastpage
440
Abstract
The prosperity of various real-time applications triggers significant challenges for the Internet to meet the critical end-to-end delay requirements. This paper investigates the feasibility and practical issues of using overlay routing to improve end-to-end delay performance, with the analysis of round trip time data collected over three months by the all pairs pings project between each pair of hundreds of nodes on the Planet- Lab. The results show: 1) overlay routing has the potential to reduce the round trip time by 40 milliseconds and increase network connectivity by 7% on average; 2) even simple static overlay paths can reduce end-to-end delay, while the dynamic algorithm does better; 3) Over 80% of the shortest overlay paths have no more than 4 hops, and a simple algorithm leveraging only one relay node can efficiently take the advantages of overlay routing.
Keywords
delays; telecommunication network routing; Internet; end-to-end delay; overlay routing; Algorithm design and analysis; Automation; Bandwidth; Delay effects; Information science; Information technology; Internet; Protocols; Quality of service; Routing; End-to-End Delay; Overlay Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2006. ICCCN 2006. Proceedings.15th International Conference on
Conference_Location
Arlington, VA
ISSN
1095-2055
Print_ISBN
1-4244-0572-6
Type
conf
DOI
10.1109/ICCCN.2006.286315
Filename
4067696
Link To Document