1 May 2004 Efficient traffic grooming in synchronous optical network/wavelength-division multiplexing bidirectional line-switched ring networks
Author Affiliations +
Abstract
We study traffic grooming in synchronous optical network/wavelength-division multiplexing (SONET/WDM) bidirectional line-switched ring (BLSR) networks under the uniform all-to-all traffic model with an objective to reduce total network costs (wavelength and electronic multiplexing costs), in particular, to minimize the number of add-drop multiplexers (ADMs) while using the optimal number of wavelengths. We derive a new tighter lower bound for the number of wavelengths when the number of nodes is a multiple of 4. We show that this lower bound is achievable. We then derive new, more general, and tighter lower bounds for the number of ADMs subject to the constraint that the optimal number of wavelengths is used, and propose heuristic algorithms (the circle construction algorithm and the circle grooming algorithm) that try to minimize the number of ADMs while using the optimal number of wavelengths in BLSR networks. Both the bounds and algorithms are applicable to any value of r and for different wavelength granularity g. All previous ADM lower bounds except perhaps that in (Gerstel et al., 1999) were derived under the assumption that the magnitude of the traffic streams (r) is one unit (r = 1) with respect to the wavelength capacity granularity g. Performance evaluation shows that wherever applicable, our lower bounds are at least as good as existing bounds and are much tighter than existing ones in many cases. Our proposed heuristic grooming algorithms perform very well with traffic streams of larger magnitude. The resulting number of ADMs required is very close to the corresponding lower bounds derived in this paper.
Abdur R.B. Billah, Bin Wang, Abdul Ahad Sami Awwal, "Efficient traffic grooming in synchronous optical network/wavelength-division multiplexing bidirectional line-switched ring networks," Optical Engineering 43(5), (1 May 2004). https://doi.org/10.1117/1.1689331
JOURNAL ARTICLE
14 PAGES


SHARE
Back to Top