IDMaps: A global Internet host distance estimation service

被引:167
作者
Francis, P [1 ]
Jamin, S
Jin, C
Jin, YX
Raz, D
Shavitt, Y
Zhang, LX
机构
[1] Tahoe Networks, San Jose, CA 95134 USA
[2] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48105 USA
[3] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
[4] Bell Labs, Lucent Technol, Holmdel, NJ 07733 USA
[5] Technion Israel Inst Technol, Dept Comp Sci, Haifa, Israel
[6] Tel Aviv Univ, Dept Elect Engn Syst, IL-69978 Tel Aviv, Israel
基金
美国国家科学基金会;
关键词
distributed algorithms; modeling; network service; scalability;
D O I
10.1109/90.958323
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
There is an increasing need to quickly and efficiently learn network distances, in terms of metrics such as latency or bandwidth, between Internet hosts. For example, Internet content providers often place data and server mirrors throughout the Internet to improve access latency for clients, and it is necessary to direct clients to the nearest mirrors based on some distance metric in order to realize the benefit of mirrors. We suggest a scalable Internet-wide architecture, called IDMaps, which measures and disseminates distance information on the global Internet. Higher level services can collect such distance information to build a virtual distance map of the Internet and estimate the distance between any pair of IP addresses. We present our solutions to the measurement server placement and distance map construction problems in IDMaps. We show that IDMaps can indeed provide useful distance estimations to applications such as nearest mirror selection.
引用
收藏
页码:525 / 540
页数:16
相关论文
共 30 条
[1]   ON SPARSE SPANNERS OF WEIGHTED GRAPHS [J].
ALTHOFER, I ;
DAS, G ;
DOBKIN, D ;
JOSEPH, D ;
SOARES, J .
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (01) :81-100
[2]  
[Anonymous], P IEEE GLOB
[3]  
[Anonymous], P IEEE INFOCOM
[4]  
[Anonymous], P 20 ANN JOINT C IEE
[5]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[6]  
[Anonymous], 1999, P C APPL TECHN ARCH, DOI [doi.acm.org/10.1145/316188.316229, DOI 10.1145/316188.316229]
[7]   Topology aggregation for directed graphs [J].
Awerbuch, B ;
Shavitt, Y .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (01) :82-90
[8]   Probabilistic approximation of metric spaces and its algorithmic applications [J].
Bartal, Y .
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, :184-193
[9]  
Bhattacharjee S, 1997, IEEE INFOCOM SER, P1388, DOI 10.1109/INFCOM.1997.631176
[10]   NP-COMPLETENESS OF MINIMUM SPANNER PROBLEMS [J].
CAI, LH .
DISCRETE APPLIED MATHEMATICS, 1994, 48 (02) :187-194