Acyclic Preference Systems in P2P Networks

Details Acyclic Preference Systems in P2P Networks Acyclic Preference Systems in P2P Networks

2007-04-30

arxiv.org/abs/0704.3904v2

Computer Science

Data Structures and Algorithms

Scientific paper

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 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 the 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 and retain the acyclicity. We also consider such properties of the corresponding collaboration graph, as clustering coefficient and diameter. In particular, studying the example of preferences based on real latency measurements, we observe that its stable configuration is a small-world graph.

Affiliated with

Also associated with

No associations

Rating

Acyclic Preference Systems in P2P Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Acyclic Preference Systems in P2P Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Acyclic Preference Systems in P2P Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415221