共查询到18条相似文献,搜索用时 140 毫秒
1.
2.
3.
4.
5.
6.
一种求解虚波长路径光网络波长资源优化问题的启发式算法 总被引:1,自引:0,他引:1
本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的. 相似文献
7.
8.
9.
本文描述了在波长路由光网络中影响连接建立时间的限制因素,提出了预置光路的方法,通过对路由和波长分配算法的改进减小部分连接的建立时间。模拟计算表明,优化的算法可以使部分连接有效地利用预置光路,从而减小连接建立时间,提高网络的整体性能。 相似文献
10.
11.
In this paper, we have analyzed the wavelength conversion for a multihop wavelength division multiplexed (WDM) transport networks to minimize the blocking probability. The analytical model is presented for a static-routing for a multihop paths wavelength conversion. The results have been validated for three cases, without wavelength conversion, with wavelength conversion and limited wavelength conversion. We show that by using wavelength conversion, there is significant improvement in performance of these transport networks. Each of the three cases of wavelength conversion is discussed for different degrees of conversions. It is observed that the higher the degree of conversion is, the lower is the blocking probability. Also as the degree of conversion is increased further, the curve for limited range conversion moves towards the no conversion. 相似文献
12.
An optical cross connection network which adopts coarse wavelength division multiplexing (CWDM) and data packet is introduced. It can be used to realize communication between multi-CPU and multi-MEM in parallel computing system. It provides an effective way to upgrade the capability of parallel computer by combining optical wavelength division multiplexing (WDM) and data packet switching technology. CWDM used in network construction, optical cross connection (OXC) based on optical switch arrays, and data packet format used in network construction were analyzed. We have also done the optimizing analysis of the number of optical switches needed in different scales of network in this paper. The architecture of the optical interconnection for 8 wavelength channels and 128 bits parallel transmission has been researched. Finally, a parallel transmission system with 4 nodes, 8 channels per node, has been designed. 相似文献
13.
Anycast routing and wavelength assignment problem has been intensively studied in wavelength-division multiplexing (WDM) networks, however, real-time application where packets have explicit expiration deadlines is not taken into consideration. In a WDM network, each link is associated with limited wavelengths available for channel connections. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay of message transmission. When the network and the set of anycast routing requests are given, the delay-constrained wavelength conversions anycast routing (DWCAR) problem is to find a set of light-paths, one for each source, for anycasting message to one member of the anycast destination group. The objective is to find a minimum number of wavelength conversions with the constraint that the sum of delays along every path must not exceed a given delay-bound. In this paper, we present a Tabu-search based delay-constrained anycast routing algorithm (TSDA) to solve this NP-complete problem, and compare it to a simple K shortest path based anycast algorithm (KSPA). Simulation results show TSDA achieves an average 40–50% improvement in required wavelength conversions. 相似文献
14.
Since optical network carries a lot of traffic, survivability is very important to ensure the service continuity against network failures. Recently, multicast services become more popular to meet the huge multimedia demand in network, so that multicast survivability in optical network has got more attention. However, multicast survivability may lead to more energy consumption due to more redundant backup resources allocated. Since greening network is particularly important with the energy crisis keeping growing, green multicast survivability in optical network is a challenging issue. This paper focuses on the green multicast grooming protection problem in optical network and designs two auxiliary graphs that includes a virtual topology graph and an integrated graph to address the survivable multicast grooming, routing and wavelength assignment. Based on the auxiliary graphs, this paper proposes an efficient heuristic called green multicast grooming algorithm based on spanning path dedicated protection (GMG-SPDP), in which the network reliability and the energy efficiency are jointly taken into account. Simulation results show that, compared to other algorithms, the proposed GMG-SPDP not only has lower blocking probability and higher bandwidth utilization ratio, but also saves more energy. 相似文献
15.
In this paper we carry out the performance analysis of traffic groomed multilayer optical networks. It is seen that the number of wavelength channels required decreases as the wavelength grooming factor increases. We have evaluated blocking probability for different load and grooming factor. The performance of the network has been evaluated for different conditions; first for fixed number of links with grooming factor set to 3 and subsequently with increase in grooming factor up to 18 in steps. The load on each link is selected as 2, 5, 9, 12, 15 and 20 Erlangs and the blocking probability as function of number of optical channels has been evaluated. In this work the effect of number of wavelength channels, traffic load and grooming factor on network blocking probability has been studied. The investigation reveals that the blocking probability decreases with increase in wavelength channels. Similarly we found that the blocking probability increases with increase in traffic load which is quite evident. Further it is shown that when the grooming factor is increased to significant value (16), the number of wavelengths requirement (8) becomes relatively stable. 相似文献
16.
THILO GIPSER HUBERT A. JAGER LUTZ RAPP Swiss Federal Institute of Technology Communication Technology Laboratory ETH Zentrum Zurich Switzerland 《Fiber and Integrated Optics》1998,17(1):21-40
All-optical networks are a sound answer to the huge data traffic demand expected for the forthcoming information society. Interesting networking aspects are the broadcasting, scalability, and reconfiguration in an all-optical environment. These issues are addressed in the present article for an all-optical network called MATRIX, which is time slotted and uses packet switching. The architecture enables the all-optical interconnection of a large number of nodes with both a small number of wavelengths and wavelength continuity based on a consequent exploitation of wavelength-division multiplexing and space-division multiplexing (i.e., multiple fibers per cable are used). For an efficient use of the resources, each node is equipped with multiple transmitters and receivers, respectively. Two different broadcasting schemes are investigated. An analytical model is developed, and the corresponding simulation results are in good agreement. It is further shown how different networks of arbitrary size can be interconnected to larger all-optical network clusters, thereby providing scalability not only with respect to the number of nodes but also to the geographical extension. Finally, wavelength reassignments allow change of optical paths through the network in case of changing traffic patterns or network failures in order to best exploit the available network resources. The total number of possible configurations is determined by the theory of Latin Squares. 相似文献
17.
In this paper, we discuss the problem of supporting resource optimization of manycasting service over wavelength division multiplexing (WDM) optical networks. Manycast is a novel group communication paradigm wherein the source is required to send data packets to a certain number of a set of pre-specified group members. Since it integrates the characteristic of multicast and anycast, manycast is attracting increasing interest from researchers over wavelength division multiplexing (WDM) optical networks. Splitter, cost, wavelength channel are three parameters which are taken into consideration for the first time in WDM. Finding a manycast tree which span the resource and selected nodes with minimum number of splitter, cost and wavelength channel is an NP-complete problem, and therefore we propose a simple and efficient heuristic solution: based-frequency manycast routing (BFM) algorithm to construct manycast trees with the aim of reducing the use of network resources. For a set of manycast requests, the simulation result shows BFM builds manycast trees with the smallest number of resources than other algorithms. 相似文献
18.
Fabrizio Forghieri Alberto Bononi Jian-Guo Zhang Paul R. Prucnal Giorgio Picchi Giancarlo Prati 《Fiber and Integrated Optics》1994,13(2):165-183
Some recent results on all-optical packet-switching and broadcasting networks are presented. The performance evaluation problem of packet-switching transparent optical networks with deflection routing is addressed. Transmission error arguments show how, for a given optical bit rate, the size of an all-optical nonregenerative multishop network is limited by the accumulation of noise and distortion in the optical fiber channel. Time-domain multiple access techniques are exploited in novel architectures based on recently proposed all-optical sampling gates to realize the matching of the ultrahigh optical speed allowed by the large bandwidth of the fiber with the lower speed of the electronic components needed at the user ends. These architectures allow great simplification of the node structure in the considered all-optical multihop and broadcast networks. 相似文献