DocumentCode :
2176055
Title :
A Graph Clustering Approach to Computing Network Coordinates
Author :
Sun, Yibo ; Wang, Beilan ; Chiu, Kenneth
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York at Binghamton, Binghamton, NY, USA
fYear :
2010
fDate :
17-19 Feb. 2010
Firstpage :
129
Lastpage :
136
Abstract :
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.
Keywords :
graph theory; grid computing; pattern clustering; Meridian dataset; graph clustering technique; grid computing; metric space; network coordinates computing; network latency; network space; relative edge density; single spring relaxation; triangle inequality violations; Computer networks; Computer science; Concurrent computing; Coordinate measuring machines; Delay; Distributed computing; Extraterrestrial measurements; Network topology; Springs; Sun; clustering; network coordinates;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel, Distributed and Network-Based Processing (PDP), 2010 18th Euromicro International Conference on
Conference_Location :
Pisa
ISSN :
1066-6192
Print_ISBN :
978-1-4244-5672-7
Electronic_ISBN :
1066-6192
Type :
conf
DOI :
10.1109/PDP.2010.72
Filename :
5452502
Link To Document :
بازگشت