Sciweavers

210 search results - page 2 / 42
» Algorithms for Automatically Computing the Causal Paths of F...
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
SAC
2010
ACM
14 years 1 days ago
Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms
We study the fifo and causal multicast problem, two group-communication abstractions that deliver messages in an order consistent with their context. With fifo multicast, the co...
Nicolas Schiper, Fernando Pedone
ISSTA
2010
ACM
13 years 8 months ago
Analyzing concurrency bugs using dual slicing
Recently, there has been much interest in developing analyzes to detect concurrency bugs that arise because of data races, atomicity violations, execution omission, etc. However, ...
Dasarath Weeratunge, Xiangyu Zhang, William N. Sum...
INFOCOM
2009
IEEE
13 years 12 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
AIPS
2009
13 years 6 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner