{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:51:58Z","timestamp":1756000318042,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T00:00:00Z","timestamp":1152057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,7,5]]},"abstract":"<jats:p>\n            Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers in the large-scale Internet, accurately estimating network proximity\/latency with minimal probing overhead becomes essential for scalable deployment. Although there exist a number of network distance estimation schemes, they either rely on extensive infrastructure support, require the IP address of the potential targets, falsely cluster distant nodes, or perform poorly with even few measurement errors. We propose\n            <jats:italic>Netvigator<\/jats:italic>\n            , a scalable network proximity and latency estimation tool that uses information obtained from probing a small number of landmark nodes and intermediate routers (termed milestones) that are discovered en route to the landmarks, to identify the closest nodes. With very little additional probing overhead, Netvigator uses distance information to the milestones to accurately locate the closest nodes. We developed a Netvigator prototype and report our performance evaluation on PlanetLab and in the intranet of a large enterprise. Netvigator is a running service on PlanetLab as a part of HP Labs'\n            <jats:italic>S<\/jats:italic>\n            <jats:sup>3<\/jats:sup>\n            (Scalable Sensing Service).\n          <\/jats:p>","DOI":"10.1145\/1140086.1140092","type":"journal-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T17:00:26Z","timestamp":1153760426000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Estimating network proximity and latency"],"prefix":"10.1145","volume":"36","author":[{"given":"Puneet","family":"Sharma","sequence":"first","affiliation":[{"name":"Hewlett-Packard Labs, Palo Alto, CA"}]},{"given":"Zhichen","family":"Xu","sequence":"additional","affiliation":[{"name":"Yahoo! Inc., Sunnyvale, CA"}]},{"given":"Sujata","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Labs, Palo Alto, CA"}]},{"given":"Sung-Ju","family":"Lee","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Labs, Palo Alto, CA"}]}],"member":"320","published-online":{"date-parts":[[2006,7,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_8"},{"key":"e_1_2_1_2_1","unstructured":"Chariot http:\/\/www.netiq.com\/products\/chr\/default.asp.  Chariot http:\/\/www.netiq.com\/products\/chr\/default.asp."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/588160.588164"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/977400.977998"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498579"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.958323"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637203"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.79"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948222"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1247415.1247426"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_26"},{"key":"e_1_2_1_14_1","unstructured":"PlanetLab http:\/\/www.planet-lab.org.  PlanetLab http:\/\/www.planet-lab.org."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"e_1_2_1_16_1","unstructured":"s3 scalable sensing service http:\/\/networking.hpl.hp.com\/s-cube\/PL.  s3 scalable sensing service http:\/\/networking.hpl.hp.com\/s-cube\/PL."},{"key":"e_1_2_1_17_1","unstructured":"Scriptroute http:\/\/www.cs.washington.edu\/research\/networking\/scriptroute.  Scriptroute http:\/\/www.cs.washington.edu\/research\/networking\/scriptroute."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818796"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209214"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/832311.837383"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863976"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948223"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832197"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025126.1025932"},{"volume-title":"Proceedings of the ACM HotNets-I.","author":"Waldvogel M.","key":"e_1_2_1_25_1","unstructured":"M. Waldvogel and R. Rinaldi . Efficient topology-aware overlay network . In Proceedings of the ACM HotNets-I. M. Waldvogel and R. Rinaldi. Efficient topology-aware overlay network. In Proceedings of the ACM HotNets-I."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080103"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31966-5_19"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140086.1140092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140086.1140092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:32Z","timestamp":1750259192000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140086.1140092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7,5]]}},"alternative-id":["10.1145\/1140086.1140092"],"URL":"https:\/\/doi.org\/10.1145\/1140086.1140092","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2006,7,5]]},"assertion":[{"value":"2006-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}