Sciweavers

89 search results - page 9 / 18
» The overhead of consensus failure recovery
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 2 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
IM
2003
13 years 9 months ago
Hierarchical End-to-End Service Recovery
: Failed networks, for example MPLS, can cause signaling storms the size of which can grow dramatically with network size. This paper presents a new scalable fault notification pro...
Mohamed El-Darieby, Dorina C. Petriu, Jerry Rolia
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
CONCURRENCY
2010
110views more  CONCURRENCY 2010»
13 years 7 months ago
Redesigning the message logging model for high performance
Over the past decade the number of processors in the high performance facilities went up to hundreds of thousands. As a direct consequence, while the computational power follow th...
Aurelien Bouteiller, George Bosilca, Jack Dongarra
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
14 years 9 months ago
A Cooperative, Self-Configuring High-Availability Solution for Stream Processing
We present a collaborative, self-configuring high availability (HA) approach for stream processing that enables low-latency failure recovery while incurring small run-time overhea...
Jeong-Hyon Hwang, Ying Xing, Ugur Çetinteme...