Encoding of Network Protection Codes Against Link and Node Failures Over Finite Fields
Salah A. Aly, Ahmed E. Kamal

TL;DR
This paper proposes network protection strategies against multiple link failures using network coding over finite fields, enhancing reliability and capacity in optical, IP, and mesh networks.
Contribution
It introduces new coding-based protection schemes for multiple link failures and derives bounds on the necessary finite field size for implementation.
Findings
Normalized capacity is (n-t)/n under t link failures.
Protection codes are defined over finite fields.
A lower bound on the required finite field size is established.
Abstract
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 in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Caching and Content Delivery · Advanced Wireless Communication Technologies
