Simulation of a New Constraint Based Routing Algorithm for Multi-Protocol Label Switching Networks

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications Pub Date : 2008-04-07 DOI:10.1109/ICTTA.2008.4530216

M.Z. Al-Ani, F. Al-Naima, S. Amin

{"title":"Simulation of a New Constraint Based Routing Algorithm for Multi-Protocol Label Switching Networks","authors":"M.Z. Al-Ani, F. Al-Naima, S. Amin","doi":"10.1109/ICTTA.2008.4530216","DOIUrl":null,"url":null,"abstract":"This paper presents modeling and simulation for constraint-based routing (CBR) algorithm for multi protocol label switching (MPLS) network which is designed for mapping among any layer-2 protocols and any layer-3 protocols of the OSI model. The MPLS network has the capability of routing with some specific constraints for supporting desired quality of service (QoS). The most important constraint is the demand bandwidth. The efficient routing algorithm should have low percentage of call-setup request blocking, high network utilization and low calculation complexity. There are many previously proposed algorithms such as minimum hop algorithm, widest shortest path algorithm and minimum interference routing algorithm. In this paper, a new algorithm is proposed which is based on the weight calculation of an amount of paths routed over each link in the network. The simulation results show that the proposed algorithm performs better in terms of network utilization, low blocking percentage and low complexity.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTTA.2008.4530216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

This paper presents modeling and simulation for constraint-based routing (CBR) algorithm for multi protocol label switching (MPLS) network which is designed for mapping among any layer-2 protocols and any layer-3 protocols of the OSI model. The MPLS network has the capability of routing with some specific constraints for supporting desired quality of service (QoS). The most important constraint is the demand bandwidth. The efficient routing algorithm should have low percentage of call-setup request blocking, high network utilization and low calculation complexity. There are many previously proposed algorithms such as minimum hop algorithm, widest shortest path algorithm and minimum interference routing algorithm. In this paper, a new algorithm is proposed which is based on the weight calculation of an amount of paths routed over each link in the network. The simulation results show that the proposed algorithm performs better in terms of network utilization, low blocking percentage and low complexity.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一种新的基于约束的多协议标签交换网络路由算法仿真

本文对多协议标签交换(MPLS)网络中基于约束的路由(CBR)算法进行了建模和仿真，该算法设计用于OSI模型中任意二层协议和任意三层协议之间的映射。MPLS网络具有带有特定约束的路由能力，以支持所需的服务质量(QoS)。最重要的约束是带宽需求。高效的路由算法应具有低呼叫建立请求阻塞率、高网络利用率和低计算复杂度等特点。目前已有许多算法被提出，如最小跳数算法、最宽最短路径算法和最小干扰路由算法。本文提出了一种新的算法，该算法基于网络中每条链路上路由的路径数量的权重计算。仿真结果表明，该算法具有网络利用率高、阻塞率低、复杂度低等优点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications

自引率

0.00%

发文量