Converging an Overlay Network to a Gradient Topology
Number of Authors: 6
2011 (English)Conference paper (Refereed)
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 containing higher utility values, 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. 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.
Place, publisher, year, edition, pages
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-23988OAI: oai:DiVA.org:ri-23988DiVA: diva2:1043067
The 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'11)