105 search results - page 1 / 21 » Distributed Algorithms for Computing Alternate Paths Avoidin... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
LCN
2008
IEEE
13 years 10 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
ICNP
2002
IEEE
13 years 9 months ago
2002
IEEE
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
TON
2010
12 years 11 months ago
2010
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
IFIP
2004
Springer
13 years 9 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...