Sciweavers

306 search results - page 15 / 62
» Routing Algorithms for Anycast Messages
Sort
View
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
15 years 4 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
DSOM
2003
Springer
15 years 5 months ago
An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...
Spyros Voulgaris, Maarten van Steen
IPPS
2006
IEEE
15 years 5 months ago
Analytical performance modelling of partially adaptive routing in wormhole hypercubes
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work dealing wi...
Ahmad Patooghy, Hamid Sarbazi-Azad
INFOCOM
2009
IEEE
15 years 6 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
PODC
2009
ACM
16 years 7 days ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher