RT oblivious erasure correcting

被引:67
作者
Beimel, Amos [1 ]
Dolev, Shlomi [1 ]
Singer, Noam
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
基金
美国国家科学基金会;
关键词
ARQ; combinatorics; data-link; information theory; stochastic processes; transport layer;
D O I
10.1109/TNET.2007.896540
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An erasure correcting scheme is rateless if it- is designed to tolerate any pattern of packet loss and reveal the transmitted information after a certain number of packets is received. On the one hand, transmission schemes that use rateless erasure correcting schemes do not usually use a feedback channel. However, they may require significant amount of additional processing by both the sender and the receiver. On the other hand, automatic repeated request protocols use a feedback channel to assist the sender, and do not usually require information processing. In this work we. present a combined approach, where a lean feedback channel is used to assist the sender to efficiently transmit the information. Our Real-Time oblivious approach minimizes the processing time and the memory requirements of the receiver and, therefore, fits a variety of receiving devices. In addition, the transmission is real-time where the expected number of original packets revealed when a packet is received is approximately the same throughout the entire transmission process. We use our end-to-end scheme as a base for broadcast (and multicast) schemes. An overlay tree structure is used to convey the information to a large number of receivers. Moreover, the receivers may download the information from a number of senders or even migrate from one sender to another.
引用
收藏
页码:1321 / 1332
页数:12
相关论文
共 19 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
BLOMER J, 1995, 95048 ICSI
[3]  
BYERS J, 1998, P ACM SIGCOMM 98 VAN, P56
[4]   Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads [J].
Byers, JW ;
Luby, M ;
Mitzenmacher, M .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :275-283
[5]   Smooth and adaptive forward erasure correcting [J].
Dolev, S ;
Fitingof, B ;
Melkman, A ;
Tubman, O .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2001, 36 (2-3) :343-355
[6]  
GRAHAM RL, 1998, CONCRETE MATH FDN CO, P33113
[7]  
Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950
[8]  
Luby M., 1998, P 9 ANN ACM SIAM S D, P364
[9]  
Luby M., 1997, STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, P150, DOI 10.1145/258533.258573
[10]   Efficient erasure correcting codes [J].
Luby, MG ;
Mitzenmacher, M ;
Shokrollahi, MA ;
Spielman, DA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :569-584