Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON

Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON

The time and wavelength division multiplexing passive optical network (TWDM-PON) allows numerous users to share a single optical fiber and wavelength. In TWDM-PON, the optical network unit (ONU) has different upstream and downstream user traffic to serve using a limited amount of optical resources....

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Sandra Arnaout, Md Arifur Rahman, Md Munjure Mowla, Slawomir Hausman, Piotr Korbel
Fformat: Erthygl
Iaith:English
Cyhoeddwyd: IEEE 2024-01-01
Cyfres:IEEE Access
Pynciau:
Delay optimization
greedy graph coloring algorithm
Hungarian algorithm
resource scheduling
time and wavelength division multiplexing passive optical network
Mynediad Ar-lein:https://ieeexplore.ieee.org/document/10792921/

Rhyngrwyd

https://ieeexplore.ieee.org/document/10792921/

Eitemau Tebyg