Proceedings Article10.1145/1161252.1161262
Zero servers with zero broadcasts
Miguel Castro,Greg O'Shea,Antony Rowstron +2 more
- 25 Sep 2006
- pp 36-41
TL;DR: It is shown that it is important to remove broadcasts at all levels of the networking stack and how to use the Virtual Ring Routing protocol to achieve the vision of networks that work without any supporting infrastructure is described.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Monitorage et journalisation dynamiques des topologies dans les réseaux ad-hoc
Cristian Popi,Olivier Festor +1 more
- 25 Mar 2008
TL;DR: Nous etudions l'utilisation d'un service pair-a-pair base sur des DHT (tables de hachage distribuees) pour le monitorage and the journalisationdistribuee de l'historique de topologies sur un reseau ad-hoc.
2
A Serverless Instant Messaging Protocol for Mobile Ad Hoc Networks
Anthony D. Urso
- 25 Jan 2010
TL;DR: The challenges of identity management and presence dissemination are addressed, with an efficient and user-friendly protocol described that solves them.
2
Multi-level virtual ring: An architecture for content routing in wireless sensor network
Ming Li,Longxiang Gao +1 more
- 01 Jan 2011
TL;DR: An embedded multi-level ring (MVR) structure to address the deployment of content delivery in a wireless sensor network that uses names rather than addresses to identify sensor nodes and takes the cross-level routing to improve the routing efficiency.
1
References
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica,Robert Morris,David R. Karger,M. Frans Kaashoek,Hari Balakrishnan +4 more
- 27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
11.2K
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Charles E. Perkins,Pravin Bhagwat +1 more
- 01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Related Papers (5)
N. Uushona,W.T. Penzhorn +1 more
- 20 Jun 2005
S. Sumathy,Beegala Yuvaraj,E Sri Harsha +2 more
- 01 Jan 2012