{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
