Converging an Overlay Network to a Gradient Topology

Details Converging an Overlay Network to a Gradient Topology Converging an Overlay Network to a Gradient Topology

2011-03-29

arxiv.org/abs/1103.5678v1

Computer Science

Systems and Control

Submitted to 50th IEEE Conference on Decision and Control (CDC 2011)

Scientific paper

In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors with the same utility value (a similar view) and a set of neighbors containing higher utility values (gradient neighbor set), such that paths of increasing utilities emerge in the network topology. The Gradient overlay network is built using gossiping and a preference function that samples from nodes using a uniform random peer sampling service. We analyze it using tools from matrix analysis, and we prove both the necessary and sufficient conditions for convergence to a complete gradient structure, as well as estimating the convergence time and providing bounds on worst-case convergence time. Finally, we show in simulations the potential of the Gradient overlay, by building a more efficient live-streaming peer-to-peer (P2P) system than one built using uniform random peer sampling.

Affiliated with

Also associated with

No associations

Rating

Converging an Overlay Network to a Gradient Topology 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 Converging an Overlay Network to a Gradient Topology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Converging an Overlay Network to a Gradient Topology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163810