Fast scheduling algorithm for WDM optical networks

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

Research output: Contribution to conferencePaper

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

Original languageEnglish
Publication statusPublished - 01 Dec 2000
Event2000 TENCON Proceedings - Kuala Lumpur, Malaysia
Duration: 24 Sep 200027 Sep 2000

Other

Other2000 TENCON Proceedings
CityKuala Lumpur, Malaysia
Period24/09/0027/09/00

Fingerprint

Fiber optic networks
Scheduling algorithms
Wavelength division multiplexing
Bandwidth
Scheduling
Processing

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Cheah, C. L., Ali, B. M., Mukerjee, M. R., Prakash, V., & Selvakennedy, S. (2000). Fast scheduling algorithm for WDM optical networks. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .
Cheah, Cheng Lai ; Ali, Borhanuddin Mohd ; Mukerjee, Malay R. ; Prakash, V. ; Selvakennedy, S. / Fast scheduling algorithm for WDM optical networks. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .
@conference{69827d01b5ef41979147fd6a89357692,
title = "Fast scheduling algorithm for WDM optical networks",
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(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.",
author = "Cheah, {Cheng Lai} and Ali, {Borhanuddin Mohd} and Mukerjee, {Malay R.} and V. Prakash and S. Selvakennedy",
year = "2000",
month = "12",
day = "1",
language = "English",
note = "2000 TENCON Proceedings ; Conference date: 24-09-2000 Through 27-09-2000",

}

Cheah, CL, Ali, BM, Mukerjee, MR, Prakash, V & Selvakennedy, S 2000, 'Fast scheduling algorithm for WDM optical networks' Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, 24/09/00 - 27/09/00, .

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

2000. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .

Research output: Contribution to conferencePaper

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 -

Cheah CL, Ali BM, Mukerjee MR, Prakash V, Selvakennedy S. Fast scheduling algorithm for WDM optical networks. 2000. Paper presented at 2000 TENCON Proceedings, Kuala Lumpur, Malaysia, .