David G. Andersen
Hari Balakrishnan
M. Frans Kaashoek
Skip Abstract Section
Abstract
The MIT RON testbed consists of 36 Internet-connected nodes at 31 different sities. It has been in operation for two years. This paper presents an overview of the testbed, summarizes some of the research for which it has proved useful, and presents the lessons we learned during its development. The testbed has been useful both for our own research and for that of external researchers becuase of its heterogeneous, diverse network connections; its homogenous hardware and software platform; its incremental, bottom-up development; and its easy configuration and management tools.
- Resilient overlay networks webpage. http://nms.Ics.mit.edu/ron/, 2002.Google Scholar
- Abone.http://www/isi/edu/abone/.Google Scholar
- ANDERSEN, D., BALAKRISHNAN, H., KAASHOEK, M., AND MORRIS, R. Resilient Overlay Networks, In Proc. 18th ACM SOSP (Banff, Canada, Oct. 2001), pp. 131--145. Google ScholarDigital Library
- ANDERSEN, D. G., SNOEREN, A. C., AND BALAKRISHMAN, H. Best-path vs. multi-path overlay routing. In Proc. Internet Measurement Conference (Miami, Fl, Oct. 2003). Google ScholarDigital Library
- CAIRN Home Page. http://www.isi.edu/div7/cairn/, 1996.Google Scholar
- CHESWICK, B., BURCH, H., AND BRANIGAN, S. Mapping and visualizing the Internet. In Proc. USENIX Technical Conference (2000). Google ScholarDigital Library
- DABEKM F., KAASHOEK, M. F., KARGER, D., MORRIS, R., AND STOICA, I. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01) (Banff, Canada, Oct. 2001). Google ScholarDigital Library
- Dummynet. http://www.iet.unipi.it/~luigi/ip_dummynet, September 1998.Google Scholar
- FEAMSTER, N., ANDERSEN, D., BALAKRISHNAN, H., AND KAASHOEK, M. F. Measuring the effects of Internet path faults on reactive ro uting. In Proc. Sigmetrics (San Deigo, Ca, June 2003). Google ScholarDigital Library
- FEAMSTER, M. J., AND MAZIÈRES, D. Sloppy hashing and self-organizing clusters. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS) (Berkeley, CA, Feb. 2003).Google Scholar
- Internet2. http://www.internet2.edu/.Google Scholar
- JACOBSEN, K., ZHANG, X., AND MARZULLO, K. Group membership and wide-area master-worker computations. In Proc. 23rd ICDCS (Providence, RI, 2003). Google ScholarDigital Library
- JAIN, M., AND DOVROLIS, C. End-to-End Avilable Bandwith: Measurement Methodology, Dynamics, and Relation with TCP Throughput. In Proc. ACM SIGCOMM (Aug.2002). Google ScholarDigital Library
- KATABI, D., AND BLAKE, C. Inferring congestion sharing and path characteristics from packet interarrival times. Tech. Rep. MIT-LCS-TR-828, MIT, 2002.Google Scholar
- MAO, Z. M. BGP beacons. http://www.psg.com/~zmao/BGPBeacon.html, 2002.Google Scholar
- MAZIÈRES, D., KAMINSKY, M., KAASHOEK, M. F., AND WITCHEL, E. Separating key management from file system security. In Proc. SOSP (Dec. 1999), pp. 124--139. Google ScholarDigital Library
- MUTHITACHAROEN, A., MORRIS, R., GIL, T., AND CHEN, B. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI '02) (Boston, MA, Dec. 2002). Google ScholarDigital Library
- PAXSON, V. End-to-End Internet Packet Dynamics. In Proc. ACM SIGCOMM (Cannes, France, Sept. 1997), pp. 139--152. Google ScholarDigital Library
- PAXSON, V., ADAMS, A., AND MATHIS, M. Experience with NIMI. In Proceedings of the Passive & Active measurement Workshop (Apr.2000).Google Scholar
- PETERSON, L., ANDERSON, T., CULLER, D., AND ROSCOE, T. A. blueprint for introducing disruptive technology into the Internet. In Proc. HotNets-I (Princeton, NJ, Oct 2002).Google Scholar
- ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proc. 18th IFIP/ACM International Conference on Distributed Systems Platforms (Nov. 2001). Google ScholarDigital Library
- STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM (San Diego, California, Aug. 2001). Google ScholarDigital Library
- STRAUSS, J., KATABI, D., AND KAASHOEK, F. A. measurement study of available bandwith estimation tools. In Proc. Internet Measurement Conference (IMC) (Oct. 2003). Google ScholarDigital Library
- TANG, L., AND CROVELLA, M. Virtual landmarks for the Internet. In Proc. Internet Measurement Conference (IMC) (Oct. 2003). Google ScholarDigital Library
- THE VINT PROJECT. The ns Manual, Apr. 2002. http://www/isi/edu/nsnam/ns/ns-documentation.html.Google Scholar
- TOUCH, J. Dli95 dartnet overview. http://www/isi/edu/~touch/dli95/dartnet-dli.html, 1995.Google Scholar
- WHITE, B., LEPREAU, J., STOLLER, L., RICCI, R., GURUPRASAD, S., NEWBOLD, M., HIBLER, M., BARB, C., AND JOGLEKAR, A. An integrated experiment for distributed systems and networks. In Proc. OSDI (Boston, MA, Dec. 2002), pp. 255--270. Google ScholarDigital Library
Index Terms
- Experience with an evolving overlay network testbed
Index terms have been assigned to the content through auto-classification.
Recommendations
Scalable multicasting with network-aware geometric overlay
It is crucial to design an efficient network-aware overlay network to enable multicast service to adjust under the dynamic underlying network conditions and node churn in a scalable manner without extensive network measurements. We propose an accurate ...
Efficient topology-aware overlay network
Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and "wonder drug" to achieve resilience. Current widely-used P2P networks rely on central directory servers ...
Comments