LERP: a Quality of Transmission Dependent Heuristic for Routing and Wavelength Assignment in Hybrid WDM Networks
暂无分享,去创建一个
Maurice Gagnaire | Mohamed Koubàa | Sawsan Al Zahr | Nicolas Puech | Mohamed Ali Ezzahdi | S. A. Zahr | M. Gagnaire | N. Puech | M. Koubàa
[1] H. T. Mouftah,et al. A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion , 2004, IEEE Journal on Selected Areas in Communications.
[2] Byrav Ramamurthy,et al. Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing , 2005, Photonic Network Communications.
[3] Zhensheng Zhang,et al. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[4] Jiangchuan Liu,et al. Analysis of sparse-partial wavelength conversion in wavelength-routed WDM networks , 2004, IEEE INFOCOM 2004.
[5] Byrav Ramamurthy,et al. Inter-domain dynamic routing in multi-layer optical transport networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[6] Nasir Ghani,et al. Metropolitan Optical Networks , 2002 .
[7] Jordi Domingo-Pascual,et al. A hierarchical routing approach for GMPLS based control plane for ASON , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.
[8] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[9] Biswanath Mukherjee,et al. Optical Communication Networks , 1997 .
[10] M. Koubaa,et al. Physical layer impairments in WDM core networks: a comparison between a North-American backbone and a Pan-European backbone , 2005, 2nd International Conference on Broadband Networks, 2005..
[11] Jean-Christophe Antona,et al. Dimensioning of WDM transparent networks based on the quality of transmission , 2004 .
[12] Seung-Woo Seo,et al. Regenerator placement algorithms for connection establishment in all-optical networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).
[13] Ioannis Lambadaris,et al. Performance analysis of first-fit wavelength assignment algorithm in optical networks , 2003, Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003..
[14] Debanjan Saha,et al. Optical Network Control: Architecture, Protocols, and Standards , 2003 .
[15] Shay Kutten,et al. Dynamic wavelength allocation in all-optical ring networks , 1997, Proceedings of ICC'97 - International Conference on Communications.
[16] Ashwin Gumaste,et al. DWDM Network Designs and Engineering Solutions , 2002 .
[17] Jordi Domingo-Pascual,et al. Hierarchical Routing with QoS Constraints in Optical Transport Networks , 2004, NETWORKING.
[18] Admela Jukan,et al. Extending end-to-end optical service provisioning and restoration in carrier networks: opportunities, issues, and challenges , 2004, IEEE Communications Magazine.
[19] Vasseur Jp,et al. Inter-area and Inter-AS MPLS Traffic Engineering , 2004 .
[20] Thomas E. Stern,et al. Multiwavelength Optical Networks: A Layered Approach , 1999 .
[21] Qing Liu,et al. Hierarchical Inter-Domain Routing in Optical DWDM Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[22] Ezhan Karasan,et al. Regenerator Placement and Traffic Engineering with Restoration in GMPLS Networks , 2004, Photonic Network Communications.
[23] Hussein M. Alnuweiri,et al. Performance of new link state advertisement mechanisms in routing protocols with traffic engineering extensions , 2004, IEEE Communications Magazine.
[24] Debasish Datta,et al. Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks , 1999 .
[25] Alberto Leon-Garcia,et al. Communication Networks , 2000 .
[26] Ilias Iliadis,et al. Optimal PNNI complex node representations for restrictive costs and minimal path computation time , 2000, TNET.
[27] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..