The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - Feb. (2013 vol.24)
pp: 275-287
Kien Nguyen , Oregon State University, Corvallis
Thinh Nguyen , Oregon State University, Corvallis
Yevgeniy Kovchegov , Oregon State University, Corvallis
Viet Le , Oregon State University, Corvallis
ABSTRACT
We propose a distributed data replenishment mechanism for some distributed peer-to-peer-based storage systems that automates the process of maintaining a sufficient level of data redundancy to ensure the availability of data in presence of peer departures and failures. The dynamics of peers entering and leaving the network are modeled as a stochastic process. A novel analytical time-backward technique is proposed to bound the expected time for a piece of data to remain in P2P systems. Both theoretical and simulation results are in agreement, indicating that the data replenishment via random linear network coding (RLNC) outperforms other popular strategies. Specifically, we show that the expected time for a piece of data to remain in a P2P system, the longer the better, is exponential in the number of peers used to store the data for the RLNC-based strategy, while they are quadratic for other strategies.
INDEX TERMS
Peer to peer computing, Redundancy, Bandwidth, Maintenance engineering, Distributed databases, Games, Network coding, network coding, Stochastic process, absorption time, distributed storage
CITATION
Kien Nguyen, Thinh Nguyen, Yevgeniy Kovchegov, Viet Le, "Distributed Data Replenishment", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 2, pp. 275-287, Feb. 2013, doi:10.1109/TPDS.2012.115
REFERENCES
[1] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content Addressable Network," Proc. ACM SIGCOMM, Aug. 2001.
[2] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, Sept. 2001.
[3] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
[4] D.G. Andersen, "Resilient Overlay Networks," master's thesis, Massachusetts Inst. of Tech nology, 2001.
[5] http:/www.bittorrents.com, 2012.
[6] http:/www.kazaa.com, 2012.
[7] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms, Nov. 2001.
[8] A. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel, "Scribe: The Design of a Large-Scale Event Notification Infrastructure," Proc. Third Int'l Cost264 Workshop Networked Group Comm. (NGC), Nov. 2001.
[9] A. Gupta, D. Agrawal, and A. Abbadi, "Approximate Range Selection Queries in Peer-to-Peer Systems," Proc. VLDB Conf. Innovative Data Research, 2003.
[10] K. Sankaralingam, S. Sethumadhavan, and J.C. Browne, "A Peer-to-Peer Framework for Caching Range Queries," Proc. IEEE Int'l Symp. High-Performance Distributed Computing, June 2003.
[11] C. Schmidt and M. Parashar, "Flexible Information Discovery in Decentralized Distributed Systems," Proc. IEEE Int'l Symp. High-Performance Distributed Computing, June 2003.
[12] O. Sahin, A. Gupta, D. Agrawal, and A. Abbadi, "A Peer-to-Peer Framework for Caching Range Queries," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2004.
[13] S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weahterspoon, and J. Kubiatowicz, "Maintenance-Free Global Data Storage," IEEE Internet Computing, vol. 5, no. 5, pp. 40-49, Sept./Oct. 2001.
[14] K. Nguyen, T. Nguyen, and S.-C. Cheung, "Video Streaming with Network Coding," J. Signal Processing Systems, vol. 59, pp. 319-333, 2010.
[15] K. Nguyen, T. Nguyen, and Y. Kovchegov, "A P2P Video Delivery Network (P2P-Vdn)," Proc. Int'l Conf. Computer and Comm. Networks, pp. 1-7, 2009.
[16] S. Acendanski, S. Deb, M. Medard, and R. Koetter, "How Good Is Random Linear Coding Based Distributed Networked Storage?" Proc. First Workshop Network Coding (NetCod), 2005.
[17] A.G. Dimakis, P.B. Godfrey, Y. Wu, M.J. Wainwright, and K. Ramchandran, "Network Coding for Distributed Storage Systems," IEEE Trans. Information Theory, vol. 56, no. 9, pp. 4539-4551, Sept. 2010.
[18] A.G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized Erasure Codes for Distributed Networked Storage," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2809-2816, June 2006.
[19] A.G. Dimakis, P.B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network Coding for Distributed Storage Systems," IEEE Trans. Information Theory, vol. 56, no. 9, pp. 4539-4551, Sept. 2010.
[20] R. Ahlswede, N. Cai, R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, pp. 1204-1216, July 2000.
[21] A.G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A Survey on Network Codes for Distributed Storage," Proc. IEEE, vol. 99, no. 3, pp. 476-489, Mar. 2011.
[22] Y. Wu and A.G. Dimakis, "Reducing Repair Traffic for Erasure Coding-Based Storage via Interference Alignment," Proc. IEEE Int'l Conf. Symp. Information Theory (ISIT '09), vol. 4, pp. 2276-2280, 2009.
[23] Y. Wu, R. Dimakis, and K. Ramch, "Deterministic Regenerating Codes for Distributed Storage," Proc. Allerton Conf. Control, Computing, and Comm., 2007.
[24] Y. Wu, "Existence and Construction of Capacity-Achieving Network Codes for Distributed Storage," IEEE J. Selected Areas Comm., vol. 28, pp. 277-288, Feb. 2010.
[25] J. Li, S. Yang, X. Wang, and B. Li, "Tree-Structured Data Regeneration in Distributed Storage Systems with Regenerating Codes," Proc. IEEE INFOCOM '10, pp. 2892-2900, 2010.
[26] A. Duminuco and E. Biersack, "A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems," Proc. IEEE 29th Int'l Conf. Distributed Computing Systems (ICDCS '09), pp. 376 -384, 2009.
[27] S. Pawar, S.Y. El Rouayheb, and K. Ramchandran, "Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks," CoRR, vol. abs/1009.2556, 2010.
[28] S. Lin and D. Costello, Error Control Coding, second ed. Prentice Hall, 2004.
[29] S. Wicker, Error Control Systems for Digital Communication and Storage. Prentice Hall, 1994.
[30] T. Ho, M. Medard, R. Koetter, D.R. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Trans. Information Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool