skip to main content
10.1145/1375457.1375507acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
poster

Network distance estimation with dynamic landmark triangles

Published:02 June 2008Publication History

ABSTRACT

This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-dimensional space to estimate the distance between arbitrary hosts with simple trigonometrical calculations. To improve the accuracy of estimation, we dynamically choose the "best" triangle for a given pair of hosts using a heuristic algorithm. Our experiments show that this approach achieves both lower computational and network probing cost over the classic landmarks-based approach while producing more accurate estimates.

References

  1. DipZoom. http://dipzoom.case.edu.Google ScholarGoogle Scholar
  2. Gnutella Topology Snapshots. http://mirage.cs.uoregon.edu/P2P/info.cgi.Google ScholarGoogle Scholar
  3. T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates--based approaches. In INFOCOM, 2002.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Network distance estimation with dynamic landmark triangles

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGMETRICS '08: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
        June 2008
        486 pages
        ISBN:9781605580050
        DOI:10.1145/1375457
        • cover image ACM SIGMETRICS Performance Evaluation Review
          ACM SIGMETRICS Performance Evaluation Review  Volume 36, Issue 1
          SIGMETRICS '08
          June 2008
          469 pages
          ISSN:0163-5999
          DOI:10.1145/1384529
          Issue’s Table of Contents

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 2 June 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        Overall Acceptance Rate459of2,691submissions,17%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader