Abstract
Modern distributed applications that run on P2P overlays need the overlay to be resilient to failures in the underlying communications network. An example application is that of event dissemination where the P2P overlay (the event broker network) delivers events published by a client to subscribers based on subscription filters. Achieving high availability requires that the overlay be aware of, and utilize the path redundancies in the underlying physical network. In addition, the overlay should be self organizing, as broker nodes may dynamically join or leave the network and centralized control is not an option in large scale networks. In this paper, we present Trimarg, an efficient distributed algorithm for achieving a self organizing overlay with an availability degree of three. Our algorithm is based on a graph theoretic foundation for highly available overlay networks and is designed to handle the concurrency issues of a large scale distributed system. The resulting unstructured P2P overlay ensures 3-degree of availability in the presence of node and link failures in the underlying physical network. We have proved the correctness of the algorithm and analyzed its complexity to show that the time complexity is O (diameter*degree)2 of the network and the message complexity is O(diameter*degree). Our algorithm is the first of its kind to deal with concurrency issues and self organizing capabilities of the resultant overlay.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pietzuch, P.R.: Hermes: A Scalable Event-Based Middleware. PhD thesis, Computer Laboratory, Queens College, University of Cambridge (February 2004)
Tang, C.: Underlay-Aware Overlay Networks. PhD thesis, Michigan State University (June 2005)
Anderson, D., Balakrishnan, H., Kaashoek, F., Morris, R.: The Case for Resilient Overlay Networks. In: Proceedings of Eighth Workshop on Hot Topics in Operating Systems(HotOS 2001), pp. 152–157. IEEE Computer Society, Los Alamitos (2001)
Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.D.: Bayeux: An Architecture for Scalable and Fault Tolerant Wide-area Data Dissemination. In: Proceedings of the Eleventh International Workshop on Network and OS support for Digital Audio and Video (NOSSDAV 2001) (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault Tolerant Wide-area Location and Routing. Technical Report, University of California-Berkeley, Berkeley, CA (2001)
Fiege, L., Muehl, G., Buchmann, A.: An Architectural Framework for Electronic Commerce Applications. In: Proceedings of Informatik 2001: Annual Conference of the German Computer Society (2001)
IBM T J Watson Research Center. Gryphon: Publish/ Subscribe over Public Network (2001), http://researchweb.watson.ibm.com/gryphon/Gryphon
Carzaniga, A.: Architectures for an Event Notification Service Scalable to Wide-Area Networks. PhD thesis, Politecnico di Milano, Milano, Italy (December 1998)
Mahambre, S.P., Madhu Kumar, S.D., Bellur, U.: A Taxonomy of QoS-Aware, Adaptive Event-Dissemination Middleware. IEEE Internet Computing 11(4), 35–44 (2007)
Muehl, G., Jaeger, M.A., Herrmann, K., Weis, T., Fiege, L., Ulbrich, A.: Self-stabilizing publish/subscribe systems: Algorithms and evaluation. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 664–674. Springer, Heidelberg (2005)
Porter, B., Taiani, F., Coulson, G.: Generalized Repair for Overlay Networks. In: Proceedings of the Twentyfifth IEEE Symposium on Reliable Distributed Systems (SRDS 2006), Leeds, UK (October 2006)
Performance Measurement Tools Taxonomy, http://www.caida.org/tools/taxonomy/performance.xml
Coates, M., Hero, A., Nowak, R., Yu, B.: Internet Tomography. IEEE Signal Processing Magazine (May 2002)
Madhu Kumar, S.D., Bellur, U.: A distributed algorithm for underlay aware and available overlay formation in event broker networks for publish/subscribe systems. In: Proceedings of the First International Workshop on Distributed Event Processing Systems and Applications (DEPSA 2007) Colocated with ICDCS 2007, Toronto, Canada (June 2007)
West, D.B.: Introduction to Graph Theory. Prentice Hall of India (1999)
Madhu Kumar, S.D., Bellur, U.: Availability Models for Underlay Aware Overlay Networks. In: Proceedings of the second International Conference on Distributed Event-Based Systems (DEBS 2008), Rome,Italy, pp. 169–180. ACM Digital Library, New York (2008)
Madhu Kumar, S.D., Bellur, U.: Graph Theoretic Concepts for Highly Available Underlay Aware P2P Networks. Technical Report IITB/CSE/2008/October/18, Department of Computer Science and Engineering, Indian Institute of Technology Bombay, IIT Bombay, India (October 2008)
Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: An Approach to Universal Topology Generation. In: Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems- MASCOTS 2001, Cincinnati, Ohio (August 200)
Madhu Kumar, S.D., Bellur, U.: Trimarg: A Distributed Algorithm for the Formation of Highly Available Underlay Aware Overlay Networks of Event Brokers. Technical Report IITB/KReSIT/2007/May/49, Kanwal Rekhi School of Information Technology, IIT Bombay (May 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, S.D.M., Bellur, U., Govindan, V.K. (2008). Underlay Aware Resiliency in P2P Overlays. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)