多层多域智能光网络关键技术研究
|
摘要
随着互联网与物联网技术的飞速发展,光传送网的规模不断扩大、业务种类不断增多,未来的传送网面临着规模化和动态化需求,分层分域成为未来光网络的发展趋势。多层多域光网络在解决传送网可扩展性和灵活性的同时,也面临着优质化需求。在未来传送网规模化、动态化和优质化需求的驱动下,多层多域光网络仍存在着体系扩展性、业务复杂性、路由协同性和网络高效性等技术问题。以这些问题为出发点,本文在国家863目标导向类课题“可大规模扩展的多层多域智能光网络关键技术与实验系统”的支撑下,主要研究多层多域智能光网络的关键技术,特别是研究多层多域光网络中路由与资源优化问题,并取得了若干具有创新性的研究成果。
本论文的主要工作和创新点可以总结为：提出了一种多层多域光网络新型路由体系结构,围绕此体系结构,在理论数学模型、路由优化算法和资源使用策略三个方面展开研究,并在多层多域光网络仿真平台上分别进行了性能验证。具体包括以下几个方面：
第一,针对多层多域光网络存在的体系扩展性、业务复杂性、路由协同性以及网络高效性等方面的问题,提出了一种多层多域多约束GMPLS/ASON光网络的新型体系结构—DREAMSCAPE,并对DREAMSCAPE的协议与机制进行了研究设计,利用OMNET++仿真工具对基于DREAMSCAPE的双路由方案进行了仿真实验。实验结果表明,相对于分级路由方案和基于PCE的后向回溯路由方案,双路由方案在阻塞率和建路时延方面具有较大优势。
第二,在理论数学模型方面,从局部的节点交换结构和全网的拓扑复杂性角度进行研究。建立了多粒度光网络的阻塞率分析模型,首次考虑了多粒度节点不具备波长变换能力和具备稀疏波长变换能力两种情况；然后研究了光网络的复杂性问题,发现并总结了光网络中涌现出的各种复杂性规律,在上述复杂性规律的基础上,设计了基于时空复杂性的光网络业务模型,较好地解决了在什么时候建立连接和与谁建立连接的问题。
第三,在路由优化算法方面,针对BRPC算法在大规模网络中收敛时间过长的问题,提出了一种双向回溯的域问路径计算方法,在降低路径计算收敛时间的同时,还能够提高网络的可靠性；针对WSON光网络中路由与波长分配算法的复杂性需求,提出了基于PCE的解决方案,分解为三个子问题进行解决,即路由问题、资源预留问题和波长分配问题,具体包括一种基于PCE的路由架构、两种基于PCE的路由模式、两种基于PCE的资源预留方案和8种基于PCE的波长分配方案,并利用离散事件仿真工具OMNeT++进行了性能验证。
第四,在资源使用策略方面,首次提出了一种资源预置的思想,并设计了相应的预置拓扑生成算法和基于预置拓扑的动态选路算法。仿真结果表明,通过资源预置策略,平均跳数和连接建立时间得到了显著降低；然后针对多层光网络中的能耗问题,基于不同的业务连接类型建立了动态多层光网络中的能耗分析模型,以此模型为基础设计了几种基于PCE的流量疏导算法和考虑生存性的流量疏导算法,并进行了仿真验证。
With the rapid development of Internet and Internet of things, the scale of optical transport networks is getting larger and larger, and the service types are also getting more and more.Large scale and dynamic are the requirement of future optical networks, and multi-layer and multi-region are the inevitable evolution trends. Although the scalability and flexibility of optical transport networks can be solved by multi-layer and multi-region, there is still quality requirement. Under the driven of large scale, dynamic and quality requirement, there are still a series of problems in multi-layer and multi-region optical networks, such as architecture scalability, service complexity, routing cooperation and network efficiency. To solve these problems, this paper mainly researches on the key technologies in multi-layer and multi-region intelligent optical networks, especially the problem of routing and resource optimization, with the support of the object-oriented project of the national high-tech research and development program "Key technologies and experiment system in large scalable multi-layer and multi-region intelligent optical networks".A number of innovative research achievements have been gained.
The main work and innovative contributions of this paper can be summarized as:a novel routing engine architecture of multi-layer and multi-region is proposed. Based on this architecture, mathematical models optimized routing algorithms and resource utilization strategies are studied and simulated on the simulation platform of multi-layer and multi-region optical networks.The details are listed as follows.
Firstly, to resolve the problems of architecture scalability, service complexity, routing cooperation and network efficiency in multi-layer and multi-region optical networks, a novel routing engine architecture of multi-layer and multi-region multi-constraints optical networks (DREAMSCAPE) is proposed, which includes group engine and unit engine, and the protocols and mechanisms of DREAMSCAPE are designed. The performance of dual routing schemes based on DREAMSCAPE has been simulated and compared with hierarchical routing and backward recursive PCE-based computation.Numeric results show that DRE can reduce average time of path computation and setup without increasing blocking probability compared with BRPC.
Secondly, in the respect of mathematical model, the switching architecture in the local node and the complexity of the entire network are studied.The blocking probability analytical models for MG-OXC based optical networks are built and both scenarios without and with sparse wavelength conversion capabilities are considered for the first time. Some complexity laws in optical networks are discovered and summarized, based on which, a novel traffic model for optical networks considering the time-space complexity is designed which satisfactorily solves the problems that when to create connections and whom to be connected.
Thirdly, in the respect of optimized routing algorithms, a dual-end recursive PCE-based computation (DRPC) procedure is proposed to compute shortest constrained inter-domain traffic engineering label switched paths which can reduce the connection establishing time and improve the network reliability. For the complexity requirement of routing and wavelength assignment algorithms in WSON, a PCE-based solution is proposed, which consists of three sub problems which are routing, resource reservation, and wavelength assignment. The solution includes a PCE-based routing framework, two PCE-based routing models, two PCE-based resource reservation schemes, and eight PCE-based wavelength assignment schemes, the performances of which have been validated using discrete event simulation tool OMNeT++.
Fourthly, in the respect of resource utilization strategies, the concept of resource pre-configuration is proposed for the first time.A planning scheme of resource pre-configuration that forms a pre-configured topology different from physical topology and virtual topology has been introduced for dynamic optical networks. Simulation results show the connection establishing time could be significantly reduced.In addition, for the energy-orient problems in multi-layer optical networks, a power consumption model is built based on different service LSPs. Several PCE-based and survivable traffic grooming algorithms are designed based on the model,then simulated and analyzed using discrete event simulation tool OMNeT++.
本论文的主要工作和创新点可以总结为：提出了一种多层多域光网络新型路由体系结构,围绕此体系结构,在理论数学模型、路由优化算法和资源使用策略三个方面展开研究,并在多层多域光网络仿真平台上分别进行了性能验证。具体包括以下几个方面：
第一,针对多层多域光网络存在的体系扩展性、业务复杂性、路由协同性以及网络高效性等方面的问题,提出了一种多层多域多约束GMPLS/ASON光网络的新型体系结构—DREAMSCAPE,并对DREAMSCAPE的协议与机制进行了研究设计,利用OMNET++仿真工具对基于DREAMSCAPE的双路由方案进行了仿真实验。实验结果表明,相对于分级路由方案和基于PCE的后向回溯路由方案,双路由方案在阻塞率和建路时延方面具有较大优势。
第二,在理论数学模型方面,从局部的节点交换结构和全网的拓扑复杂性角度进行研究。建立了多粒度光网络的阻塞率分析模型,首次考虑了多粒度节点不具备波长变换能力和具备稀疏波长变换能力两种情况；然后研究了光网络的复杂性问题,发现并总结了光网络中涌现出的各种复杂性规律,在上述复杂性规律的基础上,设计了基于时空复杂性的光网络业务模型,较好地解决了在什么时候建立连接和与谁建立连接的问题。
第三,在路由优化算法方面,针对BRPC算法在大规模网络中收敛时间过长的问题,提出了一种双向回溯的域问路径计算方法,在降低路径计算收敛时间的同时,还能够提高网络的可靠性；针对WSON光网络中路由与波长分配算法的复杂性需求,提出了基于PCE的解决方案,分解为三个子问题进行解决,即路由问题、资源预留问题和波长分配问题,具体包括一种基于PCE的路由架构、两种基于PCE的路由模式、两种基于PCE的资源预留方案和8种基于PCE的波长分配方案,并利用离散事件仿真工具OMNeT++进行了性能验证。
第四,在资源使用策略方面,首次提出了一种资源预置的思想,并设计了相应的预置拓扑生成算法和基于预置拓扑的动态选路算法。仿真结果表明,通过资源预置策略,平均跳数和连接建立时间得到了显著降低；然后针对多层光网络中的能耗问题,基于不同的业务连接类型建立了动态多层光网络中的能耗分析模型,以此模型为基础设计了几种基于PCE的流量疏导算法和考虑生存性的流量疏导算法,并进行了仿真验证。
With the rapid development of Internet and Internet of things, the scale of optical transport networks is getting larger and larger, and the service types are also getting more and more.Large scale and dynamic are the requirement of future optical networks, and multi-layer and multi-region are the inevitable evolution trends. Although the scalability and flexibility of optical transport networks can be solved by multi-layer and multi-region, there is still quality requirement. Under the driven of large scale, dynamic and quality requirement, there are still a series of problems in multi-layer and multi-region optical networks, such as architecture scalability, service complexity, routing cooperation and network efficiency. To solve these problems, this paper mainly researches on the key technologies in multi-layer and multi-region intelligent optical networks, especially the problem of routing and resource optimization, with the support of the object-oriented project of the national high-tech research and development program "Key technologies and experiment system in large scalable multi-layer and multi-region intelligent optical networks".A number of innovative research achievements have been gained.
The main work and innovative contributions of this paper can be summarized as:a novel routing engine architecture of multi-layer and multi-region is proposed. Based on this architecture, mathematical models optimized routing algorithms and resource utilization strategies are studied and simulated on the simulation platform of multi-layer and multi-region optical networks.The details are listed as follows.
Firstly, to resolve the problems of architecture scalability, service complexity, routing cooperation and network efficiency in multi-layer and multi-region optical networks, a novel routing engine architecture of multi-layer and multi-region multi-constraints optical networks (DREAMSCAPE) is proposed, which includes group engine and unit engine, and the protocols and mechanisms of DREAMSCAPE are designed. The performance of dual routing schemes based on DREAMSCAPE has been simulated and compared with hierarchical routing and backward recursive PCE-based computation.Numeric results show that DRE can reduce average time of path computation and setup without increasing blocking probability compared with BRPC.
Secondly, in the respect of mathematical model, the switching architecture in the local node and the complexity of the entire network are studied.The blocking probability analytical models for MG-OXC based optical networks are built and both scenarios without and with sparse wavelength conversion capabilities are considered for the first time. Some complexity laws in optical networks are discovered and summarized, based on which, a novel traffic model for optical networks considering the time-space complexity is designed which satisfactorily solves the problems that when to create connections and whom to be connected.
Thirdly, in the respect of optimized routing algorithms, a dual-end recursive PCE-based computation (DRPC) procedure is proposed to compute shortest constrained inter-domain traffic engineering label switched paths which can reduce the connection establishing time and improve the network reliability. For the complexity requirement of routing and wavelength assignment algorithms in WSON, a PCE-based solution is proposed, which consists of three sub problems which are routing, resource reservation, and wavelength assignment. The solution includes a PCE-based routing framework, two PCE-based routing models, two PCE-based resource reservation schemes, and eight PCE-based wavelength assignment schemes, the performances of which have been validated using discrete event simulation tool OMNeT++.
Fourthly, in the respect of resource utilization strategies, the concept of resource pre-configuration is proposed for the first time.A planning scheme of resource pre-configuration that forms a pre-configured topology different from physical topology and virtual topology has been introduced for dynamic optical networks. Simulation results show the connection establishing time could be significantly reduced.In addition, for the energy-orient problems in multi-layer optical networks, a power consumption model is built based on different service LSPs. Several PCE-based and survivable traffic grooming algorithms are designed based on the model,then simulated and analyzed using discrete event simulation tool OMNeT++.
引文
[1]张波,涂敏海.实现IP层与光层的统一调度.华为技术,2008年9月,第34期,pp.45-47.
[2]Edoardo Bonetto, Luca Chiaraviglio, Davide Cuda, et al. Optical Technologies Can Improve the Energy Efficiency of Networks. ECOC 2009, Vienna, Austria,20-24 September 2009.
[3]W Leland, M Taqqu, W Willinger, et al. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking,1994, vol.2 (1), pp.1-15.
[4]Siganos G, Faloutsos M, Faloutsos P, et al. Power laws and the AS-level Internet Topology. IEEE/ACM Transactions on Networking,2003, vol.11 (4), pp.514-524.
[5]Yang Wanchun, Zhong Jinshun, Zhang Jie, et al. Channel Statistical Multiplexing in SDH/SONET Networks. IEE Proceeding on communications,2005, vol.152 (3), pp.447-451.
[6]Shinya Ishida. A Study on Flexible, Reliable, and Scalable Wavelength-Routed Optical Networks. Osaka, Japan:Department of Information Networking Graduate School of Information Science and Technology, Osaka University, February 2007.
[7]W.Alanqar, et al. Requirements for Generalized MPLS (GMPLS) Routing for Automatically Switched Optical Network (ASON). IETF draft, April 2005.
[8]D.Papadimitriou, et al. Requirements for Generalized MPLS (GMPLS) Signalling Usage and Extenstions for Automatically Switched Optical Network (ASON). IETF draft, April 2005.
[9]Kohei Shiomoto, et al. Requirements for GMPLS-based multi-region and multi-layer networks (MRN/MLN). IETF draft, Arpil,2006.
[10]ITU-T G.8080/Y.1304. Architecture for the automatically switched optical network (ASON), June 2006.
[11]OIF 2002.23.06. Domain to Domain Routing Using GMPLS OSPF Extensions V1.0 (Draft).
[12]Thomas Lehman, et al. DRAGON:A Framework for Service Provisioning in Heterogeneous Grid Networks. IEEE Communications Magazine, Mar.2006, pp.84-90.
[13]K. Shiomoto, D. Papadimitriou, et al. Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN). RFC5212, July 2008.
[14]A. Farrel, J.-P. Vasseur, J.Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[15]S.Azodolmolky, M. Klinkowski, E. Marin, D, et al. A Survey on Physical Layer Impairments Aware Routing and Wavelength Assignment Algorithms in Optical Networks. Computer Networks, May 2009, vol 53(7), pp.926-944.
[16]Itaru Nishioka, et al. End-to-End path routing with PCEs in multi-domain GMPLS networks. IPOP2008,2008.7.
[17]Bijan JABBARI, et al. On Constraints for Path Computation in Multi-Layer Switched Networks. IEICE TRANS. COMMUN.,AUGUST 2007,VOL.E90-B,NO.8.
[18]J. Ahmed, P. Monti, L. Wosinska. LSP Request Bundling in a PCE-Based WDM Network. OFC, San Diego, America, March 2009, OML4.
[19]Xiuzhong Chen, Jie Zhang et al. PCE-Based Network Design for Multi-Domain Layer 1 Virtual Private Networks. OFC, San Diego, America, March 2009,OWL2.
[20]Ankitkumar N. Patel, Yi Zhu, and Jason P. Jue. Routing and Horizon Scheduling for Time-Shift Advance Reservation. OFC, San Diego, America, March 2009, OTHO4.
[21]A. Giorgetti and F. Paolucci. Routing and Wavelength Assignment in PCE-based Wavelength Switched Optical Networks. ECOC, Brussels, Belgium, September 2008, TH1E3.
[22]Michiaki Hayashi. Advance Reservation-Based Network Resource Manger for Optical Networks. OFC, San Diego, America, February 2008, OTuAl.
[23]Soichiro Araki. Photonic Service Gateways in the Japan's Lambda Utility Project.2nd International OFC/NFOEC Workshop on the Future of Optical Networking (FON), CA, USA, March 2007.
[24]K-J Lu, G-Xi Xiao, et al. Blocking Analysis of Dynamic Lightpath Establishment in Wavelength-Routed Networks. ICC,2002, vol.5 (28),pp.2912-2916.
[25]R. Ramaswami, K. Sivarajan. Optimal routing and wavelength assignment in all-optical networks. Proceedings of the ZEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 970-983.
[26]Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. Proceedings of the IEEE INFOCOM 1994, Toronto, Canada, June 1994, pp.534-543.
[27]A. Girard. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network,1995,3, pp.489-500.
[28]H. Harai, M. Murata, H. Miyahara.Performance of alternate routing methods in all-optical switching networks. Proceedings of the IEEE INFOCOM 97, pp.516-524.
[29]Ahmed Mokhtar, Murat Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network,1998, vol.6 (2), pp.197-206.
[30]R.Randhawa, J.S.Sohal. Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion. Optik-International Journal for Light and Electron Optics, In Press, Corrected Proof, Available online 25 November 2008.
[31]R.A. Barry, P.A. Humblet. Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Sel. Areas Commun,1996, vol.14, pp.867-878.
[32]S A and S K.N. Blocking in All-Optical Networks. Networking, IEEE/ACM Transactions on, 2004, vol.5(2), pp.384-397.
[33]Rajalakshmi P, Ashok Jhunjhunwala. An Analytical Model for Wavelength-Convertible Optical Networks. ICC, June 2007, pp.2318-2323.
[34]Narula-Tam, A.;Brady, M.H.;Finn, S.G., et al. Blocking probability of a centralized switch with shared wavelength conversion. OFC, Feb 2004, paper TuH5.
[35]Tucker RS. Optical packet switching:A reality check. Optical Switching and Networking, 2008, vol.5 (1), pp.2-9.
[36]Wang RY, Zhang J, Guo F, et al. An effective buffering architecture for optical packet switching networks. Photonic Network Communications,2008, vol.16 (3), pp.239-243.
[37]P. Bergstrom, M. Ingram, A. Vernon, J. Hughes, et al. A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun, Oct.1999, vol.47 (10), pp.1593-1603.
[38]G.Castanon. Design-dimensioning model for transparent WDM packet-switched irregular networks. J. Lightwave Technol, Jan.2002, vol.20 (1), pp.1-9.
[39]Ayman G. Fayoumi, Anura P.Jayasumana. A surjective-Mapping Based Model for Optical Shared-Buffer Cross-Connect. IEEE/ACM Transactions on networking,2007, vol.15(1), pp.226-233.
[40]Mohamed H. S.Morsy, Hossam M. H. Shalaby, et al. An Enhanced Mathematical Model for Performance Evaluation of Optical Burst Switched Networks. GLOBECOM, Dec 2008, pp.1-5.
[41]Eramo V, Germoni A, Raffaelli C, et al. Packet loss analysis of shared-per-wavelength multi-fiber all-optical switch with parallel scheduling. Computer Networks,2009, vol.53 (2), pp.202-216.
[42]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[43]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[44]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[45]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[46]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[47]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[48]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[49]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[50]JP. Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[51]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[52]S. Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[53]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521,April 2009.
[54]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[55]Y. Lee, G Bernstein, et al. PCEP Requirements for WSON routing and wavelength assignment. IETF draft-ietf-pce-wson-routing-wavelength-01.txt, March 1,2010.
[56]G Bernstein and Y. Lee. Extending GMPLS/PCE for use in wavelength switched optical networks. OFC2008, NME1.
[57]Pachnicke S, Gravemann T, Windmann M, et al. Physically constrained routing in 10-gb/s DWDM networks including fiber nonlinearities and polarization effects. Journal of Lightwave Technology,2006,24, pp.3418-3426.
[58]Pachnicke S, Reichert J, Spalter S, et al. Fast analytical assessment of the signal quality in transparent optical networks. Journal of Lightwave Technology,2006,24, pp.815-824.
[59]Markidis G, Sygletos S, Tzanakaki A, et al. Impairment-Constraint-Based Routing in Ultralong-Haul Optical Networks With 2R Regeneration. IEEE Photonics Technology Letters,2007,19, pp.420-422.
[60]He J, Brandt-Pearce M, Pointurier Y. QoT-Aware Routing in Impairment-Constrained Optical Networks. In:Brandt-Pearce M (ed). GLOBECOM'07 IEEE,2007, pp.2269-2274.
[61]Tomkos I, Sygletos S, Tzanakaki A, et al. Impairment Constraint Based Routing in Mesh Optical Networks. OFC/NFOEC 2007.
[62]Zhai Y, Pointurier Y, Subramaniam S, et al. QoS-aware RWA algorithms for path-protected DWDM networks. OFC/NFOEC,2007.
[63]Bernstein G, Lee Y. Framework for GMPLS and PCE Control of Wavelength Switched Optical Networks (WSON). IETF draft-ietf-ccamp-rwa-wson-framework-06.txt, April 7, 2010.
[64]SMART 2020 Report. Enabling the low carbon economy in the information age, http://www.theclimategroup.org,2008.
[65]S. Pileri. Energy and Communication:engine of the human progress, INTELEC 2007 keynote, Rome, September 2007.
[66]L. Chiaraviglio, M. Mellia, F.Neri. Energy-aware Backbone Networks:a Case Study, First Int. Workshop on Green Communications (GreenComm'09), Dresden, June 2009.
[67]E. Yetginer, T. Uekai, and I. T. Kislasi. Power efficient traffic grooming in optical WDM networks, in Proc. Global Communications Conference 2009, Hawaii, USA, Nov.2009.
[68]D. Seshadri. Power-aware routing:Grooming traffic for reduction of power consumption in wire-line networks, Master dissertation, Dept. Computer Science, North Carolina State Univ., North Carolina, USA,2008.
[69]Gangxiang Shen and Rodney S. Tucker. Energy-Minimized Design for IP over WDM Networks. Journal of Optical Communications and Networking, June 2009, Vol.1,No.1, pp.176-186.
[70]Makoto Murakami and Kazuhiro Oda. Power Consumption Analysis of Optical Cross-Connect Equipment for Future Large Capacity Optical Networks, ICTON2009, We.B2.4.
[71]Keyao Zhu and Biswanath Mukherjee. A review of traffic grooming in WDM optical networks:Architectures and challenges. Optical Networks Magazine, Mar-Apr 2003, Vol.4, No.2, pp.55-64.
[72]EH Modiano and Philip J Lin. Traffic grooming in WDM networks. IEEE Communications Magazine, Jul 2001, Vol.39, No.7, pp.124-129.
[73]Keyao Zhu and Biswanath Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal in Selected Areas of Communications, Jan 2002, Vol.20, No.1,pp.122-133.
[74]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Transactions on Networking, Apr.2003, vol.11, pp.285-299.
[75]S. Thiagarajan and A. K. Somani. Capacity fairness of WDMnetworks with grooming capabilities. SPIE Optical Networks Magazine, May/June 2001,vol.2, pp.24-32.
[76]K.Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks, in Proc. OFC, Mar.2002, p. ThW5.
[77]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. Dynamic traffic grooming in WDM mesh networks using a novel graph model, Proc. IEEE GLOBECOM, Nov.2002, pp.2681-2685.
[78]Bernstein G, Lee Y. Routing and Wavelength Assignment Information Model for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-rwa-info-07.txt, Feb 18,2010.
[79]Bernstein G, Lee Y. Routing and Wavelength Assignment Information Encoding for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-rwa-wson-encode-00.txt, Feb 18,2010.
[80]Bernstein G, Y.Lee. Signaling Extensions for Wavelength Switched Optical Networks. IETF draft-bernstein-ccamp-wson-signaling-03.txt, October 31,2008.
[81]Bernstein G, Lee Y. PCEP Requirements and Extensions for WSON Routing and Wavelength Assignment. IETF draft-lee-pce-wson-routing-wavelength-03.txt, October 27,2008.
[82]Lee Y, Bernstein G. OSPF Enhancement for Signal and Network Element Compatibility for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-wson-signal-compatibility-ospf-Ol.txt, March 5,2010.
[83]Bernstein G, Lee Y. A Framework for the Control of Wavelength Switched Optical Networks (WSON) with Impairments. IETF draft-bernstein-ccamp-wson-impairments-01.txt, October 12,2009.
[84]Bernstein G, Lee Y. Information Model for Impaired Optical Path Validation. IETF draft-bernstein-wson-impairment-info-00.txt October 26,2008
[85]Yuefeng Ji, Jie Zhang, Yongli Zhao, et al. DREAMSCAPE:Dual Routing Engine Architecture in Multi-layer/multi-domain Scalable Constraint-Aware Policy-Enabled optical networks. OECC, Hongkong,2009.7.
[86]Zhang Jie, Zhao Yongli, Cao Xuping, et al. A Novel PCE-based Architecture of Multi-region and Multi-layer GMPLS/ASON Networks. China Communications, July 2009, vol.6 (3), p.67-71.
[87]Yongli Zhao, Jie Zhang, Yuefeng Ji. A novel PCE-based routing architecture in multi-layer network and multi-region network. IPOP2010, Japan, June 10,2010.
[88]张杰,纪越峰,张民,赵永利等.基于多层多域光网络的双路由计算单元系统.(申请号：200910088761.61
[89]张杰,赵永利,曹徐平等.双路由计算单元系统中群计算单元信息同步的实现方法.(申请号：200910088760.1)
[90]张杰,赵永利,曹徐平等.一种基于群计算单元的双层最短路径实现方法.(申请号：200910088759.9)
[91]张杰,赵永利,曹徐平等.一种支持策略解析的多约束条件路由选择方法.(申请号：200910088758.4)
[92]张杰,赵永利,曹徐平等.一种支持群计算单元协作路径计算的信令实现方法.(申请号：200910088757.X)
[93]Yongli Zhao, Jie Zhang, Min Zhang, et al. Dual Routing Architecture in Multi-layer and Multi-domain GMPLS/ASON Networks,PS2010,American.
[94]Yongli Zhao, Jie Zhang, Dahai Han, et al. Analytical Models of Blocking Probability for Multi-granularity Cross-connect Based Optical Networks, IET Communications,2009.4, vol.3 (11), pp.1716-1723.
[95]Yongli Zhao, Jie Zhang, Dahai Han, et al. The Research of Invulnerability in Complex Optical Networks. SPIE APOC2008, Hangzhou,26-30 Oct.2008.
[96]赵永利,张杰,韩大海等.一种基于时空复杂性的新型光网络业务模型.系统仿真学报,2009.8,vol.21(16,),pp.5183-5186.
[97]Zhao Yongli, Zhang Jie, Han Dahai, et al. The Complexity and Traffic Modeling of Optical Networks, HIGH TECHNOLOGY LETTERS,2009, vol.15 (2), pp.198-202.
[98]Yongli Zhao, Jie Zhang, Hai Huang, et al. Research and Analysis of Distributed Signaling Schemes in PCE-based Wavelength Switching Optical Network. OECC 2009, Hongkong, China,2009.7
[99]Yongli Zhao, Jie Zhang, Yuefeng Ji,et al. Routing and Wavelength Assignment Problem in PCE-based Wavelength Switched Optical Networks, JOCN,2010.4, vol.2 (4).
[100]Yongli Zhao, Jie Zhang, Hai Huang, et al. Analysis of PCE-based Wavelength Assignment Schemes in Wavelength Switched Optical Networks. WOCC, Shanghai, May 14,2010.
[101]付锡华,鲍远林,张杰,赵永利.双向回溯路径计算方法及装置.(申请号：2010191850430)
[102]Xihua Fu, Yuanli Bao, Yongli Zhao, Jie Zhang. A Dual-end Recursive PCE-based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths. IETF draft, March,2010.
[103]Yongli Zhao, Jie Zhang, Dahai Han, et al. Routing on Pre-configured Topology for Dynamic Optical Networks, Photonic Network Communications, vol.17 (3),2009, pp.299-310.
[104]Zhao Yongli, Zhang Jie, Han Dahai, et al. A Resource Pre-configuration Scheme in Intelligent Optical Networks, OFC,24-28 Feb,2008.
[1]ITU-T G.8080/Y.1304. Architecture for the automatically switched optical network (ASON). June 2006.
[2]OIF 2002.23.06. Domain to Domain Routing Using GMPLS OSPF Extensions V1.0 (Draft).
[3]K. Shiomoto, D. Papadimitriou, et al. Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN). RFC5212, July 2008.
[4]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture, RFC4655. August 2006.
[5]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[6]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[7]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[8]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[9]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[10]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[11]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[12]JP.Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[13]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[14]S.Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[15]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521, April 2009.
[16]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[17]Itaru Nishioka, et al, End-to-End path routing with PCEs in multi-domain GMPLS networks, IPOP2008, July 2008.
[18]Bijan Jabbari, et al. On Constraints for Path Computation in Multi-Layer Switched Networks. IEICE Trans. Commun., August 2007, vol.E90-B, No.8, p.1922-1927.
[19]J. Ahmed, P. Monti, L. Wosinska.LSP Request Bundling in a PCE-Based WDM Network. OFC, San Diego, America, March 2009, OML4.
[20]Ankitkumar N. Patel, Yi Zhu, and Jason P. Jue. Routing and Horizon Scheduling for Time-Shift Advance Reservation. OFC, San Diego, America, March 2009, OTHO4.
[21]A. Giorgetti and F. Paolucci. Routing and Wavelength Assignment in PCE-based Wavelength Switched Optical Networks. ECOC, Brussels, Belgium, September 2008, TH1E3.
[22]Michiaki Hayashi. Advance Reservation-Based Network Resource Manger for Optical Networks. OFC, San Diego, America, February 2008, OTuAl.
[23]Yuefeng Ji, Jie Zhang, Yongli Zhao, et al. DREAMSCAPE:Dual Routing Engine Architecture in Multi-layer/multi-domain Scalable Constraint-Aware Policy-Enabled optical networks. OECC, Hongkong,2009.7.
[24]Zhang Jie, Zhao Yongli, et al. A Novel PCE-based Architecture of Multi-region and Multi-layer GMPLS/ASON Networks. China Communications, July 2009, vol.6 (3), p.67-71.
[25]G Bernstein, Y. Lee, D. Li. A Framework for the Control and Measurement of Wavelength Switched Optical Networks (WSON) with Impairments. IETF Draft, October 2008.
[26]Hua Zhang, Jie Zhang, et al. Dynamic End-to-End Optimization for Quality of Transmission in Reconfigurable Transparent Optical Networks. J. Optical Networking, June 2008, vol.7 (6), p.573-584.
[27]Xiuzhong Chen, Jie Zhang et al.PCE-Based Network Design for Multi-Domain Layer 1 Virtual Private Networks. OFC, San Diego, America, March 2009,OWL2.
[28]Jie Zhang, et al. AMSON:an Extended Architecture for Adaptive Service Provisioning in Transport Networks. OFC, San Diego, America, February 2008, JthA79.
[29]张杰,赵永利,曹徐平等.双路由计算单元系统中群计算单元信息同步的实现方法.(申请号：200910088760.11
[30]张杰,赵永利,曹徐平等.一种支持策略解析的多约束条件路由选择方法.(申请号：200910088758.4)
[31]张杰,赵永利,曹徐平等.一种支持群计算单元协作路径计算的信令实现方法.(申请号：200910088757.X)
[32]XH Fu, YL Zhao, et al. draft-fuxh-pce-drpc-OO.txt. IETF Draft, March 2010.
[33]D.King, and A. Farrel. draft-king-pce-hierarchy-fwk-03.txt. December,2009.
[34]ITU-T G.709. Interfaces for the optical transport network (OTN). Octber 2009.
[1]Yongli Zhao, Jie Zhang, Dahai Han, etal. Analytical Models of Blocking Probability for Multi-granularity Cross-connect Based Optical Networks, IET Communications,2009.4, vol.3 (11), pp.1716-1723.
[2]J.P.Ryan. WDM:North American Development Trends. IEEE Communications Magazine, 1998, vol.36 (3), pp.40-44.
[3]I.P.Kaminow, and et al. A Wideband All-Optical WDM Network. IEEE Journal on Selected Areas in Communications,1996, vol.14 (5), pp.780-799.
[4]G.Shen, S. K. Bose, et al. Operation of WDM Networks with Different Wavelength Conversion Capabilities. IEEE Communications letters,2000, vol.4 (7), pp.239-241.
[5]Pin-Han Ho, Hussein T. Mouftah. Routing and Wavelength Assignment with Multi-granularity Traffic in Optical Networks. IEEE Journal of Lightwave Technology,2008, vol.20 (8), pp.1292-1303.
[6]Pin-Han Ho, Hussein T. Mouftah, Jing Wu. A Scalable Design of Multigranularity Optical Cross-Connects for the Next-Generation Optical Internet. IEEE Journal on Selected Areas in Communications,2003, vol.21 (7), pp.1133-1142.
[7]C. Chen, X.-J.Kuo, Y.-Y.Chen, et al. A New Model for Optimal Routing and Wavelength Assigment with Fixed-length Tunnel Allocation in Multi-granularity Cross-connect WDM Networks. Military Communications Conference, Oct 2005,pp.1270-1276.
[8]L. Noirie, C. Blaizot and E. Dotaro. Multi-Granularity Optical Cross-Connect. ECOC, Oct 2000, pp.269-270.
[9]Takada, A., Koga, M. Multi-granularity OXC Architecture. OFC, March 2007, paper OThR4.
[10]Wu Jia, Song Yu, etal. A Testbed for Multi-Granularity Optical Switching Network. OFC, March 2007, paper JWA70.
[11]G-X Shen, S K. Bose, et al. The Impact of the Number of Add-Drop Ports in Wavelength-Routing All Optical Networks. Optical Networks Magazine (SPIE), Sep/Oct 2003, pp.112-122.
[12]K-J Lu, G-Xi Xiao, et al. Blocking Analysis of Dynamic Lightpath Establishment in Wavelength-Routed Networks. ICC,2002, vol.5 (28), pp.2912-2916.
[13]R. Ramaswami, K. Sivarajan. Optimal routing and wavelength assignment in all-optical networks. Proceedings of the ZEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 970-983.
[14]Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. Proceedings of the IEEE INFOCOM'94, Toronto, Canada, June 1994, pp.534-543.
[15]A. Girard. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network,1995,3, pp.489-500.
[16]H. Harai, M. Murata, H. Miyahara. Performance of alternate routing methods in all-optical switching networks. Proceedings of the IEEE INFOCOM 97, pp.516-524.
[17]Ahmed Mokhtar, Murat Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network,1998, vol.6 (2), pp.197-206.
[18]R.Randhawa, J.S.Sohal. Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion. Optik-International Journal for Light and Electron Optics, In Press, Corrected Proof, Available online 25 November 2008.
[19]R.A. Barry, P.A. Humblet. Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Sel. Areas Commun,1996, vol.14, pp.867-878.
[20]S A and S K.N. Blocking in All-Optical Networks. Networking, IEEE/ACM Transactions on, 2004, vol.5 (2), pp.384-397.
[21]Rajalakshmi P, Ashok Jhunjhunwala. An Analytical Model for Wavelength-Convertible Optical Networks. ICC, June 2007, pp.2318-2323.
[22]Narula-Tam, A., Brady, M.H., Finn, S.G., et al. Blocking probability of a centralized switch with shared wavelength conversion. OFC, Feb 2004, paper TuH5.
[23]Tucker RS. Optical packet switching:A reality check. Optical Switching and Networking, 2008, vol.5 (1), pp.2-9.
[24]Wang RY, Zhang J, Guo F, et al. An effective buffering architecture for optical packet switching networks. Photonic Network Communications,2008, vol.16 (3), pp.239-243.
[25]P. Bergstrom, M. Ingram, A. Vernon, J. Hughes, and P. Tetali. A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun, Oct.1999, vol.47 (10), pp. 1593-1603.
[26]G. Castanon. Design-dimensioning model for transparent WDM packet-switched irregular networks. J. Lightwave Technol, Jan.2002, vol.20(1), pp.1-9.
[27]Ayman G. Fayoumi, Anura P. Jayasumana. A surjective-Mapping Based Model for Optical Shared-Buffer Cross-Connect. IEEE/ACM Transactions on networking,2007, vol.15 (1), pp.226-233.
[28]Mohamed H. S. Morsy, et al. An Enhanced Mathematical Model for Performance Evaluation of Optical Burst Switched Networks. GLOBECOM, Dec 2008, pp.1-5.
[29]Eramo V, Germoni A, Raffaelli C, et al. Packet loss analysis of shared-per-wavelength multi-fiber all-optical switch with parallel scheduling. Computer Networks,2009, vol.53 (2), pp.202-216.
[30]X-J Kuo and C Chen. A Blocking Probability Model in Multi-granularity Cross-connect Optical Networks. HPSR'07,2007, pp.1-6.
[31]I. Chlamtac, et al. Lightpath communications:An approach to high bandwidth optical WANs. IEEE Transaction on Commununications,1992, vol.40 (7), pp.1171-1182.
[32]A. Birman. Computing Approximate Blocking Probabilities for a Class of All-Optical Networks. IEEE Journal on Selected Areas in Communications,1996, vol.14 (5), pp. 852-857.
[33]S. Chung, A. Kashper, and K.W. Ross. Computing Approximate Blocking Probability for Large Loss Network with State-Dependent Routing. IEEE/ACM Transactions on Networking,1993, vol.1 (1), pp.105-115.
[34]曾宪钊.网络科学.北京,军事科学出版社,2006,pp.101-110.
[35]Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the internet topology. ACM SIGCOMM Computer Communication Review,1999, vol.29 (4), pp.251-262.
[36]Yongli Zhao, Jie Zhang, Dahai Han, et al. The Research of Invulnerability in Complex Optical Networks. SPIE APOC2008, Hangzhou,26-30 Oct.2008.
[37]Jason Spencer, Lionel Sacks. On Power-Laws in SDH Transport Networks. ICC,2003 vol.3, pp.1786-1790.
[38]Wang Yong, Liu Guoliang. Two-image model of telecommunication network and its system features of complex network. Electronic measurement technology,2007, (4), pp.63-66.
[39]Liu, H, Chen, B. K, Tobagi, F. On power-law tradeoffs between optical and electronic switching. Infocom,2006, pp.1-13.
[40]D. Banerjee and B. Mukherjee. Wavelength-routed optical networks:Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Trans. Networking, Oct.2000, vol.8(5).
[41]Saad, T, Mouftah, H.T. Inter-domain wavelength routing in optical WDM networks, NETWORKS 2004,11th International,2004, pp.391-396.
[42]E. Oki, K. Shiomoto et al. Dynamic multilayer routing schemes in GMPLS-based IP+optical networks. IEEE Communications Magazine,2005, vol.43(1),pp.108-114.
[43]G Yan, T. Zhou, B. Hu, et al. Physical Review E 73,2006 (046108).
[44]郭雷；许晓鸣.复杂网络.上海科技教育出版社,2006.11：247-260.
[45]R.K. Ravalkol and D.R. Thompson. Service Restorability in Degree-based Wavelength Division Multiplexing Network. Optical Communications Systems and Networks,2005.
[46]S.W. Mahfoud, D.E Golderg. Parallel recombinative simulated annealing:a genetic algorithm. Parallel computing,1995, vol.21(1),pp.1-28.
[47]W Leland, M Taqqu, W Willinger, et al. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking,1994, vol.2 (1), pp.1-15.
[48]Siganos G, Faloutsos M, Faloutsos P, et al. Power laws and the AS-level Internet Topology. IEEE/ACM Transactions on Networking,2003, vol.11 (4), pp.514-524.
[49]Yang Wanchun, Zhong Jinshun, Zhang Jie, et al. Channel Statistical Multiplexing in SDH/SONET Networks. IEE Proceeding on communications,2005, vol.152 (3), pp.447-451.
[50]Shinya Ishida. A Study on Flexible, Reliable, and Scalable Wavelength-Routed Optical Networks. Osaka, Japan:Department of Information Networking Graduate School of Information Science and Technology, Osaka University, February 2007.
[51]Bo Mingxia, Pan Xiaofei, Ma Fanghua, et al. A Novel integrated Routing Algorithm in Multifiber IP/WDM Networks. Journal of Beijing University of Posts and Telecommunications,2006, vol.29 (5), pp.120-124.
[52]V Paxson. Fast Approximate Synthesis of Fractional Gaussian Noise for Generating Selfsimilar Network Traffic. Computer Commun. Review,1997, vol.27 (5), pp.5-18.
[53]Spencer J, Sacks L. On Power-laws in SDH Transport Networks. ICC2003, Alaska, USA, IEEE,2003, vol.3, pp.1786-1790.
[54]赵永利,张杰,韩大海,顾畹仪.一种基于时空复杂性的新型光网络业务模型.系统仿真学报,2009.8.
[55]李一宁,汪小帆.复杂网络上的一种映射网络模型.系统仿真学报,2007,vol.19(11),pp.2610-2614.
[56]Zhao Yongli, Zhang Jie, Han Dahai, et al. The Complexity and Traffic Modeling of Optical Networks, High Technology Letters,2009, vol.15 (2), pp.198-202.
[1]Xihua Fu, Yuanli Bao, Yongli Zhao, Jie Zhang. A Dual-end Recursive PCE-based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths. IETF draft, March,2010.
[2]Yongli Zhao, Jie Zhang, Hai Huang, et al. Research and Analysis of Distributed Signaling Schemes in PCE-based Wavelength Switching Optical Network. OECC, Hongkong, July 2009.
[3]Yongli Zhao, Jie Zhang, Hai Huang, et al. Analysis of PCE-based Wavelength Assignment Schemes in Wavelength Switched Optical Networks. WOCC, Shanghai, May 2010.
[4]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[5]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[6]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[7]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[8]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[9]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[10]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[11]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[12]JP. Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[13]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation(BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[14]S.Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[15]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521,April 2009.
[16]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[17]Y.Yamada, et al. Hierarchical Optical Path Network Design Considering Waveband Protection. ECOC, Berlin, Germany,2007.9.16-20.
[18]Itaru Nishioka, et al. End-to-End path routing with PCEs in multi-domain GMPLS networks. IPOP2008, Tokyo, Japan,2008.6.5-6.
[19]Y. Lee, G. Bernstein, et al. PCEP Requirements for WSON routing and wavelength assignment. IETF draft-ietf-pce-wson-routing-wavelength-01.txt, March 1,2010.
[20]G Bernstein and Y. Lee. Extending GMPLS/PCE for use in wavelength switched optical networks. OFC2008, NME1.
[21]A. Giorgetti (1), F. Paolucci, et al. Routing and wavelength assignment in PCE-based wavelength switched optical networks. ECOC2008,21-25 September 2008, Brussels, Belgium, Th.1.E.3.
[22]Arakawa, S et al., APCC/OECC, vol.1,1999, pp.445
[23]Lei Wang, Jie Zhang, Yongli Zhao, et al. A collision-aware wavelength assignment scheme for GMPLS-based WDM networks. Communications letters,IEEE,2008,vol.12 (8), pp.593-595.
[24]Yongli Zhao, Jie Zhang, Yuefeng Ji, et al. Routing and Wavelength Assignment Problem in PCE-based Wavelength Switched Optical Networks. JOCN,2010, vol.2 (4).
[1]A, Mokhtar and M, Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Transactions on Networking,1998, vol.6 (2), pp.197-206.
[2]E, Karasan and E, A yanoglu. Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE GLOBECOM, London, U.K., 1996, vol.1, pp.299-305.
[3]L, Li and A, K, Somani. Blocking performance analysis of fixed path least congestion routing in multi-fiber WDM networks. SPIE Photonics East'99, Boston,1999, pp.56-67.
[4]L, Li and A, K. Somani. Dynamic wavelength routing using congestion and neighborhood information. IEEE/ACM Transaction on Networking,1999, vol.7 (5), pp.779-786.
[5]S, Subramaniam and K, N, Barry. Wavelength assignment in fixed routing WDM Networks. IEEE ICC,1997, vol.1,pp.406-410.
[6]H, Zhang., J, P, Jue., B M uhkerjee. A review of routing and wavelength assignment approaches for wavelength routed optical WDM Networks. Optical Networks Magazine, 2000, vol.1 (1), pp.47-60.
[7]Z, Zhang., Acampora, A.S. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use. IEEE/ACM Transactions on Networking,1995,vol.3 (3), pp.281-288.
[8]Chamas, H.,Ali, M., Bjorkman, W. A novel admission control system for bandwidth on demand Ethernet services over optical transport networks. OFC,2005, vol.4, pp.6-11.
[9]Ishida, S.,Arakawa, S.,Murata, M. Virtual fiber configuration method for dynamic lightpath establishment in large-scaled WDM networks. Photonic Network Communications,2006, vol.12 (1),pp.87-98.
[10]Yongli Zhao, Jie Zhang, Dahai Han, et al. A planning scheme of resource pre-configuration in intelligent optical networks. OFC,2008, JWA102.
[11]Yongli Zhao, Jie Zhang, Dahai Han, et al. Routing on Pre-configured Topology for Dynamic Optical Networks. Photonic Network Communications,2009, vol.17 (3),pp.299-310.
[12]Gencata., et al. Virtual-topology adaptation for WDM mesh networks under dynamic traffic. IEEE/ACM Transactions,2003, vol.11 (2):pp.236-247.
[13]Ganz., et al. Efficient algorithm for virtual topology design in multihop lightwave networks. IEEE/ACM Transactions,1994, vol.2 (3), pp.217-225.
[14]Narula-Tam, A., et al. Efficient routing and wavelength assignment for reconfigurable WDM networks. Selected Areas in Communications, IEEE Journal on,2002, vol.20(1),pp.75-88.
[15]Vigoureux, M., et al. Multilayer traffic engineering for GMPLS-enabled networks. Communications magazine, IEEE,2005, vol.43 (7), pp.44-50.
[16]Salbella, R., et al. Guest editorial:Traffic engineering in optical networks. Network, IEEE, 2003, vol.17 (2), pp.6-7.
[17]SMART 2020 Report. Enabling the low carbon economy in the information age, http://www.theclimategroup.org,2008.
[18]S. Pileri. Energy and Communication:engine of the human progress, INTELEC 2007 keynote, Rome, September 2007.
[19]L. Chiaraviglio, M. Mellia, F. Neri. Energy-aware Backbone Networks:a Case Study, First Int. Workshop on Green Communications (GreenComm'09), Dresden, June 2009.
[20]E. Yetginer, T.Uekai, and I. T. Kislasi. Power efficient traffic grooming in optical WDM networks, in Proc. Global Communications Conference 2009, Hawaii, USA, Nov.2009.
[21]D. Seshadri. Power-aware routing:Grooming traffic for reduction of power consumption in wire-line networks, Master dissertation, Dept. Computer Science, North Carolina State Univ., North Carolina, USA,2008.
[22]Gangxiang Shen and Rodney S.Tucker. Energy-Minimized Design for IP Over WDM Networks. Journal of Optical Communications and Networking, June 2009, vol.1,no.1, pp.176-186.
[23]Edoardo Bonetto, Luca Chiaraviglio, Davide Cuda, et al. Optical Technologies Can Improve the Energy Efficiency of Networks, ECOC 2009, Vienna, Austria,20-24 September 2009.
[24]Makoto Murakami and Kazuhiro Oda. Power Consumption Analysis of Optical Cross-Connect Equipment for Future Large Capacity Optical Networks, ICTON2009,We.B2.4.
[25]Slavisa Aleksic. Analysis of Power Consumption in Future High-Capacity Network Nodes. Journal of Optical Communications and Networking, August 2009, vol.1,no.3, pp.245-257.
[26]J. Chabarek, J. Sommers, P. Barford, et al. Power awareness in network design and routing, in Proc. INFOCOM'08, Phoenix, AZ, Apr.13-18 2008, pp.457-465.
[27]Keyao Zhu and Biswanath Mukherjee. A review of traffic grooming in WDM optical networks:Architectures and challenges. Optical Networks Magazine, Mar-Apr 2003, vol.4, no.2, pp.55-64.
[28]EH Modiano and Philip J Lin. Traffic grooming in WDM networks. IEEE Communications Magazine, Jul 2001,vol.39, no.7, pp.124-129.
[29]Keyao Zhu and Biswanath Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal in Selected Areas of Communications, Jan 2002, vol.20, no.1, pp.122-133.
[30]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Transactions on Networking, Apr.2003, vol.11,pp.285-299.
[31]S.Thiagarajan and A. K. Somani. Capacity fairness of WDMnetworks with grooming capabilities. SPIE Optical Networks Magazine, May/June 2001,vol.2, pp.24-32.
[32]K. Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks, in Proc. OFC, Mar.2002, p. ThW5.
[33]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. Dynamic traffic grooming in WDM mesh networks using a novel graph model, Proc. IEEE GLOBECOM, Nov.2002, pp.2681-2685.
[34]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element(PCE)-Based Architecture. RFC4655,August 2006.
[35]E. Oki, J-L Le Roux, A. Farrel. Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering, IETF Draft, March 2009.
[36]E. Oki, J-L Le Roux, A. Farrel. Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering, http://www.pathcomputation element.com,23 March 2007.
[37]Cugini, F, Giorgetti, A et al. Multiple path computation element (PCE) cooperation for multi-layer traffic engineering, OFC2007,OWK5.
[38]C. Ou, K. Zhu, B. Mukherjee. Survivable traffic grooming in WDM mesh networks. OFC2003.
[39]C. Ou, K. Zhu, B. Mukherjee et al. Traffic grooming for survivable WDM networks-shared protection. IEEE Journal on selected areas in communications,2003, vol.21(9), pp.1367-1383.
[2]Edoardo Bonetto, Luca Chiaraviglio, Davide Cuda, et al. Optical Technologies Can Improve the Energy Efficiency of Networks. ECOC 2009, Vienna, Austria,20-24 September 2009.
[3]W Leland, M Taqqu, W Willinger, et al. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking,1994, vol.2 (1), pp.1-15.
[4]Siganos G, Faloutsos M, Faloutsos P, et al. Power laws and the AS-level Internet Topology. IEEE/ACM Transactions on Networking,2003, vol.11 (4), pp.514-524.
[5]Yang Wanchun, Zhong Jinshun, Zhang Jie, et al. Channel Statistical Multiplexing in SDH/SONET Networks. IEE Proceeding on communications,2005, vol.152 (3), pp.447-451.
[6]Shinya Ishida. A Study on Flexible, Reliable, and Scalable Wavelength-Routed Optical Networks. Osaka, Japan:Department of Information Networking Graduate School of Information Science and Technology, Osaka University, February 2007.
[7]W.Alanqar, et al. Requirements for Generalized MPLS (GMPLS) Routing for Automatically Switched Optical Network (ASON). IETF draft, April 2005.
[8]D.Papadimitriou, et al. Requirements for Generalized MPLS (GMPLS) Signalling Usage and Extenstions for Automatically Switched Optical Network (ASON). IETF draft, April 2005.
[9]Kohei Shiomoto, et al. Requirements for GMPLS-based multi-region and multi-layer networks (MRN/MLN). IETF draft, Arpil,2006.
[10]ITU-T G.8080/Y.1304. Architecture for the automatically switched optical network (ASON), June 2006.
[11]OIF 2002.23.06. Domain to Domain Routing Using GMPLS OSPF Extensions V1.0 (Draft).
[12]Thomas Lehman, et al. DRAGON:A Framework for Service Provisioning in Heterogeneous Grid Networks. IEEE Communications Magazine, Mar.2006, pp.84-90.
[13]K. Shiomoto, D. Papadimitriou, et al. Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN). RFC5212, July 2008.
[14]A. Farrel, J.-P. Vasseur, J.Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[15]S.Azodolmolky, M. Klinkowski, E. Marin, D, et al. A Survey on Physical Layer Impairments Aware Routing and Wavelength Assignment Algorithms in Optical Networks. Computer Networks, May 2009, vol 53(7), pp.926-944.
[16]Itaru Nishioka, et al. End-to-End path routing with PCEs in multi-domain GMPLS networks. IPOP2008,2008.7.
[17]Bijan JABBARI, et al. On Constraints for Path Computation in Multi-Layer Switched Networks. IEICE TRANS. COMMUN.,AUGUST 2007,VOL.E90-B,NO.8.
[18]J. Ahmed, P. Monti, L. Wosinska. LSP Request Bundling in a PCE-Based WDM Network. OFC, San Diego, America, March 2009, OML4.
[19]Xiuzhong Chen, Jie Zhang et al. PCE-Based Network Design for Multi-Domain Layer 1 Virtual Private Networks. OFC, San Diego, America, March 2009,OWL2.
[20]Ankitkumar N. Patel, Yi Zhu, and Jason P. Jue. Routing and Horizon Scheduling for Time-Shift Advance Reservation. OFC, San Diego, America, March 2009, OTHO4.
[21]A. Giorgetti and F. Paolucci. Routing and Wavelength Assignment in PCE-based Wavelength Switched Optical Networks. ECOC, Brussels, Belgium, September 2008, TH1E3.
[22]Michiaki Hayashi. Advance Reservation-Based Network Resource Manger for Optical Networks. OFC, San Diego, America, February 2008, OTuAl.
[23]Soichiro Araki. Photonic Service Gateways in the Japan's Lambda Utility Project.2nd International OFC/NFOEC Workshop on the Future of Optical Networking (FON), CA, USA, March 2007.
[24]K-J Lu, G-Xi Xiao, et al. Blocking Analysis of Dynamic Lightpath Establishment in Wavelength-Routed Networks. ICC,2002, vol.5 (28),pp.2912-2916.
[25]R. Ramaswami, K. Sivarajan. Optimal routing and wavelength assignment in all-optical networks. Proceedings of the ZEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 970-983.
[26]Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. Proceedings of the IEEE INFOCOM 1994, Toronto, Canada, June 1994, pp.534-543.
[27]A. Girard. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network,1995,3, pp.489-500.
[28]H. Harai, M. Murata, H. Miyahara.Performance of alternate routing methods in all-optical switching networks. Proceedings of the IEEE INFOCOM 97, pp.516-524.
[29]Ahmed Mokhtar, Murat Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network,1998, vol.6 (2), pp.197-206.
[30]R.Randhawa, J.S.Sohal. Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion. Optik-International Journal for Light and Electron Optics, In Press, Corrected Proof, Available online 25 November 2008.
[31]R.A. Barry, P.A. Humblet. Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Sel. Areas Commun,1996, vol.14, pp.867-878.
[32]S A and S K.N. Blocking in All-Optical Networks. Networking, IEEE/ACM Transactions on, 2004, vol.5(2), pp.384-397.
[33]Rajalakshmi P, Ashok Jhunjhunwala. An Analytical Model for Wavelength-Convertible Optical Networks. ICC, June 2007, pp.2318-2323.
[34]Narula-Tam, A.;Brady, M.H.;Finn, S.G., et al. Blocking probability of a centralized switch with shared wavelength conversion. OFC, Feb 2004, paper TuH5.
[35]Tucker RS. Optical packet switching:A reality check. Optical Switching and Networking, 2008, vol.5 (1), pp.2-9.
[36]Wang RY, Zhang J, Guo F, et al. An effective buffering architecture for optical packet switching networks. Photonic Network Communications,2008, vol.16 (3), pp.239-243.
[37]P. Bergstrom, M. Ingram, A. Vernon, J. Hughes, et al. A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun, Oct.1999, vol.47 (10), pp.1593-1603.
[38]G.Castanon. Design-dimensioning model for transparent WDM packet-switched irregular networks. J. Lightwave Technol, Jan.2002, vol.20 (1), pp.1-9.
[39]Ayman G. Fayoumi, Anura P.Jayasumana. A surjective-Mapping Based Model for Optical Shared-Buffer Cross-Connect. IEEE/ACM Transactions on networking,2007, vol.15(1), pp.226-233.
[40]Mohamed H. S.Morsy, Hossam M. H. Shalaby, et al. An Enhanced Mathematical Model for Performance Evaluation of Optical Burst Switched Networks. GLOBECOM, Dec 2008, pp.1-5.
[41]Eramo V, Germoni A, Raffaelli C, et al. Packet loss analysis of shared-per-wavelength multi-fiber all-optical switch with parallel scheduling. Computer Networks,2009, vol.53 (2), pp.202-216.
[42]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[43]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[44]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[45]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[46]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[47]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[48]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[49]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[50]JP. Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[51]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[52]S. Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[53]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521,April 2009.
[54]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[55]Y. Lee, G Bernstein, et al. PCEP Requirements for WSON routing and wavelength assignment. IETF draft-ietf-pce-wson-routing-wavelength-01.txt, March 1,2010.
[56]G Bernstein and Y. Lee. Extending GMPLS/PCE for use in wavelength switched optical networks. OFC2008, NME1.
[57]Pachnicke S, Gravemann T, Windmann M, et al. Physically constrained routing in 10-gb/s DWDM networks including fiber nonlinearities and polarization effects. Journal of Lightwave Technology,2006,24, pp.3418-3426.
[58]Pachnicke S, Reichert J, Spalter S, et al. Fast analytical assessment of the signal quality in transparent optical networks. Journal of Lightwave Technology,2006,24, pp.815-824.
[59]Markidis G, Sygletos S, Tzanakaki A, et al. Impairment-Constraint-Based Routing in Ultralong-Haul Optical Networks With 2R Regeneration. IEEE Photonics Technology Letters,2007,19, pp.420-422.
[60]He J, Brandt-Pearce M, Pointurier Y. QoT-Aware Routing in Impairment-Constrained Optical Networks. In:Brandt-Pearce M (ed). GLOBECOM'07 IEEE,2007, pp.2269-2274.
[61]Tomkos I, Sygletos S, Tzanakaki A, et al. Impairment Constraint Based Routing in Mesh Optical Networks. OFC/NFOEC 2007.
[62]Zhai Y, Pointurier Y, Subramaniam S, et al. QoS-aware RWA algorithms for path-protected DWDM networks. OFC/NFOEC,2007.
[63]Bernstein G, Lee Y. Framework for GMPLS and PCE Control of Wavelength Switched Optical Networks (WSON). IETF draft-ietf-ccamp-rwa-wson-framework-06.txt, April 7, 2010.
[64]SMART 2020 Report. Enabling the low carbon economy in the information age, http://www.theclimategroup.org,2008.
[65]S. Pileri. Energy and Communication:engine of the human progress, INTELEC 2007 keynote, Rome, September 2007.
[66]L. Chiaraviglio, M. Mellia, F.Neri. Energy-aware Backbone Networks:a Case Study, First Int. Workshop on Green Communications (GreenComm'09), Dresden, June 2009.
[67]E. Yetginer, T. Uekai, and I. T. Kislasi. Power efficient traffic grooming in optical WDM networks, in Proc. Global Communications Conference 2009, Hawaii, USA, Nov.2009.
[68]D. Seshadri. Power-aware routing:Grooming traffic for reduction of power consumption in wire-line networks, Master dissertation, Dept. Computer Science, North Carolina State Univ., North Carolina, USA,2008.
[69]Gangxiang Shen and Rodney S. Tucker. Energy-Minimized Design for IP over WDM Networks. Journal of Optical Communications and Networking, June 2009, Vol.1,No.1, pp.176-186.
[70]Makoto Murakami and Kazuhiro Oda. Power Consumption Analysis of Optical Cross-Connect Equipment for Future Large Capacity Optical Networks, ICTON2009, We.B2.4.
[71]Keyao Zhu and Biswanath Mukherjee. A review of traffic grooming in WDM optical networks:Architectures and challenges. Optical Networks Magazine, Mar-Apr 2003, Vol.4, No.2, pp.55-64.
[72]EH Modiano and Philip J Lin. Traffic grooming in WDM networks. IEEE Communications Magazine, Jul 2001, Vol.39, No.7, pp.124-129.
[73]Keyao Zhu and Biswanath Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal in Selected Areas of Communications, Jan 2002, Vol.20, No.1,pp.122-133.
[74]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Transactions on Networking, Apr.2003, vol.11, pp.285-299.
[75]S. Thiagarajan and A. K. Somani. Capacity fairness of WDMnetworks with grooming capabilities. SPIE Optical Networks Magazine, May/June 2001,vol.2, pp.24-32.
[76]K.Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks, in Proc. OFC, Mar.2002, p. ThW5.
[77]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. Dynamic traffic grooming in WDM mesh networks using a novel graph model, Proc. IEEE GLOBECOM, Nov.2002, pp.2681-2685.
[78]Bernstein G, Lee Y. Routing and Wavelength Assignment Information Model for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-rwa-info-07.txt, Feb 18,2010.
[79]Bernstein G, Lee Y. Routing and Wavelength Assignment Information Encoding for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-rwa-wson-encode-00.txt, Feb 18,2010.
[80]Bernstein G, Y.Lee. Signaling Extensions for Wavelength Switched Optical Networks. IETF draft-bernstein-ccamp-wson-signaling-03.txt, October 31,2008.
[81]Bernstein G, Lee Y. PCEP Requirements and Extensions for WSON Routing and Wavelength Assignment. IETF draft-lee-pce-wson-routing-wavelength-03.txt, October 27,2008.
[82]Lee Y, Bernstein G. OSPF Enhancement for Signal and Network Element Compatibility for Wavelength Switched Optical Networks. IETF draft-ietf-ccamp-wson-signal-compatibility-ospf-Ol.txt, March 5,2010.
[83]Bernstein G, Lee Y. A Framework for the Control of Wavelength Switched Optical Networks (WSON) with Impairments. IETF draft-bernstein-ccamp-wson-impairments-01.txt, October 12,2009.
[84]Bernstein G, Lee Y. Information Model for Impaired Optical Path Validation. IETF draft-bernstein-wson-impairment-info-00.txt October 26,2008
[85]Yuefeng Ji, Jie Zhang, Yongli Zhao, et al. DREAMSCAPE:Dual Routing Engine Architecture in Multi-layer/multi-domain Scalable Constraint-Aware Policy-Enabled optical networks. OECC, Hongkong,2009.7.
[86]Zhang Jie, Zhao Yongli, Cao Xuping, et al. A Novel PCE-based Architecture of Multi-region and Multi-layer GMPLS/ASON Networks. China Communications, July 2009, vol.6 (3), p.67-71.
[87]Yongli Zhao, Jie Zhang, Yuefeng Ji. A novel PCE-based routing architecture in multi-layer network and multi-region network. IPOP2010, Japan, June 10,2010.
[88]张杰,纪越峰,张民,赵永利等.基于多层多域光网络的双路由计算单元系统.(申请号：200910088761.61
[89]张杰,赵永利,曹徐平等.双路由计算单元系统中群计算单元信息同步的实现方法.(申请号：200910088760.1)
[90]张杰,赵永利,曹徐平等.一种基于群计算单元的双层最短路径实现方法.(申请号：200910088759.9)
[91]张杰,赵永利,曹徐平等.一种支持策略解析的多约束条件路由选择方法.(申请号：200910088758.4)
[92]张杰,赵永利,曹徐平等.一种支持群计算单元协作路径计算的信令实现方法.(申请号：200910088757.X)
[93]Yongli Zhao, Jie Zhang, Min Zhang, et al. Dual Routing Architecture in Multi-layer and Multi-domain GMPLS/ASON Networks,PS2010,American.
[94]Yongli Zhao, Jie Zhang, Dahai Han, et al. Analytical Models of Blocking Probability for Multi-granularity Cross-connect Based Optical Networks, IET Communications,2009.4, vol.3 (11), pp.1716-1723.
[95]Yongli Zhao, Jie Zhang, Dahai Han, et al. The Research of Invulnerability in Complex Optical Networks. SPIE APOC2008, Hangzhou,26-30 Oct.2008.
[96]赵永利,张杰,韩大海等.一种基于时空复杂性的新型光网络业务模型.系统仿真学报,2009.8,vol.21(16,),pp.5183-5186.
[97]Zhao Yongli, Zhang Jie, Han Dahai, et al. The Complexity and Traffic Modeling of Optical Networks, HIGH TECHNOLOGY LETTERS,2009, vol.15 (2), pp.198-202.
[98]Yongli Zhao, Jie Zhang, Hai Huang, et al. Research and Analysis of Distributed Signaling Schemes in PCE-based Wavelength Switching Optical Network. OECC 2009, Hongkong, China,2009.7
[99]Yongli Zhao, Jie Zhang, Yuefeng Ji,et al. Routing and Wavelength Assignment Problem in PCE-based Wavelength Switched Optical Networks, JOCN,2010.4, vol.2 (4).
[100]Yongli Zhao, Jie Zhang, Hai Huang, et al. Analysis of PCE-based Wavelength Assignment Schemes in Wavelength Switched Optical Networks. WOCC, Shanghai, May 14,2010.
[101]付锡华,鲍远林,张杰,赵永利.双向回溯路径计算方法及装置.(申请号：2010191850430)
[102]Xihua Fu, Yuanli Bao, Yongli Zhao, Jie Zhang. A Dual-end Recursive PCE-based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths. IETF draft, March,2010.
[103]Yongli Zhao, Jie Zhang, Dahai Han, et al. Routing on Pre-configured Topology for Dynamic Optical Networks, Photonic Network Communications, vol.17 (3),2009, pp.299-310.
[104]Zhao Yongli, Zhang Jie, Han Dahai, et al. A Resource Pre-configuration Scheme in Intelligent Optical Networks, OFC,24-28 Feb,2008.
[1]ITU-T G.8080/Y.1304. Architecture for the automatically switched optical network (ASON). June 2006.
[2]OIF 2002.23.06. Domain to Domain Routing Using GMPLS OSPF Extensions V1.0 (Draft).
[3]K. Shiomoto, D. Papadimitriou, et al. Requirements for GMPLS-Based Multi-Region and Multi-Layer Networks (MRN/MLN). RFC5212, July 2008.
[4]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture, RFC4655. August 2006.
[5]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[6]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[7]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[8]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[9]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[10]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[11]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[12]JP.Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[13]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[14]S.Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[15]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521, April 2009.
[16]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[17]Itaru Nishioka, et al, End-to-End path routing with PCEs in multi-domain GMPLS networks, IPOP2008, July 2008.
[18]Bijan Jabbari, et al. On Constraints for Path Computation in Multi-Layer Switched Networks. IEICE Trans. Commun., August 2007, vol.E90-B, No.8, p.1922-1927.
[19]J. Ahmed, P. Monti, L. Wosinska.LSP Request Bundling in a PCE-Based WDM Network. OFC, San Diego, America, March 2009, OML4.
[20]Ankitkumar N. Patel, Yi Zhu, and Jason P. Jue. Routing and Horizon Scheduling for Time-Shift Advance Reservation. OFC, San Diego, America, March 2009, OTHO4.
[21]A. Giorgetti and F. Paolucci. Routing and Wavelength Assignment in PCE-based Wavelength Switched Optical Networks. ECOC, Brussels, Belgium, September 2008, TH1E3.
[22]Michiaki Hayashi. Advance Reservation-Based Network Resource Manger for Optical Networks. OFC, San Diego, America, February 2008, OTuAl.
[23]Yuefeng Ji, Jie Zhang, Yongli Zhao, et al. DREAMSCAPE:Dual Routing Engine Architecture in Multi-layer/multi-domain Scalable Constraint-Aware Policy-Enabled optical networks. OECC, Hongkong,2009.7.
[24]Zhang Jie, Zhao Yongli, et al. A Novel PCE-based Architecture of Multi-region and Multi-layer GMPLS/ASON Networks. China Communications, July 2009, vol.6 (3), p.67-71.
[25]G Bernstein, Y. Lee, D. Li. A Framework for the Control and Measurement of Wavelength Switched Optical Networks (WSON) with Impairments. IETF Draft, October 2008.
[26]Hua Zhang, Jie Zhang, et al. Dynamic End-to-End Optimization for Quality of Transmission in Reconfigurable Transparent Optical Networks. J. Optical Networking, June 2008, vol.7 (6), p.573-584.
[27]Xiuzhong Chen, Jie Zhang et al.PCE-Based Network Design for Multi-Domain Layer 1 Virtual Private Networks. OFC, San Diego, America, March 2009,OWL2.
[28]Jie Zhang, et al. AMSON:an Extended Architecture for Adaptive Service Provisioning in Transport Networks. OFC, San Diego, America, February 2008, JthA79.
[29]张杰,赵永利,曹徐平等.双路由计算单元系统中群计算单元信息同步的实现方法.(申请号：200910088760.11
[30]张杰,赵永利,曹徐平等.一种支持策略解析的多约束条件路由选择方法.(申请号：200910088758.4)
[31]张杰,赵永利,曹徐平等.一种支持群计算单元协作路径计算的信令实现方法.(申请号：200910088757.X)
[32]XH Fu, YL Zhao, et al. draft-fuxh-pce-drpc-OO.txt. IETF Draft, March 2010.
[33]D.King, and A. Farrel. draft-king-pce-hierarchy-fwk-03.txt. December,2009.
[34]ITU-T G.709. Interfaces for the optical transport network (OTN). Octber 2009.
[1]Yongli Zhao, Jie Zhang, Dahai Han, etal. Analytical Models of Blocking Probability for Multi-granularity Cross-connect Based Optical Networks, IET Communications,2009.4, vol.3 (11), pp.1716-1723.
[2]J.P.Ryan. WDM:North American Development Trends. IEEE Communications Magazine, 1998, vol.36 (3), pp.40-44.
[3]I.P.Kaminow, and et al. A Wideband All-Optical WDM Network. IEEE Journal on Selected Areas in Communications,1996, vol.14 (5), pp.780-799.
[4]G.Shen, S. K. Bose, et al. Operation of WDM Networks with Different Wavelength Conversion Capabilities. IEEE Communications letters,2000, vol.4 (7), pp.239-241.
[5]Pin-Han Ho, Hussein T. Mouftah. Routing and Wavelength Assignment with Multi-granularity Traffic in Optical Networks. IEEE Journal of Lightwave Technology,2008, vol.20 (8), pp.1292-1303.
[6]Pin-Han Ho, Hussein T. Mouftah, Jing Wu. A Scalable Design of Multigranularity Optical Cross-Connects for the Next-Generation Optical Internet. IEEE Journal on Selected Areas in Communications,2003, vol.21 (7), pp.1133-1142.
[7]C. Chen, X.-J.Kuo, Y.-Y.Chen, et al. A New Model for Optimal Routing and Wavelength Assigment with Fixed-length Tunnel Allocation in Multi-granularity Cross-connect WDM Networks. Military Communications Conference, Oct 2005,pp.1270-1276.
[8]L. Noirie, C. Blaizot and E. Dotaro. Multi-Granularity Optical Cross-Connect. ECOC, Oct 2000, pp.269-270.
[9]Takada, A., Koga, M. Multi-granularity OXC Architecture. OFC, March 2007, paper OThR4.
[10]Wu Jia, Song Yu, etal. A Testbed for Multi-Granularity Optical Switching Network. OFC, March 2007, paper JWA70.
[11]G-X Shen, S K. Bose, et al. The Impact of the Number of Add-Drop Ports in Wavelength-Routing All Optical Networks. Optical Networks Magazine (SPIE), Sep/Oct 2003, pp.112-122.
[12]K-J Lu, G-Xi Xiao, et al. Blocking Analysis of Dynamic Lightpath Establishment in Wavelength-Routed Networks. ICC,2002, vol.5 (28), pp.2912-2916.
[13]R. Ramaswami, K. Sivarajan. Optimal routing and wavelength assignment in all-optical networks. Proceedings of the ZEEE INFOCOM'94, Toronto, Canada, June 1994, pp. 970-983.
[14]Z. Zhang, A. Acampora. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse. Proceedings of the IEEE INFOCOM'94, Toronto, Canada, June 1994, pp.534-543.
[15]A. Girard. Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network,1995,3, pp.489-500.
[16]H. Harai, M. Murata, H. Miyahara. Performance of alternate routing methods in all-optical switching networks. Proceedings of the IEEE INFOCOM 97, pp.516-524.
[17]Ahmed Mokhtar, Murat Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network,1998, vol.6 (2), pp.197-206.
[18]R.Randhawa, J.S.Sohal. Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion. Optik-International Journal for Light and Electron Optics, In Press, Corrected Proof, Available online 25 November 2008.
[19]R.A. Barry, P.A. Humblet. Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Sel. Areas Commun,1996, vol.14, pp.867-878.
[20]S A and S K.N. Blocking in All-Optical Networks. Networking, IEEE/ACM Transactions on, 2004, vol.5 (2), pp.384-397.
[21]Rajalakshmi P, Ashok Jhunjhunwala. An Analytical Model for Wavelength-Convertible Optical Networks. ICC, June 2007, pp.2318-2323.
[22]Narula-Tam, A., Brady, M.H., Finn, S.G., et al. Blocking probability of a centralized switch with shared wavelength conversion. OFC, Feb 2004, paper TuH5.
[23]Tucker RS. Optical packet switching:A reality check. Optical Switching and Networking, 2008, vol.5 (1), pp.2-9.
[24]Wang RY, Zhang J, Guo F, et al. An effective buffering architecture for optical packet switching networks. Photonic Network Communications,2008, vol.16 (3), pp.239-243.
[25]P. Bergstrom, M. Ingram, A. Vernon, J. Hughes, and P. Tetali. A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Commun, Oct.1999, vol.47 (10), pp. 1593-1603.
[26]G. Castanon. Design-dimensioning model for transparent WDM packet-switched irregular networks. J. Lightwave Technol, Jan.2002, vol.20(1), pp.1-9.
[27]Ayman G. Fayoumi, Anura P. Jayasumana. A surjective-Mapping Based Model for Optical Shared-Buffer Cross-Connect. IEEE/ACM Transactions on networking,2007, vol.15 (1), pp.226-233.
[28]Mohamed H. S. Morsy, et al. An Enhanced Mathematical Model for Performance Evaluation of Optical Burst Switched Networks. GLOBECOM, Dec 2008, pp.1-5.
[29]Eramo V, Germoni A, Raffaelli C, et al. Packet loss analysis of shared-per-wavelength multi-fiber all-optical switch with parallel scheduling. Computer Networks,2009, vol.53 (2), pp.202-216.
[30]X-J Kuo and C Chen. A Blocking Probability Model in Multi-granularity Cross-connect Optical Networks. HPSR'07,2007, pp.1-6.
[31]I. Chlamtac, et al. Lightpath communications:An approach to high bandwidth optical WANs. IEEE Transaction on Commununications,1992, vol.40 (7), pp.1171-1182.
[32]A. Birman. Computing Approximate Blocking Probabilities for a Class of All-Optical Networks. IEEE Journal on Selected Areas in Communications,1996, vol.14 (5), pp. 852-857.
[33]S. Chung, A. Kashper, and K.W. Ross. Computing Approximate Blocking Probability for Large Loss Network with State-Dependent Routing. IEEE/ACM Transactions on Networking,1993, vol.1 (1), pp.105-115.
[34]曾宪钊.网络科学.北京,军事科学出版社,2006,pp.101-110.
[35]Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the internet topology. ACM SIGCOMM Computer Communication Review,1999, vol.29 (4), pp.251-262.
[36]Yongli Zhao, Jie Zhang, Dahai Han, et al. The Research of Invulnerability in Complex Optical Networks. SPIE APOC2008, Hangzhou,26-30 Oct.2008.
[37]Jason Spencer, Lionel Sacks. On Power-Laws in SDH Transport Networks. ICC,2003 vol.3, pp.1786-1790.
[38]Wang Yong, Liu Guoliang. Two-image model of telecommunication network and its system features of complex network. Electronic measurement technology,2007, (4), pp.63-66.
[39]Liu, H, Chen, B. K, Tobagi, F. On power-law tradeoffs between optical and electronic switching. Infocom,2006, pp.1-13.
[40]D. Banerjee and B. Mukherjee. Wavelength-routed optical networks:Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. IEEE/ACM Trans. Networking, Oct.2000, vol.8(5).
[41]Saad, T, Mouftah, H.T. Inter-domain wavelength routing in optical WDM networks, NETWORKS 2004,11th International,2004, pp.391-396.
[42]E. Oki, K. Shiomoto et al. Dynamic multilayer routing schemes in GMPLS-based IP+optical networks. IEEE Communications Magazine,2005, vol.43(1),pp.108-114.
[43]G Yan, T. Zhou, B. Hu, et al. Physical Review E 73,2006 (046108).
[44]郭雷；许晓鸣.复杂网络.上海科技教育出版社,2006.11：247-260.
[45]R.K. Ravalkol and D.R. Thompson. Service Restorability in Degree-based Wavelength Division Multiplexing Network. Optical Communications Systems and Networks,2005.
[46]S.W. Mahfoud, D.E Golderg. Parallel recombinative simulated annealing:a genetic algorithm. Parallel computing,1995, vol.21(1),pp.1-28.
[47]W Leland, M Taqqu, W Willinger, et al. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE/ACM Transactions on Networking,1994, vol.2 (1), pp.1-15.
[48]Siganos G, Faloutsos M, Faloutsos P, et al. Power laws and the AS-level Internet Topology. IEEE/ACM Transactions on Networking,2003, vol.11 (4), pp.514-524.
[49]Yang Wanchun, Zhong Jinshun, Zhang Jie, et al. Channel Statistical Multiplexing in SDH/SONET Networks. IEE Proceeding on communications,2005, vol.152 (3), pp.447-451.
[50]Shinya Ishida. A Study on Flexible, Reliable, and Scalable Wavelength-Routed Optical Networks. Osaka, Japan:Department of Information Networking Graduate School of Information Science and Technology, Osaka University, February 2007.
[51]Bo Mingxia, Pan Xiaofei, Ma Fanghua, et al. A Novel integrated Routing Algorithm in Multifiber IP/WDM Networks. Journal of Beijing University of Posts and Telecommunications,2006, vol.29 (5), pp.120-124.
[52]V Paxson. Fast Approximate Synthesis of Fractional Gaussian Noise for Generating Selfsimilar Network Traffic. Computer Commun. Review,1997, vol.27 (5), pp.5-18.
[53]Spencer J, Sacks L. On Power-laws in SDH Transport Networks. ICC2003, Alaska, USA, IEEE,2003, vol.3, pp.1786-1790.
[54]赵永利,张杰,韩大海,顾畹仪.一种基于时空复杂性的新型光网络业务模型.系统仿真学报,2009.8.
[55]李一宁,汪小帆.复杂网络上的一种映射网络模型.系统仿真学报,2007,vol.19(11),pp.2610-2614.
[56]Zhao Yongli, Zhang Jie, Han Dahai, et al. The Complexity and Traffic Modeling of Optical Networks, High Technology Letters,2009, vol.15 (2), pp.198-202.
[1]Xihua Fu, Yuanli Bao, Yongli Zhao, Jie Zhang. A Dual-end Recursive PCE-based Computation (DRPC) Procedure to Compute Shortest Constrained Inter-domain Traffic Engineering Label Switched Paths. IETF draft, March,2010.
[2]Yongli Zhao, Jie Zhang, Hai Huang, et al. Research and Analysis of Distributed Signaling Schemes in PCE-based Wavelength Switching Optical Network. OECC, Hongkong, July 2009.
[3]Yongli Zhao, Jie Zhang, Hai Huang, et al. Analysis of PCE-based Wavelength Assignment Schemes in Wavelength Switched Optical Networks. WOCC, Shanghai, May 2010.
[4]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element (PCE)-Based Architecture. RFC4655, August 2006.
[5]J. Ash, Ed, J.L. Le Roux, Ed. Path Computation Element (PCE) Communication Protocol Generic Requirements. RFC4657, September 2006.
[6]J.L. Le Roux, Ed. Requirements for Path Computation Element (PCE) Discovery. RFC4674, October 2006.
[7]J.L. Le Roux, Ed. Path Computation Element Communication Protocol (PCECP) Specific Requirements for Inter-Area MPLS and GMPLS Traffic Engineering. RFC4927, June 2007.
[8]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. IS-IS Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5089, January 2008.
[9]J.L. Le Roux, Ed., JP. Vasseur, Ed., et al. OSPF Protocol Extensions for Path Computation Element (PCE) Discovery. RFC5088, January 2008.
[10]N. Bitar, R. Zhang, et al. Inter-AS Requirements for the Path Computation Element Communication Protocol (PCECP). RFC5376, November 2008.
[11]I. Bryskin, D. Papadimitriou, et al. Policy-Enabled Path Computation Framework. RFC5394, December 2008.
[12]JP. Vasseur, Ed, JL. Le Roux, Ed, et al. Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440, March 2009.
[13]JP. Vasseur, Ed, R. Zhang, et al. A Backward-Recursive PCE-Based Computation(BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441,April 2009.
[14]S.Sivabalan, J. Parker, et al. Diffserv-Aware Class-Type Object for the Path Computation Element Communication Protocol. RFC5445, March 2009.
[15]E. Oki, T. Takeda, et al. Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions. RFC5521,April 2009.
[16]R. Bradford, JP. Vasseur, et al. Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism. RFC5520, April 2009.
[17]Y.Yamada, et al. Hierarchical Optical Path Network Design Considering Waveband Protection. ECOC, Berlin, Germany,2007.9.16-20.
[18]Itaru Nishioka, et al. End-to-End path routing with PCEs in multi-domain GMPLS networks. IPOP2008, Tokyo, Japan,2008.6.5-6.
[19]Y. Lee, G. Bernstein, et al. PCEP Requirements for WSON routing and wavelength assignment. IETF draft-ietf-pce-wson-routing-wavelength-01.txt, March 1,2010.
[20]G Bernstein and Y. Lee. Extending GMPLS/PCE for use in wavelength switched optical networks. OFC2008, NME1.
[21]A. Giorgetti (1), F. Paolucci, et al. Routing and wavelength assignment in PCE-based wavelength switched optical networks. ECOC2008,21-25 September 2008, Brussels, Belgium, Th.1.E.3.
[22]Arakawa, S et al., APCC/OECC, vol.1,1999, pp.445
[23]Lei Wang, Jie Zhang, Yongli Zhao, et al. A collision-aware wavelength assignment scheme for GMPLS-based WDM networks. Communications letters,IEEE,2008,vol.12 (8), pp.593-595.
[24]Yongli Zhao, Jie Zhang, Yuefeng Ji, et al. Routing and Wavelength Assignment Problem in PCE-based Wavelength Switched Optical Networks. JOCN,2010, vol.2 (4).
[1]A, Mokhtar and M, Azizoglu. Adaptive wavelength routing in all-optical networks. IEEE/ACM Transactions on Networking,1998, vol.6 (2), pp.197-206.
[2]E, Karasan and E, A yanoglu. Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE GLOBECOM, London, U.K., 1996, vol.1, pp.299-305.
[3]L, Li and A, K, Somani. Blocking performance analysis of fixed path least congestion routing in multi-fiber WDM networks. SPIE Photonics East'99, Boston,1999, pp.56-67.
[4]L, Li and A, K. Somani. Dynamic wavelength routing using congestion and neighborhood information. IEEE/ACM Transaction on Networking,1999, vol.7 (5), pp.779-786.
[5]S, Subramaniam and K, N, Barry. Wavelength assignment in fixed routing WDM Networks. IEEE ICC,1997, vol.1,pp.406-410.
[6]H, Zhang., J, P, Jue., B M uhkerjee. A review of routing and wavelength assignment approaches for wavelength routed optical WDM Networks. Optical Networks Magazine, 2000, vol.1 (1), pp.47-60.
[7]Z, Zhang., Acampora, A.S. A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use. IEEE/ACM Transactions on Networking,1995,vol.3 (3), pp.281-288.
[8]Chamas, H.,Ali, M., Bjorkman, W. A novel admission control system for bandwidth on demand Ethernet services over optical transport networks. OFC,2005, vol.4, pp.6-11.
[9]Ishida, S.,Arakawa, S.,Murata, M. Virtual fiber configuration method for dynamic lightpath establishment in large-scaled WDM networks. Photonic Network Communications,2006, vol.12 (1),pp.87-98.
[10]Yongli Zhao, Jie Zhang, Dahai Han, et al. A planning scheme of resource pre-configuration in intelligent optical networks. OFC,2008, JWA102.
[11]Yongli Zhao, Jie Zhang, Dahai Han, et al. Routing on Pre-configured Topology for Dynamic Optical Networks. Photonic Network Communications,2009, vol.17 (3),pp.299-310.
[12]Gencata., et al. Virtual-topology adaptation for WDM mesh networks under dynamic traffic. IEEE/ACM Transactions,2003, vol.11 (2):pp.236-247.
[13]Ganz., et al. Efficient algorithm for virtual topology design in multihop lightwave networks. IEEE/ACM Transactions,1994, vol.2 (3), pp.217-225.
[14]Narula-Tam, A., et al. Efficient routing and wavelength assignment for reconfigurable WDM networks. Selected Areas in Communications, IEEE Journal on,2002, vol.20(1),pp.75-88.
[15]Vigoureux, M., et al. Multilayer traffic engineering for GMPLS-enabled networks. Communications magazine, IEEE,2005, vol.43 (7), pp.44-50.
[16]Salbella, R., et al. Guest editorial:Traffic engineering in optical networks. Network, IEEE, 2003, vol.17 (2), pp.6-7.
[17]SMART 2020 Report. Enabling the low carbon economy in the information age, http://www.theclimategroup.org,2008.
[18]S. Pileri. Energy and Communication:engine of the human progress, INTELEC 2007 keynote, Rome, September 2007.
[19]L. Chiaraviglio, M. Mellia, F. Neri. Energy-aware Backbone Networks:a Case Study, First Int. Workshop on Green Communications (GreenComm'09), Dresden, June 2009.
[20]E. Yetginer, T.Uekai, and I. T. Kislasi. Power efficient traffic grooming in optical WDM networks, in Proc. Global Communications Conference 2009, Hawaii, USA, Nov.2009.
[21]D. Seshadri. Power-aware routing:Grooming traffic for reduction of power consumption in wire-line networks, Master dissertation, Dept. Computer Science, North Carolina State Univ., North Carolina, USA,2008.
[22]Gangxiang Shen and Rodney S.Tucker. Energy-Minimized Design for IP Over WDM Networks. Journal of Optical Communications and Networking, June 2009, vol.1,no.1, pp.176-186.
[23]Edoardo Bonetto, Luca Chiaraviglio, Davide Cuda, et al. Optical Technologies Can Improve the Energy Efficiency of Networks, ECOC 2009, Vienna, Austria,20-24 September 2009.
[24]Makoto Murakami and Kazuhiro Oda. Power Consumption Analysis of Optical Cross-Connect Equipment for Future Large Capacity Optical Networks, ICTON2009,We.B2.4.
[25]Slavisa Aleksic. Analysis of Power Consumption in Future High-Capacity Network Nodes. Journal of Optical Communications and Networking, August 2009, vol.1,no.3, pp.245-257.
[26]J. Chabarek, J. Sommers, P. Barford, et al. Power awareness in network design and routing, in Proc. INFOCOM'08, Phoenix, AZ, Apr.13-18 2008, pp.457-465.
[27]Keyao Zhu and Biswanath Mukherjee. A review of traffic grooming in WDM optical networks:Architectures and challenges. Optical Networks Magazine, Mar-Apr 2003, vol.4, no.2, pp.55-64.
[28]EH Modiano and Philip J Lin. Traffic grooming in WDM networks. IEEE Communications Magazine, Jul 2001,vol.39, no.7, pp.124-129.
[29]Keyao Zhu and Biswanath Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal in Selected Areas of Communications, Jan 2002, vol.20, no.1, pp.122-133.
[30]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Transactions on Networking, Apr.2003, vol.11,pp.285-299.
[31]S.Thiagarajan and A. K. Somani. Capacity fairness of WDMnetworks with grooming capabilities. SPIE Optical Networks Magazine, May/June 2001,vol.2, pp.24-32.
[32]K. Zhu and B. Mukherjee. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks, in Proc. OFC, Mar.2002, p. ThW5.
[33]H. Zhu, H. Zang, K. Zhu, and B. Mukherjee. Dynamic traffic grooming in WDM mesh networks using a novel graph model, Proc. IEEE GLOBECOM, Nov.2002, pp.2681-2685.
[34]A. Farrel, J.-P. Vasseur, J. Ash. A Path Computation Element(PCE)-Based Architecture. RFC4655,August 2006.
[35]E. Oki, J-L Le Roux, A. Farrel. Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering, IETF Draft, March 2009.
[36]E. Oki, J-L Le Roux, A. Farrel. Framework for PCE-Based Inter-Layer MPLS and GMPLS Traffic Engineering, http://www.pathcomputation element.com,23 March 2007.
[37]Cugini, F, Giorgetti, A et al. Multiple path computation element (PCE) cooperation for multi-layer traffic engineering, OFC2007,OWK5.
[38]C. Ou, K. Zhu, B. Mukherjee. Survivable traffic grooming in WDM mesh networks. OFC2003.
[39]C. Ou, K. Zhu, B. Mukherjee et al. Traffic grooming for survivable WDM networks-shared protection. IEEE Journal on selected areas in communications,2003, vol.21(9), pp.1367-1383.