ADM reduction in SONET-WDM rings for stochastically varying traffic

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 proba...

Full description

Saved in:
Bibliographic Details
Main Authors: Gaurav Bhati, Saraph, G.P.
Format: Conference Proceeding
Language:English
Subjects:
Add-drop multiplexers
Bandwidth
Costs
Intelligent networks
SONET
Synchronous digital hierarchy
Telecommunication traffic
Time division multiplexing
Wavelength division multiplexing
WDM networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ICBN.2005.1589630