Chang Seok Mun, Byeon Kwnag June, Yeh Hong Jin, Wee Kyun Bum, Hong Man Pyo

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 8, pp. 2013-2026, Aug. 1998
10.3745/KIPSTE.1998.5.8.2013,   PDF Download:

Abstract

In optical passive star interconnections, all packets are transmitted between nodes in a broadcast-and-select manner. It is assumed that each node has a tunable transmitter and a fixed-wavelength receiver, and that all packet lengths are equal so that each transmission can be done in a unit time. The tuning delay, denoted by δ, means the amount of time for a transmitter to change its wavelength to another one. The problem is, given any value of the number of nodes N and the number of wavelengths k according to WDM implementations, to find transmission schedules with minimum cycle length for all-to-all broadcast where no one sends any packet to itself. In this paper, we prove that the cycle length of optimal transmission schedules should be at least max{N/k(N-1), kδ N-1}. A novel algorithm for optimal transmission schedules is then presented when N-1 is divisible by k. This algorithm also can be used for any values of N and k if the tuning delay δ does not affect strictly the cycle length of transmission schedules, i.e. N/k(N-1) > kδ N-1.

Statistics
Cite this article