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.
A_Token-Based_Distributed.pdf - Published Version
Restricted to Registered users only
Download (446Kb) | Request a copy
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.
|Item Type:||Editorials/Short Communications|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||04 Aug 2011 05:37|
|Last Modified:||04 Aug 2011 05:37|
Actions (login required)