Trim Down Redundant Transmission in Data Synchronization

Abstract:

Data synchronization distributes data to users of various configurations, and poses many challenges in today’s collaborative networks. In this paper, we propose a data synchronization scheme to reduce the finish time of distributing data with the understanding that users are free to join late or leave, which is common if the desired data is received. Our scheme involves a heuristic algorithm to push-and-pull segments of data. The numerical results yield significant lesser finish time than the conventional P2P approaches. Besides, there are no redundant transmissions and no need of searching data pieces in our approach, which help to reduce the network traffic and receiving time of data.

• Periodical: Applied Mechanics and Materials (Volumes 284-287)
• Pages: 2789-2793
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.284-287.2789
• Online since: January 2013
• Authors: Chun Hao Wen, Richard Chun Hung Lin
• Keywords: Cloud, Data Availability, Data Synchronization, P2P, Redundant Transmission

References

[1] S. Al-Kiswany, M. Ripeanu, A. Iamnitchi, and S. Vazhkudai: Are P2P Data-Dissemination Techniques Viable in Todays Data-Intensive Scientific Collaborations, Proc. of 13th European International Conference on Parallel Processing (Euro-Par) , (2007).

DOI: 10.1007/978-3-540-74466-5_44

[2] J. Xu, A. Kumar, and X. Yu: On the Fundamental Tradeoffs Between Routing Table Size and Network Diameter in Peer-to-Peer Networks, IEEE Journal on Selected Areas in Communications, (2004), vol. 22, no. 1, p.151–163.

DOI: 10.1109/jsac.2003.818805

[3] A. Kumar, S. Merugu, J. Xu, and X. Yu: Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network, European Transaction on Telecommunications, (2004), vol. 15, no. 6, p.571–587.

DOI: 10.1002/ett.1013

[4] D. England, B. Veeravalli, and J. Weissman: A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments, IEEE Transactions On Parallel and Distributed Systems, (2007), vol. 18, no. 5, p.608–620.

DOI: 10.1109/tpds.2007.1032

[5] V. Pla, J. Martinez-Bauset, and V. Casares-Giner: Efficient Computation of Optimal Capacity in Multiservice Mobile Wireless Networks, Performance Modelling and Analysis of Heterogeneous Networks, (2009), vol. 199, no. 214, p.199.

DOI: 10.1201/9781003339052-15

[6] Bittorrent protocol specification v1. 0: information on http: /wiki. theory. org/BitTorrentSpecification.

[7] G. M. Ezovski, A. Tang, and L. L. H. Andrew: Minimizing Average Finish Time in P2P Networks, Proc. of 28th IEEE International Conference on Computer Communications, (2009), p.594–602.

DOI: 10.1109/infcom.2009.5061966

[8] J. Mundinger, R. Weber and G. Weiss: Analysis of peer-to-peer filedissemination amongst users of different upload capacities. ACM SIGMETRICS Performance Evaluation Review, vol. 34, no. 2, pp.5-6, September (2006).

DOI: 10.1145/1168134.1168138

[9] Microsoft research simulator for the bittorrent protocol: information on http: /research. microsoft. com/en-us/downloads/20d68689-9a8d-44c0-80cd-66dfa4b0504b.

[10] A. Farzad and H. R. Rabiee, Modeling Topological Characteristics of BitTorrent-Like Peer-to-Peer Networks, IEEE Communication Letters, (2011), vol. 15, no. 8, p.896–898.

DOI: 10.1109/lcomm.2011.062711.110872