Reserving Resilient Capacity in a Network
SIAM Journal on Discrete Mathematics
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Cycle-logical treatment for "Cyclopathic" networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Information Theory and Network Coding
Information Theory and Network Coding
Network Coding Fundamentals
Network coding-based protection of many-to-one wireless flows
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Network Coding: An Introduction
Network Coding: An Introduction
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
An Algebraic Approach to Link Failures Based on Network Coding
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Realization strategies of dedicated path protection: A bandwidth cost perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We consider the problem of establishing reliable unicast connections across a communication network with nonuniform edge capacities. Our goal is to provide instantaneous recovery from single edge failures. With instantaneous recovery, the destination node can decode the packets sent by the source node even if one of the network edges fails, without the need of retransmission or rerouting. It has been recognized that the network coding technique offers significant advantages for this problem over standard solutions such as disjoint path routing and diversity coding. We focus on two cases of practical interest: 1) backup protection of a single flow that can be split into two subflows; and 2) shared backup protection of two unicast flows. We present an efficient network coding algorithm that operates over a small finite field (GF(2)). The small size of the underlying field results in a significant reduction in the computational and communication overhead associated with the practical implementation of the network coding technique. Our algorithm exploits the unique structure of minimum coding networks, i.e., networks that do not contain redundant edges. We also consider the related capacity reservation problem and present an approximation algorithm that finds a solution whose cost is at most two times more than the optimum.