Title: Single-hop all-to-all broadcast in optical star networks with breakdown or power-off transceivers

Authors: J.C. Liu, H-J. Ho, S.L. Lee

Addresses: Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan. ' Department of Information Management, Department of Computer Science and Information Engineering, Wufeng Institute of Technology, Chiayi 621, Taiwan. ' Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 621, Taiwan

Abstract: Packet scheduling provides a way to reduce routing control and guarantees overall throughput. An interesting special case of the packet scheduling is all-to-all broadcast in which every transmitter and receiver pair has exactly one packet to be transferred. Several optimal scheduling algorithms have been proposed for the all-to-all broadcast problem in wavelength division multiplexed (WDM) optical star networks. However, these algorithms do not fit anymore when failures occur in some transceivers. In this paper, we consider the all-to-all broadcast problem in WDM optical star network with some breakdown or power-off transceivers. We focus on the all-optical scheduling problem where the traffic reaches its destination in single-hop without being converted to electronic form for reaching high data transmission rates. The transmitters are tunable with an associated tuning delay, and the receivers are fixed-tuned to one of the available wavelengths. In this model, we first identify the lower bounds of the scheduling length for the problem. Then, we propose single-hop scheduling algorithms to find the optimal solution in both terms of arbitrary number of wavelengths and value of tuning latency.

Keywords: all-to-all broadcast; packet scheduling; WDM; optical star networks; tuning latency; single-hop scheduling; wavelength division multiplexed; breakdown; power-off transceivers.

DOI: 10.1504/IJCNDS.2008.020709

International Journal of Communication Networks and Distributed Systems, 2008 Vol.1 No.3, pp.251 - 261

Published online: 12 Oct 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article