Decentralized erasure codes for distributed networked storage

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2809-2816

  Dimakis, Alexandros G ^a   Prabhakaran, Vinod ^a   Ramchandran, Kannan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Decentralized erasure codes; Distributed storage; Network coding; Wireless networks

Indexed keywords

CODES (SYMBOLS); DATA STORAGE EQUIPMENT; ENCODING (SYMBOLS); GRAPH THEORY; RANDOM PROCESSES;

DATA COLLECTOR; DATA SOURCES; DECENTRALIZED ERASURE CODES; DISTRIBUTED NETWORKED STORAGE; NETWORK CODING; WIRELESS NETWORK;

TELECOMMUNICATION NETWORKS;

EID: 33745180496     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.874535     Document Type: Article

References (29)

1. S. Acedanski, S. Deb, M. Médard, and R. Koetter, "How good is random linear coding based distributed networked storage?," NetCod, 2005.
2. R. Ahlswede, N. Cai, R. Li S.-Y, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 155-170, Jan. 2000.
3. B. Bollóbas, Modern Graph Theory. New York: Springe-Verlagr, 2000.
4. B. Bollóbas, Random Graphs, Second ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.
5. W. A. Burkhard and J. Menon, "Disk array storage system reliability," in Proc. 23rd Int. Symp. Fault-Tolerant Computing, 1993.
6. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
7. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "Networked Slepian-Wolf: Theory, algorithms, and scaling laws," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4057-4073, Dec. 2005.
8. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes," in Proc. IEEE/ACM Int. Symp. Inf. Process. Sensor Networks (IPSN), 2005.
9. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Distributed data storage in sensor networks using decentralized erasure codes," in Proc. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2004.
10. P. Erdós and A. Rényi, "On random matrices," Publ. Math. Inst. Hungar. Acad. Sci., 1964.
11. C. Fragouli, J. Y. Le Boudec, and J. Widmer, "Network coding: An instant primer," ACM SIGCOMM Comp. Comm. Rev., Jan. 2006.
12. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., no. 5, pp. 782-795, Oct. 2003.
13. D. Ganesan, R. Cristescu, and B. Berefull-Lozano, "Power-efficient sensor placement and transmission structure for data gathering under distortion constraints, symposium on information processing in sensor networks," in Proc. IEEE/ACM Int. Symp. Inf. Process. Sensor Networks (IPSN), 2004.
14. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. Int. Symp. Inf.ormation Theory , Yokohama, Japan, Jun./Jul. 2003.
15. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Invited Paper, 41st Allerton Annu. Conf. Communications, Control and Computing, Monticello, IL, Oct. 2003.
16. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, submitted for publication.
17. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, "Oceanstore: An architecture for global-scale persistent storage," Proc. ACM ASPLOS, Nov. 2000.
18. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
19. M. Luby, "LT codes," in Proc. IEEE Conf. Foundations of Computer Science, 2002.
20. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
21. Report. [Online]. Available: http://www.comm.csl.uiuc.edu/~koetter/NWC/
22. J. S. Plank and M. G. Thomason, "A practical analysis of low-density parity-check erasure codes for wide-area storage applications," in Proc. 2004 Int. Conf. Dependable Syst. Netw., 2004, pp. 101-110.
23. S. S. Pradhan and K. Ramchandran, "Distributed source coding using syndromes (DISCUS): Design and construction," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 626-643, Mar. 2003.
24. M. O. Rabin, "Efficient dispersal of information for security, load balancing and fault tolerance," J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
25. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2410-2423, Jun. 2006.
26. M. Raab and A. Steger, "Balls into bins - A simple and tight analysis," in Proc. Second Int. Workshop Randomization Approximation Techn. Comp. Sci., 1998, pp. 159-170.
27. A. Ramamoorthy, K. Jain, P. A. Chou, and M. Effros, "Separating distributed source coding from network coding," in Proc. 42nd Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2004.
28. D. H. Wiedemann, "Solving sparse linear equations over finite fields," IEEE Trans. Inf. Theory, vol. IT-32, no. 1, pp. 54-62, Jan. 1986.
29. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.