一种基于OSPF的负载敏感的可选路径QoS路由算法

A. Sahoo
{"title":"一种基于OSPF的负载敏感的可选路径QoS路由算法","authors":"A. Sahoo","doi":"10.1109/ICCCN.2002.1043072","DOIUrl":null,"url":null,"abstract":"Real-time applications such as Voice over IP, audio and video streaming require quality of service (QoS). Such applications are being executed over the public Internet. Since today's Internet largely supports best effort traffic, QoS routing in the best effort environment is required to support real-time applications. Some QoS routing uses source routing and others use flooding of some QoS attributes of the nodes. There were also some variants of the shortest path algorithm reported in the literature. But those algorithms require changes to the packet forwarding engine and logic for loop detection. We believe a better way of implementing QoS routing is to localize the QoS routing changes to the region where QoS has deteriorated and choose loop-free alternate paths. We present such an algorithm based on OSPF (open shortest path first) called the LSR algorithm. In the LSR algorithm, congestion notification is limited to neighbors of the congested node and the neighbors try to use alternate next hops to route packets. Alternate LSR next hop is chosen in such a way that it preserves the next hop property of OSPF routing which enables the LSR algorithm to avoid a loop. We present three such methods to choose an alternate LSR next hop and prove that these methods provide loop-free routing. Our simulation results based on the three methods show that on average the LSR algorithm performs better than the OSPF algorithm in terms of delay and jitter.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"An OSPF based load sensitive QoS routing algorithm using alternate paths\",\"authors\":\"A. Sahoo\",\"doi\":\"10.1109/ICCCN.2002.1043072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-time applications such as Voice over IP, audio and video streaming require quality of service (QoS). Such applications are being executed over the public Internet. Since today's Internet largely supports best effort traffic, QoS routing in the best effort environment is required to support real-time applications. Some QoS routing uses source routing and others use flooding of some QoS attributes of the nodes. There were also some variants of the shortest path algorithm reported in the literature. But those algorithms require changes to the packet forwarding engine and logic for loop detection. We believe a better way of implementing QoS routing is to localize the QoS routing changes to the region where QoS has deteriorated and choose loop-free alternate paths. We present such an algorithm based on OSPF (open shortest path first) called the LSR algorithm. In the LSR algorithm, congestion notification is limited to neighbors of the congested node and the neighbors try to use alternate next hops to route packets. Alternate LSR next hop is chosen in such a way that it preserves the next hop property of OSPF routing which enables the LSR algorithm to avoid a loop. We present three such methods to choose an alternate LSR next hop and prove that these methods provide loop-free routing. Our simulation results based on the three methods show that on average the LSR algorithm performs better than the OSPF algorithm in terms of delay and jitter.\",\"PeriodicalId\":302787,\"journal\":{\"name\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2002.1043072\",\"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. Eleventh International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2002.1043072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

诸如IP语音、音频和视频流等实时应用需要服务质量(QoS)。这些应用程序是在公共互联网上执行的。由于今天的Internet在很大程度上支持“尽力而为”流量,因此需要在“尽力而为”环境中的QoS路由来支持实时应用程序。一些QoS路由使用源路由,另一些使用节点的某些QoS属性的泛洪。文献中也报道了一些最短路径算法的变体。但是这些算法需要改变数据包转发引擎和环路检测逻辑。我们认为实现QoS路由的更好方法是将QoS路由更改定位到QoS恶化的区域,并选择无环路的备用路径。我们提出了一种基于OSPF(开放最短路径优先)的算法,称为LSR算法。在LSR算法中,拥塞通知仅限于拥塞节点的邻居,邻居尝试使用备用下一跳来路由数据包。选择备用LSR下一跳的方式保留了OSPF路由的下一跳属性,使LSR算法能够避免环路。我们提出了三种选择备用LSR下一跳的方法,并证明了这些方法提供了无环路由。基于三种方法的仿真结果表明,平均而言,LSR算法在延迟和抖动方面优于OSPF算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An OSPF based load sensitive QoS routing algorithm using alternate paths
Real-time applications such as Voice over IP, audio and video streaming require quality of service (QoS). Such applications are being executed over the public Internet. Since today's Internet largely supports best effort traffic, QoS routing in the best effort environment is required to support real-time applications. Some QoS routing uses source routing and others use flooding of some QoS attributes of the nodes. There were also some variants of the shortest path algorithm reported in the literature. But those algorithms require changes to the packet forwarding engine and logic for loop detection. We believe a better way of implementing QoS routing is to localize the QoS routing changes to the region where QoS has deteriorated and choose loop-free alternate paths. We present such an algorithm based on OSPF (open shortest path first) called the LSR algorithm. In the LSR algorithm, congestion notification is limited to neighbors of the congested node and the neighbors try to use alternate next hops to route packets. Alternate LSR next hop is chosen in such a way that it preserves the next hop property of OSPF routing which enables the LSR algorithm to avoid a loop. We present three such methods to choose an alternate LSR next hop and prove that these methods provide loop-free routing. Our simulation results based on the three methods show that on average the LSR algorithm performs better than the OSPF algorithm in terms of delay and jitter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信