Protection against link errors and failures using network coding

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

The first version of this paper was accepted by IEEE Intl' Symp. on Info. Theo. 2009. The second version of this paper is subm

Scientific paper

We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The network consists of a set of bidirectional primary path connections that carry the uncoded traffic. The end nodes of the bidirectional connections are connected by a set of shared protection paths that provide the redundancy required for protection. Such protection strategies are employed in the domain of optical networks for recovery from failures. In this work we consider the problem of simultaneous protection against adversarial errors and failures. Suppose that n_e paths are corrupted by the omniscient adversary. Under our proposed protocol, the errors can be corrected at all the end nodes with 4n_e protection paths. More generally, if there are n_e adversarial errors and n_f failures, 4n_e + 2n_f protection paths are sufficient. The number of protection paths only depends on the number of errors and failures being protected against and is independent of the number of unicast connections.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Protection against link errors and failures using 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 Protection against link errors and failures using network coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protection against link errors and failures using network coding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-399819

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.