Skip to Main Content
We consider the sparse placement of grooming-nodes in WDM mesh networks under dynamic traffic. We formulate the problem as a weighted minimum dominating set of graphs; and compare our scheme, via simulation, to known heuristics.
Optical Fiber Communication Conference, 2004. OFC 2004 (Volume:2 )
Date of Conference: 23-27 Feb. 2004