CORP: A Casual Ordering Replication Protocol Applied to Storage Replication System

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. Fu...

Full description

Saved in:
Bibliographic Details
Main Authors: Wentao Zhan, Zhanhuai Li, Kun Ren, Jinpeng Hu
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Application software
casual ordering
Data engineering
disk scheduling
Electromagnetic compatibility
Peer to peer computing
Performance analysis
Protocols
Read-write memory
Scheduling algorithm
Storage area networks
timestamp
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2154-7491
2154-7505
DOI:10.1109/ICACTE.2008.87