Experimental evaluation on optimality of multiagent-based backup VP reservation method

T. Ohta, S. Inoue, Y. Kakuda
{"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.
基于多智能体的备用VP保留方法最优性的实验评价
为了提高ATM网络的可靠性,最近(Y. Kakuda, 1998)提出了使用多agent (MA)的虚拟路径(VP)预约方法。在该方法中,每个源节点/目的节点对之间给定一个主VP和多个备用VP候选,对于每对这样的备份对,从给定的多个备用VP候选中选择一个备用VP,并保留一个主VP和一个备用VP,以便当主VP中的某些节点和链路出现故障时,能够快速地将主VP替换为相应的备用VP。本文描述了一个关于最优性的MA方法的实验评价。实验结果表明,随着备用副总裁候选人数量的增加,MA方法具有较好的最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信