TY - GEN
T1 - Adversarial models and resilient schemes for network coding
AU - Nutman, Leah
AU - Langberg, Michael
PY - 2008
Y1 - 2008
N2 - In a recent paper, Jaggi et al. [10], presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three, arguably realistic, models. In each of the models, we present a distributed scheme that demonstrates the usefulness of the model. In particular, all of the schemes obtain optimal rate C - z, where C is the network capacity and z is a bound on the number of links controlled by the adversary.
AB - In a recent paper, Jaggi et al. [10], presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three, arguably realistic, models. In each of the models, we present a distributed scheme that demonstrates the usefulness of the model. In particular, all of the schemes obtain optimal rate C - z, where C is the network capacity and z is a bound on the number of links controlled by the adversary.
UR - http://www.scopus.com/inward/record.url?scp=52349090766&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4594970
DO - 10.1109/ISIT.2008.4594970
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:52349090766
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 171
EP - 175
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -