{"title":"基于多智能体的冗余光路设计及其实验评价","authors":"Y. Kakuda, K. Suezawa, S. Inoue, H. Nakazato","doi":"10.1109/WORDS.2003.1267502","DOIUrl":null,"url":null,"abstract":"This paper discusses a fault tolerant technique called redundant path design in wavelength division multiplexing networks, in which backup paths between source and destination nodes, such that when primary paths between them fail the primary paths are quickly switched to the backup paths, are prepared. Unlike the previous centralized approaches, this paper proposes two multiagent-based methods called Method 1 and Method 2, which is an improvement of Method 1, and evaluates optimality and efficiency of the proposed methods by simulation experiments. The simulation results show that, compared with Method 1, Method 2 has higher optimality with reasonable time.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Redundant Optical Path Design Based on Multiagents and Its Experimental Evaluation\",\"authors\":\"Y. Kakuda, K. Suezawa, S. Inoue, H. Nakazato\",\"doi\":\"10.1109/WORDS.2003.1267502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses a fault tolerant technique called redundant path design in wavelength division multiplexing networks, in which backup paths between source and destination nodes, such that when primary paths between them fail the primary paths are quickly switched to the backup paths, are prepared. Unlike the previous centralized approaches, this paper proposes two multiagent-based methods called Method 1 and Method 2, which is an improvement of Method 1, and evaluates optimality and efficiency of the proposed methods by simulation experiments. The simulation results show that, compared with Method 1, Method 2 has higher optimality with reasonable time.\",\"PeriodicalId\":350761,\"journal\":{\"name\":\"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WORDS.2003.1267502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WORDS.2003.1267502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Redundant Optical Path Design Based on Multiagents and Its Experimental Evaluation
This paper discusses a fault tolerant technique called redundant path design in wavelength division multiplexing networks, in which backup paths between source and destination nodes, such that when primary paths between them fail the primary paths are quickly switched to the backup paths, are prepared. Unlike the previous centralized approaches, this paper proposes two multiagent-based methods called Method 1 and Method 2, which is an improvement of Method 1, and evaluates optimality and efficiency of the proposed methods by simulation experiments. The simulation results show that, compared with Method 1, Method 2 has higher optimality with reasonable time.