loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07)
A Distributed Algorithm for Underlay Aware and Available Overlay Formation in Event Broker Networks for Publish/Subscribe Systems
Toronto, Canada
June 22-June 29
ISBN: 0-7695-2838-4
Madhu Kumar SD, Kanwal Rekhi School of Information Technology, IIT Bombay, India
Umesh Bellur, Kanwal Rekhi School of Information Technology, IIT Bombay, India
Event broker networks are basically overlay networks formed over the underlying physical network. In modern distributed applications, ensuring high availability in the face of the runtime failures is a major issue. This paper presents an asynchronous distributed algorithm for constructing and maintaining an underlay aware overlay which ensures high availability in the presence of node and link failures in the underlying physical network. We prove theoretically that our algorithm is correct. The time complexity of the algorithm is estimated to be O(diameter*degree)2 of the network and the message complexity is O(diameter*degree). A model for availability of an underlay aware overlay network and a classification of available overlays are the other important contributions of this paper.
Citation:
Madhu Kumar SD, Umesh Bellur, "A Distributed Algorithm for Underlay Aware and Available Overlay Formation in Event Broker Networks for Publish/Subscribe Systems," icdcsw, pp.69, 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.