Congestion or No Congestion: Packet Loss Identification and Prediction Using Machine Learning

Inayat Ali, Sonia Sabir, Seungwoo Hong, Taesik Cheung
{"title":"Congestion or No Congestion: Packet Loss Identification and Prediction Using Machine Learning","authors":"Inayat Ali, Sonia Sabir, Seungwoo Hong, Taesik Cheung","doi":"arxiv-2408.03007","DOIUrl":null,"url":null,"abstract":"Packet losses in the network significantly impact network performance. Most\nTCP variants reduce the transmission rate when detecting packet losses,\nassuming network congestion, resulting in lower throughput and affecting\nbandwidth-intensive applications like immersive applications. However, not all\npacket losses are due to congestion; some occur due to wireless link issues,\nwhich we refer to as non-congestive packet losses. In today's hybrid Internet,\npackets of a single flow may traverse wired and wireless segments of a network\nto reach their destination. TCP should not react to non-congestive packet\nlosses the same way as it does to congestive losses. However, TCP currently can\nnot differentiate between these types of packet losses and lowers its\ntransmission rate irrespective of packet loss type, resulting in lower\nthroughput for wireless clients. To address this challenge, we use machine\nlearning techniques to distinguish between these types of packet losses at end\nhosts, utilizing easily available features at the host. Our results demonstrate\nthat Random Forest and K-Nearest Neighbor classifiers perform better in\npredicting the type of packet loss, offering a promising solution to enhance\nnetwork performance.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.03007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Packet losses in the network significantly impact network performance. Most TCP variants reduce the transmission rate when detecting packet losses, assuming network congestion, resulting in lower throughput and affecting bandwidth-intensive applications like immersive applications. However, not all packet losses are due to congestion; some occur due to wireless link issues, which we refer to as non-congestive packet losses. In today's hybrid Internet, packets of a single flow may traverse wired and wireless segments of a network to reach their destination. TCP should not react to non-congestive packet losses the same way as it does to congestive losses. However, TCP currently can not differentiate between these types of packet losses and lowers its transmission rate irrespective of packet loss type, resulting in lower throughput for wireless clients. To address this challenge, we use machine learning techniques to distinguish between these types of packet losses at end hosts, utilizing easily available features at the host. Our results demonstrate that Random Forest and K-Nearest Neighbor classifiers perform better in predicting the type of packet loss, offering a promising solution to enhance network performance.
拥塞与否:使用机器学习识别和预测数据包丢失
网络中的数据包丢失会严重影响网络性能。大多数 TCP 变体在检测到数据包丢失时都会降低传输速率,假定网络拥塞,从而导致吞吐量降低,影响带宽密集型应用(如沉浸式应用)。然而,并非所有数据包丢失都是由于拥塞造成的;有些数据包丢失是由于无线链路问题造成的,我们称之为非拥塞数据包丢失。在当今的混合互联网中,单个数据流的数据包可能会穿越网络的有线和无线段到达目的地。TCP 对非拥塞丢包的反应不应与对拥塞丢包的反应相同。然而,TCP 目前无法区分这些类型的数据包丢失,无论数据包丢失类型如何,它都会降低传输速率,从而导致无线客户端的吞吐量降低。为了应对这一挑战,我们利用机器学习技术来区分终端主机上的这些数据包丢失类型,同时利用主机上易于获得的特征。我们的研究结果表明,随机森林分类器和 K 近邻分类器在预测数据包丢失类型方面表现更佳,为提高网络性能提供了有前途的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信