Sciweavers

3809 search results - page 197 / 762
» Randomized Broadcast in Networks
Sort
View
NOSSDAV
2009
Springer
16 years 23 days ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 5 days ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
INFOCOM
2012
IEEE
13 years 8 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
NDSS
2009
IEEE
16 years 29 days ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
AINA
2007
IEEE
16 years 18 days ago
Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
Vandana Gunupudi, Stephen R. Tate