Acyclic preference systems in p2p networks

Authors:
Anh-Tuan Gai;Dmitry Lebedev;Fabien Mathieu;Fabien de Montgolfier;Julien Reynier;Laurent Viennot
Affiliations:
INRIA, domaine de Voluceaux, Le Chesnay cedex, France;FT R&D, Issy les Moulineaux, France;FT R&D, Issy les Moulineaux, France;LIAFA, Université Paris 7, Paris, France;Motorola Labs, Parc Algorithmes Saint-Aubin, Gif sur Yvette Cedex, France;INRIA, domaine de Voluceaux, Le Chesnay cedex, France
Venue:
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Year:
2007

Citing 8
Cited 2

The stable roommates problem with ties

Journal of Algorithms
Sync-MS: Synchronized Messaging Service for Real-Time Multi-Player Distributed Games

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
The Hospitals/Residents Problem with Ties

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Small Worlds: The Dynamics of Networks between Order and Randomness

Small Worlds: The Dynamics of Networks between Order and Randomness
Correctness of a gossip based membership protocol

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Stratification in P2P Networks: Application to BitTorrent

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Clustering in peer-to-peer file sharing workloads

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Upper bounds for stabilization in acyclic preference-based systems

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Adaptive distributed b-matching in overlays with preferences

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto efficient) configuration, where no participant can collaborate with better partners than their current ones. We analyze the representation of such preference systems and show that any acyclic system can be represented with a symmetric mark matrix. This gives a method to merge acyclic preference systems while retaining the acyclicity property. We also consider properties of the corresponding collaboration graph, such as clustering coefficient and diameter. In particular, the study of the example of preferences based on real latency measurements shows that its stable configuration is a small-world graph.