共查询到17条相似文献,搜索用时 62 毫秒
1.
2.
在WDM光网络中,为了进一步提高波长资源的利用率,多个业务连接可以通过时分复用(TDM)技术共享一个波长的容量。在这种基于WDM-TDM技术的光网络中建立业务连接,需要解决的核心问题之一是波长路由与时隙分配(RWTA)问题。该文研究了WDM-TDM光网络中的动态RWTA问题,提出了一种基于最大使用率方法的RWTA算法(MUB)和一种改进的MUB算法(EMUB),并对它们的性能进行了计算机仿真分析。结果表明:EMUB算法的阻塞率性能优于MUB算法,能有效地优化WDM-TDM光网络的资源利用率。 相似文献
3.
根据原有的数学分析模型,提出了一种分层图模型,并根据此模型提出了一种用来解决DWDM(密集波分复用)网络中出现的波长分配问题的一种算法,并通过计算机仿真来表明此算法提高了波长资源的利用率,降低了网络的阻塞率。 相似文献
4.
基于节点功能的WDM光网络分布式路由与波长分配算法 总被引:2,自引:0,他引:2
建立了一种具有节点功能区分的WDM多波长光网络模型,根据节点功能将其分为A、B两类,在此基础上提出了波长等价弧和等价网络等概念,并根据此类多波长光网络模型的节点和网络结构特点以及相应的选路和波长分配策略,提出了一种基于节点功能的多波长光网络分布式路由与波长分配算法——BONF算法,证明了算法的可行性,分析了算法的计算复杂度,比较了此算法与其它同类型算法的区别,指出了BONF算法的优点和不足。 相似文献
5.
6.
7.
WDM全光网自适应路由和波长分配算法 总被引:4,自引:1,他引:3
研究了无波长转换WDM全光网的路由和波长分配算法(RWA)。通过对已有算法的分析和比较,提出了一种自适应最小跳数路由算法(ADMH)。此算法以最小跳数路由为基础,同时考虑网络状态的变化,因而不仅能尽量少使用网络资源,也能使网络资源的分布保持均衡。计算机模拟仿真的结果表明,这种算法性能在各种网络参数条件下优于或等于已有算法。 相似文献
8.
9.
10.
11.
12.
全光网静态路由选择和波长分配的分层图算法 总被引:1,自引:0,他引:1
文章提出一种将路由选择和波长分配结合起来的启发式的路由选择和波长分配(RWA)算法.通过这种新的分层图算法和限制光跳距的加权系数来优化全光网的静态路由选择和波长分配,使建立光连接时所需的波长数达到最少.最后对实际的ARPANet等5种光网络进行了计算机仿真,证明了本算法比以前的算法有更好的性能. 相似文献
13.
This article proposes a new approach for routing and wavelength assignment (RWA) for permanent and reliable wavelength paths
(WP) in wide all-optical WDM networks with wavelength continuity constraint. Given a number of available wavelengths on each
optical fiber, for each simple link failure of the network, we seek to maximize the number of satisfied requests for connections.
This is known as RWAP problem. In our algorithm, called RWA with Minimum Loaded Link for Permanent and Reliable wavelength
paths (MLL-PR), routing is based on the search for the optimal path while trying to minimize the maximum load on the links of the network
in order to minimize the maximum link capacity and then minimize the number of dropped lightpaths after any link failure.
The wavelength assignment is based on a graph coloring method using tabu-search. A series of experiments using two well-known
networks (ARPANET and NSFNET) have been carried out in order to evaluate the performance of our approach, in terms of the
number of blocked demands, for different failure scenarios. Generally, our results are better than those provided by the current
solving approaches taken as reference.
相似文献
Zouhair GuennounEmail: |
14.
15.
16.
17.
Amin Ebrahimzadeh Akbar Ghaffarpour Rahbar Behrooz Alizadeh 《Optical Switching and Networking》2013,10(4):354-365
Routing and wavelength assignment (RWA) is the most concern in wavelength routed optical networks. This paper proposes a novel binary quadratic programming (BQP) formulation for the static RWA problem in order to balance traffic load among a network links more fairly. Subsequently, a greedy heuristic algorithm namely variable-weight routing and wavelength assignment (VW-RWA) is proposed to solve the developed BQP problem. In this method, the weight of a link is proportional to the link congestion. Performance evaluation results for different practical network topologies show that our proposed algorithm can decrease the number of required wavelengths in the network, blocking rate and variance of used wavelengths in each link. Besides, it is shown that the number of required wavelengths to establish call requests for a given network topology can be reduced at lower cost compared to other heuristics. 相似文献