Sciweavers

4642 search results - page 425 / 929
» Distributed algorithm and reversible network
Sort
View
CLUSTER
2000
IEEE
15 years 4 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
INFOCOM
2009
IEEE
15 years 11 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
CLUSTER
2009
IEEE
15 years 11 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 5 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
TON
2010
126views more  TON 2010»
14 years 11 months ago
Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski