### Abstract

This paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node's fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog^{2}N)^{1}, where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log^{3}N) with O(M) processors by parallel processing.

Original language | English |
---|---|

Publication status | Published - 01 Dec 2000 |

Event | 2000 TENCON Proceedings - Kuala Lumpur, Malaysia Duration: 24 Sep 2000 → 27 Sep 2000 |

### Other

Other | 2000 TENCON Proceedings |
---|---|

City | Kuala Lumpur, Malaysia |

Period | 24/09/00 → 27/09/00 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science Applications
- Electrical and Electronic Engineering

### Cite this

*Fast scheduling algorithm for WDM optical networks*. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .

}

**Fast scheduling algorithm for WDM optical networks.** / Cheah, Cheng Lai; Ali, Borhanuddin Mohd; Mukerjee, Malay R.; Prakash, V.; Selvakennedy, S.

Research output: Contribution to conference › Paper

TY - CONF

T1 - Fast scheduling algorithm for WDM optical networks

AU - Cheah, Cheng Lai

AU - Ali, Borhanuddin Mohd

AU - Mukerjee, Malay R.

AU - Prakash, V.

AU - Selvakennedy, S.

PY - 2000/12/1

Y1 - 2000/12/1

N2 - This paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node's fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog2N)1, where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log3N) with O(M) processors by parallel processing.

AB - This paper proposes a fast scheduling algorithm for time-slotted wavelength division multiplexing (WDM) broadcast-and-select optical networks. The algorithm is free from collision and supports bandwidth reservation to the nodes up to a node's fair share of the network capacity. Besides, the non-reserved bandwidth can be used for best effort transmission. The time complexity of the algorithm is O(Mlog2N)1, where M is the number of packets used for scheduling and N is the number of nodes. This running time complexity can be improved to O(log3N) with O(M) processors by parallel processing.

UR - http://www.scopus.com/inward/record.url?scp=0034431387&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034431387&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034431387

ER -