基于遗传算法的虚拟网络分组分组调度

Heru Sukoco, K. Okamura
{"title":"基于遗传算法的虚拟网络分组分组调度","authors":"Heru Sukoco, K. Okamura","doi":"10.1145/2002396.2002413","DOIUrl":null,"url":null,"abstract":"This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots.\n The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Grouping packet scheduling for virtual networks by genetic algorithm\",\"authors\":\"Heru Sukoco, K. Okamura\",\"doi\":\"10.1145/2002396.2002413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots.\\n The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.\",\"PeriodicalId\":409750,\"journal\":{\"name\":\"International Conference of Future Internet\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference of Future Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2002396.2002413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference of Future Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2002396.2002413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于组的分组调度设计,以维护路由器上的虚拟网络资源,如队列、带宽和处理时间。我们试图改进我们之前的方法,基于数据包和插槽大小,通过创建网络切片和流优先级来定义遗传算法所需的参数,由OpenFlow协议完成。我们希望得到比我们之前的方法更好的结果,我们之前的方法只涉及两个参数,即数据包大小和插槽数量。当网络连接到不支持包优先级机制的其他类型的网络时,就会出现这个问题。我们希望通过将虚拟交换机集成到虚拟OpenFlow交换机中来解决这个问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Grouping packet scheduling for virtual networks by genetic algorithm
This paper proposed a design of group-based packet scheduling to maintain virtual network resources such as queue, bandwidth, and process time on routers. We attempt to improve our previous approach, a Packet and Slot Size-based, by creating network slicing and flow priority level done by OpenFlow Protocol to define parameters needed by Genetic Algorithm. We desire to get better results compared to our previous approach that only involved 2 parameters, namely packet size and the number of slots. The problem will arise when the networks connected to other types of networks that do not support packet priority mechanisms. We expect that this problem can be accommodated by using virtual switch that integrated to virtual OpenFlow switch.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信