455 citations
- Institut national de recherche en sciences et technologies du numériqueFR7 papers
- SupélecFR6 papers
- Computer Algorithms for MedicineAT3 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR3 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR3 papers
- Université de RennesFR3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Laboratoire des signaux et systèmesFR2 papers
- Laboratoire Traitement et Communication de l’InformationFR2 papers
- Techniques of Informatics and Microelectronics for Integrated Systems ArchitectureFR2 papers
- Télécom ParisFR2 papers
- UCLouvainBE2 papers
5 papers · 1 filter
Exact solutions for the two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan
Christian Tanguy
The two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan have been calculated exactly for arbitrary size as well as arbitrary individual edge a…
Exact solutions for the two- and all-terminal reliabilities of a simple ladder network
Christian Tanguy
The exact calculation of network reliability in a probabilistic context has been a long-standing issue of practical importance, but a difficult one, even for planar graphs, with pe…
Exact Failure Frequency Calculations for Extended Systems
Annie Druault-Vicard, Christian Tanguy
This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product…
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…