Many large-scale applications in broad science, engineering, and business domains are generating big data, which must be transferred to remote sites for various storage and analysis purposes. Bandwidth reservation services that discover feasible routing options over dedicated paths in high-performance networks have proved to be effective for such big data transfer. In this paper, we formulate a generic problem of bandwidth scheduling with two variable node-disjoint paths (BS-2VNDP) by exploring the flexibility and capacity of multiple data transfer paths. We further consider two variable paths of either fixed or variable bandwidth with negligible or non-negligible path switching delay, referred to as 2VPFB-0/1 and 2VPVB-0/1, respectively. We prove that all of these four scheduling problems are NP-complete, and then propose a heuristic algorithm for each. For performance comparison, we also design several other heuristic algorithms based on a greedy strategy. These scheduling algorithms are implemented and tested in both simulated and real-life networks, and extensive results show that the proposed heuristic algorithms significantly outperform other algorithms in comparison.

中文翻译：

---

具有两个可变节点不相交路径的大数据传输的带宽调度

广泛的科学、工程和商业领域中的许多大型应用程序正在生成大数据，这些数据必须传输到远程站点以用于各种存储和分析目的。在高性能网络的专用路径上发现可行的路由选项的带宽预留服务已被证明对于此类大数据传输是有效的。在本文中，我们通过探索多个数据传输路径的灵活性和容量，制定了具有两个可变节点不相交路径 (BS-2VNDP) 的带宽调度的一般问题。我们进一步考虑具有可忽略或不可忽略的路径切换延迟的固定或可变带宽的两个可变路径，分别称为 2VPFB-0/1 和 2VPVB-0/1。我们证明这四个调度问题都是 NP 完全的，然后为每个提出启发式算法。为了性能比较，我们还设计了其他几种基于贪婪策略的启发式算法。这些调度算法在模拟和现实网络中都得到了实现和测试，大量结果表明，所提出的启发式算法相比其他算法明显优于其他算法。