|
Abstract : |
In this paper, we consider the problem of scheduling 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, K, and a given number of transceivers per node, T, we first determine the lower bound on the schedule length which depends on both K and T. To achieve the lower bound, either the network bandwidth or 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 4 non-overlapping connections and can fully utilize the bandwidth of one wavelength. We propose circle construction and scheduling algorithms which can achieve the lower bound if K T! N \Gamma 1 or T = N \Gamma 1, and closely approach or achieve the lower bound 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. 1, |
