On Using Matching Theory to Understand P2P Network Design

Details On Using Matching Theory to Understand P2P Network Design On Using Matching Theory to Understand P2P Network Design

2006-12-21

arxiv.org/abs/cs/0612108v1

Computer Science

Networking and Internet Architecture

Scientific paper

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 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. We show that P2P networks with acyclic preferences possess a unique stable state with good convergence properties.

Affiliated with

Also associated with

No associations

Rating

On Using Matching Theory to Understand P2P Network Design 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 On Using Matching Theory to Understand P2P Network Design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Using Matching Theory to Understand P2P Network Design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21845