{"title":"Experimental evaluation on optimality of multiagent-based backup VP reservation method","authors":"T. Ohta, S. Inoue, Y. Kakuda","doi":"10.1109/IWADS.2000.880895","DOIUrl":null,"url":null,"abstract":"In order to enhance the reliability of ATM networks, recently (Y. Kakuda, 1998), the virtual path (VP) reservation method using multiple agents (MA) has been proposed. In this MA method, given a primary VP and multiple backup VP candidates between each source node/destination node pair, then for each such pair, a backup VP is selected from the given multiple backup VP candidates, and a primary VP and a backup VP are reserved so that, when some nodes and links in the primary VPs fail, the primary VPs are able to be changed to the corresponding backup VPs rapidly. This paper describes an experimental evaluation of the MA method with respect to optimality. The experimental results show that the MA method has good optimality, along with an increase in the number of backup VP candidates.","PeriodicalId":248775,"journal":{"name":"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWADS.2000.880895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In order to enhance the reliability of ATM networks, recently (Y. Kakuda, 1998), the virtual path (VP) reservation method using multiple agents (MA) has been proposed. In this MA method, given a primary VP and multiple backup VP candidates between each source node/destination node pair, then for each such pair, a backup VP is selected from the given multiple backup VP candidates, and a primary VP and a backup VP are reserved so that, when some nodes and links in the primary VPs fail, the primary VPs are able to be changed to the corresponding backup VPs rapidly. This paper describes an experimental evaluation of the MA method with respect to optimality. The experimental results show that the MA method has good optimality, along with an increase in the number of backup VP candidates.