25 search results - page 4 / 5 » Routing in Networks with Low Doubling Dimension |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
JOIN
2007
13 years 5 months ago
2007
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
HPCA
2009
IEEE
14 years 5 months ago
2009
IEEE
Network-on-Chips (NoCs) are quite latency sensitive, since their communication latency strongly affects the application performance on recent many-core architectures. To reduce th...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
ISCAPDCS
2004
13 years 6 months ago
2004
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...