On scheduling all-to-all personalized connections and cost-effective designs in WDM rings

In this paper, we consider the problem of seheduling all-to-all personalized connections (AAPC) in WDM rings. Scheduling one connection for every source-destination pair in a network of limited connectivity provides a way to reduce routing control and guarantee throughput. For a given number of wavelengths Ii and a given number of transceivers per node T, we first determine the lower bound (LB) on the schedule length, which depends on both K and T. To achieve the LB, either the network bandwidth, the I/O capacity, or both should be fully utilized. Our approach first constructs and then schedules circles, each of which is formed by up to four non-overlapping connections and can fully utilize the bandwidth of one wavelength. The proposed circle construction and scheduling algorithms can achieve the LB if K less than or equal to T < N-1 or T = N-1, and closely approach or achieve the LB otherwise. In addition, we determine the appropriate values of T and K for the cost-effective designs in WDM rings through analysis of the schedule length and network throughput.