软件定义网络的自适应异化蚁群算法

A. Stefano, G. Cammarata, G. Morana, D. Zito
{"title":"软件定义网络的自适应异化蚁群算法","authors":"A. Stefano, G. Cammarata, G. Morana, D. Zito","doi":"10.1109/3PGCIC.2015.120","DOIUrl":null,"url":null,"abstract":"This paper introduces A4SDN, a distributed, adaptive, load-balancing algorithm for traffic engineering on Software-Defined Networks. A4SDN, i.e. the Adaptive Alienated Ant Algorithm for Software-Defined Networking, is based on the Alienated Ant Algorithm (AAA), a stochastic-based, heuristic approach used to solve combinatorial and multi-constraint optimisation problems. Based on a non natural ants' behaviour, the AAA forces the ants in searching for food to distribute themselves over all the available paths rather than converge to a single one. This strategy, applied to the packets to route, supplies an autonomic dynamic routing and leads to a better exploitation of the network bandwidth, enforcing best effort traffic and improving network performance. A comparison between A4SDN with two Dijkstra-based routing solutions clearly shows that A4SDN is able to guarantee a higher throughput associated with a lower delay and packet loss rate.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"A4SDN - Adaptive Alienated Ant Algorithm for Software-Defined Networking\",\"authors\":\"A. Stefano, G. Cammarata, G. Morana, D. Zito\",\"doi\":\"10.1109/3PGCIC.2015.120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces A4SDN, a distributed, adaptive, load-balancing algorithm for traffic engineering on Software-Defined Networks. A4SDN, i.e. the Adaptive Alienated Ant Algorithm for Software-Defined Networking, is based on the Alienated Ant Algorithm (AAA), a stochastic-based, heuristic approach used to solve combinatorial and multi-constraint optimisation problems. Based on a non natural ants' behaviour, the AAA forces the ants in searching for food to distribute themselves over all the available paths rather than converge to a single one. This strategy, applied to the packets to route, supplies an autonomic dynamic routing and leads to a better exploitation of the network bandwidth, enforcing best effort traffic and improving network performance. A comparison between A4SDN with two Dijkstra-based routing solutions clearly shows that A4SDN is able to guarantee a higher throughput associated with a lower delay and packet loss rate.\",\"PeriodicalId\":395401,\"journal\":{\"name\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2015.120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2015.120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

本文介绍了一种用于软件定义网络流量工程的分布式、自适应、负载均衡算法A4SDN。A4SDN,即软件定义网络的自适应异化蚂蚁算法,基于异化蚂蚁算法(AAA),这是一种基于随机的启发式方法,用于解决组合和多约束优化问题。基于非自然蚂蚁的行为,AAA迫使蚂蚁在寻找食物时将自己分布在所有可用的路径上,而不是收敛到单一路径上。这种策略应用于要路由的数据包,提供了一种自主的动态路由,并导致更好地利用网络带宽,实施最佳努力流量并提高网络性能。A4SDN与两种基于dijkstra的路由方案的比较清楚地表明,A4SDN能够保证更高的吞吐量,同时具有更低的延迟和丢包率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A4SDN - Adaptive Alienated Ant Algorithm for Software-Defined Networking
This paper introduces A4SDN, a distributed, adaptive, load-balancing algorithm for traffic engineering on Software-Defined Networks. A4SDN, i.e. the Adaptive Alienated Ant Algorithm for Software-Defined Networking, is based on the Alienated Ant Algorithm (AAA), a stochastic-based, heuristic approach used to solve combinatorial and multi-constraint optimisation problems. Based on a non natural ants' behaviour, the AAA forces the ants in searching for food to distribute themselves over all the available paths rather than converge to a single one. This strategy, applied to the packets to route, supplies an autonomic dynamic routing and leads to a better exploitation of the network bandwidth, enforcing best effort traffic and improving network performance. A comparison between A4SDN with two Dijkstra-based routing solutions clearly shows that A4SDN is able to guarantee a higher throughput associated with a lower delay and packet loss rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信