计算机科学
分布式计算
带宽(计算)
调度(生产过程)
地铁列车时刻表
带宽分配
灵活性(工程)
资源配置
布线(电子设计自动化)
计算机网络
平面的
资源(消歧)
动态带宽分配
方案(数学)
前进飞机
资源管理(计算)
数据中心
变量(数学)
信道分配方案
共享资源
服务器
动态优先级调度
背景(考古学)
集合(抽象数据类型)
数学优化
作业车间调度
作者
Baojun Chen,Niangen Ye,Shuai Zhang,Jiawen Zhu,Weiqiang Sun,Weisheng Hu
出处
期刊:
日期:2025-12-02
卷期号:34: 1789-1803
标识
DOI:10.1109/ton.2025.3631962
摘要
Technologies such as intelligent reflective surface (IRS)-assisted free-space optics (FSO) systems, are capable of providing connectivity with varied bandwidth through flexibly allocating resources on a planer panel. This flexibility provides new opportunities in handling inter-rack traffic that is often unevenly distributed in space and time. In this paper, we explore a new type of resource allocation scheme by taking full advantage of this flexibility. The key ideas include: (1) dynamically divide the resource on the planar panel into two planes, such that the small and large flows can be handled separately; (2) in the plane serving small flows, use multi-hop routing with variable bandwidth connections to handle skewed traffic between source-destination pairs; (3) in the plane serving large flows, use direct links with variable bandwidth to schedule unevenly distributed demand. In essence, through flexible resource allocation in and between the two planes, this scheme is able to make more efficient use of resources. We theoretically analyze the capacities of the proposed scheme, where the effectiveness conditions and performance bounds for dynamic resource adaptation are derived and the traffic scheduling with flexible bandwidth in two planes is proved to be able to achieve constant factor approximation to the ideally optimal performance. We then propose a set of lightweight algorithms with performance guarantees in each of two planes, collectively calledFlexAlloc, to realize the flexibility and adaptivity of the proposed scheme, and discuss an example of this scheme in the context of IRS-assisted FSO systems. Our simulation results show thatFlexAllocexhibits significant superiority over existing schemes for unevenly distributed traffic at low computational complexity, and can reduce the average flow completion time by 56-81%.
科研通智能强力驱动
Strongly Powered by AbleSci AI