Results 1 
5 of
5
Protection Cycles in Mesh WDM Networks
 IEEE Journal on Selected Areas in Communications
, 2000
"... A fault recovery system that is fast and reliable is essential to today's networks, as it can be used to minimize the impact of the fault on the operation of the network and the services it provides. This paper proposes a methodology for performing automatic protection switching (APS) in optical net ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
A fault recovery system that is fast and reliable is essential to today's networks, as it can be used to minimize the impact of the fault on the operation of the network and the services it provides. This paper proposes a methodology for performing automatic protection switching (APS) in optical networks with arbitrary mesh topologies in order to protect the network from fiber link failures. All fiber links interconnecting the optical switches are assumed to be bidirectional. In the scenario considered, the layout of the protection fibers and the setup of the protection switches is implemented in nonreal time, during the setup of the network. When a fiber link fails, the connections that use that link are automatically restored and their signals are routed to their original destination using the protection fibers and protection switches. The protection process proposed is fast, distributed, and autonomous. It restores the network in real time, without relying on a central manager or a centralized database. It is also independent of the topology and the connection state of the network at the time of the failure.
Supereulerian graphs: A survey
 J. Graph Theory
, 1992
"... A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a grap ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a graph. We outline the research on supereulerian graphs, the reduction method and its applications. 1. Notation We follow the notation of Bondy and Murty [22], with these exceptions: a graph has no loops, but multiple edges are allowed; the trivial graph K1 is regarded as having infinite edgeconnectivity; and the symbol E will normally refer to a subset of the edge set E(G) of a graph G, not to E(G) itself. The graph of order 2 with 2 edges is called a 2cycle and denoted C2. Let H be a subgraph of G. The contraction G/H is the graph obtained from G by contracting all edges of H and deleting any resulting loops. For a graph G, denote O(G) = {odddegree vertices of G}. A graph with O(G) = ∅ is called an even graph. A graph is eulerian if it is connected and even. We call a graph G supereulerian if G has a spanning eulerian subgraph. Regard K1 as supereulerian. Denote SL = {supereulerian graphs}. 1 Let G be a graph. The line graph of G (called an edge graph in [22]) is denoted L(G), it has vertex set E(G), where e, e ′ ∈ E(G) are adjacent vertices in L(G) whenever e and e ′ are adjacent edges in G. Let S be a family of graphs, let G be a graph, and let k ≥ 0 be an integer. If there is a graph G0 ∈ S such that G can be obtained from G0 by removing at most k edges, then G is said to be at most k edges short of being in S. For a graph G, we write F (G) = k if k is the least nonnegative integer such that G is at most k edges short of having 2 edgedisjoint spanning trees. 2.
I Artificial Intelligence
, 1996
"... ther sensing devices in a general way. A modular system that allows new sensing devices to be added incrementally would be extremely useful. 2. Multiple sensing is in many ways a problem in distributed computation. Each sensor is typically a separate computing element, with its own world model and ..."
Abstract
 Add to MetaCart
ther sensing devices in a general way. A modular system that allows new sensing devices to be added incrementally would be extremely useful. 2. Multiple sensing is in many ways a problem in distributed computation. Each sensor is typically a separate computing element, with its own world model and set of primitives. Each sensor has its own resolution, bandwidth and response time and a major task in robotics is getting them all to work together. An open problem is the organization of such systems; should they be hierarchical with a top level controlling "overseer" or should they be more anarchistic, with each sensor doing its own thing and a minimum level of coordination. The answer is partially task dependent, but as sensors proliferate, the solutions become more difficult. 3. Tactile sensing is becoming more important in robotics. Machine vision researchers have benefited from trying to understand biological vision systems. Robotics can also benefit from an understanding of human ha
Cones, Lattices and Hilbert Bases of Circuits and Perfect Matchings
, 1991
"... There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (realvalued characteristic functions of) circuits in a binary matroid. In all three cases, one easily formulates necessary conditions for a weight vector to belong to the set in ..."
Abstract
 Add to MetaCart
There have been a number of results and conjectures regarding the cone, the lattice and the integer cone generated by the (realvalued characteristic functions of) circuits in a binary matroid. In all three cases, one easily formulates necessary conditions for a weight vector to belong to the set in question. Families of matroids for which such necessary conditions are sufficient have been determined by Seymour; Lov'asz, Sebo and Seress; Alspach, Fu, Goddyn and Zhang, respectively. However, circuits of matroids are far from being well understood. Perhaps the most daunting (and important) problem of this type is to determine whether the circuits of a matroid form a Hilbert basis. That is, for which matroids does the integer cone coincide with those vectors which belong to both the cone and the lattice? Additionally, all of the above questions have been asked with regard to perfect matchings in graphs. We present a survey of this topic for circuits in matroids, and also for perfect match...