Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Hitless Recovery from Link Failures in Networks with Arbitrary Topology
 

Summary: Hitless Recovery from Link Failures in Networks
with Arbitrary Topology
Serhat Nazim Avci, Xiaodan Hu, and Ender Ayanoglu
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
University of California, Irvine
Abstract--Link failures in wide area networks are common.
To recover from such failures, a number of methods such as
SONET rings, protection cycles, and source rerouting have been
investigated. Two important considerations in such approaches
are the recovery time and the needed spare capacity to complete
the recovery. Usually, these techniques attempt to achieve a
recovery time less than 50 ms. In this paper we introduce an
approach that provides link failure recovery in a hitless manner,
or without any appreciable delay. This is achieved by means
of a method previously introduced, named diversity coding. We
present an algorithm for the design of an overlay network to
achieve hitless recovery from single link failures in arbitrary
networks via diversity coding. This algorithm is designed to
minimize spare capacity for recovery. We compare the spare

  

Source: Ayanoglu, Ender - Department of Electrical and Computer Engineering, University of California, Irvine

 

Collections: Engineering