83 search results - page 10 / 17 » Fault-Tolerant Routing Algorithms for Hypercube Networks |
ICPP
1992
IEEE
13 years 11 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
ICN
2009
Springer
14 years 9 days ago
2009
Springer
Securing group communications in resource constrained, infrastructure-less environments such as Mobile Ad Hoc Networks (MANETs) has become one of the most challenging research dire...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
STOC
2004
ACM
14 years 1 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
JCT
1998
13 years 7 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...