Optimal transmission schedule in WDM optical networks with multiple transmitters and receivers

Article type: Research Article

Authors: Lee, Sang‐Kyu | Oh, A. Duksu | Choi, Hyeong‐Ah

Affiliations: Department of Computer Science, Sookmyung Women's University, Seoul, Korea | Department of Mathematics and Computer Science, St. Mary's College of Maryland, St. Mary's City, MD 20686, USA | Department of Computer Science, George Washington University, Washington, DC 20052, USA

Abstract: In this paper, we study the problem of optimal transmission schedules for embedding complete graphs in WDM broadcast‐and‐select optical networks. An optimal transmission schedule is defined to be the one that schedules transmissions such that each node transmits once to every other node within a repeating cycle of minimum length. Our model assumes that the network has N nodes with k wavelength channels, and each node is equipped with α tunable transmitters and β fixed‐tuned receivers. Given α, β (1≤α,β≤k) and δ (tuning delay required for a transmitter to tune from one wavelength to another), we develop an optimal transmission schedule with schedule length max {αβN(N−1)/k, β(N−1)+kδ} such that each transmitter of each node transmits once to each receiver of its neighboring nodes within this time period.

Journal: Journal of High Speed Networks, vol. 10, no. 3, pp. 209-222, 2001