Abstract
Overlay networks have emerged as a powerful paradigm to realise a large range of distributed services. However, as the number of overlays grows and the systems that use them become more interconnected, overlays must increasingly co-exist within the same infrastructure. When this happens, overlays have to compete for limited resources, which causes negative interferences. This paper takes an opposite view, and argues that coexisting overlays may also introduce positive synergies that can be exploited to benefit a distributed system. Unfortunately, and in spite of some pioneering work, this phenomenon is still poorly understood and has yet to be investigated systematically. To address this problem, this paper proposes a principled classification of synergies, and illustrates how it can be used to exploit synergies in a typical overlay platform targeting gossip protocols (GossipKit). We review in detail the risks and benefits of each identified synergy; we present experimental data that validate their added value, and finally discuss the lessons we have learnt from our implementation.
Chapter PDF
Similar content being viewed by others
References
Maniymaran, B., Bertier, M., Kermarrec, A.-M.: Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks. In: Proc. of 27th International Conference on Distributed Computing Systems (2007)
Ghodsi, A., Haridi, S., Weatherspoon, H.: Exploiting the Synergy Between Gossiping and Structured Overlays. In: Proc. of ACM SIGOPS Op. Sys. Review (2007)
Steinhauer, S., Okanda, P., Blair, G.: Virtual Overlays: An Approach to the Management of Competing or Collaborating Overlay Structures. In: Meier, R., Terzis, S. (eds.) DAIS 2008. LNCS, vol. 5053, pp. 112–125. Springer, Heidelberg (2008)
Cooper, B.: Trading Off Resources Between Overlapping Overlays. In: van Steen, M., Henning, M. (eds.) Middleware 2006. LNCS, vol. 4290, pp. 101–120. Springer, Heidelberg (2006)
Kwon, M., Fahmy, S.: Synergy: An Overlay Internetworking Architecture. In: Proc. of 14th Inter. Conf. on Computer Communications and Networks (2005)
Li, B., Guo, J., et al.: iOverlay: A Lightweight Middleware Infrastructure for Overlay Application Implementations. In: Proc. of IFIP/ACM Middleware Conf. (2004)
Rodriguez, A., Killian, C., Bhat, C., et al.: MACEDON: Methodology for automatically creating, evaluating, and designing overlay networks. In: Proc. of USENIX/ACM Symposium on Networked Systems Design (2004)
Lin, S., Taiani, F., Blair, G.: Facilitating Gossip Programming with the GossipKit Framework. In: Meier, R., Terzis, S. (eds.) DAIS 2008. LNCS, vol. 5053, pp. 238–252. Springer, Heidelberg (2008)
Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: EngineeringSelf-Organising Systems: 3rd International Workshop (2005)
Jelasity, M., Guerraoui, R., Kermarrec, A., et al.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Proc. of the 5th ACM/IFIP/USENIX international conference on Middleware (2004)
Riviere, E., Baldoni, R., Li, H., et al.: Compositional gossip: a conceptual architecture for designing gossip-based applications. In: ACM SIGOPS Op. Sys. Review (2007)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Kermarrec, A.-M., Massoulie, L., Ganesh, A., et al.: Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Trans. Parallel Distrib. Syst. (2003)
Birman, K., Abbadi, A., Dietrich, W., et al.: An Overview of the ISIS Project. IEEE Distributed Processing Technical Committee Newsletter (January 1985)
Ganesh, A., Kermarrec, A.-M., Massoulie, L.: SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 44. Springer, Heidelberg (2001)
Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure-detection service. In: Proc. Distributed Systems Platform and Open Distributed Processing (1998)
Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)
Grace, P., Coulson, G., Blair, G., et al.: GRIDKIT: Pluggable Overlay Networks for Grid Computing. In: Proc. Int. Symp. on Distributed Objects and Applications (2004)
Friedman, R., Gavidia, D., Rodirgues, L., et al.: Gossiping on MANETs: the Beauty and the Beast. ACM Operating Systems Review (2007)
Barr, R., Haas, Z., van Renesse, R.: JiST: an efficient approach to simulation using virtual machines: Research Articles. Software Practical Experiments (2005)
Stoica, I., Morris, R., Liben-Nowell, D., et al.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. In: Proc. of ACM SIGCOMM (2001)
Ucan, E., Thompson, N., Gupta, I.: A Piggybacking Approach to Reduce Overhead in Sensor Network Gossiping. In: 2nd International Workshop on Middleware for Sensor Networks (MidSens 2007) (2007)
Ananthanarayana, V., Vidyasankar, K.: Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, pp. 389–402. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lin, S., Taïani, F., Blair, G. (2009). Exploiting Synergies between Coexisting Overlays. In: Senivongse, T., Oliveira, R. (eds) Distributed Applications and Interoperable Systems. DAIS 2009. Lecture Notes in Computer Science, vol 5523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02164-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-02164-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02163-3
Online ISBN: 978-3-642-02164-0
eBook Packages: Computer ScienceComputer Science (R0)