Scheduling in unidirectional WDM rings and its extensions

All-to-All Personalized Communication (AAPC) requires each of the N nodes in a network to send a unique message to each of the other N - 1 nodes. In this paper, we study the problem of scheduling AAPC in WDM rings with K wavelengths and T transmitter-receiver pairs per node. We first determine the theoretical lower bound on the schedule length in a unidirectional ring with negligible tuning delay. A scheduling method based on a "recursive packing procedure" is then proposed. Two extensions of the above work are also made. First, we use a similar method to schedule AAPC in bidirectional rings with a small T, which achieves a better schedule performance than the method in[1]. Second, we modify the schedule to take into account the effects of non-negligible tuning delay. The schedules derived in this paper can achieve the minimum length for some values of K and T, and a near minimum length in other cases.