Constructing Internet coordinate system based on delay measurement

被引:42
作者
Lim, H [1 ]
Hou, JC
Choi, CH
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
[2] Seoul Natl Univ, Sch Elect Engn & Comp Sci, Seoul 151742, South Korea
基金
美国国家科学基金会;
关键词
Internet; modeling techniques; network topology; measurement techniques;
D O I
10.1109/TNET.2005.850197
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimation of network distances among arbitrary Internet hosts. We envision an infrastructure that consists of beacon nodes and provides the service of estimating network distance between pairs of hosts without direct delay measurement. We show that the principal component analysis (PCA) technique can effectively extract topological information from delay measurements between beacon hosts. Based on PCA, we devise a transformation method that projects the raw distance space into a new coordinate system of (much) smaller dimensions. The transformation retains as much topological information as possible and yet enables end hosts to determine their coordinates in the coordinate system. The resulting new coordinate system is termed as the Internet Coordinate System (ICS). As compared to existing work (e.g., IDMaps and GNP), ICS incurs smaller computation overhead in calculating the coordinates of hosts and smaller measurement overhead (required for end hosts to measure their distances to beacon hosts). Finally, we show via experiments with both real-life and synthetic data sets that ICS makes robust and accurate estimates of network distances, incurs little computational overhead, and its performance is not susceptible to the number of beacon nodes (as long as it exceeds a certain threshold) and the network topology.
引用
收藏
页码:513 / 525
页数:13
相关论文
共 19 条
[1]  
[Anonymous], 2002, NETWORK SIMULATOR NS
[2]  
Cormen T. H., 1990, INTRO ALGORITHMS
[3]   Adaptive dimension reduction for clustering high dimensional data [J].
Ding, C ;
He, XF ;
Zha, HY ;
Simon, HD .
2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2002, :147-154
[4]   An architecture for a global Internet host distance estimation service [J].
Francis, P ;
Jamin, S ;
Paxson, V ;
Zhang, LX ;
Gryniewicz, DF ;
Jin, YX .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :210-217
[5]  
GUYTON JD, 1995, P ACM SIGCOMM, P288, DOI DOI 10.1145/217382.217463
[6]  
Hotz S.M., 1994, THESIS U SO CALIFORN
[7]  
Jain A.K., 1988, Algorithms for Clustering Data
[8]  
Jolliffe I. T., 1986, Principal Component Analysis, DOI [DOI 10.1016/0169-7439(87)80084-9, 10.1007/0-387-22440-8_13, DOI 10.1007/0-387-22440-8_13]
[9]  
LIM H, 2003, P 3 ACM SIGCOMM C IN, P129
[10]  
Minka T., 2000, Technical report, V13