Dynamic Unattended Measurement Based Routing Algorithm for DiffServ architecture

M. Czarkowski, S. Kaczmarek
{"title":"Dynamic Unattended Measurement Based Routing Algorithm for DiffServ architecture","authors":"M. Czarkowski, S. Kaczmarek","doi":"10.1109/NETWKS.2010.5624909","DOIUrl":null,"url":null,"abstract":"Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.
基于动态无人值守测量的DiffServ架构路由算法
在当今的分组网络中,动态路由对于保证QoS非常重要,特别是对于流和弹性业务。现有的动态路由解决方案往往过于复杂,在传输流量变化很大的实时流量场景中似乎无法使用。这是研究和提出新的路由机制的主要原因,它应该适用于今天的分组网络。本文提出的算法DUMBRA,基于动态无人值勤测量的路由算法,允许对流和弹性流量类使用k-最短路径机制。利用omnet++仿真环境实现了多种不同网络拓扑下的多种流量场景,并对其进行了仿真验证。已经证实,对于大多数分析的网络拓扑,该算法在通过现有网络资源的服务流量数量上有显着的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信