38 citations · 86 across the 6 of their papers we have counts for
6 papers
The stable configuration in acyclic preference-based systems
Fabien Mathieu, Gheorghe Postelnicu, Julien Reynier
Acyclic preferences recently appeared as an elegant way to model many distributed systems. An acyclic instance admits a unique stable configuration, which can reveal the performanc…
Acyclic Preference Systems in P2P Networks
Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu +3
In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share…
Stratification in P2P Networks - Application to BitTorrent
Anh-Tuan Gai, Fabien Mathieu, Julien Reynier +1
We introduce a model for decentralized networks with collaborating peers. The model is based on the stable matching theory which is applied to systems with a global ranking utility…
On Using Matching Theory to Understand P2P Network Design
Dmitry Lebedev, Fabien Mathieu, Laurent Viennot +3
This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the…
A simple stability condition for RED using TCP mean-field modeling
Julien Reynier
Congestion on the Internet is an old problem but still a subject of intensive research. The TCP protocol with its AIMD (Additive Increase and Multiplicative Decrease) behavior hide…
Mean field convergence of a model of multiple TCP connections through a buffer implementing RED
D. R. McDonald, J. Reynier
RED (Random Early Detection) has been suggested when multiple TCP sessions are multiplexed through a bottleneck buffer. The idea is to detect congestion before the buffer overflows…