The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.23)
pp: 2175-2188
João Leitão , INESC-ID laboratory and Universidade Técnica de Lisboa, Lisboa
João Pedro Marques , INESC-ID laboratory and Universidade Técnica de Lisboa, Lisboa
José Pereira , Universidade do Minho, Braga
Luís Rodrigues , INESC-ID laboratory and Universidade Técnica de Lisboa, Lisboa
ABSTRACT
Gossip, or epidemic, protocols have emerged as a highly scalable and resilient approach to implement several application level services such as reliable multicast, data aggregation, publish-subscribe, among others. All these protocols organize nodes in an unstructured random overlay network. In many cases, it is interesting to bias the random overlay in order to optimize some efficiency criteria, for instance, to reduce the stretch of the overlay routing. In this paper, we propose X-BOT, a new protocol that allows to bias the topology of an unstructured gossip overlay network. X-BOT is completely decentralized and, unlike previous approaches, preserves several key properties of the original (nonbiased) overlay (most notably, the node degree and consequently, the overlay connectivity). Experimental results show that X-BOT can generate more efficient overlays than previous approaches independently of the underlying physical network topology.
INDEX TERMS
Peer to peer computing, Protocols, Topology, Network topology, Optimization, Measurement, Reliability, network protocols, Peer-to-peer systems, unstructured overlay networks, topology adaptation
CITATION
João Leitão, João Pedro Marques, José Pereira, Luís Rodrigues, "X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 11, pp. 2175-2188, Nov. 2012, doi:10.1109/TPDS.2012.29
REFERENCES
[1] K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, "Bimodal Multicast," ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41-88, May 1999.
[2] A.-M. Kermarrec, L. Massoulié, and A. Ganesh, "Probabilistic Reliable Dissemination in Large-Scale Systems," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, Mar. 2003.
[3] J. Leitão, J. Pereira, and L. Rodrigues, "HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast," Proc. IEEE/IFIP 37th Ann. Int'l Conf. Dependable Systems and Networks (DSN '07), pp. 419-429, 2007.
[4] M.-J. Lin and K. Marzullo, "Directional Gossip: Gossip in a Wide Area Network," Proc. Third European Dependable Computing Conf. (EDCC), pp. 364-379, 1999.
[5] M. Jelasity and A. Montresor, "Epidemic-style Proactive Aggregation in Large Overlay Networks," Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 102-109, 2004.
[6] P. Eugster and R. Guerraoui, "Probabilistic Multicast," Proc. IEEE/IFIP Ann. Int'l Conf. Dependable Systems and Networks (DSN), 2002.
[7] P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie, "From Epidemics to Distributed Computing," Computer, vol. 37, no. 5, pp. 60-67, May 2004.
[8] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic Algorithms for Replicated Database Maintenance," Proc. Sixth Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC), pp. 1-12, 1987.
[9] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a Dht," Proc. USENIX Ann. Technical Conf., pp. 10-10, 2004.
[10] M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen, "The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations," Proc. Fifth IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware), pp. 79-98, 2004.
[11] A. Ganesh, A.-M. Kermarrec, and L. Massoulié, "SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication," Proc. Third Int'l COST264 Workshop Networked Group Comm., pp. 44-55, 2001.
[12] S. Voulgaris, D. Gavidia, and M. Steen, "Cyclon: Inexpensive Membership Management for Unstructured P2P Overlays," J. Network and Systems Management, vol. 13, no. 2, pp. 197-217, June 2005.
[13] K. Birman, "The Promise, and Limitations, of Gossip Protocols," SIGOPS Operating Systems Rev., vol. 41, no. 5, pp. 8-13, 2007.
[14] S. Girdzijauskas, A. Datta, and K. Aberer, "Oscar: Small-World Overlay for Realistic Key Distributions," Proc. Int'l Conf. Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P), pp. 247-258, 2007.
[15] H. Rostami and J. Habibi, "Topology Awareness of Overlay P2P Networks," Concurrency and Computation: Practice & Experience-Autonomous Grid, vol. 19, pp. 999-1021, May 2007.
[16] J. Leitão, J.P. Marques, J.O. Pereira, and L. Rodrigues, "X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks (Supplementary Document)," http://doi.ieeecomputer society.org/10.1109 TPDS.2012.29, 2011.
[17] Y.-H. Chu, S. Rao, S. Seshan, and H. Zhang, "A Case for End System Multicast," IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1456-1471, Oct. 2002.
[18] I. Gupta, A.-M. Kermarrec, and A. Ganesh, "Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast," IEEE Trans. Parallel Distributed Systems, vol. 17, no. 7, pp. 593-605, July 2006.
[19] L. Massoulie, A.-M. Kermarrec, and A.J. Ganesh, "Network Awareness and Failure Resilience in Self-Organising Overlay Networks," Proc. 22nd Symp. Relizable Distributed Systems (SRDS), pp. 47-55, 2003.
[20] C. Tang and C. Ward, "GoCast: Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication," Proc. IEEE/IFIP Ann. Int'l Conf. Dependable Systems and Networks (DSN), pp. 140-149, 2005.
[21] R. Melamed and I. Keidar, "Araneola: A Scalable Reliable Multicast System for Dynamic Environments," Proc. IEEE Third Int'l Symp. Network Computing and Applications (NCA), pp. 5-14, 2004.
[22] M. Jelasity and O. Babaoglu, "T-Man: Gossip-Based Overlay Topology Management," The Fourth Int'l Workshop Eng. Self-Organizing Applications, May 2006.
[23] J. Leitão, N.A. Carvalho, J. Pereira, R. Oliveira, and L. Rodrigues, Handbook of Peer-to-Peer Networking, ch. 10, Springer, 2010.
[24] P. Karwaczyński, D. Konieczny, J. Moçnik, and M. Novak, "Dual Proximity Neighbour Selection Method for Peer-to-Peer Based Discovery Service," Proc. 22nd ACM Symp. Applied Computing (SAC), pp. 590-591, 2007.
[25] M. Jelasity, A. Montresor, G.P. Jesi, and S. Voulgaris, "The Peersim Simulator," http:/peersim.sf.net, 2012.
[26] J. Winick and S. Jamin, "Inet-3.0: Internet Topology Generator," Technical Report UM-CSE-TR-456-02, EECS, Univ. of Michigan, 2002.
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool