概率的测定。传输优先级和非优先级数据时通信信道的临时特性

Sh. S. Karimov
{"title":"概率的测定。传输优先级和非优先级数据时通信信道的临时特性","authors":"Sh. S. Karimov","doi":"10.51346/tstu-01.19.3.-77-0037","DOIUrl":null,"url":null,"abstract":"The article discusses the issues of finding the main indicators of the quality of the communication channel in computer networks when transmitting priority and non-priority data at different frame lengths. To solve this problem, methods of the theory of queuing using Petri nets are proposed. The proposed method for calculating the temporal and probabilistic characteristics of computer networks allows determinining the main indicators of the quality of the channel in a stationary mode when transmitting priority and non-priority data of computing tools at various values of the input stream intensity. To simulate the transmission of priority and non-priority frames, a color temporary Petri net is proposed. An algorithm is proposed for determining the basic parameters of information transfer, based on the use of the Little formula and allowing one to determine the number of frames in a queue, the average time a frame has been in a queue, and other distinctive features of the algorithm include the use of the window mode. The proposed technique allows to reduce the loss of priority frames of trajectory information and ensuring their transmission in real time.","PeriodicalId":22199,"journal":{"name":"Technical science and innovation","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DETERMINATION OF PROBABILITY - TEMPORARY CHARACTERISTICS OF COMMUNICATION CHANNELS WHEN TRANSMITTING PRIORITY AND NON-PRIORITY DATA.\",\"authors\":\"Sh. S. Karimov\",\"doi\":\"10.51346/tstu-01.19.3.-77-0037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article discusses the issues of finding the main indicators of the quality of the communication channel in computer networks when transmitting priority and non-priority data at different frame lengths. To solve this problem, methods of the theory of queuing using Petri nets are proposed. The proposed method for calculating the temporal and probabilistic characteristics of computer networks allows determinining the main indicators of the quality of the channel in a stationary mode when transmitting priority and non-priority data of computing tools at various values of the input stream intensity. To simulate the transmission of priority and non-priority frames, a color temporary Petri net is proposed. An algorithm is proposed for determining the basic parameters of information transfer, based on the use of the Little formula and allowing one to determine the number of frames in a queue, the average time a frame has been in a queue, and other distinctive features of the algorithm include the use of the window mode. The proposed technique allows to reduce the loss of priority frames of trajectory information and ensuring their transmission in real time.\",\"PeriodicalId\":22199,\"journal\":{\"name\":\"Technical science and innovation\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Technical science and innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.51346/tstu-01.19.3.-77-0037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Technical science and innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.51346/tstu-01.19.3.-77-0037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文讨论了计算机网络在传输不同帧长的优先级和非优先级数据时,寻找通信信道质量主要指标的问题。为了解决这一问题,提出了基于Petri网的排队理论方法。所提出的计算计算机网络的时间和概率特性的方法允许在以各种输入流强度值传输计算工具的优先级和非优先级数据时,确定平稳模式下信道质量的主要指标。为了模拟优先帧和非优先帧的传输,提出了一种彩色临时Petri网。在Little公式的基础上,提出了一种确定信息传递基本参数的算法,该算法允许确定队列中的帧数,帧在队列中的平均时间,以及该算法的其他显著特征包括使用窗口模式。该技术减少了弹道信息优先帧的丢失,保证了信息的实时性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DETERMINATION OF PROBABILITY - TEMPORARY CHARACTERISTICS OF COMMUNICATION CHANNELS WHEN TRANSMITTING PRIORITY AND NON-PRIORITY DATA.
The article discusses the issues of finding the main indicators of the quality of the communication channel in computer networks when transmitting priority and non-priority data at different frame lengths. To solve this problem, methods of the theory of queuing using Petri nets are proposed. The proposed method for calculating the temporal and probabilistic characteristics of computer networks allows determinining the main indicators of the quality of the channel in a stationary mode when transmitting priority and non-priority data of computing tools at various values of the input stream intensity. To simulate the transmission of priority and non-priority frames, a color temporary Petri net is proposed. An algorithm is proposed for determining the basic parameters of information transfer, based on the use of the Little formula and allowing one to determine the number of frames in a queue, the average time a frame has been in a queue, and other distinctive features of the algorithm include the use of the window mode. The proposed technique allows to reduce the loss of priority frames of trajectory information and ensuring their transmission in real time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信