Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

A Scheduling Algorithm for WDM Optical Networks

Cheah, Cheng Lai and Borhanuddin Mohd. Ali, and Mukerjee, Malay R. and Prakash, V. and Selvakennedy, S. (2001) A Scheduling Algorithm for WDM Optical Networks. Malaysian Journal of Computer Science, 14 (1). pp. 46-57. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=113

Affiliations

Universiti Putra Malaysia
Taylor’s College

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) , 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.

Item Type:Journal
Keywords:WDM optical networks, Scheduling algorithm
Subjects:Q Science
ID Code:264

B. Mukherjee, “WDM -Based Local Lightwave Networks Part I: Single-Hop Systems”. IEEE Networks, Vol. 6, No. 3, May 1992, pp. 12-27.

I.P. Kaminow et. al., “A Wideband All-Optical Network”. IEEE JSAC, Vol. 14, No. 5, June 1996, pp. 780- 799.

M. Borella and B. Mukherjee, “Efficient Scheduling of Nonuniform Packet Traffic in a WDM/TDM Local Lightwave Network with Arbitrary Transceiver Tuning Latencies”, in IEEE Infocom ‘95, Boston Park Plaza, Vol. 2, April 4-6, 1995, pp. 129-137.

G.N. Rouskas and V. Sivaraman, “Packet Scheduling in Broadcast WDM Networks with Arbitrary Transceiver Tuning Latencies”. IEEE/ACM Transactions on Networking, Vol. 5, No. 3, June 1997, pp. 359- 370.

A. Dasylva and R. Srikant, “Optimal WDM Schedules for Optical Star Networks”. IEEE/ACM Transactions on Networking, Vol. 7, No. 3, June 1999, pp. 446-456.

G.N. Rouskas and M.H. Ammar, “Analysis and Optimization of Transmission Schedules for Single-Hop WDM Networks”. IEEE/ACM Transactions on Networking, Vol. 3, No. 2, April 1995, pp. 211-221.

K.M. Sivalingam and J. Wang, “Media Access Protocols for WDM Networks with On -Line Scheduling”. IEEE/OSA Journal of Lightwave Technology, Vol. 14, No. 6, June 1996, pp. 1278-1286.

A. Kam, K.-Y. Siu, R. Barry, and E. Swanson, “A Cell Switching WDM Broadcast LAN with Bandwidth Guarantee and Fair Access”. IEEE/OSA Journal of Lightwave Technology, Vol. 16, No. 12, December 1998, pp. 2265-2280.

G. Chartrand and O.R. Oellermann, Applied and Algorithmic Graph Theory. McGraw-Hill, 1993.

Alexander Schrijver, “Bipartite Edge Coloring in O(Dm) Time”. SIAM Journal of Computing, Vol. 28, No. 3, 1998, pp. 841-846.

H.N. Gabow and O. Kariv, “Algorithms for Edge Coloring Bipartite Graphs and Multigraphs”. SIAM Journal of Computing, Vol. 11, No. 1, February 1982, pp. 117-129.

Harold N. Gabow, “Using Euler Partitions to Edge Color Bipartite Multigraphs”. International Journal of Computer and Information Sciences, Vol. 5, No. 4, December 1976, pp. 345-355.

A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge University Press, 1988.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.