Sciweavers

75 search results - page 5 / 15
» Stable routing under the Spanning Tree Protocol
Sort
View
CN
2006
113views more  CN 2006»
13 years 7 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
MONET
2002
162views more  MONET 2002»
13 years 7 months ago
AMRoute: Ad Hoc Multicast Routing Protocol
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical c...
Jason Xie, Rajesh R. Talpade, Anthony McAuley, Min...
FOCS
2002
IEEE
14 years 15 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ICUMT
2009
13 years 5 months ago
Towards real implementations of dynamic robust routing exploiting path diversity
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
Luca Muscariello, Diego Perino, Bruno Nardelli
IPSN
2010
Springer
14 years 2 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...