Abstract
An erasure correcting scheme is rateless if it is designed to tolerate any pattern of packet loss and reveal the information sent after certain number of packets are received. On one hand, transmissions schemes that use rateless erasure correcting usually do not use feedback channel, however they may require additional significant amount of processing in both the sender and the receiver sides. On the other hand, automatic repeated request (ARQ) protocols use
feedback channel to assist the sender and usually do not 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 and memory required at the receiver, and therefore may fit 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 through the
entire transmission process
feedback channel to assist the sender and usually do not 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 and memory required at the receiver, and therefore may fit 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 through the
entire transmission process
Original language | English |
---|---|
Title of host publication | PODC '04 |
Subtitle of host publication | Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing |
Publisher | Association for Computing Machinery |
Pages | 393 |
Number of pages | 1 |
ISBN (Print) | 9781581138023 |
DOIs | |
State | Published - Jun 2004 |
Keywords
- Stochastic processes
- Combinatorics
- information theory
- Erasure Codes
- data-link
- transport-layer
- Peer-to-peer.