needed to view most of the images on this Web site - just a couple of clicks and you're "good to go."
Welcome
Photos of Larryblakeley
http://www.royblakeley.name/larry_blakeley/larryblakeley_photos_jpeg.htm
(Contact Info: larry at larryblakeley dot com)
Important Note: You will need to click this icon to download the free needed to view most of the images on this Web site - just a couple of clicks and you're "good to go."
I manage this Web site and the following Web sites: Leslie (Blakeley) Adkins - my oldest daughter
Lori Ann Blakeley (June 20, 1985 - May 4, 2005) - my middle daughter
Evan Blakeley- my youngest child
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.
Network management for protection and restoration in the case of failures has generally been considered in an "ad hoc" manner, within the context of specific schemes. These schemes are predominately routing schemes, and the use of network coding, which in contrast to routing allows a network node to form outgoing data from incoming data in an arbitrary fashion and possibly involving network management signals, to described them may at first appear superfluous. However, it will turn out that enlarging the set of allowed operations at network nodes not only opens new and fruitful ways to protect networks, but the framework also naturally integrates traditional, well-known solutions to the problem of robust networks.
As the complexity of networks increases, so do the network management overhead and the catastrophic effects of imperfect network management. It is thus useful to understand network management in a fundamental way. We have proposed a framework for considering and quantifying network management, seeking through our abstraction not to replace implementation, but to guide it.
- "An Information-Theoretic View of Network Management," Tracey Ho (Member IEEE) http://web.mit.edu/trace/www/, Muriel Medard (Senior Member IEEE) http://www.mit.edu/~medard/medard.html, Ralf Koetter (Member, IEEE) http://www.comm.csl.uiuc.edu/~koetter/, IEEE Transactions on Information Theory, Volume 51, Number 4, April 2005 Digital Object Identifier (DOI) 10.1109/TIT.2005.844062 http://web.mit.edu/trace/www/management.pdf
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) homepage here http://www.ieee.org/portal/site
Directory: http://www.larryblakeley.com/Articles/p2p/
File Name: tracey_ho_muriel_medard_ralf_koetter200504.pdf
Post Date: March 18, 2005 at 10:30 AM CST; 1630 GMT