Experiments with a Queuing Mechanism over Ever-Changing Data Rates in a VHF Network

R. Lopes, Pooja Hanavadi Balaraju, Adrián Toribio Silva, Paulo H. L. Rettore, P. Sevenich
{"title":"Experiments with a Queuing Mechanism over Ever-Changing Data Rates in a VHF Network","authors":"R. Lopes, Pooja Hanavadi Balaraju, Adrián Toribio Silva, Paulo H. L. Rettore, P. Sevenich","doi":"10.1109/MILCOM47813.2019.9020863","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss experimental results testing a hierarchy of queues controlling the user data-flow over a VHF network with ever-changing data rates (up to 9.6 kbps). We challenged our solution creating three patterns of ever-changing data rates using a stochastic model to include the element of chance (randomness) that can be reproduced for quantitative comparisons. We discuss numbers showing that our queuing mechanism adapts its behavior (i.e. shaping the user data-flow) to the network conditions using feedback from the radio buffer (reactive) and from the routing protocol (proactive). Thus, our hybrid solution monitors the radio buffer occupancy to pause the transmission when a threshold is crossed, and proactively adds an inter-packet interval (IPI). The IPI varies as a function of the link data rate (computed by a tactical router), current network usage, packet loss and latency. The experimental results show three queues (for messages, IP packets and the radio buffer) complementing each other to handle different network conditions while transmitting a message that surely overflows the radio buffer (four times the buffer size).","PeriodicalId":371812,"journal":{"name":"MILCOM 2019 - 2019 IEEE Military Communications Conference (MILCOM)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2019 - 2019 IEEE Military Communications Conference (MILCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM47813.2019.9020863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper, we discuss experimental results testing a hierarchy of queues controlling the user data-flow over a VHF network with ever-changing data rates (up to 9.6 kbps). We challenged our solution creating three patterns of ever-changing data rates using a stochastic model to include the element of chance (randomness) that can be reproduced for quantitative comparisons. We discuss numbers showing that our queuing mechanism adapts its behavior (i.e. shaping the user data-flow) to the network conditions using feedback from the radio buffer (reactive) and from the routing protocol (proactive). Thus, our hybrid solution monitors the radio buffer occupancy to pause the transmission when a threshold is crossed, and proactively adds an inter-packet interval (IPI). The IPI varies as a function of the link data rate (computed by a tactical router), current network usage, packet loss and latency. The experimental results show three queues (for messages, IP packets and the radio buffer) complementing each other to handle different network conditions while transmitting a message that surely overflows the radio buffer (four times the buffer size).
VHF网络中不断变化数据速率的排队机制实验
在本文中,我们讨论了在数据速率不断变化(高达9.6 kbps)的VHF网络上测试控制用户数据流的队列层次结构的实验结果。我们对我们的解决方案进行了挑战,使用随机模型创建了三种不断变化的数据速率模式,其中包括可以用于定量比较的机会元素(随机性)。我们讨论了显示我们的排队机制使用来自无线电缓冲区(被动)和路由协议(主动)的反馈来适应其行为(即塑造用户数据流)的网络条件的数字。因此,我们的混合解决方案监视无线电缓冲区占用情况,以便在超过阈值时暂停传输,并主动添加包间间隔(IPI)。IPI随链路数据速率(由战术路由器计算)、当前网络使用、数据包丢失和延迟的函数而变化。实验结果表明,三个队列(用于消息、IP数据包和无线电缓冲区)相互补充,以处理不同的网络条件,同时传输一定会溢出无线电缓冲区(缓冲区大小的四倍)的消息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信