Advertisement

Geometric Exploration of the Landmark Selection Problem

  • Liying Tang
  • Mark Crovella
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3015)

Abstract

Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applications such as content delivery networks, peer to peer systems, and overlay networks. However all such systems rely on landmarks, and the choice of landmarks has a dramatic impact on their accuracy. Landmark selection is challenging because of the size of the Internet (leading to an immense space of candidate sets) and because insight into the properties of good landmark sets is lacking. In this paper we explore fast algorithms for landmark selection. Whereas the traditional approach to analyzing similar network-based configurkation problems employs the graph structure of the Internet, we leverage work in coordinate systems to treat the problem geometrically, providing an opening for applying new algorithms. Our results suggest that when employing small numbers of landmarks (5-10), such geometric algorithms provide good landmarks, while for larger numbers of landmarks (20-30) even faster methods based on random selection are equally effective.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The NLANR active measurement project, http://amp.nlanr.net/active/
  2. 2.
    Athitsos, V., Sclaroff, S.: Estimating 3D hand pose from a cluttered image. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (June 2003)Google Scholar
  3. 3.
    Cronin, E., Jamin, S., Jin, C., Kurc, A.R., Raz, D., Shavitt, Y.: Constrained mirror placement on the Internet. IEEE Journal on sellected Areas in Communications 20(7), 1369–1382 (2002)CrossRefGoogle Scholar
  4. 4.
    Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: an Introduction to Cluster Analysis. JohnWiley and Sons, Inc, England (1990)Google Scholar
  5. 5.
    Lakhina, A., Byers, J.W., Crovella, M., Matta, I.: On the geographic location of Internet resources. IEEE Journal on Selected Areas in Communications, Special Issue on Internet and WWW Measurement, Mapping, and Modeling (2003)Google Scholar
  6. 6.
    Lim, H., Hou, J.C., Choi, C.-H.: Constructing Internet coordinate system based on delay measurement. In: Proceedings of the ACM/SIGCOMM Internet Measurement Conference, IMC 2003 (2003)Google Scholar
  7. 7.
    Ng, E., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: Proceedings of Infocom (2002)Google Scholar
  8. 8.
    Krishnan, Y.S.P., Raz, D.: The cache location problem. IEEE/ACM Transactions on Networking 8(5), 568–582 (2000)CrossRefGoogle Scholar
  9. 9.
    Padmanabhan, V.N., Subramanian, L.: An investigation of geographic mapping techniques for Internet hosts. In: Proceedings of ACM/SIGCOMM 2001 (August 2001)Google Scholar
  10. 10.
    Pias, M., Crowcroft, J., Wilbur, S., Bhatti, S., Harris, T.: Lighthouses for scalable distributed location. In: Second InternationalWorkshop on Peer-to-Peer Systems (IPTPS 2003) (February 2003)Google Scholar
  11. 11.
  12. 12.
    Sockeye Networks, http://www.sockeye.com/
  13. 13.
    Tang, L., Crovella, M.: Virtual landmarks for the Internet. In: Proceedings of the ACM/SIGCOMM Internet Measurement Conference 2003 (October 2003)Google Scholar
  14. 14.
    Tankel, T., Shavitt, Y.: Big-bang simulation for embedding network distances in Euclidean space. In: Proceedings of IEEE INFOCOM 2003 (April 2003)Google Scholar
  15. 15.
    Vleugels, J., Veltkamp, R.C.: Efficient image retrieval through vantage objects. In: Huijsmans, D.P., Smeulders, A.W.M. (eds.) VISUAL 1999. LNCS, vol. 1614, pp. 575–584. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  16. 16.
    Ziviani, A., Fdida, S., de Rezende, J.F., Duarte, O.C.M.B.: Demographic placement for Internet host location. In: Proceedings of the IEEE Global Communications Conference (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Liying Tang
    • 1
  • Mark Crovella
    • 1
  1. 1.Department of Computer ScienceBoston UniversityBostonUSA

Personalised recommendations