Highlights on a Study of Bicriteria Routing Methods with Protection for WDM Networks with Dynamic Traffic
暂无分享,去创建一个
[1] Marta M. B. Pascoal,et al. Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..
[2] José Craveirinha,et al. Performance Analysis of a Bi-Objective Model for Routing with Protection in WDM Networks , 2010 .
[3] João C. N. Clímaco,et al. A bicriteria routing model for multi-fibre WDM networks , 2009, Photonic Network Communications.
[4] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[5] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[6] Rita Girão-Silva,et al. A meta-model for multiobjective routing in MPLS networks , 2008, Central Eur. J. Oper. Res..
[7] Jason P. Jue,et al. Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints , 2005, Comput. Networks.
[8] Biswanath Mukherjee,et al. A review of fault management in WDM mesh networks: basic concepts and research challenges , 2004, IEEE Netw..
[9] João C. N. Clímaco,et al. On a bi-dimensional dynamic alternative routing method , 2005, Eur. J. Oper. Res..
[10] Mikkel Thorup,et al. Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..
[11] João C. N. Clímaco,et al. Finding non-dominated bicriteria shortest pairs of disjoint simple paths , 2009, Comput. Oper. Res..
[12] Christoph M. Gauger,et al. Reference Transport Network Scenarios , 2003 .