Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
Tóm tắt
Từ khóa
Tài liệu tham khảo
voloshin, 2011, Personal communication
korotky, 2006, scaling of most-likely traffic patterns of hose- and cost-constrained ring and mesh networks, 2006 Optical Fiber Communication Conference National Fiber Optic Engineers Conference OFC-06, 1, 10.1109/OFC.2006.216074
korotki, 2004, An overview of the global network expectation model, Proc IEEE/OSA OFC
diestel, 2005, Graph Theory
garey, 1979, Computers and Intractability A Guide to the Theory of NP-Completeness
vazirani, 2001, Approximation Algorithms
akiyama, 1981, A short proof of the linear arboricity for cubic graphs, Bull Liberal Arts Sci Nippon Med School, 2, 1
yang, 2002, Dynamic routing in translucent WDM optical networks, Proc IEEE ICC, 955
fedrizzi, 2010, A framework for regenerator site selection based on multiple paths, Proc IEEE/OSA Conf OFC
fedrizzi, 2010, Traffic independent heuristics for regenerator site selection for providing any-to-any optical connectivity, Proc IEEE/OSA OFC
kim, 2001, regenerator placement algorithms for connection establishment in all-optical networks, Communications IEE Proceedings-, 148, 25, 10.1049/ip-com:20010064
duh, 1997, Approximation of <formula formulatype="inline"> <tex Notation="TeX">$k$</tex></formula>-set cover by semi-local optimization, Pro 29th ACM STOC, 256
huang, 2006, Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms, IEEE J Sel Areas Commun, 24, 66, 10.1109/JSAC.2006.1613773