共查询到16条相似文献,搜索用时 830 毫秒
1.
研究了动态业务下,无波长变换的波分复用全光风采用固定选路时的波长分配问题,提出了一种中心式的波长分配算法-最小影响算法。该算法能精确地描述某个波长的分配对全网状态的影响,因而能够更有效地使用网络资源。计算机仿真表明,如果用阻塞概率来衡量,该波长分配算法优于文献中已有的典型算法。 相似文献
2.
3.
4.
5.
研究了动态业务下,采用固定选路和备用选路的波分复用光传送网中的波长分配问题.提出了一种新的波长分配算法,新算法在已市算法的基础上进行了改进,与已有算法相比,该算法能更精确地描述波长分配对全厨状态的影响。计算机仿真表明,如果用阻塞率来衡量,该波长分配算法优于文献中已有的波长分配算法。 相似文献
6.
7.
8.
该文讨论了全连接结构的光交换网络在Hose不确定模型下的动态选路问题,并基于Valiant负载平衡机制,提出了一种新的动态选路算法.分配系数可调的负载平衡选路算法(Load Balancing with Adjustable Distribution Fraction, LBADF)。LBADF算法根据网络中各条链路上空闲光路的数目对Valiant负载平衡机制中的分配系数进行动态的调整,从而达到优化网络性能的目的。计算机仿真表明LBADF算法相对于分配系数恒定的VLB算法具有更小的全网呼损率,同时也相应地降低了全网中所有节点对的最大呼损率。 相似文献
9.
10.
全光网络中动态型波长路由算法的研究 总被引:4,自引:2,他引:2
分析了光路径的跳数(H)、拥挤程度(C)以及全网剩余波长总数(FW)对选路的影响,进而提出一种新型的动态波长路由算法。该算法利用网络中剩余资源的数量,动态调节选路策略,将业务分布在最短、负载最小以及剩余波长数和跳数比值最大的路径上;当有效资源减少时,增加最短路径选择的概率;当有效资源增加时,增加小负载路径的选择概率。计算机仿真结果表明,该算法的阻塞率比传统算法FAR和FPLC算法分别降低了19.1%和12.7%。 相似文献
11.
Peiyuan Lee Yongtao Gong Wanyi Gu 《Communications Letters, IEEE》2004,8(6):397-399
This letter studies routing and wavelength assignment (RWA) problem in wavelength-routed wavelength-division multiplexing networks with both uniform and nonuniform traffic model. Our research shows that the potential traffic load information is a crucial factor for routing algorithm design. Based on our analysis, an adaptive RWA algorithm is proposed. The simulation shows that the proposed algorithm performs much better than other adaptive RWA algorithms. 相似文献
12.
Goran Marković Vladanka Aćimović-Raspopović Valentina Radojičić 《Photonic Network Communications》2012,23(3):272-284
We study the routing and wavelength assignment (RWA) problem of scheduled lightpath demands (SLDs) in all-optical wavelength
division multiplexing networks with no wavelength conversion capability. We consider the deterministic lightpath scheduling
problem in which the whole set of lightpath demands is completely known in advance. The objective is to maximize the number
of established lightpaths for a given number of wavelengths. Since this problem has been shown to be NP complete, various
heuristic algorithms have been developed to solve it suboptimally. In this paper, we propose a novel heuristic RWA algorithm
for SLDs based on the bee colony optimization (BCO) metaheuristic. BCO is a newborn swarm intelligence metaheuristic approach
recently proposed to solve complex combinatorial optimization problems. We compare the efficiency of the proposed algorithm
with three simple greedy algorithms for the same problem. Numerical results obtained by numerous simulations performed on
the widely used realistic European Optical Network topology indicate that the proposed algorithm produces better-quality solutions
compared to those obtained by greedy algorithms. In addition, we compare the results of the BCO–RWA–SLD algorithm with four
other heuristic/metaheuristic algorithms proposed in literature to solve the RWA problem in the case of permanent (static)
traffic demands. 相似文献
13.
14.
Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP-complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random-wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well-designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under the fixed-alternate routing (FAR) algorithm and least-loaded routing (LLR) algorithm. Under the FAR algorithm, we propose a heuristic algorithm called minimum blocking probability first for wavelength converter placement. Under the LLR algorithm, we propose another heuristic algorithm called weighted maximum segment length. The objective of the converter placement algorithms is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON, and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance compared with full wavelength conversion under the same RWA algorithm. 相似文献
15.
The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources. 相似文献
16.
Routing and wavelength assignment of scheduled lightpath demands 总被引:4,自引:0,他引:4
Kuri J. Puech N. Gagnaire M. Dotaro E. Douville R. 《Selected Areas in Communications, IEEE Journal on》2003,21(8):1231-1240
We present algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality. Scheduled lightpath demands are connection demands for which the setup and teardown times are known in advance. We formulate separately the routing problem and the wavelength assignment problem as spatio-temporal combinatorial optimization problems. For the former, we propose a branch and bound algorithm for exact resolution and an alternative tabu search algorithm for approximate resolution. A generalized graph coloring approach is used to solve the wavelength assignment problem. We compared the proposed algorithms to an RWA algorithm that sequentially computes the route and wavelength assignment for the scheduled lightpath demands. 相似文献