Sciweavers

435 search results - page 5 / 87
» On necessary conditions for scale-freedom in complex network...
Sort
View
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 7 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
ICDCS
2007
IEEE
14 years 1 months ago
Self-Similar Algorithms for Dynamic Distributed Systems
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
K. Mani Chandy, Michel Charpentier
DC
2007
13 years 7 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
APNOMS
2009
Springer
14 years 1 months ago
The Design of an Autonomic Communication Element to Manage Future Internet Services
Future Internet services will have vastly different requirements than the current Internet. Manageability, which has been largely ignored, will have the dual role of controlling ca...
John Strassner, Sung-Su Kim, James Won-Ki Hong
SIROCCO
2008
13 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau