Sciweavers

6 search results - page 1 / 2
» Oblivious routing schemes in extended generalized Fat Tree n...
Sort
View
CLUSTER
2009
IEEE
14 years 1 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,...
ICS
2009
Tsinghua U.
13 years 11 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
MOBIHOC
2012
ACM
11 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
VTC
2008
IEEE
141views Communications» more  VTC 2008»
14 years 1 months ago
Address Assignment and Routing Schemes for ZigBee-Based Long-Thin Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been extensively researched recently. This paper makes two contributions to this field. First, we promote a new concept of long-thi...
Meng-Shiuan Pan, Hua-Wei Fang, Yung-Chih Liu, Yu-C...
INFOCOM
2009
IEEE
14 years 1 months ago
Greedy Routing with Bounded Stretch
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...