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.
© 2004 Optical Society of America
PDF ArticleMore Like This
Biswanath Mukherjee, Canhui (Sam) Ou, Hongyue Zhu, Keyao Zhu, Narendra Singhal, and Shun Yao
ThG1 Optical Fiber Communication Conference (OFC) 2004
Ankitkumar N. Patel, Chengyi Gao, Jason P. Jue, Xi Wang, Qiong Zhang, Paparao Palacharla, and Takao Naito
NTuA1 National Fiber Optic Engineers Conference (NFOEC) 2010
C. Ou, K. Zhu, B. Mukherjee, H. Zang, and L. Sahasrabuddhe
FA7 Optical Fiber Communication Conference (OFC) 2003