OSPF路由中的一些同步问题

A. Bouillard, C. Jard, Aurore Junier
{"title":"OSPF路由中的一些同步问题","authors":"A. Bouillard, C. Jard, Aurore Junier","doi":"10.5220/0004506800050014","DOIUrl":null,"url":null,"abstract":"A routing protocol such as OSPF has a cyclic behavior to regularly update its view of the network topology. Its behavior is divided into periods. Each period produces a flood of network information messages. We observe a regular activity in terms of messages exchanges and filling of receive buffers in routers. This article examines the consequences of possible overlap of activity between periods, leading to a buffer overflow. OSPF allows “out of sync” flows by considering an initial delay (phase). We study the optimum calculation of these offsets to reduce the load, while maintaining a short period to ensure a protocol reactive to topology changes. Such studies are conducted using a simulated Petri net model. A heuristic for determining initial delays is proposed. A core network in Germany serves as illustration.","PeriodicalId":430947,"journal":{"name":"2013 International Conference on Data Communication Networking (DCNET)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Some synchronization issues in OSPF routing\",\"authors\":\"A. Bouillard, C. Jard, Aurore Junier\",\"doi\":\"10.5220/0004506800050014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A routing protocol such as OSPF has a cyclic behavior to regularly update its view of the network topology. Its behavior is divided into periods. Each period produces a flood of network information messages. We observe a regular activity in terms of messages exchanges and filling of receive buffers in routers. This article examines the consequences of possible overlap of activity between periods, leading to a buffer overflow. OSPF allows “out of sync” flows by considering an initial delay (phase). We study the optimum calculation of these offsets to reduce the load, while maintaining a short period to ensure a protocol reactive to topology changes. Such studies are conducted using a simulated Petri net model. A heuristic for determining initial delays is proposed. A core network in Germany serves as illustration.\",\"PeriodicalId\":430947,\"journal\":{\"name\":\"2013 International Conference on Data Communication Networking (DCNET)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Data Communication Networking (DCNET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0004506800050014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Data Communication Networking (DCNET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0004506800050014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

路由协议(如OSPF)具有循环行为,可以定期更新其网络拓扑视图。它的行为被划分为几个周期。每个周期都会产生大量的网络信息消息。我们观察到在路由器的消息交换和接收缓冲区填充方面有规律的活动。本文将研究不同时期之间的活动重叠可能导致缓冲区溢出的后果。OSPF通过考虑初始延迟(阶段)来允许“不同步”流。我们研究了这些偏移量的最佳计算,以减少负载,同时保持较短的周期,以确保协议对拓扑变化的反应。这些研究是使用模拟的Petri网模型进行的。提出了一种确定初始延迟的启发式算法。德国的核心网络就是一个例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Some synchronization issues in OSPF routing
A routing protocol such as OSPF has a cyclic behavior to regularly update its view of the network topology. Its behavior is divided into periods. Each period produces a flood of network information messages. We observe a regular activity in terms of messages exchanges and filling of receive buffers in routers. This article examines the consequences of possible overlap of activity between periods, leading to a buffer overflow. OSPF allows “out of sync” flows by considering an initial delay (phase). We study the optimum calculation of these offsets to reduce the load, while maintaining a short period to ensure a protocol reactive to topology changes. Such studies are conducted using a simulated Petri net model. A heuristic for determining initial delays is proposed. A core network in Germany serves as illustration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信