An architecture for a global Internet host distance estimation service

被引:25
作者
Francis, P [1 ]
Jamin, S [1 ]
Paxson, V [1 ]
Zhang, LX [1 ]
Gryniewicz, DF [1 ]
Jin, YX [1 ]
机构
[1] NTT, Software Labs, Musashino, Tokyo 180, Japan
来源
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW | 1999年
关键词
D O I
10.1109/INFCOM.1999.749285
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between internet hosts. For example, to select the nearest of multiple equal content web servers. This paper explores technical issues related to the creation of a public infrastructure service to provide such information. In so doing, we suggests an architecture, called IDMaps, whereby Internet distance information is distributed over the Internet, using IP multicast groups, in the form of a virtual distance map, Systems listening to the groups can estimate the distance between any pair of IP addresses by running a spanning tree algorithm over the received distance map. We also presents the results of experiments that give preliminary evidence supporting the architecture. This work thus lays the initial foundation for future work in this new area.
引用
收藏
页码:210 / 217
页数:8
相关论文
共 18 条
[1]  
BHATTACHARJEE S, 1997, P IEEE INFOCOM 97 AP
[2]  
CACERES R, 1998, MINC MULTICAST BASED
[3]   MULTICAST ROUTING IN DATAGRAM INTERNETWORKS AND EXTENDED LANS [J].
DEERING, SE ;
CHERITON, DR .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1990, 8 (02) :85-110
[4]  
GUYTON JD, 1995, P ACM SIGCOMM AUG
[5]  
HOTZ S, 1994, ROUTING INFORMATION
[6]  
HUITEMA C, 1997, PROJECT FELIX INDEPE
[7]  
KANTOR B, 1986, 977 RFC INT ENG TASK
[8]  
KESHAV S, 1998, PROJECT OCTOPUS NETW
[9]  
LABOVITZ C, 1997, P ACM SIGCOMM 97
[10]  
LABOVITZ C, 1998, INTERNET PERFORMANCE