Sciweavers

376 search results - page 12 / 76
» Self-Stabilizing Graph Protocols
Sort
View
NCA
2007
IEEE
14 years 1 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
RFIDSEC
2010
13 years 6 months ago
The Poulidor Distance-Bounding Protocol
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
Rolando Trujillo-Rasua, Benjamin Martin 0002, Gild...
TASE
2009
IEEE
14 years 2 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
CORR
2006
Springer
161views Education» more  CORR 2006»
13 years 7 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy
NETWORKING
2007
13 years 9 months ago
Graph Based Modeling of P2P Streaming Systems
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack