Sciweavers

2276 search results - page 97 / 456
» Failure of A Mix Network
Sort
View
EUC
2007
Springer
16 years 11 days ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
IJACT
2010
90views more  IJACT 2010»
15 years 1 months ago
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optima
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, K...
INFOCOM
2010
IEEE
15 years 4 months ago
Towards a Theory of Anonymous Networking
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
Javad Ghaderi, Rayadurgam Srikant
FOCS
2006
IEEE
16 years 7 days ago
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
Tomás Feder, Adam Guetz, Milena Mihail, Ami...
CPC
2007
64views more  CPC 2007»
15 years 6 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...