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....

Full description

Saved in:
Bibliographic Details
Main Authors: Sandra Arnaout, Md Arifur Rahman, Md Munjure Mowla, Slawomir Hausman, Piotr Korbel
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Delay optimization
greedy graph coloring algorithm
Hungarian algorithm
resource scheduling
time and wavelength division multiplexing passive optical network
Online Access:https://ieeexplore.ieee.org/document/10792921/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

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

Similar Items