A Dynamic Replica Placement Mechanism Based on Response Time Measure

Author

Wang, Wenfeng ; Wei, Wenhong

Author_Institution

Sch. of Inf. Eng., Nanchang Inst. of Technol., Nanchang, China

Volume

1

fYear

2010

fDate

12-14 April 2010

Firstpage

169

Lastpage

173

Abstract

Most of existing replication strategies mainly distribute replicas based on access frequency or total response time of the whole system, lacking of consideration of the response time requirement of a single request. To overcome the deficiencies, a model called RPRTM (Replica Placement based on Response Time Measure) is presented, and a genetic algorithm is designed to figure out the model. Example analysis indicates that the RPRTM can satisfy every node´s response time requirement of a single request and minimize the number of replicas at the same time. In addition, it reduces the total response time at most to improve the whole system performance.

Keywords

distributed processing; genetic algorithms; storage management; distributed storage systems; dynamic replica placement mechanism; genetic algorithm; response time measure; Algorithm design and analysis; Delay; Distributed computing; Frequency measurement; Genetic algorithms; Mobile communication; Mobile computing; Peer to peer computing; System performance; Time measurement; access frequency; distributed storage system; genetic algorithm; replica scheme; response time;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Mobile Computing (CMC), 2010 International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-4244-6327-5

Electronic_ISBN

978-1-4244-6328-2

Type

conf

DOI

10.1109/CMC.2010.46

Filename

5471492