基于优先多属性秩的软件定义网络转发节点选择

Deva Priya Isravel, S. Silas, E. Rajsingh
{"title":"基于优先多属性秩的软件定义网络转发节点选择","authors":"Deva Priya Isravel, S. Silas, E. Rajsingh","doi":"10.1109/ICCCT2.2019.8824798","DOIUrl":null,"url":null,"abstract":"Today’s networks provide a plethora of applications with heterogeneous characteristics. The network generates a huge volume of traffic because of its distributed nature and requires preferential treatment for controlling them. The existing traditional system lacks efficiency because of the diverse nature of the network and the need for the high-performance network is imminent. However, one of the predominant issues that demand high attention is traffic flow management. This paper explores the various traffic management approaches and analyses the significant role played by the next hop neighbor node selection in improving the performance of the network. To address this issue, the emerging software defined networking paradigm (SDN) is introduced to enable flexible traffic flow control. A novel method for traffic flow management by adopting the Simple Multi-Attribute Rating Technique (SMART) ranking method has been proposed for selecting the best next hop neighbor for forwarding the flows. A flow scheduling algorithm has been adopted for minimizing the maximum link utilization and provide improved performance. Simulation result shows that the proposed algorithm performs better in terms of throughput and latency.","PeriodicalId":445544,"journal":{"name":"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Preferential Multi-Attribute Rank based Forwarding Node Selection in Software Defined Networks\",\"authors\":\"Deva Priya Isravel, S. Silas, E. Rajsingh\",\"doi\":\"10.1109/ICCCT2.2019.8824798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Today’s networks provide a plethora of applications with heterogeneous characteristics. The network generates a huge volume of traffic because of its distributed nature and requires preferential treatment for controlling them. The existing traditional system lacks efficiency because of the diverse nature of the network and the need for the high-performance network is imminent. However, one of the predominant issues that demand high attention is traffic flow management. This paper explores the various traffic management approaches and analyses the significant role played by the next hop neighbor node selection in improving the performance of the network. To address this issue, the emerging software defined networking paradigm (SDN) is introduced to enable flexible traffic flow control. A novel method for traffic flow management by adopting the Simple Multi-Attribute Rating Technique (SMART) ranking method has been proposed for selecting the best next hop neighbor for forwarding the flows. A flow scheduling algorithm has been adopted for minimizing the maximum link utilization and provide improved performance. Simulation result shows that the proposed algorithm performs better in terms of throughput and latency.\",\"PeriodicalId\":445544,\"journal\":{\"name\":\"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCT2.2019.8824798\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Computing and Communications Technologies (ICCCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT2.2019.8824798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

今天的网络提供了大量具有异构特性的应用程序。由于网络的分布式特性,产生了巨大的流量,需要优先控制流量。由于网络的多样性和对高性能网络的需求日益迫切,现有的传统系统效率低下。然而,交通流量管理是一个需要高度关注的主要问题。本文探讨了各种流量管理方法,分析了下一跳邻居节点选择对提高网络性能的重要作用。为了解决这个问题,引入了新兴的软件定义网络范式(SDN)来实现灵活的流量控制。提出了一种基于简单多属性评级技术(Simple Multi-Attribute Rating Technique, SMART)排序法的流量管理新方法,为流量转发选择最佳的下一跳邻居。为了使最大链路利用率最小化并提高性能,采用了流量调度算法。仿真结果表明,该算法在吞吐量和延迟方面都有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Preferential Multi-Attribute Rank based Forwarding Node Selection in Software Defined Networks
Today’s networks provide a plethora of applications with heterogeneous characteristics. The network generates a huge volume of traffic because of its distributed nature and requires preferential treatment for controlling them. The existing traditional system lacks efficiency because of the diverse nature of the network and the need for the high-performance network is imminent. However, one of the predominant issues that demand high attention is traffic flow management. This paper explores the various traffic management approaches and analyses the significant role played by the next hop neighbor node selection in improving the performance of the network. To address this issue, the emerging software defined networking paradigm (SDN) is introduced to enable flexible traffic flow control. A novel method for traffic flow management by adopting the Simple Multi-Attribute Rating Technique (SMART) ranking method has been proposed for selecting the best next hop neighbor for forwarding the flows. A flow scheduling algorithm has been adopted for minimizing the maximum link utilization and provide improved performance. Simulation result shows that the proposed algorithm performs better in terms of throughput and latency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信