On collaborative content distribution using multi-message gossip Export

@inproceedings{citeulike:813431, abstract = {We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. Here we explore the inter-operation between the gossip of multiple, simultaneous message-chunks. In this setting, interacting nodes must select which chunk, among many, to exchange in every communication round. We provide an efficient solution that possesses the inherent robustness and scalability of gossip. Our approach maintains the simplicity of gossip, and has low message, connections and computation overhead. Because our approach differs from solutions proposed by network coding, we are able to provide insight into the tradeoffs and analysis of the problem of collaborative content distribution. We formally analyze the performance of the algorithm, demonstrating its efficiency with high probability.}, author = {Fernandess, C. and Malkhi, D.}, citeulike-article-id = {813431}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1639258}, journal = {Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International}, keywords = {content, distribution, epidemic, gossip}, pages = {9 pp.+}, posted-at = {2006-08-23 08:26:55}, priority = {2}, title = {On collaborative content distribution using multi-message gossip}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1639258}, year = {2006} }

TY - CONF ID - citeulike:813431 L3 - citeulike-article-id:813431 N2 - We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes. Here we explore the inter-operation between the gossip of multiple, simultaneous message-chunks. In this setting, interacting nodes must select which chunk, among many, to exchange in every communication round. We provide an efficient solution that possesses the inherent robustness and scalability of gossip. Our approach maintains the simplicity of gossip, and has low message, connections and computation overhead. Because our approach differs from solutions proposed by network coding, we are able to provide insight into the tradeoffs and analysis of the problem of collaborative content distribution. We formally analyze the performance of the algorithm, demonstrating its efficiency with high probability. JF - Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International TI - On collaborative content distribution using multi-message gossip SP - 9 pp. KW - content KW - distribution KW - epidemic KW - gossip AU - Fernandess, C AU - Malkhi, D PY - 2006/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1639258 ER -