Adversarial Models and Resilient Schemes for Network Coding

Details Adversarial Models and Resilient Schemes for Network Coding Adversarial Models and Resilient Schemes for Network Coding

2008-01-04

arxiv.org/abs/0801.0701v2

Computer Science

Information Theory

Second version includes minor editing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Adversarial Models and Resilient Schemes for Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adversarial Models and Resilient Schemes for Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adversarial Models and Resilient Schemes for Network Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379785