Optimal Traffic Grooming In Wdm Mesh Networks Under Dynamic Traffic

Abstract

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. © 2003 Optical Society of America

    Similar works