Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1161252.1161262acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
Article

Zero servers with zero broadcasts

Published: 25 September 2006 Publication History

Abstract

To achieve the vision of networks that work without any supporting infrastructure, we need wireless ad hoc technology to replace the cabling infrastructure, but we also need self-configuring network and application services to replace the server infrastructure. Current solutions perform poorly because they either pick a single host to act as the server or they use network wide broadcasts to implement services. We need wireless ad hoc networks with zero servers and zero broadcasts!Can we use DHTs to build both network- and application-level services with zero servers and zero broadcasts? This paper starts to answer this question. It shows that it is important to remove broadcasts at all levels of the networking stack and describes how to use the Virtual Ring Routing protocol to achieve our vision.

References

[1]
M. Caesar, M. Castro, E. Nightingale, G. O'Shea, and A. Rowstron. Virutal Ring Routing: Network routing inspired by DHTs. In Sigcomm '06, 2006.]]
[2]
S. Cheshire, B. Aboba, and E. Guttman. Dynamic Configuration of IPv4 Link-Local Addresses (RFC 3927), May 2005. http://ietf.org/rfc/rfc3927.txt.]]
[3]
S. Cheshire and M. Krochmal. DNS-Based Service Discovery (Internet Draft), June 2005.]]
[4]
S. Cheshire and M. Krochmal. Multicast DNS (Internet Draft), June 2005.]]
[5]
T. Clausen and P. Jacquet. OLSR RFC3626, Oct. 2003. http://ietf.org/rfc/rfc3926.txt.]]
[6]
F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP'01, Banff, Canada, Oct. 2001.]]
[7]
F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica. Towards a common API for structured P2P overlays. In IPTPS, Feb 2003.]]
[8]
R. Draves, J. Padhye, and B. Zill. Comparison of routing metrics for static multi-hop wireless networks. In SIGCOMM'04, Aug. 2004.]]
[9]
R. Droms. Dynamic Host Configuration (RFC 2131), Mar. 1997. http://ietf.org/rfc/rfc2131.txt.]]
[10]
J. Eriksson, S. Agarwal, P. Bahl, and J. Padhye. Feasibility study of mesh networks for all-wireless offices. In Mobisys, June 2006.]]
[11]
R. Fonseca, S. Ratnasamy, J. Zhao, C. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point in wireless sensornets. In NSDI'05, May 2005.]]
[12]
Y. Goland, T. Cai, P. Leach, Y. Gu, and S. Albright. Simple Service Discovery Protocol (Internet Draft), Oct. 1999.]]
[13]
S. Iyer, A. Rowstron, and P. Druschel. Squirrel: A decentralized peer-to-peer web cache. In PODC, July 2002.]]
[14]
D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Ad Hoc Networking, 2001. Chapter 5, pg 139--172, Addison-Wesley.]]
[15]
A. Mislove, A. Post, C. Reis, P. Willmann, P. Druschel, D. Wallach, X. Bonnaire, P. Sens, J.-M. Busca, and L. Arantes-Bezerra. POST: A secure, resilient, cooperative messaging system. In HotOs, May 2003.]]
[16]
P. Mockapetris. Domain Names - Implementation and Specification (RFC 1035), Nov. 1987. http://ietf.org/rfc/rfc1035.txt.]]
[17]
S. Ni, Y. Tseng, Y. Chen, and J. Sheu. The broadcast storm problem in a mobile ad hoc network. In MOBICOM, Aug. 1999.]]
[18]
C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In SIGCOMM'94, Aug. 1994.]]
[19]
C. Perkins and E. Royer. Ad hoc on-demand distance vector routing. In Mobile Computing Systems and Applications, Feb. 1999.]]
[20]
D. Plummer. Converting Network Protocol Addresses to 48.bit Ethernet Address for Transmission on Ethernet Hardware (RFC 826), Nov. 1982.]]
[21]
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM'01, Aug. 2001.]]
[22]
S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: A geographic hash table for data-centric storage. In WSNA'02, Sept. 2002.]]
[23]
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, Nov. 2001.]]
[24]
A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP'01, Banff, Canada, Oct. 2001.]]
[25]
I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM'01, Aug. 2001.]]
[26]
A. Yip, B. Chen, and R. Morris. Pastwatch: A distributed version control system. In NSDI, May 2006.]]
[27]
B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: an infrastructure for fault-resilient wide-area location and routing. In Technical report UCB//CSD-01-1141, U. C. Berkeley, Apr. 2001.]]

Cited By

View all
  • (2011)Multi-level virtual ring: An architecture for content routing in wireless sensor networkThe 17th Asia Pacific Conference on Communications10.1109/APCC.2011.6152870(553-558)Online publication date: Oct-2011
  • (2010)A Serverless Instant Messaging Protocol for Mobile Ad Hoc NetworksProceedings of the 2010 Eighth International Conference on Creating, Connecting and Collaborating through Computing10.1109/C5.2010.9(71-75)Online publication date: 25-Jan-2010

Index Terms

  1. Zero servers with zero broadcasts

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      MobiShare '06: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
      September 2006
      77 pages
      ISBN:1595935584
      DOI:10.1145/1161252
      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: 25 September 2006

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. distributed hash tables
      2. wireless ad hoc networks

      Qualifiers

      • Article

      Conference

      DIWANS06

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 24 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2011)Multi-level virtual ring: An architecture for content routing in wireless sensor networkThe 17th Asia Pacific Conference on Communications10.1109/APCC.2011.6152870(553-558)Online publication date: Oct-2011
      • (2010)A Serverless Instant Messaging Protocol for Mobile Ad Hoc NetworksProceedings of the 2010 Eighth International Conference on Creating, Connecting and Collaborating through Computing10.1109/C5.2010.9(71-75)Online publication date: 25-Jan-2010

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media