Sciweavers

181 search results - page 17 / 37
» Scalable routing in delay tolerant networks
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Encounter-Based Routing in DTNs
—Current work in routing protocols for delay and disruption tolerant networks leverage epidemic-style algorithms that trade off injecting many copies of messages into the network...
Samuel C. Nelson, Mehedi Bakht, Robin Kravets
GLOBECOM
2009
IEEE
14 years 2 months ago
Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks
—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
Peiqiang Li, Guojun Wang, Jie Wu, Hong-Chuan Yang
NSDI
2008
13 years 9 months ago
Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures
The paper presents and evaluates Nysiad,1 a system that implements a new technique for transforming a scalable distributed system or network protocol tolerant only of crash failur...
Chi Ho, Robbert van Renesse, Mark Bickford, Danny ...
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 5 months ago
Optimal control in two-hop relay routing
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes ca...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
ICN
2005
Springer
14 years 1 months ago
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...
Ngoc Chi Nguyen, Vo Dinh Minh Nhat, Sungyoung Lee