A spare capacity design method for restorable networks

Author

Yamada, Jiro

Author_Institution

NTT Telecommun. Networks Labs., Tokyo, Japan

Volume

2

fYear

1995

fDate

14-16 Nov 1995

Firstpage

931

Abstract

To reroute the broken-down path in the event of transmission-line failure, it is necessary to construct a spare path network. This paper proposes an algorithm for the design of efficient spare path networks. This algorithm is a heuristic algorithm used to achieve near-optimization by repeating the movement to objective-function-value constant orientation and the value decrease orientation. Performance evaluation results show that the solution obtained with the proposed method is very close to the LP (linear programming) solution

Keywords

channel capacity; optimisation; telecommunication network reliability; telecommunication network routing; broken-down path rerouting; heuristic algorithm; increment and decrement assignment method; linear programming; near optimization; objective-function-value constant orientation; performance evaluation results; restorable networks; spare capacity design method; spare path network; transmission line failure; Algorithm design and analysis; Circuits; Design methodology; Distributed control; Heuristic algorithms; Linear programming; Routing; Switches; Telecommunication network reliability; Transmission lines;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE

Print_ISBN

0-7803-2509-5

Type

conf

DOI

10.1109/GLOCOM.1995.502541

Filename

502541