Simple Network Codes for Instantaneous Recovery from Edge Failures in Unicast Connections
نویسندگان
چکیده
We consider the problem of establishing reliable unicast connections in the presence of edge failures. In this problem, a source node s needs to deliver h packets to the destination node t, even if one of the edges in the network fails. We apply the the technique of network coding in order to guarantee an instantaneous recovery from edge failures. Focusing on the case of h = 2, we show that the underlying communication network has an elegant combinatorial structure which enables design of efficient network codes over GF (2).
منابع مشابه
Multicast 1+1 protection: The case for simple network coding
We discuss how the idea of unicast 1+1 protection can be efficiently extended to protect multicast connections in optical backbone networks. Particularly, we show how to achieve instantaneous failure recovery and cost efficiency by allowing intermediate nodes to merge their incoming flows by a simple network code, i.e., logical OR operation. Under simple network coding, the problem of minimum c...
متن کاملFast reroute from single link and single node failures for IP multicast
The rise in multicast implementations has seen with it an increased support for fast failure recovery from link and node failures. Most recovery mechanisms augment additional services to existing protocols causing excessive overhead, and these modifications are predominantly protocol-specific. In this paper, we develop a multicast failure recovery mechanism that constructs protocol independent ...
متن کاملBeyond Routing: An Algebraic Approach to Network Coding
In this paper we consider the issue of network capacity. The recent work by Li and Yeung examined the network capacity of multicast networks and related capacity to cutsets. Capacity is achieved by coding over a network. We present a new framework for studying networks and their capacity. Our framework, based on algebraic methods, is surprisingly simple and effective. For networks which are res...
متن کاملA Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks
In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...
متن کاملFault Handling for Multi-party Real-time Communication
For real-time communication services to achieve widespread usage, it is important that the network services behave gracefully if any component(s) fail. While other researchers have previously considered failure-handling for non-real-time communication as well as for unicast real-time communication, these failure-recovery techniques must be reexamined in the light of the changes introduced by th...
متن کامل