Measurement based analysis, modeling, and synthesis of the internet delay space

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2006, Pages 85-98

  Zhang, Bo ^a   Ng, T S Eugene ^a   Nandi, Animesh ^a,b   Riedi, Rudolf ^a   Druschel, Peter ^b   Wang, Guohui ^a  

^a RICE UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

Analysis; Distributed system; Internet delay space; Measurement; Modeling; Simulation; Synthesis

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER SIMULATION; DELAY CONTROL SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; STATIC ANALYSIS;

DELAY DATA; DESIGN ALTERNATIVES; INTERNET DELAY SPACES;

INTERNET;

EID: 34547482838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1177080.1177091     Document Type: Conference Paper

References (49)

1. A. Acharya and J. Saltz. A Study of Internet Round-Trip Delay. Technical Report CS-TR-3736, University of Maryland, College Park, 1996.
2. Active measurement project, NLANR. http://watt.nlanr.net.
3. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D.S. Wallach. Security for structured peer-to-peer overlay networks. In Proceedings of OSDI, Boston, MA, December 2002.
4. Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research, May 2002.
5. Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Proximity neighbor selection in tree-based structured peer-to-peer overlays. Technical Report MSR-TR-2003-52, Microsoft Research, June 2003.
6. M. Costa, M. Castro, A. Rowstron, and P. Key. PIC: Practical Internet coordinates for distance estimation. Technical Report MSR-TR-2003-53, Microsoft Research, September 2003.
7. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In Proceeding of ACM SIGCOMM, August 2004.
8. M. Doar. A better model for generating test networks. In Proceeding of IEEE GLOBECOM, November 1996.
9. 2. http://www.cs.rice.edu/~eugeneng/research/ds2/.
10. C. Faloutsos, M. Faloutsos, and P. Faloutsos. On Power-law Relationships of the Internet Topology. In Proceedings of ACM Sigcomm, August 1999.
11. Michael J. Freedman, Karthik Lakshminarayanan, and David Mazieres. Oasis: Anycast for any service. In Proceedings of ACMNSDI, May 2006.
12. Freepastry. http://freepastry.rice.edu/.
13. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the SIGCOMM IMW, Marseille, France, November 2002.
14. Krishna P. Gummadi, Ramakrishna Gummadi, Steven D. Gribble, Sylvia Ratnasamy, Scott Shenker, and Ion Stoica. The impact of DHT routing geometry on resilience and proximity. In Proc. ACM SIGCOMM, Karlsruhe, Germany, August 2003.
15. K. Hildrum and J. Kubiatowicz. Assymtotically efficient approaches to fault tolerance in peer-to-peer networks. In Proc. 17th International Symposium on Distributed Computing, Sorrento, Italy, Oct 2003.
16. David R. Karger and Matthias Ruhl. Finding nearest neighbors in growth restricted metrics. In Proceedings of ACM Symposium on Theory of Computing, 2002.
17. Sanghwan Lee, Zhi-Li Zhang, Sambit Sami, and Debanjan S aha. On suitability of Euclidean embedding of Internet hosts. In Proc. SIGMETRICS 2006, June 2006.
18. L. Li, D. Alderson, W. Willinger, and. J. Doyle. A first-principles approach to understanding the internet's router-level topology. In Proceeding of ACM SIGCOMM, August 2004.
19. H. Lim, J. Hou, and C-H. Choi. Constructing internet coordinate system based on delay measurement. In Proceedings of IMC, Miami, FL, October 2003.
20. Jesper Møller and Rasmus Waagepetersen. Statistical Inference and Simulation for Spatial Point Processes. Chapman and Hall/CRC, 2004.
21. Eng Keong Lua, Timothy Griffin, Marcelo Pias, Han Zheng, and Jon Crowcroft. On the accuracy of embeddings for internet coordinate systems. In Proceedings of IMC, Berkeley, CA, October 2005.
22. Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas Anderson, Arvind Krishnamurthy, and Arun Venkataramani. iPlane: an information plane for distributed services. In Proc. OSDI2006, November 2006.
23. P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In Proc. IPTPS 2002, March 2002.
24. T. S. E. Ng and H. Zhang. Predicting Internet networking distance with coordinates-based approaches. In Proceedings of IEEE INFOCOM, June 2002.
25. p2psim. http://www.pdos.lcs.mit.edu/p2psim/.
26. M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed, location. In Proceedings of IPTPS, 2003.
27. PingER. http://www.slac.stanford.edu/comp/net/wan-mon/tutorial.html.
28. V. Ramasubramanian and E.G Sirer. Beehive: 0(1) lookup performance for pwer-law query distributions in peer-to-peer overlays. In Proc. NSDI '04, San Francisco, California, March 2004.
29. S. Ranjan, R. Karrer, and E. Knightly. Wide area redirection of dynamic content by internet data centers. In Proceedings of IEEE INFOCOM, Hong Kong, China, 2004.
30. S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for DHTs: Some open questions. In Proceedings of IPTPS, Cambridge, MA, March 2002.
31. Rolf-Dieter Reiss. A Course on Point Processes. Springer Series in Statistics. Springer, 1993.
32. Route views, http://www.routeviews.org/.
33. B. Bhattacharjee S. Banerjee and C Kommareddy. Scalable Application Layer Multicast. In Proceedings of ACM SIGCOMM, August 2002.
34. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The End-to-end Effects of Internet Path Selection. In Proceedings of ACM Sigcomm, August 1999.
35. Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in Euclidean space. In Proceedings of IEEE INFOCOM, San Francisco, CA, March 2003.
36. Y. Shavitt and T. Tankel. On the curvature of the Internet and its usage for overlay construction and distance estimation. In Proceedings of IEEE INFOCOM, April 2004.
37. A. Singh, T. W. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In Proc. INFOCOM 2006, Barcelona, Spain, April 2006.
38. Skitter. http://www.caida.Org/tools/measurement/skitter/.
39. A. Slivkins. Distributed Approaches to Triangulation and Embedding. In Proceedings 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
40. A. Slivkins, J. Kleinberg, and T. Wexler. Triangulation and Embedding using Small Sets of Beacons. In Proceedings of FOCS, 2004.
41. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.
42. Surveyor, http://www.advanced.org/csg-ippm/.
43. L. Tang and M. Crovella. Virtual landmarks for the internet. In Proceedings of IMC, Miami, FL, October 2003.
44. Marcel Waldvogel and Roberto Rinaldi. Efficient Topology-Aware Overlay Network. In First Workshop on Hot Topics in networks (HotNets-I), October 2002.
45. B. Waxman. Routing of multipoint connections. IEEE J. Select. Areas Commun., December 1988.
46. J. Winick and S. Jamin. Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, University of Michigan, 2002.
47. Bernard Wong, Aleksandrs Slivkins, and Emin Gun Sirer. Meridian: A lightweight network location service without virtual coordinates. In Proceedings of ACM SIGCOMM, August 2005.
48. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE INFOCOM, March 1996.
49. B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for wide-area fault-tolerant location and routing. U.C. Berkeley Technical Report UCB//CSD-01-1141, 2001.