WDM光网络中的多播算法研究
|
摘要
随着光网络的迅速普及，作为未来Internet骨干支撑的WDM(Wavelength Division Multiplexing)光网络组网技术和业务提供技术受到了越来越多的关注。另一方面，随着光学技术的日益成熟，功能越来越完善的各种光通信器件／设备大批涌现，使得许多原来需要在业务交换层面完成的工作被更多地移植到了光层，一个典型的例子就是近年来广受关注的光网络多播技术。分光器的出现为实现光网络中多播传输提供了硬件基础，利用分光器可以设计出支持光层多播路由的光交叉连接器MC-OXC(Multicast Capable-OXC)。在单播连接中，光层路由是一个路状结构，而多播连接是一种点对多点的连接请求，需要在光层上构建全光的树状路由——光树或者光林(多棵光树)。与光层的单播路由，光层树状多播路由问题更加复杂。本文主要研究光层多播的算法设计问题，主要包括WDM光网络多播的网络静态规划问题、多约束条件下光树的优化设计问题、光层多播的保护问题以及光层多播的业务疏导问题。
与光层的单播连接和IP层的多播技术相比，光层多播路由的计算问题存在一些特殊的约束条件，主要包括波长连续性约束、稀疏分光器配置约束和能量损伤约束。在实际的光网络中，不是每个节点都配置波长转换器。这就导致了光网络中的波长连续性约束。在这种下，多播选路与波长选择密切相关。对于单播请求，波长连续性约束下的光路计算问题被称为RWA(Routing and Wavelength Assignment)问题，而相应光树的计算问题被称为MC-RWA(Multicasting RWA)问题。此外，考虑到网络建设成本，在实际的光网络中，不是所有的网络节点都配置了分光器。这就形成了光网络中多播路由的稀疏分光器约束。在稀疏分光器配置约束下，光树的计算问题不再是一个传统的Steiner Tree(有文献译为施泰纳树，即求覆盖网络节点集合的一个子集的最佳生成子树)问题。在光树路由结构中，光信号从源点输出经过树状路由传输到每个目的节点。信号能量经过了传输衰减损伤和分光器的分光损伤。传输损伤主要是由于光信号在光纤系统中信号能量的吸收、散射等原因造成的。分光器引入的信号能量损伤是由于光信号通过分光器后，将输入的信号能量分成了多份并通过不同的光树分支输出，从而导致了每条分支上信号能量的损伤。但是为了保证每个目的节点接收到的信号能量都能超过接收器的接收门限，光树的计算必须考虑光树的能量损伤约束条件。这三个约束条件在计算光树的过程中同时存在，所以一个可行的多播树必须满足上述所有约束条件。
光网络多播的静态规划可用于网络建设初期的规划设计或者网络中较大周期的虚拓扑重配置中。本文第二章主要从两个方面研究了光网络多播的静态规划问题：(1)在稀疏波长转换器和分光器配置的网络中，波长转换器和分光器的最佳放置问题；(2)在光纤波长通道数受限情况下，研究如何利用最少的网络资源承载给定业务矩阵的多播连接。这两个问题解决都是在波长连续性约束、稀疏分光器配置约束和能量损伤约束条件下进行的。在第二章，通过一个混合线性规划MILP(Mixed Integer Linear Programming)模型，将光网络中多播的静态规划问题转化为一个优化问题。通过求解此模型的最优解，可以获得分光器和波长转换器的最佳放置位置，并且可以得到满足所有约束条件的网络虚拓扑设计。由于光网络中多播路由的能量损伤约束是一个乘性约束。利用多播树上节点的能量守恒规律，在第二章，用一组线性的关系式准确描述了光层多播的能量损伤约束条件。
给定网络资源配置(包括波长转换器和分光器的放置位置、光纤链路上的波长通道数)，第三章研究了在动态多播业务环境中的多播树构建问题。如果没有约束条件，最佳多播树的计算问题就是一个传统的Steiner Tree问题。由于Steiner Tree问题是一个NP完全问题，约束条件下多播树的计算问题要比Steiner Tree问题更为复杂，所以约束条件下多播树的计算问题也是一个NP完全问题。在动态连接环境中，只能通过启发式算法来求解一个近似解。在图论中，树是一个不含圈的简单连通图。但是光层多播的约束条件下，一个可行的多播路由可以包含圈。针对这一特点，第三章提出的NMO(Novel-Member-Only)算法是对Member-Only的改进算法，提高了算法的性能。对于能量损伤约束条件下的多播树计算问题，提出了基于多播树扩张的选路算法MRST(Multicast Routing Basing on Spanning Tree)和基于重路由的选路算法MRRR(Multicast Routing Basing on Re-Route)。此外，一个可行的多播树算法必须满足所有约束条件，第三章还提出了多约束条件下的多播树构建算法。
WDM技术可以大大提高链路的传输容量，同时也使网络的生存性问题日渐突出。在WDM光网络中，网络部件失效时可能遭受比传统网络更大的损失，比如一根光纤断裂将导致所有经过该光纤的光路或者光树都失效，而每条全光通道都能以Gbps的速率传输数据，这样的失效对网络中业务的影响是非常严重的。本文的第四章和第五章研究WDM网络多播的保护问题。第四章主要研究多播专用保护技术，第五章主要研究了多播的共享保护技术。在第四章，首先将多播专用保护问题用一个最优化数学模型进行描述。给定多播请求和网络配置，通过求解最优化模型，可以得到最佳的多播专用保护通路由，并为动态多播业务环境下的启发式算法提供一个理论上的参考。与单播保护问题类似，光网络中多播保护可以采用分段保护的机制。在分段多播保护中，一个关键的问题是如何将给定多播树进行分段。分段机制的不同将会对算法性能产生很大的影响。在第四章提出的自适应分段保护ASSP(Adaptive Segment Shared Protection)机制中，算法将多播树上的枝叶节点作为分段的起始节点，同时为其构建一条保护通路，重复这一过程直到多播树上没有枝叶节点为止，从而实现了多播树的保护。同时，在网络稀疏配置(稀疏波长转换器配置和稀疏分光器配置)约束下，现有的多播保护算法在波长连续性限制约束下将会失效。第四章还提出了网络稀疏配置下的双路多播保护TPMP(Two-Paths Multicast Protection)算法。为了提高资源利用率，第五章研究了光网络多播的共享保护机制。首先通过一个ILP模型将共享保护机制描述成一个最优化问题，通过ILP模型的求解可以得到共享保护机制下的多播虚拓扑设计。并提出了混合共享的多播保护算法MSSP(Mixed Segment Shared Protection)。根据仿真结果，MSSP算法提高了网络资源的利用率。
在WDM网络中，波长路由的巨大带宽和单个连接请求的小粒度带宽不匹配。为了提高传输效率，可以将低速的多播业务连接汇聚起来在一棵光树上进行传输。第六章研究了WDM网络多播的业务疏导技术，并提出了多播树分解的业务疏导算法MTD(Multicasting Tree Decompose)。MTD业务疏导算法的基本思想是尽量通过网络上现有的光树进行业务疏导，每一次业务疏导都会导致新建多播树目的节点数的减少，从而改善网络的多播吞吐能力。此外，第六章还研究了WDM网络多播业务疏导的生存性问题，并提出了两种分析模型：多播混合带宽保护的业务疏导分析模型TG-MBP(Traffic Grooming with Mixed Bandwidth Protection)和多播共享保护的业务疏导分析模型TG-SP(Traffic Grooming with Shared Protection)。在TG-MBP模型中，一个专用保护的多播路由SMR(Survivable Multicasting Route)可以分解成为两棵“对偶”树结构。在网络正常情况下，连接都可以传输到SMR上的任意节点，从而保证了到SMR上任意节点的业务都可以进行业务疏导。利用TG-MBP提出了专用分段保护的多播业务疏导算法MTG-SP(Multicast Traffic with Segment Protection)。在TG-SP模型中，多播保护采用的是共享保护机制。在共享保护模型中，只有到工作树上节点的业务才可以进行业务疏导。基于这一模型，提出了共享分段保护的多播业务疏导算法MTG-SSP(Multicast Traffic Grooming with Shared Segment Protection)。最后进行了全文总结。
With the popularization of optical networks, the technology of wavelength division multiplexing (WDM) optical networks becomes the core technology of next generation Internet backbone networks. On the other hand, with the maturity of optics technology, there emerge more and more optical communication equipments/apparatus with perfect function. We can transplant some operations to the optical layer which are carried out on layer of service switching originally, for example, the technology of optical multicasting which absorbs attention widely in recent years. The emergence of the light splitters provides the hardware support for optical multicast technology. With the light splitters, we can design the multicast capable OXC--MC-OXC. In the case of unicast in the optical networks, the route of request has a "path" structure. The multicast service is the communication of one point to multiple points. So the route of the multicast request has a "tree" structure, called light trees or light forest (multiple light trees). Comparing with the technology of the unicast in optical layer, the problem of computing the optical multicasting routes is more complex. In this paper, we study the algorithm of optical multicasting, including the static programming of multicast in the WDM optical networks, the optimal design of the multicast trees with multiple constraints, the survivability of the optical multicasting and the traffic grooming of optical multicasting.
The problem of computing optical multicast tree is more complex than that of unicast, for the optical multicast tree must satisfy some especial constraints: wavelength continuity constraints, sparse light splitter configuration constraints and power budge constraints. With the constraints of wavelength continuity, the multicast routing is correlative with the wavelength assignment. The problem of light path with wavelength continuity constraints is named RWA (Routing and wavelength assignment). In the same way, problem of computing the light tree with wavelength continuity is named MC-RWA (Multicast RWA). If there are none of wavelength converters in the network, the light tree must be assigned same wavelength channel to each optical fiber on the tree. In the practical optical communication system, we need not place a light splitter to every node in view of the network cost. With the constraints of sparse light splitter configuration, the computing of light tree is not a Steiner Tree problem. In the route of light tree, the optical signal is transmitted from the source node to every destination node. The optical signals suffer losses as they travel from source to destination node. We distinguish two types of losses: signal attenuation and splitting loss. The loss of signal attenuation is due to the absorbing and dispersing when the optical signal travel along the light tree. When the optical signals pass by the MC-OXC, the power will be split several parts and then switched to according outputs, which introduces the splitting loss of the optical signal. In order to ensure every destination node receive the data, the power of received by each receiver must above a threshold. So the light tree must satisfy the constraints of power budge. The three constraints coexist for a light tree, so a feasible light tree must satisfy all the constraints.
The static programming of multicast optical network can be used for the layout design of network or the reconfiguration of virtual topology after a long period. Chapter 2 studies the static programming problem from two perspectives: (1) the placement of wavelength converters and light splitters in the sparse configuration networks; (2) with the limits of wavelength number per fiber, the network resource provisioning for given multicast traffic matrix. We formulate the two problems as a mixed integer linear programming (MILP) model. By this mean, the problem of static programming is transferred to an optimal problem. When we solve the MILP and achieve the optimal solutions, we can attain the placement of wavelength converters and light splitters. What's more, we can achieve the design of virtual topology of the networks. Especially, the constraints of power budge are multiplicative. Usually, we can not formulate a multiplicative constraint problem with linear equations precisely. In chapter 2, we use linear programming to solve optimal multicast routing and wavelength assignment with power budget constraints by using the relation of power conservation at every node on the light tree.
Chapter 3 studies the problem of dynamic multicast routing for given the configuration of network (including the placement of wavelength converters and light splitters, the wavelength number on each fiber link and the physical topology of network). With none constraints, the problem of optimal multicast tree is a Steiner Tree problem, which is NP hard. The problem of multicast tree with constraints is not less hard than that of the problem of Steiner Tree. So the multicast tree with constraints is NP hard. Under the environment of dynamic multicast traffic, we can only propose some heuristic algorithms to compute the multicast tree with constraints. In graph theory, a tree is a simple graph with no circles. With the constraints of the optical multicast, a feasible light tree may contain some circles. In chapter 3, we propose a heuristic algorithm (NMO) to compute the light tree with sparse light splitters configuration constraint according to the character of light tree. What's more, we propose an algorithm for compute the light tree with all the constraints at the rest of chapter 3.
WDM technology provides the tremendous bandwidth, while poses the survivability issue urgent. In WDM network, the failure of a network component can lead to tremendous loss than in other traditional networks. For example, a failed fiber link can lead to the failure of all the lightpaths that traverse the failed link, since each lightpath is expected to operate at a rate of several gigabytes per second, a failure can lead to a severe data loss. Chapter 4 and 5 study the protection of optical multicast in the mesh WDM networks. Chapter 4 mainly studies the scheme of dedicated multicast protection and chapter 5 focuses on the scheme of shared multicast protection. In chapter 4, we formulate the problem of dedicated multicast protection into a ILP model. Given a batch of multicast requests and the configuration of networks, we can achieve the virtual topology design by solving the ILP. Similar to the case of unicast, we can adopt the segment protection for the multicast request. The critical problem of segment multicast protection is how to identify the segments of a multicast tree. The scheme of segment will affect the performance of algorithm seriously. In chapter 4, adaptive segment shared protection (ASSP) algorithm is proposed. In the scheme of ASSP, we establish a light path to protect each segment between two leaf nodes on the multicast tree. With the constraints of sparse wavelength converters configuration, almost all the algorithms will be invalid. In chapter 4, we propose two paths multicast protection (TPMP) algorithm for sparse wavelength converters configuration constraints. In order to improve the network resource utilization efficiency, chapter 5 studies the scheme of shared multicast protection. The problem is formulated into an ILP model. We can solve the ILP model to achieve the virtual topology design. And then we propose mixed shared segment protection (MSSP) algorithm to protect multicast requests. The numerical results show that MSSP algorithm provides significant capacity savings.
In the WDM optical networks, it is mismatch for the enormous bandwidth of wavelength channel and that of single server. It is necessary to investigate how to efficiently set up connections for these traffic streams. Traffic grooming can meet this problem. Chapter 6 studies the technology of multicast traffic grooming in the WDM mesh networks. An algorithm of Multicast Tree Decompose (MTD) is proposed for dynamic multicast traffic grooming. The main idea of MTD is try to decrease the destination number of multicast request by grooming the traffic on the existing multicast trees. Then we study the problem of survivability multicast traffic grooming and propose two model, named multicast traffic grooming with mixed bandwidth protection (TG-MBP) and multicast traffic grooming with shared protection (TG-SP). In TG-MBP, a dedicated protected survivable multicast route (SMR) route can be partitioned into two "dual-trees". Under normal operation, the traffic can be transferred to any node on the SMR, which ensures that we can groom the traffic on the SMR for every node on the SMR. According to the model of TG-MBP, multicast traffic grooming with segment protection (MTG-SP) algorithm is proposed. In the model of TG-SP, the protection resource can be shared by different multicast requests. Under normal operation, the traffic can only be transferred to the node on the working tree. So the traffic can be groomed on the working tree for the node on the tree. Based on the model of MTG-SP, the algorithm of multicast traffic grooming with shared segment protection is proposed.
与光层的单播连接和IP层的多播技术相比，光层多播路由的计算问题存在一些特殊的约束条件，主要包括波长连续性约束、稀疏分光器配置约束和能量损伤约束。在实际的光网络中，不是每个节点都配置波长转换器。这就导致了光网络中的波长连续性约束。在这种下，多播选路与波长选择密切相关。对于单播请求，波长连续性约束下的光路计算问题被称为RWA(Routing and Wavelength Assignment)问题，而相应光树的计算问题被称为MC-RWA(Multicasting RWA)问题。此外，考虑到网络建设成本，在实际的光网络中，不是所有的网络节点都配置了分光器。这就形成了光网络中多播路由的稀疏分光器约束。在稀疏分光器配置约束下，光树的计算问题不再是一个传统的Steiner Tree(有文献译为施泰纳树，即求覆盖网络节点集合的一个子集的最佳生成子树)问题。在光树路由结构中，光信号从源点输出经过树状路由传输到每个目的节点。信号能量经过了传输衰减损伤和分光器的分光损伤。传输损伤主要是由于光信号在光纤系统中信号能量的吸收、散射等原因造成的。分光器引入的信号能量损伤是由于光信号通过分光器后，将输入的信号能量分成了多份并通过不同的光树分支输出，从而导致了每条分支上信号能量的损伤。但是为了保证每个目的节点接收到的信号能量都能超过接收器的接收门限，光树的计算必须考虑光树的能量损伤约束条件。这三个约束条件在计算光树的过程中同时存在，所以一个可行的多播树必须满足上述所有约束条件。
光网络多播的静态规划可用于网络建设初期的规划设计或者网络中较大周期的虚拓扑重配置中。本文第二章主要从两个方面研究了光网络多播的静态规划问题：(1)在稀疏波长转换器和分光器配置的网络中，波长转换器和分光器的最佳放置问题；(2)在光纤波长通道数受限情况下，研究如何利用最少的网络资源承载给定业务矩阵的多播连接。这两个问题解决都是在波长连续性约束、稀疏分光器配置约束和能量损伤约束条件下进行的。在第二章，通过一个混合线性规划MILP(Mixed Integer Linear Programming)模型，将光网络中多播的静态规划问题转化为一个优化问题。通过求解此模型的最优解，可以获得分光器和波长转换器的最佳放置位置，并且可以得到满足所有约束条件的网络虚拓扑设计。由于光网络中多播路由的能量损伤约束是一个乘性约束。利用多播树上节点的能量守恒规律，在第二章，用一组线性的关系式准确描述了光层多播的能量损伤约束条件。
给定网络资源配置(包括波长转换器和分光器的放置位置、光纤链路上的波长通道数)，第三章研究了在动态多播业务环境中的多播树构建问题。如果没有约束条件，最佳多播树的计算问题就是一个传统的Steiner Tree问题。由于Steiner Tree问题是一个NP完全问题，约束条件下多播树的计算问题要比Steiner Tree问题更为复杂，所以约束条件下多播树的计算问题也是一个NP完全问题。在动态连接环境中，只能通过启发式算法来求解一个近似解。在图论中，树是一个不含圈的简单连通图。但是光层多播的约束条件下，一个可行的多播路由可以包含圈。针对这一特点，第三章提出的NMO(Novel-Member-Only)算法是对Member-Only的改进算法，提高了算法的性能。对于能量损伤约束条件下的多播树计算问题，提出了基于多播树扩张的选路算法MRST(Multicast Routing Basing on Spanning Tree)和基于重路由的选路算法MRRR(Multicast Routing Basing on Re-Route)。此外，一个可行的多播树算法必须满足所有约束条件，第三章还提出了多约束条件下的多播树构建算法。
WDM技术可以大大提高链路的传输容量，同时也使网络的生存性问题日渐突出。在WDM光网络中，网络部件失效时可能遭受比传统网络更大的损失，比如一根光纤断裂将导致所有经过该光纤的光路或者光树都失效，而每条全光通道都能以Gbps的速率传输数据，这样的失效对网络中业务的影响是非常严重的。本文的第四章和第五章研究WDM网络多播的保护问题。第四章主要研究多播专用保护技术，第五章主要研究了多播的共享保护技术。在第四章，首先将多播专用保护问题用一个最优化数学模型进行描述。给定多播请求和网络配置，通过求解最优化模型，可以得到最佳的多播专用保护通路由，并为动态多播业务环境下的启发式算法提供一个理论上的参考。与单播保护问题类似，光网络中多播保护可以采用分段保护的机制。在分段多播保护中，一个关键的问题是如何将给定多播树进行分段。分段机制的不同将会对算法性能产生很大的影响。在第四章提出的自适应分段保护ASSP(Adaptive Segment Shared Protection)机制中，算法将多播树上的枝叶节点作为分段的起始节点，同时为其构建一条保护通路，重复这一过程直到多播树上没有枝叶节点为止，从而实现了多播树的保护。同时，在网络稀疏配置(稀疏波长转换器配置和稀疏分光器配置)约束下，现有的多播保护算法在波长连续性限制约束下将会失效。第四章还提出了网络稀疏配置下的双路多播保护TPMP(Two-Paths Multicast Protection)算法。为了提高资源利用率，第五章研究了光网络多播的共享保护机制。首先通过一个ILP模型将共享保护机制描述成一个最优化问题，通过ILP模型的求解可以得到共享保护机制下的多播虚拓扑设计。并提出了混合共享的多播保护算法MSSP(Mixed Segment Shared Protection)。根据仿真结果，MSSP算法提高了网络资源的利用率。
在WDM网络中，波长路由的巨大带宽和单个连接请求的小粒度带宽不匹配。为了提高传输效率，可以将低速的多播业务连接汇聚起来在一棵光树上进行传输。第六章研究了WDM网络多播的业务疏导技术，并提出了多播树分解的业务疏导算法MTD(Multicasting Tree Decompose)。MTD业务疏导算法的基本思想是尽量通过网络上现有的光树进行业务疏导，每一次业务疏导都会导致新建多播树目的节点数的减少，从而改善网络的多播吞吐能力。此外，第六章还研究了WDM网络多播业务疏导的生存性问题，并提出了两种分析模型：多播混合带宽保护的业务疏导分析模型TG-MBP(Traffic Grooming with Mixed Bandwidth Protection)和多播共享保护的业务疏导分析模型TG-SP(Traffic Grooming with Shared Protection)。在TG-MBP模型中，一个专用保护的多播路由SMR(Survivable Multicasting Route)可以分解成为两棵“对偶”树结构。在网络正常情况下，连接都可以传输到SMR上的任意节点，从而保证了到SMR上任意节点的业务都可以进行业务疏导。利用TG-MBP提出了专用分段保护的多播业务疏导算法MTG-SP(Multicast Traffic with Segment Protection)。在TG-SP模型中，多播保护采用的是共享保护机制。在共享保护模型中，只有到工作树上节点的业务才可以进行业务疏导。基于这一模型，提出了共享分段保护的多播业务疏导算法MTG-SSP(Multicast Traffic Grooming with Shared Segment Protection)。最后进行了全文总结。
With the popularization of optical networks, the technology of wavelength division multiplexing (WDM) optical networks becomes the core technology of next generation Internet backbone networks. On the other hand, with the maturity of optics technology, there emerge more and more optical communication equipments/apparatus with perfect function. We can transplant some operations to the optical layer which are carried out on layer of service switching originally, for example, the technology of optical multicasting which absorbs attention widely in recent years. The emergence of the light splitters provides the hardware support for optical multicast technology. With the light splitters, we can design the multicast capable OXC--MC-OXC. In the case of unicast in the optical networks, the route of request has a "path" structure. The multicast service is the communication of one point to multiple points. So the route of the multicast request has a "tree" structure, called light trees or light forest (multiple light trees). Comparing with the technology of the unicast in optical layer, the problem of computing the optical multicasting routes is more complex. In this paper, we study the algorithm of optical multicasting, including the static programming of multicast in the WDM optical networks, the optimal design of the multicast trees with multiple constraints, the survivability of the optical multicasting and the traffic grooming of optical multicasting.
The problem of computing optical multicast tree is more complex than that of unicast, for the optical multicast tree must satisfy some especial constraints: wavelength continuity constraints, sparse light splitter configuration constraints and power budge constraints. With the constraints of wavelength continuity, the multicast routing is correlative with the wavelength assignment. The problem of light path with wavelength continuity constraints is named RWA (Routing and wavelength assignment). In the same way, problem of computing the light tree with wavelength continuity is named MC-RWA (Multicast RWA). If there are none of wavelength converters in the network, the light tree must be assigned same wavelength channel to each optical fiber on the tree. In the practical optical communication system, we need not place a light splitter to every node in view of the network cost. With the constraints of sparse light splitter configuration, the computing of light tree is not a Steiner Tree problem. In the route of light tree, the optical signal is transmitted from the source node to every destination node. The optical signals suffer losses as they travel from source to destination node. We distinguish two types of losses: signal attenuation and splitting loss. The loss of signal attenuation is due to the absorbing and dispersing when the optical signal travel along the light tree. When the optical signals pass by the MC-OXC, the power will be split several parts and then switched to according outputs, which introduces the splitting loss of the optical signal. In order to ensure every destination node receive the data, the power of received by each receiver must above a threshold. So the light tree must satisfy the constraints of power budge. The three constraints coexist for a light tree, so a feasible light tree must satisfy all the constraints.
The static programming of multicast optical network can be used for the layout design of network or the reconfiguration of virtual topology after a long period. Chapter 2 studies the static programming problem from two perspectives: (1) the placement of wavelength converters and light splitters in the sparse configuration networks; (2) with the limits of wavelength number per fiber, the network resource provisioning for given multicast traffic matrix. We formulate the two problems as a mixed integer linear programming (MILP) model. By this mean, the problem of static programming is transferred to an optimal problem. When we solve the MILP and achieve the optimal solutions, we can attain the placement of wavelength converters and light splitters. What's more, we can achieve the design of virtual topology of the networks. Especially, the constraints of power budge are multiplicative. Usually, we can not formulate a multiplicative constraint problem with linear equations precisely. In chapter 2, we use linear programming to solve optimal multicast routing and wavelength assignment with power budget constraints by using the relation of power conservation at every node on the light tree.
Chapter 3 studies the problem of dynamic multicast routing for given the configuration of network (including the placement of wavelength converters and light splitters, the wavelength number on each fiber link and the physical topology of network). With none constraints, the problem of optimal multicast tree is a Steiner Tree problem, which is NP hard. The problem of multicast tree with constraints is not less hard than that of the problem of Steiner Tree. So the multicast tree with constraints is NP hard. Under the environment of dynamic multicast traffic, we can only propose some heuristic algorithms to compute the multicast tree with constraints. In graph theory, a tree is a simple graph with no circles. With the constraints of the optical multicast, a feasible light tree may contain some circles. In chapter 3, we propose a heuristic algorithm (NMO) to compute the light tree with sparse light splitters configuration constraint according to the character of light tree. What's more, we propose an algorithm for compute the light tree with all the constraints at the rest of chapter 3.
WDM technology provides the tremendous bandwidth, while poses the survivability issue urgent. In WDM network, the failure of a network component can lead to tremendous loss than in other traditional networks. For example, a failed fiber link can lead to the failure of all the lightpaths that traverse the failed link, since each lightpath is expected to operate at a rate of several gigabytes per second, a failure can lead to a severe data loss. Chapter 4 and 5 study the protection of optical multicast in the mesh WDM networks. Chapter 4 mainly studies the scheme of dedicated multicast protection and chapter 5 focuses on the scheme of shared multicast protection. In chapter 4, we formulate the problem of dedicated multicast protection into a ILP model. Given a batch of multicast requests and the configuration of networks, we can achieve the virtual topology design by solving the ILP. Similar to the case of unicast, we can adopt the segment protection for the multicast request. The critical problem of segment multicast protection is how to identify the segments of a multicast tree. The scheme of segment will affect the performance of algorithm seriously. In chapter 4, adaptive segment shared protection (ASSP) algorithm is proposed. In the scheme of ASSP, we establish a light path to protect each segment between two leaf nodes on the multicast tree. With the constraints of sparse wavelength converters configuration, almost all the algorithms will be invalid. In chapter 4, we propose two paths multicast protection (TPMP) algorithm for sparse wavelength converters configuration constraints. In order to improve the network resource utilization efficiency, chapter 5 studies the scheme of shared multicast protection. The problem is formulated into an ILP model. We can solve the ILP model to achieve the virtual topology design. And then we propose mixed shared segment protection (MSSP) algorithm to protect multicast requests. The numerical results show that MSSP algorithm provides significant capacity savings.
In the WDM optical networks, it is mismatch for the enormous bandwidth of wavelength channel and that of single server. It is necessary to investigate how to efficiently set up connections for these traffic streams. Traffic grooming can meet this problem. Chapter 6 studies the technology of multicast traffic grooming in the WDM mesh networks. An algorithm of Multicast Tree Decompose (MTD) is proposed for dynamic multicast traffic grooming. The main idea of MTD is try to decrease the destination number of multicast request by grooming the traffic on the existing multicast trees. Then we study the problem of survivability multicast traffic grooming and propose two model, named multicast traffic grooming with mixed bandwidth protection (TG-MBP) and multicast traffic grooming with shared protection (TG-SP). In TG-MBP, a dedicated protected survivable multicast route (SMR) route can be partitioned into two "dual-trees". Under normal operation, the traffic can be transferred to any node on the SMR, which ensures that we can groom the traffic on the SMR for every node on the SMR. According to the model of TG-MBP, multicast traffic grooming with segment protection (MTG-SP) algorithm is proposed. In the model of TG-SP, the protection resource can be shared by different multicast requests. Under normal operation, the traffic can only be transferred to the node on the working tree. So the traffic can be groomed on the working tree for the node on the tree. Based on the model of MTG-SP, the algorithm of multicast traffic grooming with shared segment protection is proposed.
引文
[1]．Stern，T．E．，Bala，K．(徐荣，龚倩译)；多波长网络，人民邮电出版社；2001年4月；
[2]．杨淑雯 编著；全光光纤通信网；科学出版社；2004年1月；
[3]．王晟，李乐民；WDM网络及其对IP连接的支持；中国通信，19-24，1999(8)；
[4]．韦乐平；光网络的发展、演进和面临的挑战；中兴通讯技术，Vol．8，No．4，pp．1-5，2002；
[5]．韦乐平；向3T级骨干网络演进；世界电信网络，Vol．9，No．9，pp．45-47，2001；
[6]. C. R. R. Murthy, M.Gurusamy; WDM Optical Networks:Concepts, Design, and Algorithms:Prentice Hall PTR, 2002;
[7]. S. Paul;Multicasting on the Internet and Its Applications. Boston, MA: Kluwer Academic, 1998.
[8]. A. Ding and G. S. Poo; A survey of optical multicast over WDM networks; Comput. Commun., vol.26, no.2, pp.193-200, Feb. 2003.
[9]. L. H. Sahasrabuddhe and B. Mukherjee; Light-trees: optical multicasting for improved performance in wavelength-routed networks; IEEE Commun. Mag., vol.37, no.2, Feb. 1999, pp.67-73.
[10]. X. Zhang, J.Wei, and C. Qiao; On fundamental issues in IP over WDM multicasting; in Proc. Int. Conf. Comput. Commun. Netw., Boston, MA, 1999, pp.84-90.
[11]．徐荣，龚倩；高速宽带光互联网技术；1 ed：人民邮电出版社，2002；
[12]. D. Cavendish; Evolution of optical transport technologies: from SONET/SDH to WDM; Communications Magazine, IEEE, vol.38, no.6, pp.164-172, 2000;
[13]．张杰、徐云斌等．自动交换光网络ASON．人民邮电出版社，2002：51-299
[14]. Opitmization of point-to-point transmission and investigation of optical time-domain multiplexed (OTDM) routing for all-optical networks at single channel data rates of 160Gb/s and highter. FASHIN: Ultrafast Switching in High-Speed OTDM Networks. 2003
[15]. Taskin, C.; Evirgen, H.; Ekiz, H.; Cakir, A.Y.; Evolution of the Current Telecommunications Networks and the Next Generation Optical Networks; Internet Surveillance and Protection, 2006. ICISP'06. 26-28 Aug. 2006 Page(s):12-12
[16]. Gladisch, A.; Braun, R.-P.; Breuer, D.; Ehrhardt, A.; Foisel, H.-M.; Jaeger, M.; Leppla, R.; Sctmeiders, M.; Vorbeck, S.; Weiershausen, W.; Westphal, F.-J.; Evolution of terrestrial optical system and core network architecture; Proceedings of the IEEE Volume 94, Issue 5, May 2006 Page(s):869-891
[17]. ITU-T G.872. Architecture of Optical Transport Networks
[18]. ITU-T G.807/Y.1302. Requirements for the Automatic Switched Transport Network (ASTN)
[19]. ITU-T G.805. Generic Functional Architecture of Transport Networks
[20]. ITU-T G.8080/Y.1304. Architecture for the Automatic Switched Optical Network(ASON)
[21]. ITU-T G.7713.1/Y.1704.1. Distributed Call and Connection Management (DCM) based on PNNI
[22]. ITU-T G.7713.2/Y.1704.2. DCM Signalling Mechanism Using GMPLS RSVP-TE
[23]. ITU-T G7713.3/Y.1704.3. Distributed call and connection management signalling using GMPLS CR-LDP
[24]. ITU-T G.7714/Y.1705. Generalized Automatic Discovery Techniques
[25]. ITU-T G.7715/Y.1706. Architecture and Requirements for Routing in the Automatically Switched Optical Network
[26]. K. Sohraby, M. T. Fatehi. Digital container: a mechanism for heterogeneous traffic transport over an all optical network. Optical Networks Magazine, 45-57, 2001
[27]. D. K. Hunter, 1. Andonovic. Approaches to optical Internet packet switching. IEEE Communications Magazine, 115-122, Sep 2000.
[28]. http://ocpn.ece.ucsb.edu
[29]. http://www.ist-lasagne.org
[30]. S. Yao, B. Mukherjee, S. Dixit. Advances in Photonic Packet Switching: An Overview. IEEE Communications Magazine, 38(2), 84-94, Feb 2000.
[31]. D. K. Hunter, I. Andonovic. Approaches to optical Internet packet switching. IEEE Communications Magazine, 116-122, Sep 2000.
[32]. P. B. Hansen, S. L. Danielsen, K. E. Stubkjaer. Optical packet switching without packet alignment. In Proceedings of ECOC, Sep 1998.
[33]. P. O'Reilly. Burst and fast packet switching: performance comparisons. Computer Networks and ISDN Systems, 13(1), 21-32,1987.
[34]. S. R. Amstutz. Burst switching - an update. IEEE Communications Magazine, 27(9), 50-57, Sep 1989.
[35]. C. Qiao, M. Yoo. Optical burst switching (OBS)- a new paradigm for an optical Internet. Journal of High Speed Networks, vol. 8(1), pp.69-84, Jan 1999.
[36]. J. S. Turner, Terabit burst switching, Journal of High Speed Networks, 8(1), 3-16, Jan 1999.
[37]. W. S. Hu and Q. J. Zeng, "Multicasting optical cross connects employing splitter-and-delivery switch," IEEE Photonics Technology Letters, vol. 10, pp. 970 - 972,1998.
[38]. B. M. Ali and J. S. Deogun, "Power-efficient Design of Multicast Wavelength-Routed Networks," IEEE Journal on Selected Areas in Communications, vol. 18, pp. 1852-62, 2000.
[39]. A. Ding and G-S. Poo, "A survey of optical multicast over WDM networks," Computer Communications, vol. 26, pp. 193-200, 2003.
[40]. D. Thaker and G. N. Rouskas, "Multi-destination communication in broadcast WDM networks: a survey," in Optical Networks Magazine, vol. 3, 2002, pp. 34-44.
[41]. H.-C. Lin, C.-H. Wang, A hybrid multicast algorithm for single-hop WDM networks, Proceedings of the IEEE INFOCOM 20011 (2001).
[42]. E. Modiano, Random algorithms for scheduling multicast traffic in WDM broadcast-and-select networks, IEEE/ACM Transactions on Networking 7 (3) (1999) June.
[43]. Z.O. Ortiz, G.N. Rouskas, H.G Perros, Scheduling of multicast traffic in tunable-receiver WDM networks with non-negligible tuning latencies, Proceedings of the ACM SIGCOMM '97 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (1997).
[44]. B. Mukherjee, WDM-based local lightwave networks, Part I: singlehop systems, IEEE Network May (1992).
[45]. W.-Y. Tseng, S.-Y. Kuo, Hybrid scheduling for unicast and multicast traffic in broadcast WDM networks, IEICE Transactions on Communications E83-B (10) (2000) Oct.
[46]. GN. Rouskas, M.H. Ammar, Multidestination communication over tunable-receiver single-hop WDM networks, IEEE Journal on Selected Areas in Communications 15 (3) (1997) April.
[47]. G N. Rouskas, "Optical layer multicast: rationale, building blocks, and challenges," IEEE Network, vol. 17, pp. 60 - 65, 2003.
[48]. X.-H. Jia, D.-Z. Du, X.-D. Hu, M.-K. Lee, and J. Gu, "Optimization of wavelength assignment for QoS multicast in WDM networks," IEEE Transactions on Communications, vol. 49, pp. 341 - 350, 2001.
[49]. G Sahin and M. Azizoglu, "Multicast routing and wavelength assignment in wide-area networks," Proc. SPEE, vol. 3531, pp. 196-208,1998.
[50]. S. Ramesh, G N. Rouskas, and H. G Perros, "Computing call blocking probabilities in multi-class wavelength routing networks with multicast traffic," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 89-96, 2002.
[51]. A. E. Kamal and A. K. Al-Yatama, "Blocking probabilities in circuit-switched wavelength division multiplexing networks under multicast service," Performance Evaluation, vol. 47, pp. 43-71, 2002.
[52]. R. Libeskind-Hadas and R. Melhem, "Multicast routing and wavelength assignment in multihop optical networks," IEEE/ACM Transactions on Networking, vol. 10, pp. 621 - 629, 2002.
[53]. X. Zhang, J. Y. Wei, and C. Qiao, "Constrained multicast routing in WDM networks with sparse light splitting," Journal of Lightwave Technology, vol. 18, pp. 1917 -1927, 2000.
[54]. W.-Y. Tseng and S.-Y. Kuo, "All-optical multicasting on wavelength-routed WDM networks with partial replication," presented at Proceedings of 15th International Conference on Information Networking, 2001., 2001.
[55]. S. Yan, J. S. Deogun, and M. Ali, "Routing in sparse splitting optical networks with multicast traffic," Computer Networks, vol. 41, pp. 89-113, 2003.
[56]. A. Zsigri, A. Guitton, and M. Molnar, "Construction of light-trees for WDM multicasting under splitting capability constraints," presented at 10th International Conference on Telecommunications, 2003. ICT 2003,2003.
[57]. G N. Rouskas, "Light-Tree routing under optical layer power budget constraints," presented at 17th IEEE Computer Communications Workshop, 2002.
[58]. K.-D. Wu, J.-C. Wu, and C.-S. Yang, "Multicast routing with power consideration in sparse splitting WDM networks," presented at IEEE ICC, 2001.
[59]. N. K. Singhal and B. Mukherjee, "Protecting multicast sessions in WDM optical mesh networks," Journal of Lightwave Technology, vol. 21, pp. 884 - 892, 2003.
[60]. Y. Liu, D. Tipper, and P. Siripongwutikorn. "Approximating optimal spare capacity allocation by successive survivable routing". in Proc.IEEE INFOCOM, Apr. 2001, pp. 699-708.
[61]. K. P. Gummadi, M. J. Pradeep, C. S. R. Murthy. "An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks". IEEE/ACM Trans. Networking, vol. 11, pp.81-94, Feb. 2003.
[62]. C. Ou, H. Zang, and B. Mukherjee. "Sub-path protection for scalability and fast recovery in WDM mesh networks", in Proc. Optical Fiber Communications Conf. (OFC 2002), Mar. 2002, Th06.
[63]. Pin-Han Ho; Mouftah, H.T. "A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion". Selected Areas in Communications, IEEE Journal on Volume 22, Issue 8, Oct. 2004 Page(s):1548-1560
[64]. P.-H. Ho and H. T. Mouftah. A framework for service-guaranteed shared protection in WDM mesh networks. IEEE Commun. Mag., pp. 97-103, Feb. 2002.
[65]. C. V. Saradhi and M. Siva. "Dynamic establishment of segmented protection paths in single and multifiber WDM mesh networks", in Opticomm 2002, Aug. 2002, pp. 211-222
[66]. R. Dutta and G N. Rouskas, "A survey of virtual topology design algorithms for wavelength routed optical networks," in Optical Networks Magazine, vol. 1, 2000, pp. 73-89.
[67]. E. Modiano, "Traffic grooming in WDM networks," in IEEE Communications Magazine, vol. 39, 2001, pp. 124-129.
[68]. N. K. Singhal and B. Mukherjee, "Architectures and Algorithms for Multicasting in Optical WDM Mesh Networks using Opaque and Transparent Optical Cross-connects," presented at IEEE OFC'01, Anaheim, CA, 2001.
[69]. Rahman, T; Ellinas, G.;" Protection of multicast sessions in WDM mesh optical networks"; Optical Fiber Communication Conference, 2005. Technical Digest. OFC/NFOEC Volume 2, 6-11 March 2005 Page(s):3 pp. Vol. 2
[70]. N.K. Singhal, Canhui Ou and Biswanath Mukherjee; Cross-sharing vs. self-sharing trees for protection multicast sessions in mesh networks; Computer Networks, Volume 50, Issue 2, 8 February 2006, Pages 200-206
[71]. Singhal, N.K.; Canhai Ou; Mukherjee, B.;" Shared protection for multicast sessions in mesh networks"; Optical Fiber Communication Conference, 2005. Technical Digest. OFC/NFOEC Volume 2, 6-11 March 2005 Page(s):3 pp. Vol. 2
[72]. Hongbin Luo, Hongfang Yu,Lemin li,Sheng Wang;On protection dynamic multicast sessions in survivable mesh WDM networks;Optical Fiber
Communication Conference, 2006 and the 2006 National Fiber Optic Engineers Conference 5-10 March 2006 Page(s):3 pp.
[73]. T. Cinkler. Traffic and λ Grooming. Network, IEEE, vol. 17, no. 2, pp. 16-21, 2003
[74]. R.S.Barr, R.A.Patterson. Grooming Telecommunication Networks. Optical Networks Magazine,vol. 2, no. 3, pp. 20-23, 2001.
[75]. K. Zhu, B. Mukherjee. A review of traffic grooming in WDM optical networks: Architecturesand challenges. Optical Networks Magazine, vol. 4, no. 2, pp. 55-64, 2003.
[76]. Special Issue: Telecommunications Grooming. Optical Networks Magazine, vol. 2, no. 3, 2001.
[77]. R. Dutta, G. N. Rouskas. Traffic grooming in WDM networks: past and future. Network, IEEE,vol. 16, no. 6, pp. 46-56, 2002.
[78]. J. Q. Hu, B. Leida. Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks, presented at Sixth INFORMS Telecommunications Conference, Boca Raton, Florida, USA, 2002.
[79]. G Huiban, S. Perennes, M. Syska. Traffic grooming in WDM networks with multi-layer switches, presented at Communications,' 2002. ICC 2002. IEEE International Conference on, 2002.
[80]. E. Modiano. Traffic grooming in WDM networks. Communications Magazine, IEEE, vol. 39, no. 7, pp. 124-129, 2001.
[81]. R. Srinivasan, A. K. Somani. Analysis of multi-rate traffic in WDM grooming networks, presented at Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on, 2002.
[82]. R. Lingampalli, P. Vengalam. Effect of wavelength and waveband grooming on all-optical networks with single layer photonic switching, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002, 2002.
[83]. K. Zhu, B. Mukherjee. Traffic grooming in an optical WDM mesh network. Selected Areas in Communications, IEEE Journal on, vol. 20, no. 1, pp. 122-133, 2002.
[84]. R. Dutta, G N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, vol. 1, no. 1, pp. 73-89, 2000.
[85]. A. L. Chiu, E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Lightwave Technology, Journal of, vol. 18, no. 1, pp. 2-12, 2000.
[86]. V. R. C. Konda, T.Y. Algorithm for traffic grooming in optical networks to minimize the number of transceivers, presented at High Performance Switching and Routing, 2001 IEEE Workshop on, 2001.
[87]. M. Brunato, R. Battiti. A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies, presented at The Sixth Working Conference on Optical Network Design and Modelling, Torino, Italy, Feb. 2002.
[88]. Zhu, H. Zang, K. Zhu, et al. A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. Networking, IEEE/ACM Transactions on, vol. 11, no. 2, pp. 285-299, 2003.
[89]. R. Srinivasan, A. K. Somani. Dynamic routing in WDM grooming networks. Photonic Network Communications, vol. 5, no. 2, pp. 123-135,2003.
[90]. S. Thiagarajan, A. K.Somani. Capacity Fairness of WDM Networks with Grooming Capabilities. Optical Networks Magazine, vol. 2, no. 3, pp. 24-32, 2001.
[91]. R. Srinivasan, A. K. Somani. A generalized framework for analyzing time-space switched optical networks. Selected Areas in Communications, IEEE Journal on, vol. 20, no. 1, pp.202-215, 2002.
[92]. K. Zhu, B. Mukherjee. On-line approaches for provisioning connections of different bandwidthgranularities in WDM mesh networks, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002, 2002.
[93]. J. Louis Anthony Cox, J. R. Sanchez. Cost Savings from Optimized Packing and Grooming of Optical Circuits: Mesh Versus Ring Comparisons. Optical Networks Magazine, vol. 2, no. 3, pp. 72-90,2001.
[94]. A. Lardies, R. Gupta, R. A. Patterson. Traffic Grooming in a Multilayer Network. Optical Networks Magazine, vol. 2, no. 3, pp. 91-99, 2001.
[95]. K. Zhu, H. Zhu, B. Mukherjee. Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming. Network, IEEE, vol. 17, no. 2, pp.8-15, 2003.
[96]. H. Zhu, K. Zhu, H. Zang, et al. Cost-effective WDM backbone network design with OXCs of different bandwidth granularities. Selected Areas in Communications, IEEE Journal on, vol. 21, no. 9, pp. 1452-1466, 2003.
[97]. S. Thiagarajan, A. K. Somani. Traffic Grooming for Survivable WDM Mesh Networks. OpticalNetworks Magazine, vol. 3, no. 3, pp. 88-98, 2002.
[98]. C. Ou, K. Zhu, H. Zang, et al. Traffic grooming for survivable WDM networks-shared protection. Selected Areas in Communications, IEEE Journal on, vol. 21, no. 9, pp. 1367-1383, 2003.
[99]. L. H. Sahasrabuddhe and B. Mukherjee, "Light-trees: Optical multicasting for improved performance in wavelength-routed networks," IEEE Comm. Magazine, 37(2): 67-73, February 1999.
[100]. A. Khalil, C. Assi, A. Hadjantonis, G Ellinas, M. Ali, "On Dynamic Multicast Traffic Grooming In WDM Networks," The Ninth IEEE Symposium On Computers And Communications (ISCC 2004), Alexandria, June-July 2004.
[101]. Khalil, A.; Hadjiantonis, A.; Ellinas, G; Ali, M.;Sequential and hybrid grooming approaches for multicast traffic in WDM networks Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE Volume 3, 29 Nov.-3 Dec. 2004 Page(s):1808 -1812 Vol.3
[102]. H.Madhyastha, N. Srinivas, G Chowdhary, and C. Murthy, "Grooming of multicast sessions in WDM ring networks," in Proc. Optical Networking and Communications (OptiComm), Dallas, TX, Oct. 2003, pp. 1-12.
[103]. A. Billah, B. Wang, and A. Awwal, "Multicast traffic grooming in WDMoptical mesh networks," in IEEE Global Telecommunications Conf.(GLOBECOM), San Francisco, CA, Dec. 2003, pp. 2755-2760.
[104]. A. Kamal and R. Ul-Mustafa, "Multicast traffic grooming in WDM networks," in Proc. Optical Networking and Communications (Opti-Comm), Dallas, TX, Oct. 2003, pp. 25-36.
[105]. D. Yang, and W. Liao, "Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks," Proc. IEEE INFOCOM, 2002, vol.1, pp. 32-41.
[106]. S. Subramaniam, M. Azizoglu, A. K. Somani. All-optical networks with sparse wavelength conversion. IEEE Transaction on Networking, 1996,4(4):544-557
[107]. S. Subramaniam, M. Azizoglu, A. K. Somani. On the optimal placement of wavelength converters in wavelength routed networks. Proceedings of IEEE INFOCOM'98, 98:902-909
[108]. J. Strand, R. Doverspike, G. Li. Importance Of Wavelength Conversion In An Optical Network. Optical Networks Magazine, 2000, 2(3):33-44
[109]. S.L. Hakimi, "Steiner's problem in graphs and its implications," Networks, vol.1, no.2, pp.113-133, 1971.
[110]．张雷．波长变换WDM网络中路由与波长分配算法的研究及网络性能分析：博士论文．成都：电子科技大学，2002年
[111]. M. Ali, "Optimization of splitting node placement in wavelength routed optical networks," J. Select. Areas Commun., vol.20, no.8, pp.1571-1579, Oct. 2002.
[112]. Yuan Cao; Oliver Yu;" Optimal placement of light splitters and wavelength converters for multicast in WDM networks"; Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on Volume 1, 27-30 May 2005 Page(s):585-589 Vol. 1
[113]. Yufeng Xin, George N. Rouskas. Multicast Routing Under Optical Layer Constraints. Hong Kong, 2004, Proceedings of IEEE Infocom 2004, March 7-11,
[114]. A. N. Washington, H. G. Perros, R. Dutta. A Survey of Optical Network Survivability, NCSU CSC, Technical Report TR-2002-08, 2002
[115]. A.J. Vernon, J. D. Portier. Protection of Optical Channels in All-Optical Networks. 18th Annual National Fiber Optic Engineers Conference (NFOEC 2002), Dallas, 2002:1695-1706
[116]. Singhal, N.K.; Sahasrabuddhe, L.H.; Mukherjee, B.;" Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks"; Lightwave Technology, Journal of Volume 21, Issue 11, Nov. 2003 Page(s):2587-2594
[117]. Medard, M.; Finn, S.G.; Barry, R.A.; Gallager, R.G.;" Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs"; Networking, IEEE/ACM Transactions on Volume 7, Issue 5, Oct. 1999 Page(s): 641-652
[118]. Aiguo Fei; Junhong Cui; Gerla, M.; Cavendish, D.;" A dual-tree scheme for fault-tolerant multicast"; Communications, 2001. ICC 2001. IEEE International Conference on Volume 3, 11-14 June 2001 Page(s):690-694 vol.3
[119]. S. Ramamurthy, B. Mukherjee. Survivable WDM mesh networks. Part I-Protection. IEEE INFOCOM'99, 1999
[120]. Bharat T.Doshi and Subrahmanyam Dravida. Optical Network Design and Restoration. Bell Labs Technical Journal, 1999, 4(1):
[121]. Shengli Yuan and Jason P. Jue. Shared Protection Routing Algorithm for Optical Networks. Optical Networks Magazine, 2002, 3(3): 20-27
[122]. Hui Zang, Canhni Ou, and Biswanath Mukherjee. Path-Protection Routing and Wavelength Assignment in WDM Mesh Networks under Shared-Risk-Group Constraints. APOC 2001, 2001:49-59
[123]．熊光楞，肖田元，张燕云．连续系统仿真与离散事件系统仿真：清华大学出版社，1991
[124]．顾启泰．应用仿真技术：国防工业出版社，1995
[125]. Debasis Mitra, Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Comouter Networks. Elsevier Inc.. 2004
[126]．鲁才，李乐民，王晟；多约束条件下WDM光网中多播选路和波长分配算法；《电子与信息学报》，v28，n9，September，2006，p1684-1688
[127]．鲁才，李乐民，王晟；稀疏分光器配置约束下的多播选路算法；《电子科技大学学报》，v34，p963-967
[128]. Cai lu, Lemin Li, Sheng Wang; A Novel Shared Segment Protection Algorithm for Multicast Session in Mesh WDM Networks; ETRI, Vol.28, pp 329-336
[129]. Cai lu, Lemin Li, Sheng Wang, Xiaoyan; Nie; Adaptive segment protection algorithm of multicast on WDM networks against single link failure; Proc. of SPIE APOC2005, v6022I, p60222C
[130]. Cai lu, Lemin Li, Sheng Wang, Xiaoyan Nie; Efficient dynamic multicast traffic grooming algorithm on WDM networks; Proc. of SPIE APOC2005, v6022 Ⅱ，p602230
[131]. Cai lu, Lemin Li, Sheng Wang; Dynamic Multicast Traffic Grooming for Survivable WDM Mesh Networks; Journal of Optical Networking
[132]. Cai lu, Lemin Li, Sheng Wang; Multicast Routing under Optical Layer Constraints; Journal of Lightwave Technology
[133]. Cai lu, Lemin Li, Sheng Wang; Multicasting with Mixed-Sharing Protection in WDM Optical Networks; Journal of Optical Networking
[134]．鲁才，李乐民；稀疏配置下的多播保护选路算法；专利申请中
[2]．杨淑雯 编著；全光光纤通信网；科学出版社；2004年1月；
[3]．王晟，李乐民；WDM网络及其对IP连接的支持；中国通信，19-24，1999(8)；
[4]．韦乐平；光网络的发展、演进和面临的挑战；中兴通讯技术，Vol．8，No．4，pp．1-5，2002；
[5]．韦乐平；向3T级骨干网络演进；世界电信网络，Vol．9，No．9，pp．45-47，2001；
[6]. C. R. R. Murthy, M.Gurusamy; WDM Optical Networks:Concepts, Design, and Algorithms:Prentice Hall PTR, 2002;
[7]. S. Paul;Multicasting on the Internet and Its Applications. Boston, MA: Kluwer Academic, 1998.
[8]. A. Ding and G. S. Poo; A survey of optical multicast over WDM networks; Comput. Commun., vol.26, no.2, pp.193-200, Feb. 2003.
[9]. L. H. Sahasrabuddhe and B. Mukherjee; Light-trees: optical multicasting for improved performance in wavelength-routed networks; IEEE Commun. Mag., vol.37, no.2, Feb. 1999, pp.67-73.
[10]. X. Zhang, J.Wei, and C. Qiao; On fundamental issues in IP over WDM multicasting; in Proc. Int. Conf. Comput. Commun. Netw., Boston, MA, 1999, pp.84-90.
[11]．徐荣，龚倩；高速宽带光互联网技术；1 ed：人民邮电出版社，2002；
[12]. D. Cavendish; Evolution of optical transport technologies: from SONET/SDH to WDM; Communications Magazine, IEEE, vol.38, no.6, pp.164-172, 2000;
[13]．张杰、徐云斌等．自动交换光网络ASON．人民邮电出版社，2002：51-299
[14]. Opitmization of point-to-point transmission and investigation of optical time-domain multiplexed (OTDM) routing for all-optical networks at single channel data rates of 160Gb/s and highter. FASHIN: Ultrafast Switching in High-Speed OTDM Networks. 2003
[15]. Taskin, C.; Evirgen, H.; Ekiz, H.; Cakir, A.Y.; Evolution of the Current Telecommunications Networks and the Next Generation Optical Networks; Internet Surveillance and Protection, 2006. ICISP'06. 26-28 Aug. 2006 Page(s):12-12
[16]. Gladisch, A.; Braun, R.-P.; Breuer, D.; Ehrhardt, A.; Foisel, H.-M.; Jaeger, M.; Leppla, R.; Sctmeiders, M.; Vorbeck, S.; Weiershausen, W.; Westphal, F.-J.; Evolution of terrestrial optical system and core network architecture; Proceedings of the IEEE Volume 94, Issue 5, May 2006 Page(s):869-891
[17]. ITU-T G.872. Architecture of Optical Transport Networks
[18]. ITU-T G.807/Y.1302. Requirements for the Automatic Switched Transport Network (ASTN)
[19]. ITU-T G.805. Generic Functional Architecture of Transport Networks
[20]. ITU-T G.8080/Y.1304. Architecture for the Automatic Switched Optical Network(ASON)
[21]. ITU-T G.7713.1/Y.1704.1. Distributed Call and Connection Management (DCM) based on PNNI
[22]. ITU-T G.7713.2/Y.1704.2. DCM Signalling Mechanism Using GMPLS RSVP-TE
[23]. ITU-T G7713.3/Y.1704.3. Distributed call and connection management signalling using GMPLS CR-LDP
[24]. ITU-T G.7714/Y.1705. Generalized Automatic Discovery Techniques
[25]. ITU-T G.7715/Y.1706. Architecture and Requirements for Routing in the Automatically Switched Optical Network
[26]. K. Sohraby, M. T. Fatehi. Digital container: a mechanism for heterogeneous traffic transport over an all optical network. Optical Networks Magazine, 45-57, 2001
[27]. D. K. Hunter, 1. Andonovic. Approaches to optical Internet packet switching. IEEE Communications Magazine, 115-122, Sep 2000.
[28]. http://ocpn.ece.ucsb.edu
[29]. http://www.ist-lasagne.org
[30]. S. Yao, B. Mukherjee, S. Dixit. Advances in Photonic Packet Switching: An Overview. IEEE Communications Magazine, 38(2), 84-94, Feb 2000.
[31]. D. K. Hunter, I. Andonovic. Approaches to optical Internet packet switching. IEEE Communications Magazine, 116-122, Sep 2000.
[32]. P. B. Hansen, S. L. Danielsen, K. E. Stubkjaer. Optical packet switching without packet alignment. In Proceedings of ECOC, Sep 1998.
[33]. P. O'Reilly. Burst and fast packet switching: performance comparisons. Computer Networks and ISDN Systems, 13(1), 21-32,1987.
[34]. S. R. Amstutz. Burst switching - an update. IEEE Communications Magazine, 27(9), 50-57, Sep 1989.
[35]. C. Qiao, M. Yoo. Optical burst switching (OBS)- a new paradigm for an optical Internet. Journal of High Speed Networks, vol. 8(1), pp.69-84, Jan 1999.
[36]. J. S. Turner, Terabit burst switching, Journal of High Speed Networks, 8(1), 3-16, Jan 1999.
[37]. W. S. Hu and Q. J. Zeng, "Multicasting optical cross connects employing splitter-and-delivery switch," IEEE Photonics Technology Letters, vol. 10, pp. 970 - 972,1998.
[38]. B. M. Ali and J. S. Deogun, "Power-efficient Design of Multicast Wavelength-Routed Networks," IEEE Journal on Selected Areas in Communications, vol. 18, pp. 1852-62, 2000.
[39]. A. Ding and G-S. Poo, "A survey of optical multicast over WDM networks," Computer Communications, vol. 26, pp. 193-200, 2003.
[40]. D. Thaker and G. N. Rouskas, "Multi-destination communication in broadcast WDM networks: a survey," in Optical Networks Magazine, vol. 3, 2002, pp. 34-44.
[41]. H.-C. Lin, C.-H. Wang, A hybrid multicast algorithm for single-hop WDM networks, Proceedings of the IEEE INFOCOM 20011 (2001).
[42]. E. Modiano, Random algorithms for scheduling multicast traffic in WDM broadcast-and-select networks, IEEE/ACM Transactions on Networking 7 (3) (1999) June.
[43]. Z.O. Ortiz, G.N. Rouskas, H.G Perros, Scheduling of multicast traffic in tunable-receiver WDM networks with non-negligible tuning latencies, Proceedings of the ACM SIGCOMM '97 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (1997).
[44]. B. Mukherjee, WDM-based local lightwave networks, Part I: singlehop systems, IEEE Network May (1992).
[45]. W.-Y. Tseng, S.-Y. Kuo, Hybrid scheduling for unicast and multicast traffic in broadcast WDM networks, IEICE Transactions on Communications E83-B (10) (2000) Oct.
[46]. GN. Rouskas, M.H. Ammar, Multidestination communication over tunable-receiver single-hop WDM networks, IEEE Journal on Selected Areas in Communications 15 (3) (1997) April.
[47]. G N. Rouskas, "Optical layer multicast: rationale, building blocks, and challenges," IEEE Network, vol. 17, pp. 60 - 65, 2003.
[48]. X.-H. Jia, D.-Z. Du, X.-D. Hu, M.-K. Lee, and J. Gu, "Optimization of wavelength assignment for QoS multicast in WDM networks," IEEE Transactions on Communications, vol. 49, pp. 341 - 350, 2001.
[49]. G Sahin and M. Azizoglu, "Multicast routing and wavelength assignment in wide-area networks," Proc. SPEE, vol. 3531, pp. 196-208,1998.
[50]. S. Ramesh, G N. Rouskas, and H. G Perros, "Computing call blocking probabilities in multi-class wavelength routing networks with multicast traffic," IEEE Journal on Selected Areas in Communications, vol. 20, pp. 89-96, 2002.
[51]. A. E. Kamal and A. K. Al-Yatama, "Blocking probabilities in circuit-switched wavelength division multiplexing networks under multicast service," Performance Evaluation, vol. 47, pp. 43-71, 2002.
[52]. R. Libeskind-Hadas and R. Melhem, "Multicast routing and wavelength assignment in multihop optical networks," IEEE/ACM Transactions on Networking, vol. 10, pp. 621 - 629, 2002.
[53]. X. Zhang, J. Y. Wei, and C. Qiao, "Constrained multicast routing in WDM networks with sparse light splitting," Journal of Lightwave Technology, vol. 18, pp. 1917 -1927, 2000.
[54]. W.-Y. Tseng and S.-Y. Kuo, "All-optical multicasting on wavelength-routed WDM networks with partial replication," presented at Proceedings of 15th International Conference on Information Networking, 2001., 2001.
[55]. S. Yan, J. S. Deogun, and M. Ali, "Routing in sparse splitting optical networks with multicast traffic," Computer Networks, vol. 41, pp. 89-113, 2003.
[56]. A. Zsigri, A. Guitton, and M. Molnar, "Construction of light-trees for WDM multicasting under splitting capability constraints," presented at 10th International Conference on Telecommunications, 2003. ICT 2003,2003.
[57]. G N. Rouskas, "Light-Tree routing under optical layer power budget constraints," presented at 17th IEEE Computer Communications Workshop, 2002.
[58]. K.-D. Wu, J.-C. Wu, and C.-S. Yang, "Multicast routing with power consideration in sparse splitting WDM networks," presented at IEEE ICC, 2001.
[59]. N. K. Singhal and B. Mukherjee, "Protecting multicast sessions in WDM optical mesh networks," Journal of Lightwave Technology, vol. 21, pp. 884 - 892, 2003.
[60]. Y. Liu, D. Tipper, and P. Siripongwutikorn. "Approximating optimal spare capacity allocation by successive survivable routing". in Proc.IEEE INFOCOM, Apr. 2001, pp. 699-708.
[61]. K. P. Gummadi, M. J. Pradeep, C. S. R. Murthy. "An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks". IEEE/ACM Trans. Networking, vol. 11, pp.81-94, Feb. 2003.
[62]. C. Ou, H. Zang, and B. Mukherjee. "Sub-path protection for scalability and fast recovery in WDM mesh networks", in Proc. Optical Fiber Communications Conf. (OFC 2002), Mar. 2002, Th06.
[63]. Pin-Han Ho; Mouftah, H.T. "A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion". Selected Areas in Communications, IEEE Journal on Volume 22, Issue 8, Oct. 2004 Page(s):1548-1560
[64]. P.-H. Ho and H. T. Mouftah. A framework for service-guaranteed shared protection in WDM mesh networks. IEEE Commun. Mag., pp. 97-103, Feb. 2002.
[65]. C. V. Saradhi and M. Siva. "Dynamic establishment of segmented protection paths in single and multifiber WDM mesh networks", in Opticomm 2002, Aug. 2002, pp. 211-222
[66]. R. Dutta and G N. Rouskas, "A survey of virtual topology design algorithms for wavelength routed optical networks," in Optical Networks Magazine, vol. 1, 2000, pp. 73-89.
[67]. E. Modiano, "Traffic grooming in WDM networks," in IEEE Communications Magazine, vol. 39, 2001, pp. 124-129.
[68]. N. K. Singhal and B. Mukherjee, "Architectures and Algorithms for Multicasting in Optical WDM Mesh Networks using Opaque and Transparent Optical Cross-connects," presented at IEEE OFC'01, Anaheim, CA, 2001.
[69]. Rahman, T; Ellinas, G.;" Protection of multicast sessions in WDM mesh optical networks"; Optical Fiber Communication Conference, 2005. Technical Digest. OFC/NFOEC Volume 2, 6-11 March 2005 Page(s):3 pp. Vol. 2
[70]. N.K. Singhal, Canhui Ou and Biswanath Mukherjee; Cross-sharing vs. self-sharing trees for protection multicast sessions in mesh networks; Computer Networks, Volume 50, Issue 2, 8 February 2006, Pages 200-206
[71]. Singhal, N.K.; Canhai Ou; Mukherjee, B.;" Shared protection for multicast sessions in mesh networks"; Optical Fiber Communication Conference, 2005. Technical Digest. OFC/NFOEC Volume 2, 6-11 March 2005 Page(s):3 pp. Vol. 2
[72]. Hongbin Luo, Hongfang Yu,Lemin li,Sheng Wang;On protection dynamic multicast sessions in survivable mesh WDM networks;Optical Fiber
Communication Conference, 2006 and the 2006 National Fiber Optic Engineers Conference 5-10 March 2006 Page(s):3 pp.
[73]. T. Cinkler. Traffic and λ Grooming. Network, IEEE, vol. 17, no. 2, pp. 16-21, 2003
[74]. R.S.Barr, R.A.Patterson. Grooming Telecommunication Networks. Optical Networks Magazine,vol. 2, no. 3, pp. 20-23, 2001.
[75]. K. Zhu, B. Mukherjee. A review of traffic grooming in WDM optical networks: Architecturesand challenges. Optical Networks Magazine, vol. 4, no. 2, pp. 55-64, 2003.
[76]. Special Issue: Telecommunications Grooming. Optical Networks Magazine, vol. 2, no. 3, 2001.
[77]. R. Dutta, G. N. Rouskas. Traffic grooming in WDM networks: past and future. Network, IEEE,vol. 16, no. 6, pp. 46-56, 2002.
[78]. J. Q. Hu, B. Leida. Traffic Grooming, Routing, and Wavelength Assignment in Optical WDM Mesh Networks, presented at Sixth INFORMS Telecommunications Conference, Boca Raton, Florida, USA, 2002.
[79]. G Huiban, S. Perennes, M. Syska. Traffic grooming in WDM networks with multi-layer switches, presented at Communications,' 2002. ICC 2002. IEEE International Conference on, 2002.
[80]. E. Modiano. Traffic grooming in WDM networks. Communications Magazine, IEEE, vol. 39, no. 7, pp. 124-129, 2001.
[81]. R. Srinivasan, A. K. Somani. Analysis of multi-rate traffic in WDM grooming networks, presented at Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on, 2002.
[82]. R. Lingampalli, P. Vengalam. Effect of wavelength and waveband grooming on all-optical networks with single layer photonic switching, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002, 2002.
[83]. K. Zhu, B. Mukherjee. Traffic grooming in an optical WDM mesh network. Selected Areas in Communications, IEEE Journal on, vol. 20, no. 1, pp. 122-133, 2002.
[84]. R. Dutta, G N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks Magazine, vol. 1, no. 1, pp. 73-89, 2000.
[85]. A. L. Chiu, E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Lightwave Technology, Journal of, vol. 18, no. 1, pp. 2-12, 2000.
[86]. V. R. C. Konda, T.Y. Algorithm for traffic grooming in optical networks to minimize the number of transceivers, presented at High Performance Switching and Routing, 2001 IEEE Workshop on, 2001.
[87]. M. Brunato, R. Battiti. A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies, presented at The Sixth Working Conference on Optical Network Design and Modelling, Torino, Italy, Feb. 2002.
[88]. Zhu, H. Zang, K. Zhu, et al. A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. Networking, IEEE/ACM Transactions on, vol. 11, no. 2, pp. 285-299, 2003.
[89]. R. Srinivasan, A. K. Somani. Dynamic routing in WDM grooming networks. Photonic Network Communications, vol. 5, no. 2, pp. 123-135,2003.
[90]. S. Thiagarajan, A. K.Somani. Capacity Fairness of WDM Networks with Grooming Capabilities. Optical Networks Magazine, vol. 2, no. 3, pp. 24-32, 2001.
[91]. R. Srinivasan, A. K. Somani. A generalized framework for analyzing time-space switched optical networks. Selected Areas in Communications, IEEE Journal on, vol. 20, no. 1, pp.202-215, 2002.
[92]. K. Zhu, B. Mukherjee. On-line approaches for provisioning connections of different bandwidthgranularities in WDM mesh networks, presented at Optical Fiber Communication Conference and Exhibit, 2002. OFC 2002, 2002.
[93]. J. Louis Anthony Cox, J. R. Sanchez. Cost Savings from Optimized Packing and Grooming of Optical Circuits: Mesh Versus Ring Comparisons. Optical Networks Magazine, vol. 2, no. 3, pp. 72-90,2001.
[94]. A. Lardies, R. Gupta, R. A. Patterson. Traffic Grooming in a Multilayer Network. Optical Networks Magazine, vol. 2, no. 3, pp. 91-99, 2001.
[95]. K. Zhu, H. Zhu, B. Mukherjee. Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming. Network, IEEE, vol. 17, no. 2, pp.8-15, 2003.
[96]. H. Zhu, K. Zhu, H. Zang, et al. Cost-effective WDM backbone network design with OXCs of different bandwidth granularities. Selected Areas in Communications, IEEE Journal on, vol. 21, no. 9, pp. 1452-1466, 2003.
[97]. S. Thiagarajan, A. K. Somani. Traffic Grooming for Survivable WDM Mesh Networks. OpticalNetworks Magazine, vol. 3, no. 3, pp. 88-98, 2002.
[98]. C. Ou, K. Zhu, H. Zang, et al. Traffic grooming for survivable WDM networks-shared protection. Selected Areas in Communications, IEEE Journal on, vol. 21, no. 9, pp. 1367-1383, 2003.
[99]. L. H. Sahasrabuddhe and B. Mukherjee, "Light-trees: Optical multicasting for improved performance in wavelength-routed networks," IEEE Comm. Magazine, 37(2): 67-73, February 1999.
[100]. A. Khalil, C. Assi, A. Hadjantonis, G Ellinas, M. Ali, "On Dynamic Multicast Traffic Grooming In WDM Networks," The Ninth IEEE Symposium On Computers And Communications (ISCC 2004), Alexandria, June-July 2004.
[101]. Khalil, A.; Hadjiantonis, A.; Ellinas, G; Ali, M.;Sequential and hybrid grooming approaches for multicast traffic in WDM networks Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE Volume 3, 29 Nov.-3 Dec. 2004 Page(s):1808 -1812 Vol.3
[102]. H.Madhyastha, N. Srinivas, G Chowdhary, and C. Murthy, "Grooming of multicast sessions in WDM ring networks," in Proc. Optical Networking and Communications (OptiComm), Dallas, TX, Oct. 2003, pp. 1-12.
[103]. A. Billah, B. Wang, and A. Awwal, "Multicast traffic grooming in WDMoptical mesh networks," in IEEE Global Telecommunications Conf.(GLOBECOM), San Francisco, CA, Dec. 2003, pp. 2755-2760.
[104]. A. Kamal and R. Ul-Mustafa, "Multicast traffic grooming in WDM networks," in Proc. Optical Networking and Communications (Opti-Comm), Dallas, TX, Oct. 2003, pp. 25-36.
[105]. D. Yang, and W. Liao, "Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks," Proc. IEEE INFOCOM, 2002, vol.1, pp. 32-41.
[106]. S. Subramaniam, M. Azizoglu, A. K. Somani. All-optical networks with sparse wavelength conversion. IEEE Transaction on Networking, 1996,4(4):544-557
[107]. S. Subramaniam, M. Azizoglu, A. K. Somani. On the optimal placement of wavelength converters in wavelength routed networks. Proceedings of IEEE INFOCOM'98, 98:902-909
[108]. J. Strand, R. Doverspike, G. Li. Importance Of Wavelength Conversion In An Optical Network. Optical Networks Magazine, 2000, 2(3):33-44
[109]. S.L. Hakimi, "Steiner's problem in graphs and its implications," Networks, vol.1, no.2, pp.113-133, 1971.
[110]．张雷．波长变换WDM网络中路由与波长分配算法的研究及网络性能分析：博士论文．成都：电子科技大学，2002年
[111]. M. Ali, "Optimization of splitting node placement in wavelength routed optical networks," J. Select. Areas Commun., vol.20, no.8, pp.1571-1579, Oct. 2002.
[112]. Yuan Cao; Oliver Yu;" Optimal placement of light splitters and wavelength converters for multicast in WDM networks"; Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on Volume 1, 27-30 May 2005 Page(s):585-589 Vol. 1
[113]. Yufeng Xin, George N. Rouskas. Multicast Routing Under Optical Layer Constraints. Hong Kong, 2004, Proceedings of IEEE Infocom 2004, March 7-11,
[114]. A. N. Washington, H. G. Perros, R. Dutta. A Survey of Optical Network Survivability, NCSU CSC, Technical Report TR-2002-08, 2002
[115]. A.J. Vernon, J. D. Portier. Protection of Optical Channels in All-Optical Networks. 18th Annual National Fiber Optic Engineers Conference (NFOEC 2002), Dallas, 2002:1695-1706
[116]. Singhal, N.K.; Sahasrabuddhe, L.H.; Mukherjee, B.;" Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks"; Lightwave Technology, Journal of Volume 21, Issue 11, Nov. 2003 Page(s):2587-2594
[117]. Medard, M.; Finn, S.G.; Barry, R.A.; Gallager, R.G.;" Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs"; Networking, IEEE/ACM Transactions on Volume 7, Issue 5, Oct. 1999 Page(s): 641-652
[118]. Aiguo Fei; Junhong Cui; Gerla, M.; Cavendish, D.;" A dual-tree scheme for fault-tolerant multicast"; Communications, 2001. ICC 2001. IEEE International Conference on Volume 3, 11-14 June 2001 Page(s):690-694 vol.3
[119]. S. Ramamurthy, B. Mukherjee. Survivable WDM mesh networks. Part I-Protection. IEEE INFOCOM'99, 1999
[120]. Bharat T.Doshi and Subrahmanyam Dravida. Optical Network Design and Restoration. Bell Labs Technical Journal, 1999, 4(1):
[121]. Shengli Yuan and Jason P. Jue. Shared Protection Routing Algorithm for Optical Networks. Optical Networks Magazine, 2002, 3(3): 20-27
[122]. Hui Zang, Canhni Ou, and Biswanath Mukherjee. Path-Protection Routing and Wavelength Assignment in WDM Mesh Networks under Shared-Risk-Group Constraints. APOC 2001, 2001:49-59
[123]．熊光楞，肖田元，张燕云．连续系统仿真与离散事件系统仿真：清华大学出版社，1991
[124]．顾启泰．应用仿真技术：国防工业出版社，1995
[125]. Debasis Mitra, Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Comouter Networks. Elsevier Inc.. 2004
[126]．鲁才，李乐民，王晟；多约束条件下WDM光网中多播选路和波长分配算法；《电子与信息学报》，v28，n9，September，2006，p1684-1688
[127]．鲁才，李乐民，王晟；稀疏分光器配置约束下的多播选路算法；《电子科技大学学报》，v34，p963-967
[128]. Cai lu, Lemin Li, Sheng Wang; A Novel Shared Segment Protection Algorithm for Multicast Session in Mesh WDM Networks; ETRI, Vol.28, pp 329-336
[129]. Cai lu, Lemin Li, Sheng Wang, Xiaoyan; Nie; Adaptive segment protection algorithm of multicast on WDM networks against single link failure; Proc. of SPIE APOC2005, v6022I, p60222C
[130]. Cai lu, Lemin Li, Sheng Wang, Xiaoyan Nie; Efficient dynamic multicast traffic grooming algorithm on WDM networks; Proc. of SPIE APOC2005, v6022 Ⅱ，p602230
[131]. Cai lu, Lemin Li, Sheng Wang; Dynamic Multicast Traffic Grooming for Survivable WDM Mesh Networks; Journal of Optical Networking
[132]. Cai lu, Lemin Li, Sheng Wang; Multicast Routing under Optical Layer Constraints; Journal of Lightwave Technology
[133]. Cai lu, Lemin Li, Sheng Wang; Multicasting with Mixed-Sharing Protection in WDM Optical Networks; Journal of Optical Networking
[134]．鲁才，李乐民；稀疏配置下的多播保护选路算法；专利申请中