A Fast Scheduling Algorithm for WDM Optical Networks
Wavelength Division Multiplexing (WDM) is emerging as the most promising approach to exploit the huge bandwidth of optical fibre. This approach divides the optical spectrum into many different channels where each channel corresponds to a different wavelength. Single-hop WDM networks are attractive i...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2000
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/10486/1/FK_2000_22.pdf |
| _version_ | 1796967947660427264 |
|---|---|
| author | Cheah, Cheng Lai |
| author_facet | Cheah, Cheng Lai |
| author_sort | Cheah, Cheng Lai |
| collection | UPM |
| description | Wavelength Division Multiplexing (WDM) is emerging as the most promising approach to exploit the huge bandwidth of optical fibre. This approach divides the optical spectrum into many different channels where each channel corresponds to a different wavelength. Single-hop WDM networks are attractive in local area environment where all the nodes can be connected to a single broadcast facility. In a single-hop WDM broadcast network, the transmitter must know when to transmit a packet and at which wavelength, while the receiver must know when to tune to the appropriate wavelength to receive the packet. This process requires some
form of coordination. Many researches have focused on the scheduling algorithms that perform this kind of coordination. This thesis proposes a scheduling algorithm for the WDM broadcast networks. The algorithm employs a theory in graph, known as edge colouring of bipartite multigraph to produce the transmission schedule, which is free from collision due to the nature of the edge colouring. An optimal edge colouring of bipartite multi graph can be found in O(M log2 N) time, where M is number of
packets selected for scheduling, and N is the number of the nodes. This time complexity can be improved to O(log3 N) by parallel processing using O(M) processors. Two variations of implementation of the scheduling algorithm have been
proposed, namely the Variable Frame Size (VFS) and Limited Frame Size (LFS) schemes. These schemes use different criteria to select packets from the nodes for scheduling. The VFS scheme is simple, but supports only best effort transmissions. The LFS scheme ensures the frame size of the transmission schedule is bounded, thus enabling it to support bandwidth guarantee to the nodes up to a node's fair share of the network capacity. The LFS scheme is capable of supporting constant bit rate and unspecified bit rate service categories, analogous to the Asynchronous Transfer Mode (ATM) services. The results show that the LFS scheme performs better than the VFS scheme in terms of channel utilisation, packet loss probability and network throughput for all the simulated traffic patterns, especially at heavy loads. Besides, the LFS scheme respects any level of bandwidth guarantee, while the unused bandwidth can be used for best effort transmissions. The results also show that the VFS and LFS schemes are future-proof as they are able to capitalise on the increase in the number of wavelength channels. |
| first_indexed | 2024-03-06T07:21:18Z |
| format | Thesis |
| id | upm.eprints-10486 |
| institution | Universiti Putra Malaysia |
| language | English English |
| last_indexed | 2024-04-09T03:50:07Z |
| publishDate | 2000 |
| record_format | dspace |
| spelling | upm.eprints-104862024-04-02T07:46:23Z http://psasir.upm.edu.my/id/eprint/10486/ A Fast Scheduling Algorithm for WDM Optical Networks Cheah, Cheng Lai Wavelength Division Multiplexing (WDM) is emerging as the most promising approach to exploit the huge bandwidth of optical fibre. This approach divides the optical spectrum into many different channels where each channel corresponds to a different wavelength. Single-hop WDM networks are attractive in local area environment where all the nodes can be connected to a single broadcast facility. In a single-hop WDM broadcast network, the transmitter must know when to transmit a packet and at which wavelength, while the receiver must know when to tune to the appropriate wavelength to receive the packet. This process requires some form of coordination. Many researches have focused on the scheduling algorithms that perform this kind of coordination. This thesis proposes a scheduling algorithm for the WDM broadcast networks. The algorithm employs a theory in graph, known as edge colouring of bipartite multigraph to produce the transmission schedule, which is free from collision due to the nature of the edge colouring. An optimal edge colouring of bipartite multi graph can be found in O(M log2 N) time, where M is number of packets selected for scheduling, and N is the number of the nodes. This time complexity can be improved to O(log3 N) by parallel processing using O(M) processors. Two variations of implementation of the scheduling algorithm have been proposed, namely the Variable Frame Size (VFS) and Limited Frame Size (LFS) schemes. These schemes use different criteria to select packets from the nodes for scheduling. The VFS scheme is simple, but supports only best effort transmissions. The LFS scheme ensures the frame size of the transmission schedule is bounded, thus enabling it to support bandwidth guarantee to the nodes up to a node's fair share of the network capacity. The LFS scheme is capable of supporting constant bit rate and unspecified bit rate service categories, analogous to the Asynchronous Transfer Mode (ATM) services. The results show that the LFS scheme performs better than the VFS scheme in terms of channel utilisation, packet loss probability and network throughput for all the simulated traffic patterns, especially at heavy loads. Besides, the LFS scheme respects any level of bandwidth guarantee, while the unused bandwidth can be used for best effort transmissions. The results also show that the VFS and LFS schemes are future-proof as they are able to capitalise on the increase in the number of wavelength channels. 2000-07 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/10486/1/FK_2000_22.pdf Cheah, Cheng Lai (2000) A Fast Scheduling Algorithm for WDM Optical Networks. Masters thesis, Universiti Putra Malaysia. English |
| spellingShingle | Cheah, Cheng Lai A Fast Scheduling Algorithm for WDM Optical Networks |
| title | A Fast Scheduling Algorithm for WDM Optical Networks |
| title_full | A Fast Scheduling Algorithm for WDM Optical Networks |
| title_fullStr | A Fast Scheduling Algorithm for WDM Optical Networks |
| title_full_unstemmed | A Fast Scheduling Algorithm for WDM Optical Networks |
| title_short | A Fast Scheduling Algorithm for WDM Optical Networks |
| title_sort | fast scheduling algorithm for wdm optical networks |
| url | http://psasir.upm.edu.my/id/eprint/10486/1/FK_2000_22.pdf |
| work_keys_str_mv | AT cheahchenglai afastschedulingalgorithmforwdmopticalnetworks AT cheahchenglai fastschedulingalgorithmforwdmopticalnetworks |