Brief announcement: RT oblivious erasure correcting

Amos Beimel; Shlomi Dolev; Noam Singer

doi:10.1145/1011767.1011856

Brief announcement: RT oblivious erasure correcting

Amos Beimel
, Shlomi Dolev
, Noam Singer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

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	https://doi.org/10.1145/1011767.1011856
State	Published - Jun 2004

Keywords

Stochastic processes
Combinatorics
information theory
Erasure Codes
data-link
transport-layer
Peer-to-peer.

Access to Document

10.1145/1011767.1011856

Cite this

@inproceedings{84a87a859ba0430cab548566c7fea822,

title = "Brief announcement: RT oblivious erasure correcting",

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",

keywords = "Stochastic processes, Combinatorics, information theory, Erasure Codes, data-link, transport-layer, Peer-to-peer.",

author = "Amos Beimel and Shlomi Dolev and Noam Singer",

year = "2004",

month = jun,

doi = "10.1145/1011767.1011856",

language = "English",

isbn = "9781581138023",

pages = "393",

booktitle = "PODC '04",

publisher = "Association for Computing Machinery",

address = "United States",

}

TY - GEN

T1 - Brief announcement

T2 - RT oblivious erasure correcting

AU - Beimel, Amos

AU - Dolev, Shlomi

AU - Singer, Noam

PY - 2004/6

Y1 - 2004/6

N2 - 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

AB - 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

KW - Stochastic processes

KW - Combinatorics

KW - information theory

KW - Erasure Codes

KW - data-link

KW - transport-layer

KW - Peer-to-peer.

U2 - 10.1145/1011767.1011856

DO - 10.1145/1011767.1011856

M3 - Conference contribution

SN - 9781581138023

SP - 393

BT - PODC '04

PB - Association for Computing Machinery

ER -

Brief announcement: RT oblivious erasure correcting

Abstract

Keywords

Access to Document

Fingerprint

Cite this