Dynamic ONU grouping algorithm based on combination partition for centralized flexible PON

The traditional optical access network architecture is fixed, and passive optical networking (PON) is only used as the transmission pipeline, which fails to make full use of the exchange capability of OLTs. In this paper, a dynamic optical network unit (ONU) grouping algorithm based on combination partition (DGACP) is proposed in the centralized flexible PON architecture. The algorithm transforms the global partitioning problem into a local partitioning problem, thereby reducing the number of algorithm iterations while obtaining the minimum cross-OLT traffic. Simulation results show that compared with the existing dynamic PON slice restructuring algorithm (DRA), the traffic gain of the DGACP is almost equal or slightly better, and the maximum running time is reduced from around 180 s to less than 0.5 s when the number of ONUs is 512.

Authors

Institutions

Publication Details

Journal
Applied Optics
Published
2024-08-15
DOI
https://doi.org/10.1364/ao.532343
Primary Topic
Advanced Photonic Communication Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic ONU grouping algorithm based on combination partition for centralized flexible PON

Lei Zhu, Fu Wang, Feng Tian, Xiangjun Xin et al.
Applied Optics
Advanced Photonic Communication Systems
article

Dynamic ONU grouping algorithm based on combination partition for centralized flexible PON

Lei Zhu, Fu Wang, Feng Tian, Xiangjun Xin, Sitong Zhou, Qinghua Tian, Dandan Sun, Junjie Chen, Xiao Zhang, Qi Zhang
article en

Abstract

The traditional optical access network architecture is fixed, and passive optical networking (PON) is only used as the transmission pipeline, which fails to make full use of the exchange capability of OLTs. In this paper, a dynamic optical network unit (ONU) grouping algorithm based on combination partition (DGACP) is proposed in the centralized flexible PON architecture. The algorithm transforms the global partitioning problem into a local partitioning problem, thereby reducing the number of algorithm iterations while obtaining the minimum cross-OLT traffic. Simulation results show that compared with the existing dynamic PON slice restructuring algorithm (DRA), the traffic gain of the DGACP is almost equal or slightly better, and the maximum running time is reduced from around 180 s to less than 0.5 s when the number of ONUs is 512.

Applied OpticsVol. 63(26)
Beijing Institute of Technology (CN), Beijing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 90%
Advanced Photonic Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.