549 search results - page 1 / 110 » Computing All the Best Swap Edges Distributively |
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
OPODIS
2004
13 years 6 months ago
2004
ESA
1998
Springer
13 years 8 months ago
1998
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
ICPADS
2000
IEEE
13 years 9 months ago
2000
IEEE
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...