By Topic

Computing the unmeasured: an algebraic approach to Internet mapping

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shavitt, Y. ; Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Israel ; Xiaodong Sun ; Wool, A. ; Yener, B.

Distance estimation is important to many Internet applications. It can aid a World Wide Web client when selecting among several potential candidate servers or among candidate peer-to-peer servers. It can also aid in building efficient overlay or peer-to-peer networks that react dynamically to changes in the underlying Internet. One of the approaches to distance (i.e., time delay) estimation in the Internet is based on placing tracer stations in key locations and conducting measurements between them. The tracers construct an approximated map of the Internet after processing the information obtained from these measurements. This work presents a novel algorithm, based on algebraic tools, that computes additional distances, which are not explicitly measured. As such, the algorithm extracts more information from the same amount of measurement data. Our algorithm has several practical impacts. First, it can reduce the number of tracers and measurements without sacrificing information. Second, our algorithm is able to compute distance estimates between locations where tracers cannot be placed. To evaluate the algorithm's performance, we tested it both on randomly generated topologies and on real Internet measurements. Our results show that the algorithm computes up to 50%-200% additional distances beyond the basic tracer-to-tracer measurements.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:22 ,  Issue: 1 )