Adversarial Models and Resilient Schemes for Network Coding
| dc.creator | Nutman, Leah | |
| dc.creator | Langberg, Michael | |
| dc.date | 2008-01-04 | |
| dc.date | 2008-02-06 | |
| dc.date.accessioned | 2026-07-07T09:18:44Z | |
| dc.date.available | 2026-07-07T09:18:44Z | |
| dc.description | In a recent paper, Jaggi et al. (INFOCOM 2007), 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. | |
| dc.description | Second version includes minor editing | |
| dc.identifier | https://arxiv.org/abs/0801.0701 | |
| dc.identifier | http://arxiv.org/abs/0801.0701 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154131 | |
| dc.subject | Information Theory | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | Adversarial Models and Resilient Schemes for Network Coding | |
| dc.type | text |