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....
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10792921/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849311757472890880 |
|---|---|
| author | Sandra Arnaout Md Arifur Rahman Md Munjure Mowla Slawomir Hausman Piotr Korbel |
| author_facet | Sandra Arnaout Md Arifur Rahman Md Munjure Mowla Slawomir Hausman Piotr Korbel |
| author_sort | Sandra Arnaout |
| collection | DOAJ |
| description | 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. Dynamic wavelength and time slot scheduling play an important role in managing user traffic variation. As is well known, delay is one of the most important performance parameters of TWDM-PON. This motivates us to investigate the delay optimization problem and solve it through resource scheduling. To optimize delay performance, we propose a greedy graph coloring algorithm (GGCA) to dynamically assign the timeslots for upstream packet transmissions. Moreover, we also propose a Hungarian algorithm (HA) to solve the wavelength scheduling problem within the scheduled timeslots by the GGCA. Numerical simulations show that the proposed GGCA and HA provide approximately 70- 80% delay reduction compared to a fixed baseline algorithm that schedules the timeslots and the wavelength in a fixed manner. |
| format | Article |
| id | doaj-art-74a45cfd291943f0aa6873d34e1fb1f3 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-74a45cfd291943f0aa6873d34e1fb1f32025-08-20T03:53:17ZengIEEEIEEE Access2169-35362024-01-011219040019041010.1109/ACCESS.2024.351548310792921Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PONSandra Arnaout0Md Arifur Rahman1https://orcid.org/0000-0003-3861-9290Md Munjure Mowla2https://orcid.org/0000-0002-8883-5170Slawomir Hausman3https://orcid.org/0000-0003-3891-4214Piotr Korbel4https://orcid.org/0000-0003-3716-0932Research and Innovation Department, IS-Wireless, Piaseczno, PolandResearch and Innovation Department, IS-Wireless, Piaseczno, PolandResearch and Innovation Department, IS-Wireless, Piaseczno, PolandInstitute of Electronics, Lodz University of Technology, Łódź, PolandInstitute of Electronics, Lodz University of Technology, Łódź, PolandThe 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. Dynamic wavelength and time slot scheduling play an important role in managing user traffic variation. As is well known, delay is one of the most important performance parameters of TWDM-PON. This motivates us to investigate the delay optimization problem and solve it through resource scheduling. To optimize delay performance, we propose a greedy graph coloring algorithm (GGCA) to dynamically assign the timeslots for upstream packet transmissions. Moreover, we also propose a Hungarian algorithm (HA) to solve the wavelength scheduling problem within the scheduled timeslots by the GGCA. Numerical simulations show that the proposed GGCA and HA provide approximately 70- 80% delay reduction compared to a fixed baseline algorithm that schedules the timeslots and the wavelength in a fixed manner.https://ieeexplore.ieee.org/document/10792921/Delay optimizationgreedy graph coloring algorithmHungarian algorithmresource schedulingtime and wavelength division multiplexing passive optical network |
| spellingShingle | Sandra Arnaout Md Arifur Rahman Md Munjure Mowla Slawomir Hausman Piotr Korbel Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON IEEE Access Delay optimization greedy graph coloring algorithm Hungarian algorithm resource scheduling time and wavelength division multiplexing passive optical network |
| title | Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON |
| title_full | Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON |
| title_fullStr | Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON |
| title_full_unstemmed | Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON |
| title_short | Greedy Graph Coloring and Hungarian Algorithms for Resource Scheduling in TWDM-PON |
| title_sort | greedy graph coloring and hungarian algorithms for resource scheduling in twdm pon |
| topic | Delay optimization greedy graph coloring algorithm Hungarian algorithm resource scheduling time and wavelength division multiplexing passive optical network |
| url | https://ieeexplore.ieee.org/document/10792921/ |
| work_keys_str_mv | AT sandraarnaout greedygraphcoloringandhungarianalgorithmsforresourceschedulingintwdmpon AT mdarifurrahman greedygraphcoloringandhungarianalgorithmsforresourceschedulingintwdmpon AT mdmunjuremowla greedygraphcoloringandhungarianalgorithmsforresourceschedulingintwdmpon AT slawomirhausman greedygraphcoloringandhungarianalgorithmsforresourceschedulingintwdmpon AT piotrkorbel greedygraphcoloringandhungarianalgorithmsforresourceschedulingintwdmpon |