论文信息 - On Using Matching Theory to Understand P2P Network Design

On Using Matching Theory to Understand P2P Network Design

This paper aims at giving insight on the stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the will of getting the best service available. This is the case for most existing P2P networks. We explore an evolution model derived from stable roommates theory that accounts for heterogeneity between nodes. We show that most P2P applications can be modeled using stable matching theory. This is the case whenever preference lists can be deduced from the exchange policy. In many cases, the preferences lists are characterized by an interesting acyclic property. This leads us to the notion of acyclic preferences. We show that P2P networks with acyclic preferences possess a unique stable state with good convergence properties.

[1] David Manlove,et al. The structure of stable marriage with indifference , 2002, Discret. Appl. Math..

[2] Robert W. Irving. An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[3] David Manlove,et al. Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[4] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .

[5] Katarína Cechlárová,et al. On a generalization of the stable roommates problem , 2005, TALG.

[6] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[7] Tamás Fleiner,et al. Egerváry Research Group on Combinatorial Optimization on the Stable B-matching Polytope on the Stable B-matching Polytope , 2022 .

[8] Jimmy J. M. Tan. A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.

[9] Anne-Marie Kermarrec,et al. Clustering in Peer-to-Peer File Sharing Workloads , 2004, IPTPS.

[10] M. Utku Ünver,et al. Credible group stability in many-to-many matching problems , 2006, J. Econ. Theory.

[11] Bruce M. Maggs,et al. Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).