1768 search results - page 19 / 354 » Optimal routing in Chord |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
INFOCOM
2003
IEEE
14 years 21 days ago
2003
IEEE
— Efficient use of network resources has long been an important problem for large-scale network operators. To this end, several recent research efforts have proposed automated m...
DSN
2009
IEEE
14 years 2 months ago
2009
IEEE
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...