A scheduling algorithm for WDM optical networks

Cheng Lai Cheah, Borhanuddin Mohd Ali, Malay R. Mukerjee, V. Prakash, S. Selvakennedy

Research output: Contribution to journalArticle

Abstract

This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing.

Original languageEnglish
Pages (from-to)46-57
Number of pages12
JournalMalaysian Journal of Computer Science
Volume14
Issue number1
Publication statusPublished - 01 Dec 2001

Fingerprint

Fiber optic networks
Scheduling algorithms
Wavelength division multiplexing
Quality of service
Scheduling
Processing

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Cheah, C. L., Ali, B. M., Mukerjee, M. R., Prakash, V., & Selvakennedy, S. (2001). A scheduling algorithm for WDM optical networks. Malaysian Journal of Computer Science, 14(1), 46-57.
Cheah, Cheng Lai ; Ali, Borhanuddin Mohd ; Mukerjee, Malay R. ; Prakash, V. ; Selvakennedy, S. / A scheduling algorithm for WDM optical networks. In: Malaysian Journal of Computer Science. 2001 ; Vol. 14, No. 1. pp. 46-57.
@article{173f2b43cf4d4c06a00acf78181e8ce5,
title = "A scheduling algorithm for WDM optical networks",
abstract = "This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing.",
author = "Cheah, {Cheng Lai} and Ali, {Borhanuddin Mohd} and Mukerjee, {Malay R.} and V. Prakash and S. Selvakennedy",
year = "2001",
month = "12",
day = "1",
language = "English",
volume = "14",
pages = "46--57",
journal = "Malaysian Journal of Computer Science",
issn = "0127-9084",
publisher = "Faculty of Computer Science and Information Technology",
number = "1",

}

Cheah, CL, Ali, BM, Mukerjee, MR, Prakash, V & Selvakennedy, S 2001, 'A scheduling algorithm for WDM optical networks', Malaysian Journal of Computer Science, vol. 14, no. 1, pp. 46-57.

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

In: Malaysian Journal of Computer Science, Vol. 14, No. 1, 01.12.2001, p. 46-57.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A 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 - 2001/12/1

Y1 - 2001/12/1

N2 - This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing.

AB - This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. The algorithm is free from collision and supports a particular class of quality of service (QoS), namely constant bit rate (CBR). The running time complexity of the algorithm is O(Mlog2N)1, where M and N are the number of packets used for scheduling and the number of nodes, respectively. This running time can be improved to O(log3N) by parallel processing.

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

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

M3 - Article

VL - 14

SP - 46

EP - 57

JO - Malaysian Journal of Computer Science

JF - Malaysian Journal of Computer Science

SN - 0127-9084

IS - 1

ER -

Cheah CL, Ali BM, Mukerjee MR, Prakash V, Selvakennedy S. A scheduling algorithm for WDM optical networks. Malaysian Journal of Computer Science. 2001 Dec 1;14(1):46-57.