There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 4836 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 4822 | - |
dc.citation.title | IEEE TRANSACTIONS ON MOBILE COMPUTING | - |
dc.citation.volume | 22 | - |
dc.contributor.author | Zhang, Xiaoxi | - |
dc.contributor.author | Chen, Siqi | - |
dc.contributor.author | Zhang, Yunfan | - |
dc.contributor.author | Im, Youngbin | - |
dc.contributor.author | Gorlatova, Maria | - |
dc.contributor.author | Ha, Sangtae | - |
dc.contributor.author | Joe-Wong, Carlee | - |
dc.date.accessioned | 2023-12-21T11:49:49Z | - |
dc.date.available | 2023-12-21T11:49:49Z | - |
dc.date.created | 2022-07-14 | - |
dc.date.issued | 2023-08 | - |
dc.description.abstract | Today's Internet must support applications with increasingly dynamic and heterogeneous connectivity requirements, such as video streaming and the Internet of Things. Yet current network management practices generally rely on pre-specified network configurations, which may not be able to cope with dynamic application needs. Moreover, even the best-specified policies will find it difficult to cover all possible scenarios, given applications' increasing heterogeneity and dynamic network conditions, e.g., on volatile wireless links. In this work, we instead propose a model-free learning approach to find the optimal network policies for current network flow requirements. This approach is attractive as comprehensive models do not exist for how different policy choices affect flow performance under changing network conditions. However, it can raise new challenges for online learning algorithms: policy configurations can affect the performance of multiple flows sharing the same network resources, and this performance coupling limits the scalability and optimality of existing online learning algorithms. In this work, we extend multi-armed bandit frameworks to propose new online learning algorithms for protocol selection with provably sublinear regret under certain conditions. We validate the optimality and scalability of our algorithms through data-driven simulations and testbed experiments. | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON MOBILE COMPUTING, v.22, no.8, pp.4822 - 4836 | - |
dc.identifier.doi | 10.1109/tmc.2022.3162880 | - |
dc.identifier.issn | 1536-1233 | - |
dc.identifier.scopusid | 2-s2.0-85128655716 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/58858 | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9755209 | - |
dc.identifier.wosid | 001022084500031 | - |
dc.language | 영어 | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Optimal Network Protocol Selection for Competing Flows via Online Learning | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | 5G mobile communication | - |
dc.subject.keywordAuthor | Bandwidth | - |
dc.subject.keywordAuthor | Heuristic algorithms | - |
dc.subject.keywordAuthor | Mobile computing | - |
dc.subject.keywordAuthor | multi-armed bandits | - |
dc.subject.keywordAuthor | Network protocol selection | - |
dc.subject.keywordAuthor | Network topology | - |
dc.subject.keywordAuthor | online algorithms | - |
dc.subject.keywordAuthor | online learning | - |
dc.subject.keywordAuthor | Protocols | - |
dc.subject.keywordAuthor | Topology | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.