A token-based distributed algorithm for total order atomic broadcast


Autoria(s): Dey, Sandip; Pal, Arindam
Contribuinte(s)

Das, SK

Bhattacharya, S

Data(s)

2002

Resumo

In this paper, we propose a new token-based distributed algorithm for total order atomic broadcast. We have shown that the proposed algorithm requires lesser number of messages compared to the algorithm where broadcast servers use unicasting to send messages to other broadcast servers. The traditional method of broadcasting requires 3(N - 1) messages to broadcast an application message, where N is the number of broadcast servers present in the system. In this algorithm, the maximum number of token messages required to broadcast an application message is 2N. For a heavily loaded system, the average number of token messages required to broadcast an application message reduces to 2, which is a substantial improvement over the traditional broadcasting approach.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/39008/1/A_Token-Based_Distributed.pdf

Dey, Sandip and Pal, Arindam (2002) A token-based distributed algorithm for total order atomic broadcast. In: Lecture Notes in Computer Science, 2571 . pp. 343-347.

Publicador

Springer

Relação

http://www.springerlink.com/content/yay703xb3r5g3hke/

http://eprints.iisc.ernet.in/39008/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Editorials/Short Communications

PeerReviewed