Sciweavers

Share
NOMS
2010
IEEE
201views Communications» more  NOMS 2010»
9 years 9 months ago
Checkpoint-based fault-tolerant infrastructure for virtualized service providers
Crash and omission failures are common in service providers: a disk can break down or a link can fail anytime. In addition, the probability of a node failure increases with the num...
Iñigo Goiri, Ferran Julià, Jordi Gui...
MOBIHOC
2010
ACM
9 years 9 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
TECS
2010
74views more  TECS 2010»
9 years 10 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
TON
2002
117views more  TON 2002»
9 years 11 months ago
Generalized loop-back recovery in optical mesh networks
Current means of providing loop-back recovery, which is widely used in SONET, rely on ring topologies, or on overlaying logical ring topologies upon physical meshes. Loop-back is d...
Muriel Médard, Richard A. Barry, Steven G. ...
TON
2008
106views more  TON 2008»
9 years 11 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
IM
2003
10 years 1 months ago
Using Neural Networks to Identify Control and Management Plane Poison Messages
: Poison message failure propagation is a mechanism that has been responsible for large scale failures in both telecommunications and IP networks: Some or all of the network elemen...
Xiaojiang Du, Mark A. Shayman, Ronald A. Skoog
IPSN
2004
Springer
10 years 5 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
DMSN
2004
ACM
10 years 5 months ago
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures,...
Julian Winter, Wang-Chien Lee
INFOCOM
2005
IEEE
10 years 5 months ago
On failure detection algorithms in overlay networks
— One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilie...
Shelley Zhuang, Dennis Geels, Ion Stoica, Randy H....
ICNP
2005
IEEE
10 years 5 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
books