Communication on a network can be described by codes specifying the behavior of the network nodes s i.e the relationships between the signals on each node's incoming and outgoing links. Link failure recovery may require some of these relationships to change. The network management information needed to effect the appropriate changes in network behavior for recovery can be quantified by the number of different codes needed. In this paper, we focus on linear codes for delay-free acyclic networks, with a single receiver node and one or more source nodes. We 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 s and the management requirement is taken as the log of the number of such codes that the network may switch among. For this formulation s we give tight upper and lower bounds on network management for receiver-based and network-wide recovery from all single link failures, assuming they are recoverable. The second is a node-based formu- lation where the management requirement is taken as the sum over all nodes of the log of the number of different behaviors for each node. We show that the minimum node-based management requirement for terminal link failures and the no-failure scenario is achieved with receiver-based schemes
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.