Sciweavers

306 search results - page 23 / 62
» Routing Algorithms for Anycast Messages
Sort
View
NETWORKING
2010
15 years 1 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
86
Voted
GLOBECOM
2008
IEEE
15 years 6 months ago
WPR: A Proactive Routing Protocol Tailored to Wireless Mesh Networks
— This work proposes the Wireless-mesh-network Proactive Routing (WPR) protocol for wireless mesh networks. Unlike current routing protocols, such as the Optimized LinkState Rout...
Miguel Elias M. Campista, Luís Henrique Mac...
MOBICOM
2006
ACM
15 years 5 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 12 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
IPPS
2000
IEEE
15 years 4 months ago
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...
Seungjin Park, Jong-Hoon Youn, Bella Bose