Differentiated data persistence with priority random linear codes

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2007, Pages

  Lin, Yunfeng ^a   Li, Baochun ^a   Liang, Ben ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; SENSOR NETWORKS; SERVERS;

NODE DYNAMICS; PRE-DISTRIBUTION PROTOCOLS; RANDOM LINEAR CODES;

CODES (SYMBOLS);

EID: 34848916088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2007.99     Document Type: Conference Paper

References (23)

1. S. Acedanski, S. Deb, M. Medard, and R. Koetter. How Good is Random Linear Coding Based Distributed Networked Storage? In NetCod, 2005.
2. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
3. A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan. Priority Encoding Transmission. IEEE Transactions on Information Theory, 42(6): 1737-1744, Nov. 1996.
4. J. Byers, J. Considine, and M. Mitzenmacher. Geometric Generalizations of the Power of Two Choices. In ACM SPAA, 2004.
5. P. A. Chou, Y. Wu, and K. Jain. Practical Network Coding. In Allerton, 2003.
6. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran. Network Coding for Distributed Storage Systems. In Proc. of IEEE INFOCOM, 2007.
7. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran. Decentralized Erasure Codes for Distributed Networked Storage. IEEE Transactions on Information Theory, 2006.
8. T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros. The Benefits of Coding over Routing in a Randomized Setting. In Proc. of IEEE International Symposium on Information Theory, 2003.
9. K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, second edition, 1971.
10. A. Kamra, J. Feldman, V. Misra, and D. Rubenstein. Growth Codes: Maximizing Sensor Network Data Persistence. In Proc. of ACM SIGCOMM, 2006.
11. B. Karp and H. T. Kung. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In ACMMOBICOM, 2000.
12. R. Koetter and M. Medard. An Algebraic Approach to Network Coding. IEEE/ACM Transactions on Networking, 11(5):782-795, October 2003.
13. P. Kontkanen and P. Myllymaki. Computing the Regret Table for Multinomial Data. Technical report, Helsinki Institute for Information Technology, 2005.
14. Y. Lin, B. Li, and B. Liang. Differentiated Data Persistence with Priority Random Linear Codes. Technical report, http://iqua.ece.toronto.edu/ papers/priorityencoding.pdf, ECE, University of Toronto, Dec. 2006.
15. Y Lin, B. Liang, and B. Li. Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes. In Proc. of IEEE INFOCOM, 2007.
16. J. Liu, M. Adler, D. Towsley, and C. Zhang. On Optimal Communication Cost for Gathering Correlated Data through Wireless Sensor Networks. In ACM MOBICOM, 2006.
17. P. Maymounkov, N. J. A. Harvey, and D. S. Lun. Methods for Efficient Network Coding. In Allerton, 2006.
18. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
19. K. Sayood. Introduction to Data Compression. Morgan Kaufmann, third edition, 2006.
20. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In ACM SIGCOMM, 2001.
21. D. Wang, Q. Zhang, and J. Liu. Partial Network Coding for Continuous Data Collection in Sensor Networks. In IWQoS, 2006.
22. W Wang and K. Ramchandran. Random Distributed Multiresolution Representations with Significance Querying. In IPSN, 2006.
23. C. Wu and B. Li. Echelon: Peer-to-Peer Network Diagnosis with Network Coding. In Proc. of IWQoS, 2006.