Traffic grooming in unidirectional WDM ring networks using design theory
暂无分享,去创建一个
[1] P. Hell,et al. Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .
[2] George N. Rouskas,et al. A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .
[3] Stéphane Pérennes,et al. Traffic grooming in WDM networks with multi-layer switches , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[4] Ori Gerstel,et al. Cost effective traffic grooming in WDM 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.
[5] George N. Rouskas,et al. Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..
[6] Jean-Claude Bermond,et al. Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case , 2003 .
[7] Chunming Qiao,et al. On scheduling all-to-all personalized connections and cost-effective designs in WDM rings , 1999, TNET.
[8] Jean-Claude Bermond,et al. Decomposition of complete graphs into isomorphic subgraphs with five vertices , 1980 .
[9] A.L. Chiu,et al. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.
[10] Jian-Qiang Hu,et al. Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic , 2002 .
[11] Jian Wang,et al. Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .
[12] D. Coudert,et al. Lightpath assignment for multifibers wdm optical networks with wavelength translators , 2002 .
[13] Jean-Claude Bermond,et al. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 , 2003, Networks.
[14] Charles J. Colbourn,et al. Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements , 2001 .
[15] 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.
[16] Charles J. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[17] Peng-Jun Wan,et al. Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.
[18] Chunming Qiao,et al. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.
[19] Xin Yuan,et al. Wavelength assignment to minimize the number of SONET ADMs in WDM rings , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[20] Charles J. Colbourn,et al. Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs , 2003, Discret. Math..
[21] Eytan Modiano,et al. Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..
[22] J. Bermond,et al. Graph decompositions and G-designs , 1976 .
[23] Charles J. Colbourn,et al. Grooming in unidirectional rings: K4-e designs , 2004, Discret. Math..
[24] George N. Rouskas,et al. On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..