共查询到18条相似文献,搜索用时 156 毫秒
1.
目前网络承载业务的趋势是以IP为中心的数据业务,从而促进了以WDM光网络向高速和宽带多波长的应用和普及,为了进一步提高网络的性能并提高资源利用率,出现了光网络控制面技术.路由选择与波长分配问题是WDM光传输网络控制面中非常重要的问题之一.目前实际应用最广泛的波长分配算法是First-Fir(FF)算法.本文基于FF算法,研究动态业务下波分复用光网络在固定选路下的波长分配问题,提出了一种新的波长分配启发式算法——Joint First Fit.计算机仿真试验表明,与常用的FF算法相比,该算法显著的降低了网络呼叫阻塞率,有利于提高网络资源的利用率. 相似文献
2.
针对节点功能不同光网络中的路由与波长分配问题,建立了一种具有节点功能区分的波分复用器(WDM)多波长光网络模型,根据节点功能将其分为A,B两类,并提出了波长等价弧、等价网络,以及等价多播树等概念.在此基础上基于节点功能区分的WDM光网络的特点和相应的路由和波长分配策略,提出了一种如何在此类WDM光网络中实现多播连接的快速有效的算法,分析了算法计算复杂度,指出了算法的优缺点. 相似文献
3.
4.
针对TDM EPON向WDM EPON升级过程中各个光网络单元(ONU)支持波长数不尽相同的特点,提出一种基于波长间负载均衡的动态带宽分配算法(LB-DBA).该算法在分配带宽时考虑波长信道的带宽约束,同时分两步确定授权给ONU的发送波长和发送时间,有利于波长信道间的负载均衡.仿真结果表明,LB-DBA可以避免已有算法在混合TDM/WDM EPON中可能出现的授权周期长度增加和资源利用率低等问题,有效改善网络性能. 相似文献
5.
6.
7.
8.
在WDM光网络中,为了进一步提高波长资源的利用率,多个业务连接可以通过时分复用(TDM)技术共享一个波长的容量。在这种基于WDM-TDM技术的光网络中建立业务连接,需要解决的核心问题之一是波长路由与时隙分配(RWTA)问题。该文研究了WDM-TDM光网络中的动态RWTA问题,提出了一种基于最大使用率方法的RWTA算法(MUB)和一种改进的MUB算法(EMUB),并对它们的性能进行了计算机仿真分析。结果表明:EMUB算法的阻塞率性能优于MUB算法,能有效地优化WDM-TDM光网络的资源利用率。 相似文献
9.
引言WDM环网以其结构简单、生存性好等特点而成为目前大多数WDM光网络研究和实验项目的首选网络结构。而波长分配是光网络优化设计中的一项关键技术。所谓波长分配就是把网络中的业务连接(即需要建立的光通路)以最优化方式映射到网络的物理资源上。其优化目标可以是最小化网络资源(如波长数最小),也可以是最大化网络中可以建立的连接数。目前,有些资料中已针对环网中的波长分配提出了几种启发式算法[1,2],但是这此算法都把波长分配中紧密关联的路由和波长分配这两部分割裂开并独立优化,而本文提出的算法则把这两部分综合到同一个优化过程… 相似文献
10.
11.
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. 相似文献
12.
本文讨论了WDM光网中,在动态业务流量和有限范围波长变换情况下的动态路由和波长分配(RWA)问题,基于Moone-Dijkstra算法,考虑到动态波长变换的可能和限制,提出了一种新型的、可实现动态最小代价路由和最佳虚波长通道的综合启发式算法(DMC-OVMP)。该算法对路由子问题和波长分配子问题既相互独立,又相互结合,优化了RWA,保证了网络信息传输的安全性。对中国教育和科研计算机网(CERNET)基于本算法进行了计算机仿真,实现了低的网络阻塞率。 相似文献
13.
Dynamic routing and wavelength assignment (RWA), which supports request arrivals and lightpath terminations at random times,
is needed for rapidly changing traffic demands in wavelength division multiplexed, (WDM) networks. In this paper, a new distributed
heuristic algorithm based on ant colony optimization for dynamic RWA is put forward. We consider the combination of route
selection and wavelength assignment as a whole using a multilayer-graph model. Therefore, an extended multilayer-graph model
for WDM networks with limited wavelength conversion is presented. Compared with other RWA methods, the Ant Colony heuristic
algorithm can achieve better global network optimization and can reduce communication overhead cost of the networks. Simulation
showed that a lower blocking probability and a more rational wavelength resource assignment can be achieved. 相似文献
14.
研究了动态业务下,采用固定选路和备用选路的波分复用光传送网中的波长分配问题.提出了一种新的波长分配算法,新算法在已市算法的基础上进行了改进,与已有算法相比,该算法能更精确地描述波长分配对全厨状态的影响。计算机仿真表明,如果用阻塞率来衡量,该波长分配算法优于文献中已有的波长分配算法。 相似文献
15.
16.
17.
The next generation multimedia applications such as video conferencing and HDTV have raised tremendous challenges on the network design, both in bandwidth and service. As wavelength-division-multiplexing (WDM) networks have emerged as a promising candidate for future networks with large bandwidth, supporting efficient multicast in WDM networks becomes eminent. Different from the IP layer, the cost of multicast at the WDM layer involves not only bandwidth (wavelength) cost, but also wavelength conversion cost and light splitting cost. It is well known that the optimal multicast problem in WDM networks is NP-hard. In this paper, we develop an efficient approximation algorithm consisting of two separate but integrated steps: multicast routing and wavelength assignment. We prove that the problem of optimal wavelength assignment on a multicast tree is not NP-hard; in fact, an optimal wavelength assignment algorithm with complexity of O(NW) is presented. Simulation results have revealed that the optimal wavelength assignment beats greedy algorithms by a large margin in networks using many wavelengths on each link such as dense wavelength-division-multiplexing (DWDM) networks. Our proposed heuristic multicast routing algorithm takes into account both the cost of using wavelength on links and the cost of wavelength conversion. The resulting multicast tree is derived from the optimal lightpaths used for unicast 相似文献