RT oblivious erasure correcting

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1321-1332

  Beimel, Amos ^a   Dolev, Shlomi ^a   Singer, Noam ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Cisco Networks ^*

Author keywords

ARQ; Automatic repeat request; Combinatorics; Data link; Information theory; Stochastic processes; Transport layer

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR CORRECTION; FEEDBACK; PACKET LOSS; RANDOM PROCESSES; REAL TIME SYSTEMS;

AUTOMATIC REPEAT REQUEST; FEEDBACK CHANNEL; TRANSPORT LAYER;

DATA COMMUNICATION SYSTEMS;

EID: 37549052103     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.896540     Document Type: Article

References (21)

1. The ATM Forum [Online]. Available: http://www.atmforum.com
2. Gigabit Ethernet Alliance [Online]. Available: http:// www.gigabit-ethernet.org
3. A.S. Tanenbaum, Computer Networks, 4th ed. Englewood Cliffs, NJ: Prentice Hall, 2000.
4. J. Blömer, M. Kalfane, M. Karpinski, R. Karp, M. G. Luby, and D. Zuckerman, "An XOR-based erasure-resilient coding scheme," ICSI, Tech. Rep. 95-048, 1995.
5. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th Annu. ACM Symp. Theory of Computing, 1997, pp. 150-159.
6. M. G. Luby, M. Mitzenmacher, and M. A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 364-373.
7. J. W. Byers, M. G. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads," in Proc. IEEE INFOCOM, 1999, pp. 275-283.
8. S. Dolev, B. Fitingof, A. Melkman, and O. Tubman, "Smooth and adaptive forward erasure correcting," Computer Networks, vol. 36, pp. 343-355, 2001.
9. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, 2001.
10. M. G. Luby, "LT codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science, 2002, pp. 271-282.
11. P. Maymounkov and D. Mazières, "Rateless codes and big downloads," presented at the 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS03), Berkeley, CA, 2003.
12. J. W. Byers, M. G. Luby, M. Mitzenmacher, and A. Rege, "Digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM, 1998, pp. 56-67.
13. I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. SIAM, vol. 8, pp. 300-304, 1960.
14. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, 2006.
15. P. Maymounkov, "Online codes," NYU, Tech. Rep. TR2002-833, 2002.
16. D. S. Lun, M. Medard, and M. Effros, "On coding for reliable communication over packet networks," in Proc. 42nd Annu. Allerton Conf. Communication, Control and Computing, 2004.
17. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
18. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, A Foundation for Computer Science, 2nd ed. Reading, MA: Addison-Wesley, 1998.
19. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
20. L. Rizzo, "Effective erasure codes for reliable computer communication protocols," ACM Comput. Commun. Rev., vol. 27, no. 2, pp. 24-36, 1997.
21. L. Rizzo and L. Vicisano, "A reliable multicast data distribution protocol based on software FEC techniques," in 4th IEEE Workshop Architecture and Implementation of High Performance Communication Systems (HPCS'97), Sani Beach, Chalkidiki, Greece, Jun. 1997.