Record Details

A distributed algorithm for underlay aware and available overlay formation in event broker networks for publish/subscribe systems

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A distributed algorithm for underlay aware and available overlay formation in event broker networks for publish/subscribe systems
 
Creator MADHU KUMAR, SD
BELLUR, UMESH
 
Subject computational complexity
distributed algorithms
graph theory
message passing
middleware
 
Description 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.
 
Publisher IEEE
 
Date 2009-06-05T07:15:25Z
2011-11-28T08:08:39Z
2011-12-15T09:57:26Z
2009-06-05T07:15:25Z
2011-11-28T08:08:39Z
2011-12-15T09:57:26Z
2007
 
Type Article
 
Identifier Proceedings of the 27th International Conference on Distributed Computing Systems Workshops, Toronto, Ontario, Canada, 22-29 June 2007, 69-76
0-7695-2838-4
10.1109/ICDCSW.2007.9
http://hdl.handle.net/10054/1439
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1439
 
Language en