Sciweavers

83 search results - page 11 / 17
» Fault-Tolerant Routing Algorithms for Hypercube Networks
Sort
View
ICC
2009
IEEE
127views Communications» more  ICC 2009»
13 years 5 months ago
Starburst SSD: An Efficient Protocol for Selective Dissemination
Abstract--We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hie...
Tahir Azim, Qasim Mansoor, Philip Levis
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 9 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
CCS
2010
ACM
13 years 8 months ago
Demonstrating cognitive packet network resilience to worm attacks
The need for network stability and reliability has led to the growth of autonomic networks [2] that can provide more stable and more reliable communications via on-line measuremen...
Georgia Sakellari, Erol Gelenbe
PDCAT
2005
Springer
14 years 1 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
APPT
2007
Springer
14 years 1 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami