Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Design Algorithms for Fast Network Restoration via Diversity Coding
 

Summary: Design Algorithms for Fast Network Restoration
via Diversity Coding
Serhat Nazim Avci and Ender Ayanoglu
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
University of California, Irvine
Irvine, CA 92697-2625
Abstract--The technique of diversity coding was introduced to
provide fast restoration against link failures in communication
networks. We have recently devised algorithms to incorporate
diversity coding into networks with arbitrary topology, so that
restoration is achieved very fast, in an almost hitless manner,
while spare capacity requirements are competitive with the alter-
native state-of-the-art restoration techniques. In addition to two
techniques we have recently developed, in this paper we introduce
two new techniques. These two techniques provide optimal pre-
provisioning of aggregate traffic and active provisioning of dy-
namic traffic, respectively. In both cases, diversity coding results
in smaller restoration time, simpler synchronization, and much
reduced signaling complexity than the existing techniques in the

  

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

 

Collections: Engineering