.png){kind=icon}
返回
Recursive first fit: a highly parallel optimal solution to spectrum allocation
.png){kind=icon}
OA
AI
DOI：10.1364/JOCN.445492.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We revisit the classical spectrum allocation (SA) problem, a fundamental subproblem in optical network design, and make three contributions. First, we show how some SA problem instances may be decomposed into smaller instances that may be solved independently without loss of optimality. Second, we prove an optimality property of the well-known first-fit (FF) heuristic. Finally, we leverage this property to develop a recursive and parallel algorithm that applies the FF heuristic to find an optimal solution efficiently. This recursive FF algorithm is highly scalable because of two unique properties: (1) it completely sidesteps the symmetry inherent in SA and hence drastically reduces the solution space compared to typical integer linear programming formulations, and (2) the solution space can be naturally decomposed in non-overlapping subtrees that may be explored in parallel almost independently of each other, resulting in faster than linear speedup. (C) 2022 Optica Publishing Group
Keyword:
RESOURCE-ALLOCATION
OPTICAL NETWORKS
ASSIGNMENT
PATH
期刊
IF:
4.3
论文数:
2.2K
被引数:
3.8K
机构
引用论文
.png){kind=icon}
Crosstalk-Aware Shared Backup Path Protection in Multi-Core Fiber Elastic Optical Networks多芯光纤弹性光网络中串扰感知的共享备份路径保护
OAAI
OAAI分享收藏分享收藏Multiple Moat Modification of Mohs Micrographic Surgery for the Treatment of Anogenital Extramammary Paget Disease: Challenges and ConsiderationsMohs显微手术的多堤改造法治疗肛门生殖器外乳腺佩吉特病：挑战与考量
PREAI
分享收藏
查看更多内容