UCSY's Research Repository

Consistent Replica Selection Mechanism for Cloud Data Storage

Show simple item record

dc.contributor.author Nwe, Thazin
dc.contributor.author Yee, Tin Tin
dc.contributor.author Phyu, Myat Pwint
dc.contributor.author Htoon, Ei Chaw
dc.date.accessioned 2019-07-11T03:08:18Z
dc.date.available 2019-07-11T03:08:18Z
dc.date.issued 2017-02-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/666
dc.description.abstract Cloud computing is becoming increasingly popular and cloud storage services attract more attentions for their high security and availability with a low cost. Cloud storage is expected to become the main force of the future storage market. To achieve high data availability, cloud storage services rely on replication. Data replication is a widely used technology in quorum based data center distributed storage system. In such systems, it is important to choose a closest set of replicas to service a client request for increasing performance and reliability. Static replica selection would be suboptimal even over a dedicated infrastructure. Suboptimal replica choices result in reduced performance as a result of increased response latency. In this paper, a consistent replica selection mechanism is proposed to automatically select number of consistent replicas by searching nearest replicas and selecting consistent replicas depends on current time, nearest arrival time, read/write latency and version for each read request. This mechanism tends to achieve the performance of client requests for cloud services by reducing latency cost. en_US
dc.language.iso en en_US
dc.publisher Fifteenth International Conference on Computer Applications(ICCA 2017) en_US
dc.title Consistent Replica Selection Mechanism for Cloud Data Storage en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics