The stable configuration in acyclic preference-based systems

Details The stable configuration in acyclic preference-based systems The stable configuration in acyclic preference-based systems

2008-09-04

arxiv.org/abs/0809.0833v1

Computer Science

Networking and Internet Architecture

Scientific paper

Acyclic preferences recently appeared as an elegant way to model many distributed systems. An acyclic instance admits a unique stable configuration, which can reveal the performance of the system. In this paper, we give the statistical properties of the stable configuration for three classes of acyclic preferences: node-based preferences, distance-based preferences, and random acyclic systems. Using random overlay graphs, we prove using mean-field and fluid-limit techniques that these systems have an asymptotically continuous independent rank distribution for a proper scaling, and the analytical solution is compared to simulations. These results provide a theoretical ground for validating the performance of bandwidth-based or proximity-based unstructured systems.

Affiliated with

Also associated with

No associations

Rating

The stable configuration in acyclic preference-based systems 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 The stable configuration in acyclic preference-based systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The stable configuration in acyclic preference-based systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142064