Sciweavers

2515 search results - page 44 / 503
» Interval Availability Distribution Computation
Sort
View
EDCC
2008
Springer
15 years 5 months ago
Targeted Distribution of Resource Allocation for Backup LSP Computation
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
TON
2010
158views more  TON 2010»
15 years 2 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
IPPS
2007
IEEE
15 years 10 months ago
Self Adaptive Application Level Fault Tolerance for Parallel and Distributed Computing
Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed witho...
Zizhong Chen, Ming Yang, Guillermo A. Francia III,...
GLOBECOM
2007
IEEE
15 years 10 months ago
A Distributed Bandwidth Sharing Heuristic for Backup LSP Computation
— With the advent of MPLS, the restoration times of communications is decreased down to 50 ms by the use of preconfigured backup LSPs. To ensure there are enough resources after ...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
FC
2006
Springer
108views Cryptology» more  FC 2006»
15 years 7 months ago
Uncheatable Reputation for Distributed Computation Markets
Reputation systems aggregate mutual feedback of interacting peers into a "reputation" metric for each participant. This is then available to prospective service "req...
Bogdan Carbunar, Radu Sion