RREACT: A Distributed Network Restoration Protocol for Rapid Restoration of Active Communication Trunks

  • Chow C
  • McCaughey S
  • Syed S
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Commercial telecommunications networks have tight real-time requirements for restoration after a failure. The problem of finding the available restoration paths and reassigning the interrupted traffic within such tight real-time requirements places difficult demands on the restoration protocol employed. This paper reviews several distributed network restoration protocols and presents a new distributed protocol called RREACT, for performing this function with a distributed algorithm which uses no prior network status or topography knowledge and which supports multiple simultaneous link restorations. Simulation results show that this protocol significantly outperforms other existing algorithms based on the Sender-Chooser approach, usually completing the total restoration in well under one second. In addition, enhancements to the basic algorithm are described which help to ensure near-optimal use of network spare channel resources and address such restoration situations where a complete r...

Cite

CITATION STYLE

APA

Chow, C. E., McCaughey, S., & Syed, S. (1994). RREACT: A Distributed Network Restoration Protocol for Rapid Restoration of Active Communication Trunks. In Network Management and Control (pp. 391–406). Springer US. https://doi.org/10.1007/978-1-4899-1298-5_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free