6 search results - page 1 / 2 » Oblivious routing schemes in extended generalized Fat Tree n... |
75
Voted
CLUSTER
2009
IEEE
15 years 4 months ago
2009
IEEE
—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...
104
Voted
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
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...
124
Voted
MOBIHOC
2012
ACM
12 years 12 months ago
2012
ACM
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...
VTC
2008
IEEE
15 years 3 months ago
2008
IEEE
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...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—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...