DocumentCode
2203018
Title
CORP: A Casual Ordering Replication Protocol Applied to Storage Replication System
Author
Zhan, Wentao ; Li, Zhanhuai ; Ren, Kun ; Hu, Jinpeng
Author_Institution
Dept. of Comput. Sci., Northwestern Polytech. Univ., Xian
fYear
2008
fDate
20-22 Dec. 2008
Firstpage
1045
Lastpage
1049
Abstract
In order to meet the need of data disaster tolerance in low end application, this paper discusses some flaws of already existing replication protocols based on storage replication system. Then a casual ordering replication protocol (CORP) is presented in the paper aiming at resolving these flaws. Furthermore, the paper discusses the workflow of CORP and provides a timestamp method to implement CORP. Analysis and experiment have revealed that CORP can make full use of secondary disk scheduling algorithms without increasing primary load, which is helpful to improve IO performance and respond faster.
Keywords
replicated databases; scheduling; security of data; storage management; IO performance; casual ordering replication protocol; data disaster tolerance; secondary disk scheduling algorithm; storage replication system; Algorithm design and analysis; Application software; Data engineering; Electromagnetic compatibility; Peer to peer computing; Performance analysis; Protocols; Read-write memory; Scheduling algorithm; Storage area networks; casual ordering; disk scheduling; timestamp;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on
Conference_Location
Phuket
Print_ISBN
978-0-7695-3489-3
Type
conf
DOI
10.1109/ICACTE.2008.87
Filename
4737116
Link To Document