多pce域间路径配置的实验性能评价

S. Ishida, Y. Iizawa, I. Nishioka, So Araki
{"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}
引用次数: 0

摘要

本文讨论了基于pce的域间路径计算。多个pce与BRPC过程的交互不仅可以实现端到端最短路径计算,还可以实现多个网络的端到端多路径计算。从路径计算复杂度的角度出发,利用BRPC分析了各种基于pce的域间路径计算策略。为了减少路径计算时间,提出了一种简化的路径计算策略,并在原型PCE系统上进行了实验验证。实验结果与分析结果吻合较好。与传统策略相比,该策略将路径计算时间大幅减少至七分之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信