Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
Network coding theory: single sources
Communications and Information Theory
Foundations and Trends® in Networking
One family of algebraic codes for network coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Design of efficient robust network codes for multicast connections
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Algebraic codes for network coding
Problems of Information Transmission
Distributed algorithms for minimum cost multicast with network coding
IEEE/ACM Transactions on Networking (TON)
Network coding: an excellent approach for overloaded communication era
WSEAS TRANSACTIONS on COMMUNICATIONS
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
A practical network coding and routing scheme based on maximum flow combination
International Journal of Network Management
Hi-index | 754.84 |
We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we describe the input-output relations of network nodes in terms of network codes. This very general concept of network behavior as a code provides a way to quantify essential management information as that needed to switch among different codes (behaviors) for different failure scenarios. We compare two types of recovery schemes, receiver-based and network-wide, and consider two formulations for quantifying network management. The first is a centralized formulation where network behavior is described by an overall code determining the behavior of every node, and the management requirement is taken as the logarithm of the number of such codes that the network may switch among. For this formulation, we give bounds, many of which are tight, on management requirements for various network connection problems in terms of basic parameters such as the number of source processes and the number of links in a minimum source-receiver cut. Our results include a lower bound for arbitrary connections and an upper bound for multitransmitter multicast connections, for linear receiver-based and network-wide recovery from all single link failures. The second is a node-based formulation where the management requirement is taken as the sum over all nodes of the logarithm of the number of different behaviors for each node. We show that the minimum node-based requirement for failures of links adjacent to a single receiver is achieved with receiver-based schemes.