共查询到18条相似文献,搜索用时 187 毫秒
1.
2.
WDM环网以其结构简单、生存性好等特点而成为目前大多数WDM光网络研究和实验项目的首选网络结构。而波长分配是光网络优化设计中的一项关键技术。所谓波长分配就是把网络中的业务连接(即需要建立的光通路)以最优化方式映射到网络的物理资源上。其优化目标可以是最小化网络资源(如波长数最小),也可以是最大化网络中可以建立的连接数。目前,有些资料中已针对环网中的波长分配提出了几种启发式算法,但是这此算法都把波长分配中紧密关联的路由和波长分配这两部分割裂开并独立优化,而本文提出的算法则把这两部分综合到同一个优化过程中,从而提高了算法的效率和性能。 相似文献
3.
波分复用技术结合时分复用形成了混合WDM EPON,如何提高系统的带宽利用率和用户服务质量成为关键技术。结合已有算法的优缺点,提出一种新的动态波长带宽分配算法。该算法结合业务等级分类和用户服务等级协议的权重为光网络单元分配相应的带宽和波长,以达到提高服务质量、带宽分配公平性,提高上行带宽利用率和改善网络性能的目的。 相似文献
4.
在WDM光网络中,为了进一步提高波长资源的利用率,多个业务连接可以通过时分复用(TDM)技术共享一个波长的容量。在这种基于WDM-TDM技术的光网络中建立业务连接,需要解决的核心问题之一是波长路由与时隙分配(RWTA)问题。该文研究了WDM-TDM光网络中的动态RWTA问题,提出了一种基于最大使用率方法的RWTA算法(MUB)和一种改进的MUB算法(EMUB),并对它们的性能进行了计算机仿真分析。结果表明:EMUB算法的阻塞率性能优于MUB算法,能有效地优化WDM-TDM光网络的资源利用率。 相似文献
5.
6.
7.
8.
针对光传送网中动态业务的路由和波长问题,提出一种基于强化学习的深度路由波长分配算法DeepRWA。算法基于软件定义网络架构,通过强化学习灵活地调整控制光传送网,实现光网络路由波长分配策略优化。针对路由选择问题,结合链路上的波长使用情况,使用A3C算法选择合适的路由,使得阻塞率最小;针对波长分配问题,使用首次命中算法选择波长。考虑阻塞率、资源利用率、策略熵、价值损失、运行时间及收敛速度等多个指标,利用14节点NSFNET网络拓扑仿真实验。结果表明:当信道中包含18个波长时,与传统KSP-FF算法相比,所提出的路由波长分配算法的阻塞率降低了0.06,资源利用率提高了0.02,但运行时间有增加;在波长数超过45以后,与传统KSP-FF算法相比,所提算法保持阻塞率和资源利用率的同时,运行时间开始降低;当信道中包含波长数为58时,与传统KSP-FF算法相比,所提算法运行时间减少了0.07 ms。由此可见,提出的算法使路由选择和波长分配得到了优化。 相似文献
9.
研究了在基于GMPLS的WDM网络中,当节点不具备波长变换能力并且配备有限个光收发器对时,如何为到达的业务请求建立标记交换路径(LSP)的问题。提出一种以跳数和带宽碎片要求为权重,合理分配带宽资源的新算法。仿真结果表明,该算法在保证用户业务可靠性要求的同时,能够更有效地提高全网资源的利用率,并大大降低网络阻塞的可能性。 相似文献
10.
研究了在基于GMPLS的WDM网络中,当节点不具备波长变换能力并且配备有限个光收发器对时,如何为到达的业务请求建立标记交换路径(LSP)的问题。提出一种以跳数和带宽碎片要求为权重,合理分配带宽资源的新算法。仿真结果表明,该算法在保证用户业务可靠性要求的同时,能够更有效地提高全网资源的利用率,并大大降低网络阻塞的可能性。 相似文献
11.
This paper proposes and evaluates a four-wave mixing (FWM) aware evolutionary programming algorithm for dynamically setting
up lightpaths in an optical wavelength division multiplexed network (WDM network). The proposed algorithm also considers the
effect of amplified spontaneous emission noise (ASE noise) on a lightpath during propagation of the optical signal from any
source to the intended destination. As crosstalk due to FWM and ASE noise are two transmission impairments that degrade the
quality of optical signal even at low to medium data rates, it is mandatory for an algorithm for dynamic routing and wavelength
assignment in a WDM network to consider the effect of these two impairments on the lightpath to be established. The distinguishing
feature of the proposed algorithm is that it is based on an initial population of a single individual and uses a fitness function
that is expressed in terms of the number of hops, path cost, variance contributions due to FWM crosstalk, amplifier noise,
and different beat noises at the receiver. The performance of a newly introduced FWM aware priority-based wavelength assignment
technique is compared with few of the existing wavelength assignment techniques in the present work. 相似文献
12.
在WDM网络中,由于光路之间存在的依赖性,物理网络的单链路失效可能会造成虚拓扑不连通而使上层网络(SDH、ATM或IP)无法使用自身的恢复机制来恢复受影响的业务,因此虚拓扑在嵌入物理拓扑时必须避免发生这种情况.已有的分离备用路径(Disjoint Alternate Path,DAP)算法总是假设网络所有波长路由节点都具有全波长转换能力.本文提出的LG-VTMDP保护设计算法利用分层图同时解决路由和波长分配两个子问题,并考虑了负载均衡和物理链路的容量限制.实验结果表明LG-VTMDP算法优于DAP算法和已有波长分配算法组合后的性能.本文还在此基础上提出了一种有效的波长转换器放置算法WCP算法. 相似文献
13.
The bandwidth of a wavelength channel in WDM optical networks is very high compared to the user’s requirements for various
applications. Therefore, there is a scope for better utilization of channel bandwidth by traffic grooming, in which several
user’s channels are multiplexed for transmission over a single channel. Several research works have been reported on traffic
grooming routing and wavelength assignment (GRWA) for static and dynamic traffic pattern under centralized environment. Distributed
dynamic grooming routing and wavelength assignment (DDGRWA) is a new and quite unexplored area in WDM optical mesh networks.
This article introduces the concept of distributed traffic grooming in WDM mesh networks which also includes virtual topology
construction, reconfiguration, routing and wavelength assignment in the distributed environment assuming incoming traffic
to be dynamic in nature. We have also presented simulation results of our algorithm on dynamically generated traffic under
various network topologies. 相似文献
14.
The need for on‐demand provisioning of wavelength‐routed channels with service‐differentiated offerings within the transport layer has become more essential because of the recent emergence of high bit rate Internet protocol (IP) network applications. Diverse optical transport network architectures have been proposed to achieve the above requirements. This approach is determined by fundamental advances in wavelength division multiplexing (WDM) technologies. Because of the availability of ultra long‐reach transport and all‐optical switching, the deployment of all‐optical networks has been made possible. The concurrent transmission of multiple streams of data with the assistance of special properties of fiber optics is called WDM. The WDM network provides the capability of transferring huge amounts of data at high speeds by the users over large distances. There are several network applications that require the support of QoS multicast, such as multimedia conferencing systems, video‐on‐demand systems, real‐time control systems, etc. In a WDM network, the route decision and wavelength assignment of lightpath connections are based mainly on the routing and wavelength assignment (RWA). The multicast RWA's task is to maximize the number of multicast groups admitted or minimize the call‐blocking probability. The dynamic traffic‐grooming problem in wavelength‐routed networks is generally a two‐layered routing problem in which traffic connections are routed over lightpaths in the virtual topology layer and lightpaths are routed over physical links in the physical topology layer. In this paper, a multicast RWA protocol for capacity improvement in WDM networks is designed. In the wavelength assignment technique, paths from the source node to each of the destination nodes and the potential paths are divided into fragments by the junction nodes and these junction nodes have the wavelength conversion capability. By using the concept of fragmentation and grouping, the proposed scheme can be generally applied for the wavelength assignment of multicast in WDM networks. An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization and minimizing the blocking probability. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
15.
本文讨论了WDM光网中,在动态业务流量和有限范围波长变换情况下的动态路由和波长分配(RWA)问题,基于Moone-Dijkstra算法,考虑到动态波长变换的可能和限制,提出了一种新型的、可实现动态最小代价路由和最佳虚波长通道的综合启发式算法(DMC-OVMP)。该算法对路由子问题和波长分配子问题既相互独立,又相互结合,优化了RWA,保证了网络信息传输的安全性。对中国教育和科研计算机网(CERNET)基于本算法进行了计算机仿真,实现了低的网络阻塞率。 相似文献
16.
Bandwidth-variable optical networks can not only provide bandwidth-flexible lightpaths,but also complete high capacity all-optical switching,and improve the spectrum efficiency.However,for the spectrum... 相似文献
17.
In general, multicast routing and wavelength assignment (MC-RWA) can be subdivided in routing and wavelength assignment issues in wavelength-division multiplexing (WDM) mesh networks. Previous studies on WDM multicast have mainly focused on WDM multicast routing. The multicast wavelength assignment problem is studied in this paper. A unicast routing path can be established by a lightpath in an all-optical network. However, in the multicasting case, a multicast routing tree can be established by a single light-tree or several lightpaths, or a combination of several light-trees and lightpaths. We propose a wavelength assignment algorithm for finding an optimal combination of lightpaths and light-trees to construct a newly required multicast session. First of all, two cost functions are given to evaluate the establishing cost for each feasible wavelength, and then find a set of wavelengths that covers all destinations with the minimal cost using Integer Linear Programming (ILP) formulation. We focus on maximizing the total number of users served in a multicast session and the network capacity. The simulation results show that the proposed algorithm can improve system resource utilization and reduce the blocking probability compared with the First-Fit algorithm.This research was partially supported by the Grant of National Science Council, R.O.C. (NSC 94-2745-E-155-007-URD). 相似文献
18.