OVERLOAD AND TRAFFIC MANAGEMENT OF MESSAGE SOURCES WITH DIFFERENT PRIORITY OF SERVICE

Q4 Engineering
Valerii Kozlovskyi, Valerii Kozlovskyi, Andrii Toroshanko, Oleksandr Toroshanko, Natalia Yakumchuk
{"title":"OVERLOAD AND TRAFFIC MANAGEMENT OF MESSAGE SOURCES WITH DIFFERENT PRIORITY OF SERVICE","authors":"Valerii Kozlovskyi, Valerii Kozlovskyi, Andrii Toroshanko, Oleksandr Toroshanko, Natalia Yakumchuk","doi":"10.35784/iapgos.3505","DOIUrl":null,"url":null,"abstract":"The scheme of dynamic management of traffic and activity of message sources with different priority of service is considered. The scheme is built on the basis of the neuroprognostic analysis model and the gradient descent method. For prediction and early detection of overload, the apparatus of the general theory of sensitivity with indirect feedback and control of activity of message sources is used. The control algorithm is started at the bottleneck of the network node. It uses a recursive prediction approach where the neural network output is referred to as many steps as defined by a given prediction horizon. Traffic with a higher priority is served without delay using the entire available bandwidth. Low-priority traffic will use the remaining bandwidth not used by higher-priority traffic. An algorithm for estimating the maximum available bandwidth of a communication node for traffic with a low service priority has been developed. This approach makes it possible to improve the efficiency of channel use without affecting the quality of service for high-priority traffic.","PeriodicalId":53131,"journal":{"name":"Informatyka Automatyka Pomiary w Gospodarce i Ochronie Srodowiska","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatyka Automatyka Pomiary w Gospodarce i Ochronie Srodowiska","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35784/iapgos.3505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

The scheme of dynamic management of traffic and activity of message sources with different priority of service is considered. The scheme is built on the basis of the neuroprognostic analysis model and the gradient descent method. For prediction and early detection of overload, the apparatus of the general theory of sensitivity with indirect feedback and control of activity of message sources is used. The control algorithm is started at the bottleneck of the network node. It uses a recursive prediction approach where the neural network output is referred to as many steps as defined by a given prediction horizon. Traffic with a higher priority is served without delay using the entire available bandwidth. Low-priority traffic will use the remaining bandwidth not used by higher-priority traffic. An algorithm for estimating the maximum available bandwidth of a communication node for traffic with a low service priority has been developed. This approach makes it possible to improve the efficiency of channel use without affecting the quality of service for high-priority traffic.
不同服务优先级消息源的过载和流量管理
考虑了不同服务优先级的消息源的流量和活动动态管理方案。该方案建立在神经预后分析模型和梯度下降法的基础上。对于过载的预测和早期检测,采用了具有间接反馈和消息源活动控制的一般灵敏度理论装置。控制算法在网络节点的瓶颈处启动。它使用递归预测方法,其中神经网络输出被指指由给定预测范围定义的尽可能多的步骤。优先级高的流量可以毫无延迟地使用整个可用带宽。低优先级流量将使用高优先级流量未使用的剩余带宽。提出了一种估计具有低业务优先级的通信节点最大可用带宽的算法。这种方法可以在不影响高优先级业务的服务质量的情况下提高信道使用效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
40
审稿时长
10 weeks
×
引用
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学术官方微信