Partially Decentralized Passive Replication Algorithm


KIPS Transactions on Computer and Communication Systems, Vol. 12, No. 6, pp. 507-514, Dec. 2005
10.3745/KIPSTA.2005.12.6.507,   PDF Download:

Abstract

This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to this desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated server systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce 16.5%~52.3% of the average response time of a client request compared with the traditional ones.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Ahn, "Partially Decentralized Passive Replication Algorithm," KIPS Journal A (2001 ~ 2012) , vol. 12, no. 6, pp. 507-514, 2005. DOI: 10.3745/KIPSTA.2005.12.6.507.

[ACM Style]
Jin Ho Ahn. 2005. Partially Decentralized Passive Replication Algorithm. KIPS Journal A (2001 ~ 2012) , 12, 6, (2005), 507-514. DOI: 10.3745/KIPSTA.2005.12.6.507.