High-demanding transfers of extremely large amounts of data have been increasingly supported by the bandwidth reservation services in dedicated high-performance networks (HPNs). To use the bandwidth reservation service, a user needs to initialize a bandwidth reservation request (BRR) containing parameters and requirements of the bandwidth reservation or data transfer, such as the time interval. Upon receiving one BRR, existing researches and bandwidth reservation service providers return either the best-case bandwidth reservation (BR) or a reject message if not all the BRR requirements can be satisfied. In this paper, we study the intelligent and flexible bandwidth scheduling of two common types of BRRs: direct bandwidth reservation and indirect bandwidth reservation (data transfer). When not all the requirements of the first type can be satisfied, instead of a direct reject message, we identify and return two alternative BRs made within the closest time intervals before and after the user-specified time interval; for the second type, besides the above two alternative BRs, we also identify and return the alternative BR made within the closest time interval crossing the user-specified time interval. For each problem, we design a flexible bandwidth scheduling algorithm with rigorous optimality proofs to compute both the best-case and alternative BRs. For comparison, we also design two heuristic algorithms adapted from existing bandwidth scheduling algorithms. We then conduct extensive simulations to compare their overall performance, and the simulation results show that the proposed optimal algorithms have superior performance to those in comparison. To the best of our knowledge, our work in this paper is among the first to study intelligent and adaptive bandwidth scheduling with alternative BRs in HPNs.

中文翻译：

---

专用高性能网络中数据传输的智能灵活带宽调度

专用高性能网络 (HPN) 中的带宽预留服务越来越支持对极大量数据的高要求传输。为了使用带宽预留服务，用户需要初始化带宽预留请求(BRR)，其中包含带宽预留或数据传输的参数和要求，例如时间间隔。收到一个 BRR 后，现有研究和带宽预留服务提供商会返回最佳情况带宽预留 (BR) 或如果不能满足所有 BRR 要求，则返回拒绝消息。在本文中，我们研究了两种常见类型的 BRR 的智能灵活带宽调度：直接带宽预留和间接带宽预留（数据传输）。当不能满足第一类的所有要求时，代替直接拒绝消息，我们识别并返回在用户指定的时间间隔之前和之后最接近的时间间隔内生成的两个替代 BR；对于第二种类型，除了上述两个替代BR之外，我们还识别并返回在跨越用户指定时间间隔的最近时间间隔内所做的替代BR。对于每个问题，我们设计了一个灵活的带宽调度算法，并提供严格的最优性证明来计算最佳情况和替代 BR。为了进行比较，我们还设计了两种改编自现有带宽调度算法的启发式算法。然后，我们进行了广泛的仿真以比较它们的整体性能，仿真结果表明，所提出的最优算法具有优于比较算法的性能。据我们所知，