Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract)
暂无分享,去创建一个
[1] Ori Gerstel,et al. Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[2] S. Raghavan,et al. The regenerator location problem , 2010 .
[3] Byrav Ramamurthy,et al. Dynamic routing in translucent WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[4] Elio Salvadori,et al. Traffic independent heuristics for regenerator site selection for providing any-to-any optical connectivity , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.
[5] S Pachnicke,et al. Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks , 2008, OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference.
[6] Peng-Jun Wan,et al. Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.
[7] Gianpiero Monaco,et al. On the complexity of the regenerator placement problem in optical networks , 2011, TNET.
[8] Byrav Ramamurthy,et al. Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing , 2005, Photonic Network Communications.
[9] Peter Winkler,et al. Wavelength assignment and generalized interval graph coloring , 2003, SODA '03.
[10] Shmuel Zaks,et al. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests , 2010, ICALP.
[11] Gianpiero Monaco,et al. Minimizing total busy time in parallel scheduling with application to optical networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[12] Elio Salvadori,et al. A framework for regenerator site selection based on multiple paths , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.
[13] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[14] Michael Tarsi,et al. Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..
[15] N. Golmie,et al. Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..
[16] Peng-Jun Wan,et al. Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs , 2002, J. Comb. Optim..
[17] Gianpiero Monaco,et al. Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs , 2008, Euro-Par.
[18] Seung-Woo Seo,et al. Regenerator placement algorithms for connection establishment in all-optical networks , 2001 .
[19] Peng-Jun Wan,et al. Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..