Converging an Overlay Network to a Gradient Topology
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
IEEE , 2011.
Overlay networks, topology convergence, gossiping, gradient topology
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-46515DOI: 10.1109/CDC.2011.6161194ISI: 000303506207141ScopusID: 2-s2.0-84860691260OAI: oai:DiVA.org:kth-46515DiVA: diva2:453815
50th IEEE Conference on Decision and Control and European Control Conference, Orlando, Florida, December 12-15 2011
FunderTrenOp, Transport Research Environment with Novel PerspectivesICT - The Next Generation
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 201111242011-11-242011-11-032013-06-12Bibliographically approved