DocumentCode :
3123461
Title :
A Distributed Algorithm for Underlay Aware and Available Overlay Formation in Event Broker Networks for Publish/Subscribe Systems
Author :
Madhu Kumar, S.D. ; Bellur, Umesh
Author_Institution :
IIT Bombay, Mumbai
fYear :
2007
fDate :
22-29 June 2007
Firstpage :
69
Lastpage :
69
Abstract :
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.
Keywords :
computational complexity; distributed algorithms; graph theory; message passing; middleware; asynchronous distributed algorithm; event broker network; graph theory; message complexity; publish/subscribe system; time complexity; underlay aware overlay network; Algorithm design and analysis; Availability; Computer networks; Distributed algorithms; Electronic mail; Information technology; Peer to peer computing; Physics computing; Publish-subscribe; Runtime;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems Workshops, 2007. ICDCSW '07. 27th International Conference on
Conference_Location :
Toronto, Ont.
ISSN :
1545-0678
Print_ISBN :
0-7695-2838-4
Electronic_ISBN :
1545-0678
Type :
conf
DOI :
10.1109/ICDCSW.2007.9
Filename :
4279073
Link To Document :
بازگشت