Profit Maximization in Flex-Grid All-Optical Networks
暂无分享,去创建一个
[1] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[3] Guy Kortsarz,et al. Multicoloring: Problems and Techniques , 2004, MFCS.
[4] Mordechai Shalom,et al. On the interval chromatic number of proper interval graphs , 2015, Discret. Math..
[5] Ori Gerstel. Realistic approaches to scaling the IP network using optics , 2011, 2011 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference.
[6] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[7] Ralf Klasing,et al. Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .
[8] Mikkel Thorup,et al. OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.
[9] Masahiko Jinno,et al. Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies , 2009, IEEE Communications Magazine.
[10] Shmuel Zaks,et al. Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.
[11] Suresh Venkatasubramanian,et al. Restricted strip covering and the sensor cover problem , 2007, SODA '07.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Kumar N. Sivarajan,et al. Optical Networks: A Practical Perspective, 3rd Edition , 2009 .
[14] Andrew V. Goldberg,et al. Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.
[15] O. Gerstel. Flexible use of Spectrum and Photonic Grooming , 2010 .
[16] Shmuel Zaks,et al. Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract) , 2014, MFCS.