Lightpath Establishment Without Wavelength Conversion Based on Aggressive Rank Accounting in Multi-Domain WDM Networks

In multi-domain WDM networks, in order to establish inter-domain lightpaths across multiple domains without wavelength conversion, a lightpath establishment method based on rank accounting has previously been proposed. With the method, the inter-domain lightpaths are established with small blocking probability based on ranking databases for wavelengths; however, the performance of the method deteriorates when the ranking databases are not frequently updated. In this paper, we propose a lightpath establishment method based on aggressive rank accounting so that ranking databases are updated frequently. In the proposed method, border-node information is used in addition to wavelength usage information, and ranking databases for multiple nodes are updated simultaneously every time a lightpath establishment is processed. From the border-node information, accuracies of the wavelength usage information for each node are computed, and then the ranking database for each node is updated with the wavelength usage information and the computed accuracies. With the updated ranking database, each source node establishes an inter-domain lightpath without wavelength conversion to its destination node across multiple domains. We also present two implementations of the proposed method toward its practical use based on RSVP-TE signaling. We evaluate by simulation the performance of the proposed method, and we show that the proposed method provides smaller blocking probability than the conservative, conventional method when inter-domain lightpaths are not frequently established. We also show that the proposed method still provides smaller blocking probability even if routes of the inter-domain lightpaths change. Finally, we show that the performance of the proposed method is insensitive to the two implementations.     

Performance analysis of multi-fiber WDM network with limited-range wavelength conversion

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength conversion technology and wavelength converters play an important role in enhancing fiber utilization and in reducing the overall call blocking probability of the network. In this paper, we develop a new analytical model to calculate the average blocking probability in multi-fiber link networks using limited-range wavelength conversion. Based on the results obtained, we conclude that the proposed analytical model is simple and yet can effectively analyze the impact of wavelength conversion ranges and number of fibers on network performance. Also a new heuristic approach for placement of wavelength converters to reduce blocking probabilities is explored. Finally, we analyze network performance with the proposed scheme. It can be observed from numerical simulations that limited-range converters placed at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes. We also show that being equipped with a multi-fiber per-link has the same effect as being equipped with the capability of limited-range wavelength conversion. So a multi-fiber per-link network using limited-range wavelength conversion has similar blocking performance as a full wavelength convertible network. Since a multi-fiber network using limited-range wavelength conversion could use fewer converters than a single-fiber network using limited range wavelength conversion and because wavelength converters are today more expensive than fiber equipment, a multi-fiber network in condition with limited-range wavelength conversion is less costly than a single-fiber network using only limited-range wavelength conversion. Thus, multi-fiber per-link network using limited-range wavelength conversion is currently a more practical method for all optical WDM networks. Simulation studies carried out on a 14-node NSFNET, a 10-node CERNET (China Education and Research Network), and a 9-node regular mesh network validate the analysis.     

Multiwavelength optical networks with limited wavelength conversion

This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can efficiently support lightpaths (connections) between nodes. Each lightpath follows a route in a network and must be assigned a channel on each link along the route. The load λ_max of a set of lightpaths is the maximum over all links of the number of lightpaths that use the link. At least λ_max wavelengths will be needed to assign channels to the lightpaths. If the network has full wavelength conversion capabilities, then λ_max wavelengths are sufficient to perform the channel assignment. Ring networks with fixed wavelength conversion capability within the nodes are proposed that can support all lightpath sets with load λ_max at most W-1, where W is the number of wavelengths in each link. Ring networks with a small additional amount of wavelength conversion capability within the nodes are also proposed that allow the support of any set of lightpaths with load λ_max at most W. A star network is also proposed with fixed wavelength conversion capability at its hub node that can support all lightpath sets with load λ_max at most W. These results are extended to tree networks and networks with arbitrary topologies. This provides evidence that significant improvements in traffic-carrying capacity can be obtained in WDM networks by providing very limited wavelength conversion capability within the network     

Performance modeling of bufferless WDM packet switching networks with limited-range wavelength conversion

All optical communication is attracting more and more attention because of the huge bandwidth of optics. In this paper, we study the performance of bufferless optical wavelength-division multiplexing (WDM) packet switching networks with limited-range wavelength conversion capabilities. We first introduce an optimal scheduling algorithm that maximizes the throughput of the switch. We then derive an analytical model to evaluate the performance of the switch in terms of packet-loss probability. Our model is the first accurate analytical model for a bufferless WDM packet switch with variable conversion distances, and can be used to quantitatively determine the maximum load for a given conversion distance or the minimum conversion distance for a given traffic load. We also conducted simulations to validate the analytical model. Both the analytical and simulation results reveal that limited-range wavelength conversion can achieve almost the same performance as full-range wavelength conversion.     

Dynamic lightpath establishment considering four-wave mixing in multifiber WDM networks

This paper proposes a dynamic lightpath establishment scheme considering four-wave mixing (FWM) in multifiber wavelength-division multiplexed (WDM) all-optical networks. The FWM is one of the most important physical impairments to be resolved in WDM networks because the FWM induces nonlinear inter-channel crosstalk and decays the performance of WDM networks. In WDM networks, data are transmitted via lightpaths. When the effect of FWM crosstalk is large, it is highly possible that data transmission fails even if lightpaths are correctly established. The proposed scheme aims to avoid not only the blocking of lightpath establishment but also the accumulation of FWM crosstalk by means of ingenious selection of routes, wavelengths, and fibers for lightpath establishment. In the proposed scheme, a route and a wavelength are selected for each lightpath based on wavelength availability and wavelength placement of established lightpaths. Furthermore, fibers on the route are selected based on estimated FWM power. In this paper, we show the effectiveness of the proposed scheme through simulation experiments.     

Cost Evaluation of Optical Packet Switches Equipped With Limited-Range and Full-Range Converters for Contention Resolution

Two architectures are proposed for a wavelength-division multiplexed optical packet switch equipped with both limited-range wavelength converters (LRWCs) and shared full-range wavelength converters (FRWCs). The FRWCs are used to overcome the performance degradation in terms of packet loss probability due to the use of LRWCs only. Two different sharing strategies of the FRWCs are considered. In the first architecture, a pool of FRWCs is shared among the arriving packets. In the second one, the sharing is only partial and the packets directed to the same output share a same pool of FRWCs. A probabilistic model is proposed to dimension the number of shared FRWCs so that the same packet loss probability of a switch equipped with only shared FRWCs is guaranteed. After introducing a cost model of the converters depending on the conversion range, we show that the architectures may allow a conversion cost savings on the order of 90%.     

A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks

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.     

Lightpath (wavelength) routing in large WDM networks

We address the problem of efficient circuit switching in wide area optical networks. The solution provided is based on finding optimal routes for lightpaths and the new concept of semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining together several lightpaths, using wavelength conversion at their junctions. A fast and practical algorithm is presented to optimally route lightpaths and semilightpaths taking into account both the cost of using the wavelengths on links and the cost of wavelength conversion. We prove that the running time of the algorithm is the best possible in the wide class of algorithms allowing linear algebraic operations on weights. This class encompasses all known related practical methods. Additionally, our method works for any physical realization of wavelength conversion, independently whether it is done via optoelectronic conversion or in a fully optical way     

An experimental switching-aware GMPLS-based lightpath provisioning protocol in wavelength-routed networks

In wavelength-routed optical networks, the high-delay introduced by the optical switching fabric for resource reservation increases critically the lightpath setup delay. In order to minimize the setup delay, Generalized Multi-protocol Label Switching (GMPLS) introduced the concept of Suggested Label Object (SL), which allows to start reserving and configuring the hardware with a proposed wavelength from the source node to the destination node. This solution is not optimal in wavelength selective networks (WSN) (i.e., without wavelengths converters). The need of guaranteeing the wavelength continuity constraint for end-to-end optical connections, combined with the lack of global wavelength-based link information (the source node is not aware of which wavelengths are available on each link), makes that the likelihood of establishing a lightpath using the proposed suggested label may be minimum. In this article, we propose an enhancement to the current GMPLS RSVP-TE signaling protocol with offset time-based provisioning that minimizes the lightpath setup, improving the overall network performance in terms of blocking probability and setup delay. Experimental performance evaluation has been carried out in ADRENALINE testbed, a GMPLS-based intelligent all-optical transport network.     

A non-competing hybrid optical burst switch architecture for QoS differentiation

In this paper, we present a new hybrid optical burst switch architecture (HOBS) that takes advantage of the pre-transmission idle time during lightpath establishment. In dynamic circuit switching (wavelength routing) networks, capacity is immediately hard-reserved upon the arrival of a setup message at a node, but it is used at least a round-trip time delay later. This waste of resources is significant in optical multi-gigabit networks and can be used to transmit traffic of a lower class of service in a non-competing way. The proposed hybrid OBS architecture, takes advantage of this idle time to transmit one-way optical bursts of a lower class of service, while high priority data explicitly requests and establishes end-to-end lightpaths. In the proposed scheme, the two control planes (two-way and one-way OBS reservation) are merged, in the sense that each SETUP message, used for the two-way lightpath establishment, is associated with one-way burst transmission and therefore it is modified to carry routing and overhead information for the one-way traffic as well. In this paper, we present the main architectural features of the proposed hybrid scheme and further we assess its performance by conducting simulation experiments on the NSF net backbone topology. The extensive network study revealed that the proposed hybrid architecture can achieve and sustain an adequate burst transmission rate with a finite worst case delay.     

Wavelength allocation in an optical switch with a fiber delay line buffer and limited-range wavelength conversion

This paper presents an approach to evaluate the performance of an optical switch equipped with both limited-range wavelength conversion and Fiber Delay Lines to resolve contention. We propose an analytical model that allows a general behavior for the packet size distribution while the inter-arrival times are assumed to be of Phase-Type and can easily be relaxed to be generally distributed if needed. As the set of reachable wavelengths is a major issue in limited-range wavelength conversion, we first focus on a simple wavelength set configuration that allows the comparison of different policies and their effect on the loss rate of the system. In addition, a linear association between the loss rate of the simple and a more complex set configuration is identified. Using this association and the results from the analytical model, we derive an approximation for the more complex case, where the interactions among adjacent wavelengths play an important role. The approximation works well for different parameter instances and is particularly useful for the mid load case, when simulations become computationally prohibitive.     

Efficient Wavelength Assignment Methods for Distributed Lightpath Restorations in Wavelength-Routed Networks

In distributed lightpath restoration in wavelength-routed networks, different restoration operations may compete for the same wavelength on the same link and get blocked though there are still plenty of idle capacities on the link. In this paper, we propose two different wavelength assignment methods within the same framework for lowering such type of blocking. Simulation results show that the proposed methods significantly outperform the existing ones. Theoretical analysis confirms the optimality of the proposed methods for a special case; while for a few most important more general cases, it is shown that the optimal performance cannot be guaranteed by any distributed wavelength assignment method with a predefined wavelength searching sequence. For different cases where the original lightpath establishment has adopted random and first-fit wavelength assignments respectively, we discuss the different concerns in developing efficient distributed restoration schemes.     

Optimal Resource Allocation and Fairness Control in All-Optical WDM Networks

This paper investigates the problem of optimal wavelength allocation and fairness control in all-optical wavelength-division-multiplexing networks. A fundamental network topology, consisting of a two-hop path network, is studied for three classes of traffic. Each class corresponds to a source-destination pair. For each class, call interarrival and holding times are exponentially distributed. The objective is to determine a wavelength allocation policy in order to maximize the weighted sum of users of all classes (i.e., class-based utilization). This method is able to provide differentiated services and fairness management in the network. The problem can be formulated as a Markov decision process (MDP) to compute the optimal allocation policy. The policy iteration algorithm is employed to numerically compute the optimal allocation policy. It has been analytically and numerically shown that the optimal policy has the form of a monotonic nondecreasing switching curve for each class. Since the implementation of an MDP-based allocation scheme is practically infeasible for realistic networks, we develop approximations and derive a heuristic algorithm for ring networks. Simulation results compare the performance of the optimal policy and the heuristic algorithm, with those of complete sharing and complete partitioning policies.     

Research on dynamic RWA algorithm supporting service-differentiated provision

In the multi-service requirement of the next generation of optical networks, differentiated services should be provided, and the transmission quality of signal and the path reliability are two important parameters of service class differentiation. A new dynamic routing and wavelength assignment (RWA) algorithm supporting service-differentiated provision, which takes account of both requirements of the signal transmission quality and the path reliability, is proposed. The numerical results from simulation show that the algorithm can not only overcome the impact of impairment on signal transmission quality and guarantee lightpath reliability, but also offer the service-differentiated lightpath according to its class.     

Dynamically concatenated wavelength converters

An architecture is proposed for a wavelength-division-multiplexed (WDM) optical packet or circuit switch in which a bank of limited-range wavelength converters is shared among all input fibers, and in which any subset of converters can be dynamically concatenated (cascaded) to yield a wider conversion range for a packet that would otherwise be dropped because all unused wavelengths in its desired output fiber lie outside the range of a single converter. A probabilistic model of a switch is used to numerically determine the improvement in packet-drop probability achieved by dynamically concatenating converters.     

Worst-case analysis of dynamic wavelength allocation in opticalnetworks

This paper proposes algorithms for allocating wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. A worst-case model is considered, where no blocking of lightpaths is allowed, and there are no assumptions made on the traffic arrival and holding times. The traffic is characterized only by its load L, which is the maximum number of lightpaths that can be present on any link, assuming no blocking. A dynamic traffic model is considered where requests to set up lightpaths arrive over time and, must be accommodated without rerouting existing lightpaths, and lightpaths may be terminated over time as well. For networks without wavelength conversion, we show that at least 0.5Llog ₂N wavelengths are required by any dynamic algorithm for rings of N nodes and present an algorithm that uses at most Llog₂ N+L wavelengths for rings and 2(L-1)log₂N for trees. We also study the worst-case behavior of the well-known first-fit algorithm, and show that it requires at most 2.52Llog₂N+5L wavelengths (small variants of these constants are proven as well). When limited wavelength conversion is allowed, we first show how to use expanders to insure no blocking in arbitrary topologies. Then, we present conversion patterns for rings with conversion degree d=2, which require Llog₂L+4L or 2Llog₂log₂L+4L wavelengths, thereby eliminating the dependence (that exists without wavelength conversion) between the number of wavelengths and N. We also consider different traffic models where lightpath setup requests arrive over time, but once set up, lightpaths are never taken down. For this model, the number of wavelengths needed is shown to be only max{0,L-d}+L for a conversion degree of d     

Efficient routing and wavelength assignment for reconfigurable WDMnetworks

Through the use of configurable wavelength-division-multiplexing (WDM) technology including tunable optical transceivers and frequency selective switches, next-generation WDM networks will allow multiple virtual topologies to be dynamically established on a given physical topology. For N node P port networks, we determine the number of wavelengths required to support all possible virtual topologies (PN lightpaths) on a bidirectional ring physical topology. We show that if shortest path routing is used, approximately N wavelengths are needed to map N lightpaths. We then present novel adaptive lightpath routing and wavelength assignment strategies that reduce the wavelength requirements to [(N/2)] working wavelengths per port for protected networks and [(N/3)] wavelengths in each direction per port for unprotected networks. We show that this reduced wavelength requirement is optimal in the sense that it is the minimum required to support the worst case logical topology. Furthermore, we prove that a significant number of logical topologies require this minimum number of wavelengths. We also develop joint routing and wavelength assignment strategies that not only minimize the number of wavelengths required to implement the worst case logical topologies but also reduce average wavelength requirements. Finally, methods for extending these routing and wavelength assignment results to general two-connected and three-connected physical topologies are presented     

A scalable optical WDM multicast Beneš network with multi-channel wavelength converters

An optical wavelength division multiplexing (WDM) multicast network interconnects an input signal on a given wavelength to one or more output fibers, possibly on different wavelengths (via wavelength conversion), while maintaining the signal in the optical domain. A key challenge in the design of scalable multicast networks is to reduce conversion complexity without affecting the switching capability and signal quality. In this article, we propose a scalable WDM multicast Beneš interconnection network with minimized conversion complexity. The proposed network is based on the Copy-and-Route architecture, and it uses multi- channel WCs (MCWCs) for wavelength conversion. The conversion complexity of the proposed design is O(F log₂ W) (where F is the number of fibers and W is the number of wavelengths per fiber), which is smaller than the O(FW) complexity of the optimal design based on conventional single-channel WCs (SCWCs). We prove that, for W >  64 and for any value of F, the conversion complexity of the new design is strictly less than that of the optimal SCWC-based design regardless of the total number of wavelengths simultaneously converted by each MCWCs. Analyzes of conversion complexity of the proposed design for large values of W confirm considerable savings compared to the optimal SCWC-based design. For instance, for W = 256 and an for an arbitrary value of F, a practical implementation of the proposed design achieves 87% reduction in conversion complexity as compared to the optimal SCWC-based design.