Towards emergency networks security with per-flow queue rate management

M. Casoni, Carlo Augusto Grazia, Martin Klapež, Natale Patriciello
{"title":"Towards emergency networks security with per-flow queue rate management","authors":"M. Casoni, Carlo Augusto Grazia, Martin Klapež, Natale Patriciello","doi":"10.1109/PERCOMW.2015.7134087","DOIUrl":null,"url":null,"abstract":"When statistical multiplexing is used to provide connectivity to a number of client hosts through a high-delay link, the original TCP as well as TCP variants born to improve performance on those links often provide poor performance and sub-optimal QoS properties. To guarantee intra-protocol fairness, inter-protocol friendliness, low queues utilization and optimal throughput in mission-critical scenarios, Congestion Control Middleware Layer (C2ML) has been proposed as a tool for centralized and collaborative resource management. However, C2ML offers only very limited security guarantees. Because emergencies may be natural or man-provoked, in the latter case there may be interest to cut out legitimate users from the communication networks that support disaster recovery operations. In this paper we present Queue Rate Management (QRM), an Active Queue Management scheme able to provide protection from Resource Exhaustion Attacks in scenarios where access to the shared link is controlled by C2ML; the proposed algorithm checks whether a node is exceeding its allowed rate, and consequently decides whether to keep or drop packets coming from that node. We mathematically prove that with QRM the gateway queue size can never exceed the Bandwidth-Delay Product of the channel. Furthermore, we use the ns-3 simulator to compare QRM with CoDel and RED, showing how QRM provides better performance in terms of both throughput and QoS guarantees when employed with C2ML.","PeriodicalId":180959,"journal":{"name":"2015 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2015.7134087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

When statistical multiplexing is used to provide connectivity to a number of client hosts through a high-delay link, the original TCP as well as TCP variants born to improve performance on those links often provide poor performance and sub-optimal QoS properties. To guarantee intra-protocol fairness, inter-protocol friendliness, low queues utilization and optimal throughput in mission-critical scenarios, Congestion Control Middleware Layer (C2ML) has been proposed as a tool for centralized and collaborative resource management. However, C2ML offers only very limited security guarantees. Because emergencies may be natural or man-provoked, in the latter case there may be interest to cut out legitimate users from the communication networks that support disaster recovery operations. In this paper we present Queue Rate Management (QRM), an Active Queue Management scheme able to provide protection from Resource Exhaustion Attacks in scenarios where access to the shared link is controlled by C2ML; the proposed algorithm checks whether a node is exceeding its allowed rate, and consequently decides whether to keep or drop packets coming from that node. We mathematically prove that with QRM the gateway queue size can never exceed the Bandwidth-Delay Product of the channel. Furthermore, we use the ns-3 simulator to compare QRM with CoDel and RED, showing how QRM provides better performance in terms of both throughput and QoS guarantees when employed with C2ML.
基于单流队列速率管理的应急网络安全研究
当使用统计多路复用通过高延迟链路向许多客户机主机提供连接时,原始TCP以及为提高这些链路上的性能而产生的TCP变体通常会提供较差的性能和次优的QoS属性。为了在关键任务场景下保证协议内公平、协议间友好、低队列利用率和最佳吞吐量,拥塞控制中间件层(C2ML)被提出作为集中和协作的资源管理工具。然而,C2ML只提供非常有限的安全保证。由于紧急情况可能是自然发生的,也可能是人为造成的,在后一种情况下,可能有意将合法用户排除在支持灾难恢复行动的通信网络之外。在本文中,我们提出了队列速率管理(Queue Rate Management, QRM),一种主动队列管理方案,能够在共享链路访问由C2ML控制的情况下提供对资源耗尽攻击的保护;提出的算法检查节点是否超过其允许的速率,从而决定是否保留或丢弃来自该节点的数据包。从数学上证明了在QRM下网关队列的大小永远不会超过信道的带宽-延迟积。此外,我们使用ns-3模拟器将QRM与CoDel和RED进行比较,显示了当与C2ML一起使用时,QRM如何在吞吐量和QoS保证方面提供更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信