多备份虚拟路径预留问题及其解决方法

Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000 Pub Date : 2000-09-11 DOI:10.1109/ICECCS.2000.873935

S. Inoue, Y. Kakuda

{"title":"多备份虚拟路径预留问题及其解决方法","authors":"S. Inoue, Y. Kakuda","doi":"10.1109/ICECCS.2000.873935","DOIUrl":null,"url":null,"abstract":"A method of preparing a backup virtual path (VP) for each primary VP is popular for establishing a reliable computer network. In the case of multiple failures, however, it is possible that multiple failures happen on both a primary VP and a pairwise backup VP. In order to solve the above problem, the paper proposes a new multiagent based method where more than one backup VP is prepared for each primary VP.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multiple backup virtual paths reservation problem and its solution\",\"authors\":\"S. Inoue, Y. Kakuda\",\"doi\":\"10.1109/ICECCS.2000.873935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of preparing a backup virtual path (VP) for each primary VP is popular for establishing a reliable computer network. In the case of multiple failures, however, it is possible that multiple failures happen on both a primary VP and a pairwise backup VP. In order to solve the above problem, the paper proposes a new multiagent based method where more than one backup VP is prepared for each primary VP.\",\"PeriodicalId\":228728,\"journal\":{\"name\":\"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECCS.2000.873935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCS.2000.873935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

为每个主虚拟路径准备备份虚拟路径(VP)的方法是建立可靠的计算机网络的常用方法。但是，在出现多个故障的情况下，可能在主VP和成对备份VP上同时发生多个故障。为了解决上述问题，本文提出了一种新的基于多智能体的方法，该方法为每个主VP准备多个备份VP。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multiple backup virtual paths reservation problem and its solution

A method of preparing a backup virtual path (VP) for each primary VP is popular for establishing a reliable computer network. In the case of multiple failures, however, it is possible that multiple failures happen on both a primary VP and a pairwise backup VP. In order to solve the above problem, the paper proposes a new multiagent based method where more than one backup VP is prepared for each primary VP.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000

自引率

0.00%

发文量