Online available bandwidth estimation using multiclass supervised learning techniques

计算机科学 人工智能 机器学习 半监督学习 多类分类 监督学习 支持向量机 在线学习 在线算法 分类器(UML)
作者
Sukhpreet Kaur Khangura,Sami Akin
出处
期刊:Computer Communications [Elsevier]
卷期号:170: 177-189 被引量:1
标识
DOI:10.1016/j.comcom.2021.02.009
摘要

Abstract In order to answer how much bandwidth is available to an application from one end to another in a network, state-of-the-art estimation techniques, based on active probing, inject artificial traffic with a known structure into the network. At the receiving end, the available bandwidth is estimated by measuring the structural changes in the injected traffic, which are caused by the network path. However, bandwidth estimation becomes difficult when packet distributions are distorted by non-fluid bursty cross traffic and multiple links. This eventually leads to an estimation bias. One known approach to reduce the bias in bandwidth estimations is to probe a network with constant-rate packet trains and measure the average structural changes in them. However, one cannot increase the number of packet trains in a designated time period as much as needed because high probing intensity overloads the network and results in packet losses in probe and cross traffic, which distorts probe packet gaps and inflicts more bias. In this work, we propose a machine learning-based, particularly classification-based, method that provides reliable estimates utilizing fewer packet trains. Then, we implement supervised learning techniques. Furthermore, considering the correlated changes over time in traffic in a network, we apply filtering techniques on estimation results in order to track the changes in the available bandwidth. We set up an experimental testbed using the Emulab software and a dumbbell topology in order to create training and testing data for performance analysis. Our results reveal that our proposed method identifies the available bandwidth significantly well in single-link networks as well as networks with heavy cross traffic burstiness and multiple links. It is also able to estimate the available bandwidth in randomly generated networks where the network capacity and the cross traffic intensity vary substantially. We also compare our technique with the others that use direct probing and regression approaches, and show that ours has better performance in terms of standard deviation around the actual bandwidth values.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
3秒前
小二郎应助兴奋巧凡采纳,获得10
4秒前
5秒前
wanci应助冷傲小猫咪采纳,获得10
8秒前
英姑应助郑zhenglanyou采纳,获得10
10秒前
13秒前
辣味尖尖酱完成签到 ,获得积分10
15秒前
nhsyb嘉完成签到,获得积分10
15秒前
18秒前
nhsyb嘉发布了新的文献求助10
18秒前
18秒前
情怀应助tuanheqi采纳,获得20
19秒前
21秒前
23秒前
单薄茗发布了新的文献求助10
27秒前
锖婧完成签到 ,获得积分10
27秒前
贾静雯应助科研通管家采纳,获得10
28秒前
星辰大海应助科研通管家采纳,获得10
28秒前
鎏清畵应助科研通管家采纳,获得10
29秒前
FashionBoy应助科研通管家采纳,获得10
29秒前
贾静雯应助科研通管家采纳,获得10
29秒前
29秒前
冷傲小猫咪完成签到,获得积分10
29秒前
31秒前
循环不好的Cu完成签到,获得积分10
32秒前
huijie完成签到 ,获得积分10
34秒前
35秒前
小徐发布了新的文献求助10
38秒前
高晓澍完成签到,获得积分10
41秒前
彭于晏应助chenchenchen采纳,获得10
41秒前
FY完成签到,获得积分10
42秒前
丷Geng发布了新的文献求助10
44秒前
FY发布了新的文献求助10
45秒前
英俊的铭应助酸奶采纳,获得10
48秒前
胡八一完成签到 ,获得积分10
49秒前
50秒前
苏嘉完成签到,获得积分10
50秒前
纨绔发布了新的文献求助10
51秒前
51秒前
53秒前
高分求助中
Teaching Social and Emotional Learning in Physical Education 900
Plesiosaur extinction cycles; events that mark the beginning, middle and end of the Cretaceous 800
Recherches Ethnographiques sue les Yao dans la Chine du Sud 500
Two-sample Mendelian randomization analysis reveals causal relationships between blood lipids and venous thromboembolism 500
Chinese-English Translation Lexicon Version 3.0 500
[Lambert-Eaton syndrome without calcium channel autoantibodies] 460
Wisdom, Gods and Literature Studies in Assyriology in Honour of W. G. Lambert 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2394005
求助须知:如何正确求助?哪些是违规求助? 2097845
关于积分的说明 5286180
捐赠科研通 1825362
什么是DOI,文献DOI怎么找? 910154
版权声明 559943
科研通“疑难数据库(出版商)”最低求助积分说明 486433