105 search results - page 8 / 21 » Distributed Algorithms for Computing Alternate Paths Avoidin... |
EUC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Current trends in high-performance parallel computers show that fat-tree interconnection networks are one of the most popular topologies. The particular characteristics of this to...
TSP
2010
13 years 2 months ago
2010
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
JCO
2006
13 years 7 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...