Problem
Research questions and friction points this paper is trying to address.
parallel data transmission
minimum longest path length
stochastic semi-bandit setting
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
🤖 AI Summary
研究解决在网络中选择k条路径以最小化最长传输时间的问题，提出一种半强盗算法来应对这一在线问题。
📝 Abstract
When performing parallel data transmission through a network using multiple paths, it is practically important to minimize the maximum transmission time among the selected paths. This study addresses an online problem in which $k$ paths from an origin vertex to a destination vertex must be selected at each time step within a network represented as a directed graph. Here, the number of paths going through each edge in each parallel data transmission is limited to its capacity, and the time required for transmission is determined stochastically. We formulate the semi-bandit problem of selecting a set of paths to minimize the maximum traversal time among the selected paths and propose an algorithm to solve it.
Innovation
Methods, ideas, or system contributions that make the work stand out.
semi-bandit problem
minimum longest path length
stochastic transmission time
🔎 Similar Papers
No similar papers found.
