分层分布的PCE用于光网络备份策略

H. Matsuura, N. Morita, T. Murakami, K. Takami
{"title":"分层分布的PCE用于光网络备份策略","authors":"H. Matsuura, N. Morita, T. Murakami, K. Takami","doi":"10.1109/CCE.2006.350841","DOIUrl":null,"url":null,"abstract":"The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.","PeriodicalId":148533,"journal":{"name":"2006 First International Conference on Communications and Electronics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Hierarchically distributed PCE for backup strategies on an optical network\",\"authors\":\"H. Matsuura, N. Morita, T. Murakami, K. Takami\",\"doi\":\"10.1109/CCE.2006.350841\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.\",\"PeriodicalId\":148533,\"journal\":{\"name\":\"2006 First International Conference on Communications and Electronics\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 First International Conference on Communications and Electronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCE.2006.350841\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 First International Conference on Communications and Electronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCE.2006.350841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

路径计算单元(pce)的应用已被广泛讨论,以减少GMPLS节点的路由计算负担。然而,目前的PCE提案尚未涵盖路径备份方案,而路径备份方案是提供核心光网络等巨大容量的先决条件。我们已经提出了一种层次分布路径计算元素(HDPCE)架构来改进现有的PCE技术。在本文中,我们详细描述了HDPCE执行的路径备份方法,以展示HDPCE架构的潜力。关键思想是域间HDPCE,它管理桥接光域,存储共享风险链路组(SRLG)信息,并发现准确的分离SRLG备份。所提出的技术具有足够的灵活性,允许商业网络中通常需要的三种路径备份方法的变体。分析了三种路径备份方法的特点和性能。我们还展示了与传统的基于ospf的备份方法相比,所提出的基于hdpce的备份方法在路径容纳和处理时间方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hierarchically distributed PCE for backup strategies on an optical network
The application of path computation elements (PCEs) has been widely discussed to reduce route calculation burden from GMPLS nodes. Current PCE proposals, however, have not yet covered path backup schemes, which is prerequisite for providing tremendous capacity such as core optical networks. We already presented a hierarchically distributed path computation element (HDPCE) architecture to improve existing PCE techniques. In this paper, we describe detailed path backup methods performed by HDPCEs to demonstrate the promising potential of HDPCE architecture. The key idea is the interdomain HDPCE, which manages the bridging optical domains, stores shared risk link group (SRLG) information, and discovers accurate disjointed SRLG backups. The proposed technique is sufficiently flexible to allow three variants of path backup methods that are commonly required in commercial networks. We analyze the features and performance of three types of path-backup methods. We also show the superiority of the proposed HDPCE-based backup methods compared to legacy OSPF-based backup methods in terms of path accommodation and processing time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信