A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering

B. Oommen, S. Misra, Ole-Christoffer Granmo
{"title":"A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering","authors":"B. Oommen, S. Misra, Ole-Christoffer Granmo","doi":"10.1109/INFOCOM.2006.90","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient adaptive online routing algorithm for the computation of bandwidth-guaranteed paths in Multiprotocol Label Switching (MPLS) based networks, using a learning scheme that computes an optimal ordering of routes. This work has two-fold contributions. The first is that we propose a new class of solutions other than those available in the literature incorporating the family of stochastic Random-Races (RR) algorithms. The most popular previouslyproposed MPLS Traffic Engineering (TE) solutions attempt to find a superior path to route an incoming path setup request. Our algorithm, on the other hand, tries to learn an optimal ordering of the paths through which requests can be routed according to the “rank” of the paths in the order learnt by the algorithm. The second contribution of our work is that we have proposed a routing algorithm that has better performance than the important algorithms in the literature. The efficiency of our algorithm was experimentally established.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOM.2006.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper presents an efficient adaptive online routing algorithm for the computation of bandwidth-guaranteed paths in Multiprotocol Label Switching (MPLS) based networks, using a learning scheme that computes an optimal ordering of routes. This work has two-fold contributions. The first is that we propose a new class of solutions other than those available in the literature incorporating the family of stochastic Random-Races (RR) algorithms. The most popular previouslyproposed MPLS Traffic Engineering (TE) solutions attempt to find a superior path to route an incoming path setup request. Our algorithm, on the other hand, tries to learn an optimal ordering of the paths through which requests can be routed according to the “rank” of the paths in the order learnt by the algorithm. The second contribution of our work is that we have proposed a routing algorithm that has better performance than the important algorithms in the literature. The efficiency of our algorithm was experimentally established.
MPLS流量工程中一种随机竞争路由算法
本文提出了一种有效的自适应在线路由算法,用于基于多协议标签交换(MPLS)的网络中带宽保证路径的计算,该算法使用一种计算最优路由排序的学习方案。这项工作有双重贡献。首先,我们提出了一种新的解决方案,而不是文献中可用的解决方案,其中包括随机随机种族(RR)算法家族。以前提出的最流行的MPLS流量工程(TE)解决方案试图找到一条更好的路径来路由传入的路径设置请求。另一方面,我们的算法试图学习路径的最优排序,通过该排序,请求可以根据算法学习到的路径顺序的“排名”进行路由。我们工作的第二个贡献是我们提出了一种路由算法,它比文献中重要的算法具有更好的性能。实验证明了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信