Sciweavers

528 search results - page 9 / 106
» Fault-tolerant analysis of a class of networks
Sort
View
DSN
2002
IEEE
14 years 1 months ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...
MOBIHOC
2003
ACM
14 years 1 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
MASCOTS
1993
13 years 9 months ago
Simulation Modeling of Weak-Consistency Protocols
: Weak-consistency replication protocols can be used to build wide-area services that are scalable, fault-tolerant, and useful for mobile computer systems. We have evaluated the ti...
Richard A. Golding, Darrell D. E. Long
DC
2010
13 years 8 months ago
Towards worst-case churn resistant peer-to-peer systems
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
SNPD
2007
13 years 9 months ago
Biswapped Networks and Their Topological Properties
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
Wenjun Xiao, Weidong Chen, Mingxin He, Wenhong Wei...