1768 search results - page 58 / 354 » Optimal routing in Chord |
168
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
135
click to vote
SPDP
1991
IEEE
15 years 9 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
158
click to vote
JCT
1998
15 years 5 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...
150
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
155
click to vote
KIVS
2005
Springer
15 years 11 months ago
2005
Springer
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...