@inproceedings{55cf81f032e74e00b6fd384f1d2b7768,
title = "Converging an overlay network to a Gradient topology",
abstract = "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.",
keywords = "Overlay networks, gossiping, gradient topology, topology convergence",
author = "H{\aa}kan Terelius and Guodong Shi and Jim Dowling and Amir Payberah and Ather Gattami and Johansson, \{Karl Henrik\}",
year = "2011",
doi = "10.1109/CDC.2011.6161194",
language = "English",
isbn = "9781612848006",
series = "Proceedings of the IEEE Conference on Decision and Control",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "7230--7235",
booktitle = "2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011",
address = "United States",
note = "2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 ; Conference date: 12-12-2011 Through 15-12-2011",
}