Exploit TIVs to Find Faster Paths
Yanhua Zhang, Chunhong Zhang, Gang Wang · 2011
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.