An Online Learning Multi-path Selection Framework for Multi-path Transmission Protocols

Kechao Cai, John C.S. Lui
{"title":"An Online Learning Multi-path Selection Framework for Multi-path Transmission Protocols","authors":"Kechao Cai, John C.S. Lui","doi":"10.1109/CISS.2019.8692900","DOIUrl":null,"url":null,"abstract":"In the last decade, we have witnessed a tremendous growth of inter-connectivity among hosts in networks. Many new data transmission protocols have been developed to enable multi-path data transmissions between two hosts. However, the existing multi-path transmission protocol designs are limited as they neglect the stochastic nature of the metrics of the paths, e.g., latency, available bandwidth, and packet loss. Moreover, there are different design requirements in the applications, such as low latency, bandwidth throttling, and low loss rate in data delivery. In this paper, we propose a flexible online learning multi-path selection (OLMPS) framework to select multiple paths by learning the stochastic metrics of the paths and meeting the design requirements of the applications. Specifically, we design a set of novel online learning algorithms in the OLMPS framework for three different applications, maxRTT constrained, bandwidth constrained, and loss rate constrained, multi-path selection, to select paths and satisfy the requirements. We prove that the algorithms can provide theoretical guarantees on both sublinear regret and sublinear violation in our OLMPS framework.","PeriodicalId":123696,"journal":{"name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2019.8692900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the last decade, we have witnessed a tremendous growth of inter-connectivity among hosts in networks. Many new data transmission protocols have been developed to enable multi-path data transmissions between two hosts. However, the existing multi-path transmission protocol designs are limited as they neglect the stochastic nature of the metrics of the paths, e.g., latency, available bandwidth, and packet loss. Moreover, there are different design requirements in the applications, such as low latency, bandwidth throttling, and low loss rate in data delivery. In this paper, we propose a flexible online learning multi-path selection (OLMPS) framework to select multiple paths by learning the stochastic metrics of the paths and meeting the design requirements of the applications. Specifically, we design a set of novel online learning algorithms in the OLMPS framework for three different applications, maxRTT constrained, bandwidth constrained, and loss rate constrained, multi-path selection, to select paths and satisfy the requirements. We prove that the algorithms can provide theoretical guarantees on both sublinear regret and sublinear violation in our OLMPS framework.
多路径传输协议的在线学习多路径选择框架
在过去十年中,我们见证了网络中主机之间互联性的巨大增长。为了实现两台主机之间的多路径数据传输,已经开发了许多新的数据传输协议。然而,现有的多路径传输协议设计是有限的,因为它们忽略了路径度量的随机性,例如延迟、可用带宽和数据包丢失。此外,在应用程序中还存在不同的设计要求,如低延迟、带宽限制、数据传输的低损失率等。在本文中,我们提出了一个灵活的在线学习多路径选择(OLMPS)框架,通过学习路径的随机度量来选择多条路径,并满足应用程序的设计要求。具体而言,我们在OLMPS框架中设计了一套新颖的在线学习算法,用于maxRTT约束、带宽约束和损失率约束三种不同的应用,多路径选择,以选择路径并满足需求。在我们的OLMPS框架中,我们证明了算法可以为次线性后悔和次线性违规提供理论保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信