Optimal grooming in SONET-WDM ring networks corresponds to minimization of add-drop multiplexers under given constraints. The general grooming problem is NP-complete. We present an approach towards reduction in the number of ADMs under stochastically varying traffic. First, a model of blocking probability is presented. Then we present the complete mathematical formulation (ILP) of the problem. Lastly, we discuss the type of solution which is required for this problem.
['Gaurav Bhati', 'G.P. Saraph']
ADM reduction in SONET-WDM rings for stochastically varying traffic