共查询到20条相似文献,搜索用时 15 毫秒
1.
In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes. 相似文献
2.
As multicast applications becoming widely popular, supporting multicast in wavelength division multiplexing (WDM) networks is an important issue. Currently, there are two schemes to support multicast in WDM networks. One scheme is opaque multicasting which replicate bit stream in electronic domain. And the other is transparent multicasting which replicate bit stream all optically by a light splitter. However, both of two schemes have drawbacks or difficulties. This paper investigates an alternate translucent multicasting scheme, in which a fraction of branch nodes replicate bit stream at electronic domain and the other branch nodes replicate bit stream all optically. Replicating bit stream at electronic domain will introduce electronic processing overhead and extra delay. To satisfy the delay requirement of multicast session, the maximum number of electronic hops of a multicast tree must be less than an upper bound. In this paper, a hop-constrained multicast routing heuristic algorithm called shortest path based hop-constrained multicast routing (SPHMR) is proposed. A series of simulations are conducted to evaluate the effectiveness of translucent multicasting scheme. Simulation results show that the translucent multicasting scheme achieve a good compromise between network performance and network cost as well as power losses caused by light splitting. 相似文献
3.
The advances in wavelength-division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications through light splitting. Due to complexity and cost constraints, light splitting (or optical multicast) nodes are sparsely configured in a practical WDM network. In this article, we investigate the multicast routing problem under the sparse light-splitting constraint. An efficient sparse splitting constrained multicast routing algorithm called Multicast Capable Node First Heuristic (MCNFH) is proposed. The key idea of MCNFH is to include the shortest path, that includes most of the multicast capable nodes, for configuring the multicast tree. Simulations and comparisons are used to demonstrate the performance of MCNFH. Simulation results and analysis show that MCNFH builds multicast trees with the least wavelength channel cost and with the smallest number of wavelengths used per link. In addition, MCNFH requires only one transmitter at the source node. 相似文献
4.
P圈的出现为在格状WDM光网络中实现快速的故障恢复提供了一种很吸引人的方案,P圈法兼有环网快速的保护倒换速度和格状网络有效的资源利用率这两大特点。从P圈的基本概念、P圈的主要特点以及P圈的配置等几个方面出发对在格状WDM网络中使用P圈法实现网络保护的方案进行了介绍。 相似文献
5.
在光层构建多播选路和波长分配时,必须考虑一些约束条件。主要的约束条件有以下4种:稀疏分光器配置约束、波长连续性约束、能量损伤约束及稀疏波长转换器约束。目前,研究人员只是针对其中一个或两个约束条件进行了算法研究。该文在详细分析各种约束条件之后,提出了一种基于多约束条件下多播选路和波长分配启发式算法。最后在CERNET和NSFNET两种网络拓扑上进行了仿真实验。根据算法仿真结果可以得出该算法可以有效地解决多约束条件下的多播路由及波长分配问题。 相似文献
6.
7.
This paper addresses the problem of multicast wavelength assignment for sparse wavelength conversion (MWA-SWC) in wavelength-routed wavelength-division-multiplexing (WDM) networks. It aims to optimally allocate the available wavelength for each link of the multicast tree, given a sparse wavelength conversion network and a multicast request. To our knowledge, little research work has been done to address this problem in literature.In this paper, we propose a new technique called MWA-SWC algorithm to solve the problem. The algorithm first maps the multicast tree from the sparse conversion case to the full conversion case by making use of a novel virtual link method to carry out the tree mapping. The method provides a forward mapping to generate an auxiliary tree as well as a reverse mapping to recover the original tree. Applying the auxiliary tree, we propose a dynamic programing algorithm for the wavelength assignment (WA) aiming to minimize the number of wavelength converters (NWC) required. Simulation results show that our new algorithm outperforms both random and greedy algorithms with regard to minimizing the NWC. Testing on various scenarios by varying the number of wavelength conversion nodes in the tree has confirmed the consistency of the performance. The primary use of the MWA-SWC algorithm is for static traffic. However, it can also serve as a baseline for dynamic heuristic algorithms. Typically, the MWA-SWC algorithm will provide great benefit when the number of available wavelengths on each link of the multicast tree is relatively large and the performance advantage is significant. 相似文献
8.
生存性是WDM(波分复用)光网络的核心技术之一,对多播业务而言,IpC(智能P圈保护)是一种具有快速、高效等特点的保护算法。文章提出一种EIpC(增强型智能P圈)保护方案,包括分段和路径IpC算法,分段和路径IpC算法分别为每个分段和路径寻找新的P圈。理论分析和仿真结果表明,路径IpC在资源利用率、P圈构造个数以及圈平均覆盖度等方面最优,分段IpC次之,传统(链路)IpC最低。在先验效率方面,链路IpC最优,分段IpC次之,路径IpC最低。 相似文献
9.
10.
在WDM网络中,由于光路之间存在的依赖性,物理网络的单链路失效可能会造成虚拓扑不连通而使上层网络(SDH、ATM或IP)无法使用自身的恢复机制来恢复受影响的业务,因此虚拓扑在嵌入物理拓扑时必须避免发生这种情况.已有的分离备用路径(Disjoint Alternate Path,DAP)算法总是假设网络所有波长路由节点都具有全波长转换能力.本文提出的LG-VTMDP保护设计算法利用分层图同时解决路由和波长分配两个子问题,并考虑了负载均衡和物理链路的容量限制.实验结果表明LG-VTMDP算法优于DAP算法和已有波长分配算法组合后的性能.本文还在此基础上提出了一种有效的波长转换器放置算法WCP算法. 相似文献
11.
Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm 总被引:1,自引:0,他引:1
In this paper, a genetic algorithm is proposed for grooming of arbitrary traffic in optical mesh networks. Traffic streams are routed in the wavelength division multiplexing (WDM) grooming networks that comprise both fiber links and established lightpaths. Chromosomes are split into multiple versions when multiple shortest routes are found. The selection strategy is based on a comparison between chromosomes. A variety of cost functions are proposed for the routing algorithm and two comparison methods are considered in the selection procedure. Computer simulations are performed with randomly generated traffic patterns. The results show that the algorithm is effective for traffic grooming (TG) problems, and also for routing and wavelength assignment problems. 相似文献
12.
In this paper, the sharing schemes of multicast in survivable Wavelength-Division Multiplexed (WDM) networks are studied and the concept of Shared Risk Link Group (SRLG) is considered. While the network resources are shared by the backup paths, the sharing way is possible to make the backup paths selfish. This selfishness leads the redundant hops of the backup route and a large number of primary lightpaths to share one backup link. The sharing schemes, especially, the self-sharing and cross-sharing, are investigated to avoid the selfishness when computing the backup light-tree. In order to decrease the selfishness of the backup paths, it is important to make the sharing links fair to be used. There is a trade-off between the self-sharing and cross-sharing, which is adjusted through simulation to adapt the sharing degree of each sharing scheme and save the network resources. 相似文献
13.
《Optical Fiber Technology》2014,20(4):341-352
This paper proposes an efficient overlay multicast provisioning (OMP) mechanism for dynamic multicast traffic grooming in overlay IP/MPLS over WDM networks. To facilitate request provisioning, OMP jointly utilizes a data learning (DL) scheme on the IP/MPLS layer for logical link cost estimation, and a lightpath fragmentation (LPF) based method on the WDM layer for improving resource sharing in grooming process. Extensive simulations are carried out to evaluate the performance of OMP mechanism under different traffic loads, with either limited or unlimited port resources. Simulation results demonstrate that OMP significantly outperforms the existing methods. To evaluate the respective influences of the DL scheme and the LPF method on OMP performance, provisioning mechanisms only utilizing either the IP/MPLS layer DL scheme or the WDM layer LPF method are also devised. Comparison results show that both DL and LPF methods help improve OMP blocking performance, and contribution from the DL scheme is more significant when the fixed routing and first-fit wavelength assignment (RWA) strategy is adopted on the WDM layer. Effects of a few other factors, including definition of connection cost to be reported by the WDM layer to the IP/MPLS layer and WDM-layer routing method, on OMP performance are also evaluated. 相似文献
14.
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization. 相似文献
15.
16.
17.
18.
We have developed a new layered-routing approach to address the problem of all-optical multicast over wavelength-routed wavelength
division multiplexing (WDM) networks. We model the WDM network as a collection of wavelength layers with sparse light- splitting
(LS) and wavelength conversion (WC) capabilities. We apply the degree constraint technique to solve the problem. The approach
is capable of completing multicast routing and wavelength assignment (MCRWA) in one step. We propose two generic frameworks
to facilitate heuristic development. Any heuristic that is derived from either Prim’s or Kruskal’s algorithm can be easily
imported to solve the MCRWA problem. One example is given for each framework to demonstrate heuristic development. Extensive
simulations were carried out to measure the performance of heuristics developed from the frameworks. The results show that
the STRIGENT scheme is suitable for hardware design and it is advisable to deploy light splitters and wavelength converters
to the same node for better performance. 相似文献
19.