DocumentCode
2126077
Title
VP reservation for rapid restoration using multiagents
Author
Kakuda, Yoshiaki ; Nagano, Shin´ichi ; Kikuno, Tohru ; Terabe, Masahiro
Author_Institution
Dept. of Comput. Eng., Hiroshima City Univ., Japan
fYear
1998
fDate
10-14 Aug 1998
Firstpage
121
Lastpage
128
Abstract
This paper discusses how a backup virtual path (VP) between each pair of a source node and a destination node is set up such that when some nodes and links in primary VP´s fail, primary VP´s are changed to backup VP´s rapidly. Then, this paper proposes a multiagent-based method for such rapid restoration from primary VP´s to backup VP´s. The proposed method consists of the following three steps. The first step enumerates candidates of backup VP between each pair of a source node and a destination node. In the second step, capacities of shared links in backup VP candidates between different pairs of a source node and a destination node are obtained. The last step determines a backup VP with the minimum capacities of shared links between each pair of a source node and a destination node. The proposed method has potentially good adaptability for change of both network resource such as topology and link capacity and resource requirements such as capacities of primary VP and backup VP
Keywords
protocols; virtual reality; VP reservation; backup VP; destination node; link capacity; multiagents; network resource; primary VP; rapid restoration; resource requirements; source node; virtual path reservation; Bandwidth; Centralized control; Informatics; Read only memory; Safety;
fLanguage
English
Publisher
ieee
Conference_Titel
Engineering of Complex Computer Systems, 1998. ICECCS '98. Proceedings. Fourth IEEE International Conference on
Conference_Location
Monterey, CA
Print_ISBN
0-8186-8597-2
Type
conf
DOI
10.1109/ICECCS.1998.706662
Filename
706662
Link To Document