{"title":"多pce域间路径配置的实验性能评价","authors":"S. Ishida, Y. Iizawa, I. Nishioka, So Araki","doi":"10.1117/12.804289","DOIUrl":null,"url":null,"abstract":"In this paper, PCE-based inter-domain path computation has been discussed. Interworking of multiple PCEs with the BRPC procedure enables not only end-to-end shortest path computation but also end-to-end diverse path computation over multiple networks. We have analyzed various PCE-based inter-domain path computation strategies using BRPC, in terms of the path computation complexity. To reduce path computation time, a simplified path computation strategy was proposed and evaluated experimentally with our prototyped PCE system. Our experimental results show good correspondence with analytical ones. The proposed strategy drastically reduced path computation time down to one-seventh in comparison with the conventional strategy.","PeriodicalId":179447,"journal":{"name":"SPIE/OSA/IEEE Asia Communications and Photonics","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experimental performance evaluation of inter-domain path provisioning with multiple PCEs\",\"authors\":\"S. Ishida, Y. Iizawa, I. Nishioka, So Araki\",\"doi\":\"10.1117/12.804289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, PCE-based inter-domain path computation has been discussed. Interworking of multiple PCEs with the BRPC procedure enables not only end-to-end shortest path computation but also end-to-end diverse path computation over multiple networks. We have analyzed various PCE-based inter-domain path computation strategies using BRPC, in terms of the path computation complexity. To reduce path computation time, a simplified path computation strategy was proposed and evaluated experimentally with our prototyped PCE system. Our experimental results show good correspondence with analytical ones. The proposed strategy drastically reduced path computation time down to one-seventh in comparison with the conventional strategy.\",\"PeriodicalId\":179447,\"journal\":{\"name\":\"SPIE/OSA/IEEE Asia Communications and Photonics\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SPIE/OSA/IEEE Asia Communications and Photonics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.804289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPIE/OSA/IEEE Asia Communications and Photonics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.804289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Experimental performance evaluation of inter-domain path provisioning with multiple PCEs
In this paper, PCE-based inter-domain path computation has been discussed. Interworking of multiple PCEs with the BRPC procedure enables not only end-to-end shortest path computation but also end-to-end diverse path computation over multiple networks. We have analyzed various PCE-based inter-domain path computation strategies using BRPC, in terms of the path computation complexity. To reduce path computation time, a simplified path computation strategy was proposed and evaluated experimentally with our prototyped PCE system. Our experimental results show good correspondence with analytical ones. The proposed strategy drastically reduced path computation time down to one-seventh in comparison with the conventional strategy.