Network Performance Analysis of an Adaptive OSPF Routing Strategy-Effective Bandwidth Estimation

T. B. Pereira, L. Ling
{"title":"Network Performance Analysis of an Adaptive OSPF Routing Strategy-Effective Bandwidth Estimation","authors":"T. B. Pereira, L. Ling","doi":"10.14209/its.2002.722","DOIUrl":null,"url":null,"abstract":"Currently Open Shortest Path First (OSPF) is the most commonly used and promising intra-domain internet routing protocol where packets are routed along shortest paths to the destination. The shortest path computation is based on some static link costs and the change of the paths only happens when existing link components become unreachable or when new link components are added. In other words, the network congestion doesn't affect the routing decisions and, as a consequence, alternative paths, which could result in a better traffic performance, remain unused. This paper introduces and analyzes an adaptive OSPF routing strategy based on effective bandwidth estimation. Simulations carried out in the OPNET network simulator showed some preliminary, interesting results. Better network throughput (sometimes until 25,673 % better) can be reached using this adaptive routing other than the traditional OSPF, sacrificing an increase in network delay.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do 2002 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/its.2002.722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Currently Open Shortest Path First (OSPF) is the most commonly used and promising intra-domain internet routing protocol where packets are routed along shortest paths to the destination. The shortest path computation is based on some static link costs and the change of the paths only happens when existing link components become unreachable or when new link components are added. In other words, the network congestion doesn't affect the routing decisions and, as a consequence, alternative paths, which could result in a better traffic performance, remain unused. This paper introduces and analyzes an adaptive OSPF routing strategy based on effective bandwidth estimation. Simulations carried out in the OPNET network simulator showed some preliminary, interesting results. Better network throughput (sometimes until 25,673 % better) can be reached using this adaptive routing other than the traditional OSPF, sacrificing an increase in network delay.
自适应OSPF路由策略的网络性能分析——有效带宽估计
目前,开放最短路径优先(OSPF)是最常用和最有前途的域内互联网路由协议,数据包沿着最短路径路由到目的地。最短路径的计算是基于一些静态链路开销的,只有当现有的链路组件变得不可达或添加了新的链路组件时,路径才会发生变化。换句话说,网络拥塞不会影响路由决策,因此,可能导致更好的流量性能的替代路径仍然未被使用。介绍并分析了一种基于有效带宽估计的自适应OSPF路由策略。在OPNET网络模拟器中进行的仿真显示了一些初步的、有趣的结果。与传统的OSPF相比,使用这种自适应路由可以达到更好的网络吞吐量(有时达到25,673%),但牺牲了网络延迟的增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信