OBGP+: A simple approach to drastically improve OBGP

M. Yannuzzi, X. Masip-Bruin, G. Fabrego, S. Sánchez-López, J. Solé-Pareta
{"title":"OBGP+: A simple approach to drastically improve OBGP","authors":"M. Yannuzzi, X. Masip-Bruin, G. Fabrego, S. Sánchez-López, J. Solé-Pareta","doi":"10.1109/ONDM.2008.4578403","DOIUrl":null,"url":null,"abstract":"During the last few years, the research community has shown an increasing interest in the subject of inter-domain routing in optical networks, so new approaches like the optical extension of BGP, namely OBGP, have arisen. However, it is widely accepted now that a multi-domain routing model mostly centered on the exchange of reachability information - like the one we have today or the one provided by OBGP - is not going to be enough in the future. Routing domains must be able to exchange both, reachability, as well as aggregated path state information (PSI). Understanding that there is a missing piece in the routing models provided by BGP and OBGP is easy nowadays, but contributing with solutions capable of highly improving the performance of these routing protocols without increasing the number and frequency of the routing messages exchanged between domains is a challenging task. This study makes the following contributions. First, we propose a straightforward strategy to compute highly aggregated PSI between routing domains. Second, we propose OBGP+, an extended version of OBGP that exploits this PSI to compute inter-domain lightpaths in a highly efficient way. Third, in order to avoid the typical increase in the number of routing messages associated with the update of PSI, we propose to piggy-back these updates in non-dummy Keepalive messages exchanged between OBGP+ neighbors. Extensive simulations made with OPNET in the PAN European network topology reveal that: i) OBGP+ is able to drastically reduce the blocking experienced with OBGP; ii) while even needing less number of routing messages than OBGP to achieve this performance.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Optical Network Design and Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ONDM.2008.4578403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

During the last few years, the research community has shown an increasing interest in the subject of inter-domain routing in optical networks, so new approaches like the optical extension of BGP, namely OBGP, have arisen. However, it is widely accepted now that a multi-domain routing model mostly centered on the exchange of reachability information - like the one we have today or the one provided by OBGP - is not going to be enough in the future. Routing domains must be able to exchange both, reachability, as well as aggregated path state information (PSI). Understanding that there is a missing piece in the routing models provided by BGP and OBGP is easy nowadays, but contributing with solutions capable of highly improving the performance of these routing protocols without increasing the number and frequency of the routing messages exchanged between domains is a challenging task. This study makes the following contributions. First, we propose a straightforward strategy to compute highly aggregated PSI between routing domains. Second, we propose OBGP+, an extended version of OBGP that exploits this PSI to compute inter-domain lightpaths in a highly efficient way. Third, in order to avoid the typical increase in the number of routing messages associated with the update of PSI, we propose to piggy-back these updates in non-dummy Keepalive messages exchanged between OBGP+ neighbors. Extensive simulations made with OPNET in the PAN European network topology reveal that: i) OBGP+ is able to drastically reduce the blocking experienced with OBGP; ii) while even needing less number of routing messages than OBGP to achieve this performance.
OBGP+:一种彻底改进OBGP的简单方法
近年来,学术界对光网络中的域间路由问题的研究越来越感兴趣,因此出现了BGP的光扩展(即OBGP)等新方法。然而,现在被广泛接受的是,一个多域路由模型主要集中在可达性信息的交换上——就像我们今天所拥有的或者OBGP所提供的那样——在未来是不够的。路由域必须能够交换可达性和聚合路径状态信息(PSI)。理解BGP和OBGP提供的路由模型中缺失的部分现在很容易,但是提供能够在不增加域之间交换路由消息的数量和频率的情况下高度提高这些路由协议性能的解决方案是一项具有挑战性的任务。本研究的贡献如下:首先,我们提出了一个简单的策略来计算路由域之间高度聚合的PSI。其次,我们提出了OBGP+,这是OBGP的扩展版本,它利用这种PSI以高效的方式计算域间光路。第三,为了避免与PSI更新相关的路由消息数量的典型增加,我们建议在OBGP+邻居之间交换的非虚拟Keepalive消息中附带这些更新。利用OPNET在PAN欧洲网络拓扑中进行的大量仿真表明:1)OBGP+能够显著减少OBGP遇到的阻塞;ii)甚至需要比OBGP更少的路由消息来实现这种性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信