We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
This paper discusses theoretical and experimental aspects of gradient-based approaches to the direct optimization of policy performance in controlled ??? ?s. We introduce ??? ?, a...
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of aut...
Ruggero Carli, Fabio Fagnani, Alberto Speranzon, S...