A Graph Clustering Approach to Computing Network Coordinates

In the technique known as network coordinates, the network latency between nodes is modeled as the distance between points in a metric space. Actual network latencies, however, exhibit numerous triangle inequality violations, which result in significant error between the actual latency and the distance as determined by the network coordinates. In this work, we show how graph clustering techniques can be used to find regions of the network space that show low triangle inequality violation within the region. By using techniques to increase the relative edge density in these regions, we improve the accuracy of network coordinates in these regions. We reduce the relative error within a cluster by 15% on average for the Meridian dataset, and by 7% over all; when compared to a single spring relaxation over the whole network.

[1]  Andreas Noack,et al.  Energy Models for Graph Clustering , 2007, J. Graph Algorithms Appl..

[2]  Arun Venkataramani,et al.  iPlane: an information plane for distributed services , 2006, OSDI '06.

[3]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[4]  Bo Zhang,et al.  Towards network triangle inequality violation aware distributed systems , 2007, IMC '07.

[5]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[6]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[7]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[8]  Bobby Bhattacharjee,et al.  Triangle Inequality and Routing Policy Violations in the Internet , 2009, PAM.

[9]  Eng Keong Lua,et al.  Internet Routing Policies and Round-Trip-Times , 2005, PAM.

[10]  Chuang Liu,et al.  A Scalable Cluster Algorithm for Internet Resources , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[11]  Zhi-Li Zhang,et al.  On suitability of Euclidean embedding of internet hosts , 2006, SIGMETRICS '06/Performance '06.

[12]  Bo Zhang,et al.  Measurement-Based Analysis, Modeling, and Synthesis of the Internet Delay Space , 2006, IEEE/ACM Transactions on Networking.

[13]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[14]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.