11 search results - page 1 / 3 » On Randomized and Deterministic Schemes for Routing and Sort... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
EUROPAR
1997
Springer
13 years 9 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
ISCC
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
ISPAN
2005
IEEE
13 years 10 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...