The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2009 vol.20)
pp: 1653-1667
Yunfeng Lin , University of Toronto, Toronto
Ben Liang , University of Toronto, Toronto
Baochun Li , University of Toronto, Toronto
ABSTRACT
Node churn and failures exist as fundamental characteristics in both peer-to-peer (P2P) and sensor networks. Peers in P2P networks are highly dynamic, whereas sensors are not dependable. As such, maintaining the persistence of periodically measured data in a scalable fashion has become a critical challenge in such systems, without the use of centralized servers. To better cope with node dynamics and failures, we propose priority random linear codes (RLCs), as well as their affiliated predistribution protocols, to maintain measurement data in different priorities, such that critical data have a higher opportunity to survive node failures than data of less importance. A salient feature of priority RLCs is the ability to partially recover more important subsets of the original data with higher priorities, when it is not feasible to recover all of them due to node dynamics. We present extensive analytical and experimental results to show the effectiveness of priority RLCs.
INDEX TERMS
Distributed networks, distributed applications, distributed priority coding, random linear codes.
CITATION
Yunfeng Lin, Ben Liang, Baochun Li, "Priority Random Linear Codes in Distributed Storage Systems", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 11, pp. 1653-1667, November 2009, doi:10.1109/TPDS.2008.251
REFERENCES
[1] Y. Lin, B. Li, and B. Liang, “Differentiated Data Persistence with Priority Random Linear Codes,” Proc. 27th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2007.
[2] 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.
[3] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[4] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, 2000.
[5] W. Wang and K. Ramchandran, “Random Distributed Multiresolution Representations with Significance Querying,” Proc. Fifth Int'l Symp. Information Processing in Sensor Networks (IPSN), 2006.
[6] K. Sayood, Introduction to Data Compression, third ed. Morgan Kaufmann, 2006.
[7] T. Ho, R. Koetter, M. Medard, D.R. Karger, and M. Effros, “The Benefits of Coding over Routing in a Randomized Setting,” Proc. IEEE Int'l Symp. Information Theory (ISIT), 2003.
[8] K. Hoffman and R. Kunze, Linear Algebra, second ed. Prentice Hall, 1971.
[9] P. Kontkanen and P. Myllymaki, “Computing the Regret Table for Multinomial Data,” technical report, Helsinki Inst. for Information Tech nology, 2005.
[10] M. de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer, 2000.
[11] J. Byers, J. Considine, and M. Mitzenmacher, “Geometric Generalizations of the Power of Two Choices,” Proc. 16th Ann. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2004.
[12] M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, 2005.
[13] J. Liu, M. Adler, D. Towsley, and C. Zhang, “On Optimal Communication Cost for Gathering Correlated Data through Wireless Sensor Networks,” Proc. ACM MobiCom, 2006.
[14] A. Kamra, J. Feldman, V. Misra, and D. Rubenstein, “Growth Codes: Maximizing Sensor Network Data Persistence,” Proc. ACM SIGCOMM, 2006.
[15] D. Wang, Q. Zhang, and J. Liu, “Partial Network Coding for Continuous Data Collection in Sensor Networks,” Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS), 2006.
[16] Y. Lin, B. Liang, and B. Li, “Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes,” Proc. IEEE INFOCOM, 2007.
[17] S. Acedanski, S. Deb, M. Medard, and R. Koetter, “How Good is Random Linear Coding Based Distributed Networked Storage?” Proc. First Workshop Network Coding, Theory, and Applications (NetCod), 2005.
[18] C. Wu and B. Li, “Echelon: Peer-to-Peer Network Diagnosis with Network Coding,” Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS), 2006.
[19] A.G. Dimakis, P.B. Godfrey, M. Wainwright, and K. Ramchandran, “Network Coding for Distributed Storage Systems,” Proc. IEEE INFOCOM, 2007.
[20] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, “Network Information Flow,” IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[21] R. Koetter and M. Medard, “An Algebraic Approach to Network Coding,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
[22] P.A. Chou, Y. Wu, and K. Jain, “Practical Network Coding,” Proc. 41st Ann. Allerton Conf. Comm., Control and Computing, Oct. 2003.
[23] P. Maymounkov, N.J.A. Harvey, and D.S. Lun, “Methods for Efficient Network Coding,” Proc. 44th Ann. Allerton Conf. Comm., Control and Computing, 2006.
[24] A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority Encoding Transmission,” IEEE Trans. Information Theory, vol. 42, no. 6, pp. 1737-1744, Nov. 1996.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool