Mobile Data Replication Algorithms Based on Agent

Article Preview

Abstract:

In mobile transaction process, there exists frequently data transferring and replication. By the bandwidth limitation, discontinuous characteristics, there are a lot of questions in mobile data loss, replication failure, etc. Aimed at the questions, the paper proposes several mobile data transfer and replication algorithms based on agent. Every proposed algorithm is analyzed and simulation is performed to compare their delay. Result shows that through collecting small data transactions by agent, data are batch processed to servers, which may reduce the total cost of replication and promote replication success ratio and reduce the delay of replications. Adaptive algorithm is also considered.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Pages:

957-960

Citation:

Online since:

April 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yingjie Li and Ming-Tsan Liu. SDSR: A Scalable Data Storage and Retrieval Service for Wireless Ad Hoc Networks. ICOIN 2005, LNCS 3391, 2005, p.499–509.

DOI: 10.1007/978-3-540-30582-8_52

Google Scholar

[2] Luo Huiqiong, Ding Xuyang, Lao Hansheng and Wang Wenmin. P2P File Sharing in Wireless Mesh Networks. APPT 2007, LNCS 4847, 2007, p.402–413.

DOI: 10.1007/978-3-540-76837-1_44

Google Scholar

[3] John D. Strunk. Using Utility Functions to Control a Distributed Storage System. PhD: Carnegie Mellon University, May 2008.

Google Scholar