{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:58Z","timestamp":1772164018792,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T00:00:00Z","timestamp":1245024000000},"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":[],"published-print":{"date-parts":[[2009,6,15]]},"DOI":"10.1145\/1555349.1555357","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T09:34:36Z","timestamp":1245144876000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["On the treeness of internet latency and bandwidth"],"prefix":"10.1145","author":[{"given":"Venugopalan","family":"Ramasubramanian","sequence":"first","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"Microsoft Research Silicon Valley, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Archit","family":"Gupta","sequence":"additional","affiliation":[{"name":"Data Domain Inc., Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Akella","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281110"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Abraham I.","year":"2007","unstructured":"I. Abraham , Y. Bartal , and O. Neiman . Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion . In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA) , New Orleans, LA , Jan. 2007 . I. Abraham, Y. Bartal, and O. Neiman. Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, Jan. 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1189023"},{"key":"e_1_3_2_1_4_1","first-page":"509","volume":"8","author":"Barabasi A.","year":"1999","unstructured":"A. Barabasi and R. Albert . Emergence of Scaling in Random Networks. Science , 8 : 509 -- 512 , Oct. 1999 . A. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science, 8:509--512, Oct. 1999.","journal-title":"Emergence of Scaling in Random Networks. Science"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90047-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339337"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/977400.977998"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298313"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.958323"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Freedman M.","year":"2006","unstructured":"M. Freedman , K. Laskhminarayanan , and D. Mazi\u00e8res . OASIS: Anycast for Any Service . In Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI) , San Jose, CA , May 2006 . M. Freedman, K. Laskhminarayanan, and D. Mazi\u00e8res. OASIS: Anycast for Any Service. In Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI), San Jose, CA, May 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637203"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Gupta A.","year":"2001","unstructured":"A. Gupta . Steiner Points in Tree Metrics don't (Really) Help . In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA) , Washington, DC , Jan. 2001 . A. Gupta. Steiner Points in Tree Metrics don't (Really) Help. In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, DC, Jan. 2001."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of INFOCOM Conference","author":"Hu N.","year":"2005","unstructured":"N. Hu , L.E. Li , Z.M. Mao , P. Steenkiste , and J. Wang . A Measurement Study of Internet Bottlenecks . In Proc. of INFOCOM Conference , Miami, FL , Mar. 2005 . N. Hu, L.E. Li, Z.M. Mao, P. Steenkiste, and J. Wang. A Measurement Study of Internet Bottlenecks. In Proc. of INFOCOM Conference, Miami, FL, Mar. 2005."},{"key":"e_1_3_2_1_17_1","volume-title":"Tomozei. Non-Metric Coordinates for Predicting Network Proximity. In Proc. of the IEEE INFOCOM Conference","author":"Key P.","year":"2008","unstructured":"P. Key , L. Massoulie , and D.- C. Tomozei. Non-Metric Coordinates for Predicting Network Proximity. In Proc. of the IEEE INFOCOM Conference , Phoenix, AZ , Apr. 2008 . P. Key, L. Massoulie, and D.-C. Tomozei. Non-Metric Coordinates for Predicting Network Proximity. In Proc. of the IEEE INFOCOM Conference, Phoenix, AZ, Apr. 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/876907.881582"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of IEEE INFOCOM Conference","author":"Lebhar E.","year":"2008","unstructured":"E. Lebhar , P. Fraigniaud , and L. Viennot . The Inframetric Model for the Internet . In Proc. of IEEE INFOCOM Conference , Apr. 2008 . E. Lebhar, P. Fraigniaud, and L. Viennot. The Inframetric Model for the Internet. In Proc. of IEEE INFOCOM Conference, Apr. 2008."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140296"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025126.1025932"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948222"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251097"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of the Usenix Conference on Networked Systems Design and Implementation (NSDI)","author":"Madhyastha H.V.","year":"2009","unstructured":"H.V. Madhyastha , E.K. Bassett , T. Anderson , A. Krishnamurthy , and A. Venkataramani . iPlane Nano: Path Prediction for Peer-to-Peer Applications . In Proc. of the Usenix Conference on Networked Systems Design and Implementation (NSDI) , Apr. 2009 . H.V. Madhyastha, E.K. Bassett, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane Nano: Path Prediction for Peer-to-Peer Applications. In Proc. of the Usenix Conference on Networked Systems Design and Implementation (NSDI), Apr. 2009."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of the Usenix Conference on Operating Systems Design and Implementation (OSDI)","author":"Madhyastha H.V.","year":"2006","unstructured":"H.V. Madhyastha , T. Isdal , M. Piatek , C. Dixon , T. Anderson , A. Krishnamurthy , and A. Venkataramani . iPlane: An Information Plane for Distributed Services . In Proc. of the Usenix Conference on Operating Systems Design and Implementation (OSDI) , Nov. 2006 . H.V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane: An Information Plane for Distributed Services. In Proc. of the Usenix Conference on Operating Systems Design and Implementation (OSDI), Nov. 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028827"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649563"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_26"},{"key":"e_1_3_2_1_30_1","first-page":"19","article-title":"Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete &","author":"Prasad R.","year":"1998","unstructured":"R. Prasad , M. Murray , C. Dovloris , and kc Claffy . Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete & Computational Geometry , 19 , 1998 . R. Prasad, M. Murray, C. Dovloris, and kc Claffy. Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete & Computational Geometry, 19, 1998.","journal-title":"Computational Geometry"},{"key":"e_1_3_2_1_31_1","first-page":"19","article-title":"Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete &","author":"Rabinovich Y.","year":"1998","unstructured":"Y. Rabinovich and R. Raz . Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete & Computational Geometry , 19 , 1998 . Y. Rabinovich and R. Raz. Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discrete & Computational Geometry, 19, 1998.","journal-title":"Computational Geometry"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/762483.762485"},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. of Passive and Active Measurement Workshop","author":"Ribeiro V.","year":"2003","unstructured":"V. Ribeiro , R. Riedi , R. Baraniuk , J. Navratil , and L. Cottrell . pathChirp: Efficient Avalable Bandwidth Estimation for Network Paths . In Proc. of Passive and Active Measurement Workshop , San Diego, CA , Apr. 2003 . V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell. pathChirp: Efficient Avalable Bandwidth Estimation for Network Paths. In Proc. of Passive and Active Measurement Workshop, San Diego, CA, Apr. 2003."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838597"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.899021"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. of the Infocom Conference","author":"Subramanian L.","year":"2002","unstructured":"L. Subramanian , S. Agarwal , J. Rexford , and R. Katz . Characterzing the Internet Hierarchy from Multiple Vantage Points . In Proc. of the Infocom Conference , New York, NY , June 2002 . L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterzing the Internet Hierarchy from Multiple Vantage Points. In Proc. of the Infocom Conference, New York, NY, June 2002."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948223"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965863"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080103"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015509"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505228"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31966-5_19"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/378344.378347"},{"key":"e_1_3_2_1_46_1","unstructured":"Akamai SureRoute. http:\/\/www.akamai.com\/dl\/feature_sheets\/fs_edgesuite_sureroute.pdf.  Akamai SureRoute. http:\/\/www.akamai.com\/dl\/feature_sheets\/fs_edgesuite_sureroute.pdf."},{"key":"e_1_3_2_1_47_1","unstructured":"Meridian: A Lighweight Approach to Network Positioning. http:\/\/www.cs.cornell.edu\/People\/egs\/meridian.  Meridian: A Lighweight Approach to Network Positioning. http:\/\/www.cs.cornell.edu\/People\/egs\/meridian."},{"key":"e_1_3_2_1_48_1","unstructured":"PlanetLab: An Open Platform for Developing Deploying and Accessing Planetary-Scale Services. http:\/\/www.planet-lab.org.  PlanetLab: An Open Platform for Developing Deploying and Accessing Planetary-Scale Services. http:\/\/www.planet-lab.org."},{"key":"e_1_3_2_1_49_1","volume-title":"http:\/\/www.eecs.harvard.edu\/syrah\/nc\/","year":"2006","unstructured":"Network Coordinate Research at Harvard. http:\/\/www.eecs.harvard.edu\/syrah\/nc\/ , 2006 . Network Coordinate Research at Harvard. http:\/\/www.eecs.harvard.edu\/syrah\/nc\/, 2006."},{"key":"e_1_3_2_1_50_1","volume-title":"http:\/\/dss.clip2.com\/GnutellaProtocol0.4.pdf","year":"2000","unstructured":"The Gnutella 0.4 Protocol Specification. http:\/\/dss.clip2.com\/GnutellaProtocol0.4.pdf , 2000 . The Gnutella 0.4 Protocol Specification. http:\/\/dss.clip2.com\/GnutellaProtocol0.4.pdf, 2000."},{"key":"e_1_3_2_1_51_1","unstructured":"S3: Scalable Sensing Service. http:\/\/networking.hpl.hp.com\/s-cube.  S 3 : Scalable Sensing Service. http:\/\/networking.hpl.hp.com\/s-cube."},{"key":"e_1_3_2_1_52_1","unstructured":"University of Oregon Route Views Project. http:\/\/www.routeviews.org.  University of Oregon Route Views Project. http:\/\/www.routeviews.org."},{"key":"e_1_3_2_1_53_1","volume-title":"http:\/\/ping.ececs.uc.edu\/ping\/","year":"2006","unstructured":"All-Sites-Pings for PlanetLab. http:\/\/ping.ececs.uc.edu\/ping\/ , 2006 . All-Sites-Pings for PlanetLab. http:\/\/ping.ececs.uc.edu\/ping\/, 2006."}],"event":{"name":"SIGMETRICS09: ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Seattle WA USA","acronym":"SIGMETRICS09","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555349.1555357","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1555349.1555357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:23:03Z","timestamp":1750234983000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1555349.1555357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,15]]},"references-count":53,"alternative-id":["10.1145\/1555349.1555357","10.1145\/1555349"],"URL":"https:\/\/doi.org\/10.1145\/1555349.1555357","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2492101.1555357","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,6,15]]},"assertion":[{"value":"2009-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}