Computer Science – Information Theory
Scientific paper
2009-05-12
Computer Science
Information Theory
Scientific paper
Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been done to protect against link and node failures, and to provide reliable solutions based on pre-defined provision or dynamic restoration of the domain. In this paper we develop network protection strategies against multiple link failures using network coding and joint capacities. In these strategies, the source nodes apply network coding for their transmitted data to provide backup copies for recovery at the receivers' nodes. Such techniques can be applied to optical, IP, and mesh networks. The encoding operations of protection codes are defined over finite fields. Furthermore, the normalized capacity of the communication network is given by $(n-t)/n$ in case of $t$ link failures. In addition, a bound on the minimum required field size is derived.
Aly Salah A.
Kamal Ahmed E.
No associations
LandOfFree
Encoding of Network Protection Codes Against Link and Node Failures Over Finite Fields 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 Encoding of Network Protection Codes Against Link and Node Failures Over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encoding of Network Protection Codes Against Link and Node Failures Over Finite Fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-336852