Research on the Development of Programable Packet Scheduling

Y. Lin
{"title":"Research on the Development of Programable Packet Scheduling","authors":"Y. Lin","doi":"10.1109/cvidliccea56201.2022.9825157","DOIUrl":null,"url":null,"abstract":"The packet scheduling problem is a classical multidimensional decision problem that requires rational decisions on the inbound as well as the outbound timing of a huge number of packets. With the advent of programmable scheduling, the deployment of packet scheduling algorithms on switches is easier, and multiple scheduling algorithms can be implemented without changing the hardware architecture. The advent of programmable scheduling simplifies the testing and deployment of new scheduling algorithms and can make the application of packet scheduling algorithms much easier to implement.","PeriodicalId":23649,"journal":{"name":"Vision","volume":"16 1","pages":"1098-1101"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cvidliccea56201.2022.9825157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The packet scheduling problem is a classical multidimensional decision problem that requires rational decisions on the inbound as well as the outbound timing of a huge number of packets. With the advent of programmable scheduling, the deployment of packet scheduling algorithms on switches is easier, and multiple scheduling algorithms can be implemented without changing the hardware architecture. The advent of programmable scheduling simplifies the testing and deployment of new scheduling algorithms and can make the application of packet scheduling algorithms much easier to implement.
可编程分组调度的发展研究
数据包调度问题是一个经典的多维决策问题,它需要对大量数据包的入站和出站时间进行合理的决策。随着可编程调度的出现,分组调度算法在交换机上的部署变得更加容易,并且可以在不改变硬件架构的情况下实现多种调度算法。可编程调度的出现简化了新调度算法的测试和部署,并使分组调度算法的应用更容易实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信