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. The authors 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.
Did you find this white paper useful?
26 out of 50 users found this white paper useful
Related white papers
Exploring Real Time Multimedia Content Creation in Video Games
Video games represent a class of media applications for which creating video content is as important as displaying it. This paper compares video games running on an Apple Macintosh G5...
neosnetworks: Delivering "Liquid Bandwidth" Ethernet Services
Neos created the Ethernet Service Provider (ESP) market in the UK in October 2001 and today has 100% market share. Neos is the UK's fastest-growing service provider, having achieved a...
Maximizing Bandwidth in CCII for Wireless Optical Applications
This paper discusses bandwidth problems associated with the usage of second-generation current conveyors in wireless optical systems, and presents a new current amplifier with wide bandwidth and large input dynamic...
Performance and Implementation of Dynamic Frequency Hopping in Limited-Bandwidth Cellular Systems
This paper evaluates the performance of recently proposed Dynamic Frequency Hopping (DFH) when applied to cellular systems with a limited total bandwidth. The paper also illustrates a practical implementation for...
The Effect of Bandwidth on Speech Intelligibility
Of all the elements that affect the intelligibility of speech in telephony, bandwidth has been shown to be one of the most critical. This paper discusses the relation between bandwidth...
On Orthogonal Reduction to Hessenberg Form With Small Bandwidth
Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction...
A Two-Stage Plug-in Bandwidth Selection and Its Implementation for Covariance Estimation
The two most popular bandwidth choice rules for kernel HAC estimation have been proposed by Andrews (1991) and Newey and West (1994). This paper suggests an alternative approach that estimates...
