DocumentCode
2902348
Title
Exploit TIVs to Find Faster Paths
Author
Zhang, Yanhua ; Zhang, Chunhong ; Wang, Gang
Author_Institution
Mobile Life & New Media Lab., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2011
fDate
16-18 Nov. 2011
Firstpage
1779
Lastpage
1782
Abstract
The phenomenon of Triangle inequality violations (TIVs) is very common in the Internet today. And it will remain as a property of the Internet for the foreseeable future. Though TIVs may bring some problems to the research on the Internet, they can also be used by us. We suggest that TIVs can help to find the relay hosts in order to get the faster paths. We show that TIVs can be detected by using their clustering feature and then we can use this. At last, we simulate such a distributed methodology to show that it is efficient.
Keywords
Internet; telecommunication network routing; Internet; TIV; clustering feature; distributed methodology; relay hosts; triangle inequality violations; Clustering algorithms; Delay; Internet; Peer to peer computing; Relays; Routing; Telecommunications; Triangle inequality violations (TIVs); clustering feature; distributed methodology; relay hosts;
fLanguage
English
Publisher
ieee
Conference_Titel
Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4577-2135-9
Type
conf
DOI
10.1109/TrustCom.2011.248
Filename
6121047
Link To Document