CR-LDP消息反转建立基于约束的LSP

Byeongsik Kim, Woojik Chun, Jaeho Yoo
{"title":"CR-LDP消息反转建立基于约束的LSP","authors":"Byeongsik Kim, Woojik Chun, Jaeho Yoo","doi":"10.1109/ICOIN.2001.905622","DOIUrl":null,"url":null,"abstract":"We investigate the problem of constraint-based routing that is one key component of traffic engineering. In constraint-based routing, resource information in addition to topology information is maintained in a database on all participating nodes in the routing domain. Especially the resource information of the links is changed rapidly because the bandwidth availability, for example, is changed whenever new LSPs are established and terminated. Therefore, the information used to compute a constraint-based path may be out-of-date. This means an LSP setup request may be blocked because a link or a node along the selected LSP has insufficient resources. This paper discusses the impact of inaccurate link state information, an LSP setup method coping with the inaccuracies, a new mechanism that allows constraint-based LSP setup and restoration, and gains obtained by our new mechanism.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Constraint-based LSP setup by message reversing of CR-LDP\",\"authors\":\"Byeongsik Kim, Woojik Chun, Jaeho Yoo\",\"doi\":\"10.1109/ICOIN.2001.905622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of constraint-based routing that is one key component of traffic engineering. In constraint-based routing, resource information in addition to topology information is maintained in a database on all participating nodes in the routing domain. Especially the resource information of the links is changed rapidly because the bandwidth availability, for example, is changed whenever new LSPs are established and terminated. Therefore, the information used to compute a constraint-based path may be out-of-date. This means an LSP setup request may be blocked because a link or a node along the selected LSP has insufficient resources. This paper discusses the impact of inaccurate link state information, an LSP setup method coping with the inaccuracies, a new mechanism that allows constraint-based LSP setup and restoration, and gains obtained by our new mechanism.\",\"PeriodicalId\":332734,\"journal\":{\"name\":\"Proceedings 15th International Conference on Information Networking\",\"volume\":\"158 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 15th International Conference on Information Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2001.905622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 15th International Conference on Information Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2001.905622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

我们研究了基于约束的路由问题,这是交通工程的一个关键组成部分。在基于约束的路由中,除了拓扑信息外,资源信息还保存在路由域中所有参与节点的数据库中。特别是链路上的资源信息变化很快,例如,每当建立和终止新的lsp时,带宽的可用性都会发生变化。因此,用于计算基于约束的路径的信息可能已经过时。这意味着LSP的建立请求可能会因为所选LSP的链路或节点资源不足而被阻塞。本文讨论了链路状态信息不准确的影响,一种处理不准确的LSP建立方法,一种允许基于约束的LSP建立和恢复的新机制,以及该新机制所获得的收益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Constraint-based LSP setup by message reversing of CR-LDP
We investigate the problem of constraint-based routing that is one key component of traffic engineering. In constraint-based routing, resource information in addition to topology information is maintained in a database on all participating nodes in the routing domain. Especially the resource information of the links is changed rapidly because the bandwidth availability, for example, is changed whenever new LSPs are established and terminated. Therefore, the information used to compute a constraint-based path may be out-of-date. This means an LSP setup request may be blocked because a link or a node along the selected LSP has insufficient resources. This paper discusses the impact of inaccurate link state information, an LSP setup method coping with the inaccuracies, a new mechanism that allows constraint-based LSP setup and restoration, and gains obtained by our new mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信