随机半带反馈设置下最小化最长路径长度的k条路径选择
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
浏览论文内容
中文总结 AI 辅助
针对并行数据传输中需最小化所选路径最大传输时间的问题，本文将其形式化为随机半带设置下的k路径选择问题，并提出相应求解算法。
中文摘要 AI 辅助
在使用多条路径进行网络并行数据传输时，最小化所选路径中的最大传输时间具有重要的实际意义。本研究针对一个在线问题：在一个表示为有向图的网络中，每个时间步需要从源顶点到目的顶点选择k条路径。这里，每次并行传输中经过每条边的路径数量受限于其容量，且传输所需的时间是随机确定的。我们将选择一组路径以最小化所选路径中最大遍历时间的问题形式化为半带问题，并提出一种算法来解决该问题。
英文摘要
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.
发表机构
- Graduate School of Information Science and Technology, Hokkaido University（北海道大学信息科学与技术研究生院）
机构由 AI 辅助整理，请以论文原文为准。
