A clustering-driven medium access control protocol for WDM star networks

Channel assignment and nodes’ service order are two key issues that have to be addressed when designing medium access control (MAC) protocols for WDM star networks. Traditional scheduling techniques consider either channel assignment or nodes’ service order issues. Furthermore, they make use of information such as data channels or receivers’ availability, without combining it with senders’ demands. This paper introduces a novel approach to message scheduling algorithms for WDM star networks, which is driven by clustering techniques. The proposed clustering driven-minimum scheduling latency (CD-MSL) scheme combines all the aforementioned information to create groups of similar source nodes on the basis of the destination nodes of their messages, aiming at rearranging nodes’ service order and improving network performance. Extensive simulation results are presented, which indicate that the proposed clustering-driven scheme leads to a significantly higher throughput-delay performance, in comparison to conventional scheduling algorithms.     

Wavelength assignment algorithms for WDM optical networks

In this paper, we have proposed an efficient wavelength assignment algorithm for dynamic provisioning of lightpath. This proposed algorithm is based on most-used wavelength assignment algorithm. We have also suggested a mathematical model for WDM optical networks for minimization of blocking probability. The results of proposed algorithm and suggested model are then compared with the conventional wavelength assignment algorithms such as first-fit, best-fit, random and most-used wavelength assignment algorithms. These proposed approaches are very effective for the minimization of blocking probability of optical WDM networks.     

Blocking in wavelength-routed all-optical WDM network with wavelength conversion

The blocking probability in wavelength-routed all optical networks is very important measure of performance of the network, which can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper, we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for wavelength-convertible networks. The model can be used to evaluate the blocking performance of any network topology also it can be useful to improve its blocking performance of the given network topology. The blocking probability variation of the network for a particular load (per link) has been studied based on the load variation and total number of wavelengths used in the network. This model gives good results for high load (per link).     

Capacity enhancement in packet switched slotted ring wavelength division multiplexed transport networks

In this paper, all-optical WDM networks based on a slotted multichannel ring topology have been investigated. The nodes are equipped with one fixed-wavelength receiver, wavelength-tunable transmitter and provide packet-mode transport in WDM network. The topology provides one logical channel to be associated with each destination node. Each channel is shared in statistical time division by all nodes transmitting to a given destination. The capacity enhancement has been demonstrated by comparing all optical WDM network by increasing the number of nodes. It is concluded that by increasing the number of nodes in the topology, the token queue length capacity, the token arrival rate are increased and the token arrival period is decreased which results in overall increase in the performance and capacity of the logical WDM network.     

Blocking in wavelength-routed all-optical WDM network with or without wavelength conversion

The blocking probability in wavelength-routed all-optical networks is a very important measure of performance of the network. This blocking probability can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for both wavelength convertible networks as well as for wavelength non-convertible networks. The model is can be used to evaluate the blocking performance of any network topology also it can be useful to improve its performance of the given network topology.     

Provisioning for restorable WDM optical networks

Restoration is a very critical issue in WDM optical networks. Provisioning also plays a great role in the networks because it deals with resource allocation. In this paper, we have presented two provisioning strategies for restorable networks: unity link weight strategy and varying link weight strategy. The strategies are implemented for critical applications which require 100% degree of survivability. The simulation is done using different proportionate of resources for working and restoration lightpaths. The simulated results show that the performance of the unity link weight strategy is much better than the varying link weight strategy in terms of resource requirement and blocking probability.     

Distributed control based routing and wavelength assignment strategy for WDM optical networks

Wavelength-division-multiplexing (WDM) is emerging as the dominant technology for the next generation optical networks. The control strategy can be either centralized or distributed. In centralized control, there is a central controller to keep track of the state of the network. It is also responsible for selecting the path for data transmission. Most of the work done in this field is based on centralized control. For large networks, distributed control is preferred over centralized control because of low control overhead. Distributed control strategy requires exchange of control messages among nodes. The distributed control generally results in the possibility of resource reservation conflicts among simultaneous path establishments and poor resource utilization. In this paper, we have proposed one distributed control based routing and wavelength assignment strategy that avoids the problem of resource reservation conflicts along with the efficient utilization of resources.     

A New RWA Algorithm Based on Multi-Objective

In this article , we studied the associated research problems and challenges on routing and wavelength assignment (RWA) in WDM (wavelength division multiplexing) networks. Various RWA approaches are examined and compared.We proposed a new RWA algorithm based on multi-objective. In this new algorithm, we consider multiple network optimizing objectives to setup a lightpath with maximize profit and shortest path under the limited resources. By comparing and analyzing, the pro posed algorithm is much better than the algorithms, which only consider one optimizing objective.     

Fault-tolerant routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we investigate the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We propose a mechanism, which is used to combat multiple link failures. A routing and wavelength assignment algorithm has been proposed with the name of fault-tolerant routing and wavelength assignment algorithm. The comparison of this algorithm has also been made with the best-fit and first-fit algorithms. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

Survivable routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we have investigated the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

Nonlinear Codirectional Coupler Filter Used in WDM Networks

It is proposed a novel wavelength filter with a narrow bandwidth suitable for WDM networks, which is based upon nondegenerate four-wave mixing(NDFWM) process in the active region of a wavelength selective coupler. By separating the desired wave-mixing product on the basis of the transverse spatial mode of the electric field, a bandwidth (full width at half maximum, FWHM) of subangstrom for the filter is obtained. The selected wavelength can be tuned in the entire semiconductor gain bandwidth (～70 nm). A theoretical analysis for NDFWM effect in the filter is given. The numerical simulation has been done. The influences of configure parameters on the output efficiency, 3 dB bandwidth (FWHM) and frequency shift are discussed.     

IP/WDM网络的集成服务质量(QoS)控制方法

对IP/WDM网络的集成服务质量（QoS）控制技术问题做了研究, 给出了基于通用多协议标记交换（GMPLS）技术的业务差分处理模型, 设计了新的业务分类、光路分类以及层间映射/疏导/重构策略, 给出了具体的映射技术方案. 本方法具有三大特点：1）光电集成的差分服务模型; 2）多粒度多优先级业务的自适应资源管理机制; 3）支持电信级应用. 该模型较好地折中了多种类型业务的QoS控制复杂性和有效性, 具有较强的实用性和可扩展性, 能够解决光因特网络中支持多媒体业务传送的QoS问题.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

A New 1×K Tunable Multi-wavelength Router and its Features

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｗａｖｅｌｅｎｇｔｈｒｏｕｔｅｒｓ (ＷＲｓ)ａｒｅｋｅｙｄｅｖｉｃｅｓｉｎｗａｖｅｌｅｎｇｔｈ ｒｏｕｔｉｎｇａｌｌ ｏｐｔｉｃａｌｎｅｔｗｏｒｋｓ.Ｒｅｃｅｎｔｌｙ ,ｒｅｓｅａｒｃｈｆｏｒｔｈｅＷＲｓｈａｓｂｅｅｎｏｎｅｏｆｈｏｔｓｐｏｔｓｉｎｗａｖｅｌｅｎｇｔｈｄｉｖｉｓｉｏｎｍｕｌｔｉｐｌｅｘｉｎｇ (ＷＤＭ )ｎｅｔｗｏｒｋｔｅｃｈｎｏｌｏｇｉｅｓ[1,2 ] .Ｂｙｄｉｆｆｅｒｅｎｔｒｏｕｔｉｎｇｐａｔｔｅｒｎｓ,ｔｈｅＷＲｓｃａｎｂｅｄｉｖｉｄｅｄｉｎｔｏｔｗｏｋｉｎｄ…     

A New 1×K Tunable Multi-wavelength Router and its Features

Tunable wavelength routers (TWRs) for multiple wavelength selection are key devices in dynamic wavelength-routing wavelength division multiplexing (WDM) networks. In this paper, by cascading conventional 2×2 TWRs, a new 1×K TWR is proposed for large-scale dynamic wavelength-routing WDM networks. When the cascading numbers are smaller, the 1×K TWR can be directly applied to networking WDM networks. When the cascading numbers are larger, the 1×K TWR can be carried out by the integrating method and be extensively used to networking various multi-wavelength optical networks by the way of “EDFA+TWR”. Though the cascading method proposed is based on the acousto-optic TWRs, it can be also applied to cascading other kinds of TWRs.     

Nonlinear Codirectional Coupler Filter Used in WDM Networks

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｗａｖｅｌｅｎｇｔｈｄｉｖｉｓｉｏｎｍｕｌｔｉｐｌｅｘｉｎｇ(ＷＤＭ)ｉｓａｖｅｒｙａｔｔｒａｃｔｉｖｅｓｃｈｅｍｅｔｏｉｎｃｒｅａｓｅｔｈｅｃａｐａｃｉｔｙｏｆｆｉｂｅｒｏｐｔｉｃｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍ?..     

Delay-constrained anycast routing problem in WDM networks with wavelength conversions

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.     

Routing and wavelength assignment in WDM networks with dynamic link weight assignment

We consider the routing and wavelength assignment problem on wavelength division multiplexing networks without wavelength conversion. When the physical network and required connections are given, routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. In this paper, we have proposed three dynamic link weight assignment strategies that change the link weight according to the traffic. The performance of the existing trend and the proposed strategies is shown in terms of blocking probability. The simulation results show that all the proposed strategies perform better than the existing trend.     

Wavelength Conversion in WDM All-Optical Networks and Analytical Models

This paper gives a brief introduction to the various wavelength conversion techniques. In order to explain the applications and benefits of the wavelength conversion techniques in WDM all-optical networks, several analytical models are studied.