Nonblocking WDM switching networks with full and limited wavelength conversion

In previous years, with the rapid exhaustion of the capacity in wide area networks led by Internet and multimedia applications, demand for high bandwidth has been growing at a very fast pace. Wavelength-division multiplexing (WDM) is a promising technique for utilizing the huge available bandwidth in optical fibers. We consider efficient designs of nonblocking WDM permutation switching networks. Such designs require nontrivial extensions from the existing designs of electronic switching networks. We first propose several permutation models in WDM switching networks ranging from no wavelength conversion, to limited wavelength conversion, to full wavelength conversion, and analyze the network performance in terms of the permutation capacity and network cost, such as the number of optical cross-connect elements and the number of wavelength converters required for each model. We then give two methods for constructing nonblocking multistage WDM switching networks to reduce the network cost.     

Operation of WDM networks with different wavelength conversioncapabilities

We study the impact of wavelength conversion capability on wavelength routing WDM networks with fixed shortest-path routing. We propose a method for implementing wavelength routing in a WDM network with partial wavelength conversion capability. Simulation results show that such partial wavelength conversion networks provide a performance in between that of wavelength continuous networks and those with full conversion capability. In addition, it can be seen that only limited wavelength conversion capability is enough to provide a performance close to that of a network with full conversion. Analytical and simulation bounding results for the full and no conversion cases have also been provided     

Efficient routing and wavelength assignment for multicast in WDMnetworks

The next generation multimedia applications such as video conferencing and HDTV have raised tremendous challenges on the network design, both in bandwidth and service. As wavelength-division-multiplexing (WDM) networks have emerged as a promising candidate for future networks with large bandwidth, supporting efficient multicast in WDM networks becomes eminent. Different from the IP layer, the cost of multicast at the WDM layer involves not only bandwidth (wavelength) cost, but also wavelength conversion cost and light splitting cost. It is well known that the optimal multicast problem in WDM networks is NP-hard. In this paper, we develop an efficient approximation algorithm consisting of two separate but integrated steps: multicast routing and wavelength assignment. We prove that the problem of optimal wavelength assignment on a multicast tree is not NP-hard; in fact, an optimal wavelength assignment algorithm with complexity of O(NW) is presented. Simulation results have revealed that the optimal wavelength assignment beats greedy algorithms by a large margin in networks using many wavelengths on each link such as dense wavelength-division-multiplexing (DWDM) networks. Our proposed heuristic multicast routing algorithm takes into account both the cost of using wavelength on links and the cost of wavelength conversion. The resulting multicast tree is derived from the optimal lightpaths used for unicast     

An analysis of limited wavelength translation in regularall-optical WDM networks

We analyze limited-wavelength translation in regular all-optical, wavelength division multiplexed (WDM) networks, where up to W wavelengths, each of which ran carry one circuit, are multiplexed onto a network link. All-optical wavelength translators with a limited translation range permit an incoming wavelength to be switched only to a small subset of the outgoing wavelengths. We focus on the wraparound mesh and hypercube WDM networks, and analyze the case where an incoming wavelength can he switched to one of k (k=2, 3) outgoing wavelengths (called the feasible wavelength set). Our analysis captures the state of a feasible wavelength set at a network node, which allows us to obtain the probability that a session arriving at a node at a random time successfully establishes a connection from its source node to its destination node in each of these topologies. Based on this probability, we quantify the throughput and blocking performance of limited wavelength translation, and compare it to that of no wavelength translation and full wavelength translation. We demonstrate that in regular networks it can obtain most of the performance advantages of full translation at a fraction of the cost, and we present a simple, economical switch architecture to effect limited wavelength translation at a cost that is effectively independent of the number of wavelengths W in the system     

An efficient dynamic multicast traffic-grooming algorithm for WDM networks

With the growth of multi-granularity multicast applications, there comes into being a huge gap between the bandwidth of a wavelength provided and a multicast traffic required in the wavelength division multiplexing (WDM) networks. The dynamic multicast traffic-grooming is an effective way for WDM networks to improve the wavelength utilization and decrease the traffic blocking probability. A novel switching node architecture with the multicast switching matrix and traffic-grooming fabric is studied in the paper. Then, an efficient dynamic multicast traffic-grooming algorithm is proposed for the architecture. According to the ratio of network available grooming port number to network transceiver number, the proposed algorithm estimates whether the traffic-grooming port is a scarce resource for input traffic and chooses the appropriate grooming strategy. If the traffic-grooming port is scarce, the minimized use grooming port strategy is designed for the coming traffic. On the contrary, the minimized use node transceiver strategy is applied for the coming traffic. Simulation results show that the proposed algorithm can groom traffic efficiently with low blocking probability and high network throughput constraint by limiting number of node transceivers and grooming ports.     

On Multicast Routing for Wavelength-Routed WDM Networks with Dynamic Membership

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work in [1], we explored the optical link control (OLC) layer on the top of optical layer that enables the possibility of bandwidth on-demand (BoD) service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to join a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as low as possible. The same algorithm can be applied to other wavelength routing architectures with redefinition of electronic copy cost. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.     

WDM网状网络中一种动态多播自适应业务疏导算法

光多播业务需要消耗大量的WDM光网络带宽资源,业务疏导是光多播网络降低业务请求阻塞率和提高带宽资源利用率的有效方法。提出了一种新型光多播疏导节点结构,研究了疏导端口优先的多播业务疏导算法(TGPFA)和新建光树优先的多播业务疏导算法(TCLFA),进而提出了一种能够适应网络资源变化的动态多播业务疏导算法(ADMGA)。结果表明,在网络资源有限的情况下,ADMGA算法能取得较低的请求阻塞率和带宽阻塞率,获得较好的网络性能。     

Wavelength conversion technologies for WDM network applications

WDM networks make a very effective utilization of the fiber bandwidth and offer flexible interconnections based on wavelength routing. In high capacity, dynamic WDM networks, blocking due to wavelength contention can he reduced by wavelength conversion. Wavelength conversion addresses a number of key issues in WDM networks including transparency, interoperability, and network capacity. Strictly transparent networks offer seamless interconnections with full reconfigurability and interoperability. Wavelength conversion may be the first obstacle in realizing a transparent WDM network. Among numerous wavelength conversion techniques reported to date, only a few techniques offer strict transparency. Optoelectronic conversion (O/E-E/O) techniques achieve limited transparency, yet their mature technologies allow deployment in the near future. The majority of all-optical wavelength conversion techniques also offer limited transparency but they have a potential advantage over the optoelectronic counterpart in realizing lower packaging costs and crosstalk when multiple wavelength array configurations are considered. Wavelength conversion by difference-frequency generation offers a full range of transparency while adding no excess noise to the signal. Recent experiments showed promising results including a spectral inversion and a 90 nm conversion bandwidth. This paper reviews various wavelength conversion techniques, discusses the advantages and shortcomings of each technique, and addresses their implications for transparent networks     

On the design of multi-wavelength copy interconnects with reduced complexity

A multi-wavelength copy interconnect is a switching network capable of replicating a signal arriving at the input on a specific wavelength to one or more outputs possibly on different wavelengths. Such an interconnect can be useful in building optical multicast switches for wavelength division multiplexing (WDM) networks. In this article, we investigate, for the first time, the problem of designing copy networks that can simultaneously multicast input signals to a set of outputs while changing the wavelength of the replica according to the required routing pattern. We propose a novel multi-wavelength crossbar (MWX) switch that can switch an input signal on a specific wavelength to two different output wavelengths. The proposed MWX is used as a building block to construct two classes of multi-log_2N copy networks, namely, baseline and Bene? interconnects. The design space of the proposed interconnect classes is characterized and their hardware complexity is analyzed. We show that the proposed interconnects are transparent to existing multicast routing algorithms, and present simple routing algorithms for routing of multicast requests over the proposed designs. Comparisons with existing designs confirm that the proposed interconnects require a smaller number of space switches and wavelength conversion processes as compared to most conventional copy networks. In particular, for a large number of wavelengths and for any number of fibers the proposed design requires 50% less switching elements as compared to best available designs.     

A Scalable and High Capacity All-Optical Packet Switch: Design,Analysis, and Control

In this paper, a modular and scalable all-optical packet switch (AOPS) is proposed. The range of its capacity can be easily scaled from gigabit per second to multi-terabits per second. Due to its broadcast-and-select property, the proposed AOPS is capable of performing a multicast function. By taking the advantage of wavelength division multiplexing (WDM), this architecture can provide the best network performance using a limited number of optical fiber delay lines as buffers. To perform the header replacement function, a novel all-optical header replacement unit (HRU) is introduced to be integrated with the switching function. The proposed HRU is shared by all the inputs which provides cost advantages. In addition, we present a generic control scheme for the proposed AOPS. To implement the function of the AOPS, two possible approaches, based on the design of wavelength conversion pools (WCPs), are presented and their cascadability performances are compared. Our simulations show that the proposed AOPS with an arrayed waveguide grating (AWG) based WCP provides better cascadability performance than the one with a star coupler based WCP. We conclude that, based on the status of current optical and electronic technologies, the proposed architecture is feasible to be implemented, and can be a good candidate for future packet switching solutions.     

Virtual Source Based Multicast Routing in WDM Optical Networks

Wavelength-division multiplexed (WDM) networks using wavelength-routing are considered to be potential candidates for the next generation wide-area backbone networks. Multicasting is the ability to transmit information from a single source node to multiple destination nodes and is becoming an important requirement in high-speed networks. As WDM technology matures and multicast applications become increasingly popular, supporting multicast routing at the WDM layer becomes an important and yet a challenging topic. This paper concerns with the problem of optical multicast routing in WDM networks. A few nodes in the network may have wavelength conversion and/or splitting capabilities. In this paper, a new multicast tree construction algorithm is proposed. This algorithm is based on a concept called virtual source. A virtual source is a node having both the splitting and wavelength conversion capabilities. By exploiting the presence of virtual source nodes, the proposed algorithm achieves improved performance. To further improve the performance, the algorithm assigns priorities to nodes based on their capabilities. The effectiveness of the proposed algorithm is verified through extensive simulation experiments.     

Performance analysis of multicast routing and wavelength assignment protocol with dynamic traffic grooming in WDM networks

The need for on‐demand provisioning of wavelength‐routed channels with service‐differentiated offerings within the transport layer has become more essential because of the recent emergence of high bit rate Internet protocol (IP) network applications. Diverse optical transport network architectures have been proposed to achieve the above requirements. This approach is determined by fundamental advances in wavelength division multiplexing (WDM) technologies. Because of the availability of ultra long‐reach transport and all‐optical switching, the deployment of all‐optical networks has been made possible. The concurrent transmission of multiple streams of data with the assistance of special properties of fiber optics is called WDM. The WDM network provides the capability of transferring huge amounts of data at high speeds by the users over large distances. There are several network applications that require the support of QoS multicast, such as multimedia conferencing systems, video‐on‐demand systems, real‐time control systems, etc. In a WDM network, the route decision and wavelength assignment of lightpath connections are based mainly on the routing and wavelength assignment (RWA). The multicast RWA's task is to maximize the number of multicast groups admitted or minimize the call‐blocking probability. The dynamic traffic‐grooming problem in wavelength‐routed networks is generally a two‐layered routing problem in which traffic connections are routed over lightpaths in the virtual topology layer and lightpaths are routed over physical links in the physical topology layer. In this paper, a multicast RWA protocol for capacity improvement in WDM networks is designed. In the wavelength assignment technique, paths from the source node to each of the destination nodes and the potential paths are divided into fragments by the junction nodes and these junction nodes have the wavelength conversion capability. By using the concept of fragmentation and grouping, the proposed scheme can be generally applied for the wavelength assignment of multicast in WDM networks. An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization and minimizing the blocking probability. Copyright © 2011 John Wiley & Sons, Ltd.     

Channel sharing in multi-hop WDM lightwave networks: realizationand performance of multicast traffic

A local lightwave network can be constructed by employing two-way fibers to connect nodes in a passive-star physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The number of channels, ω, in a WDM network is limited by technology and is usually less than the number of nodes, N, in the network. We provide a general method using channel sharing to construct practical multi-hop networks under this limitation. Channel sharing may be achieved through time division multiplexing. The method is applied to a generalized shuffle-exchange-based multi-hop architecture, called GEMNET. Multicasting-the ability to transmit information from a single source node to multiple destination nodes-is becoming an important requirement in high-performance networks. Multicasting, if improperly implemented, can be bandwidth-abusive. Channel sharing is one approach toward efficient management of multicast traffic. We develop a general modeling procedure for the analysis of multicast (point-to-multipoint) traffic in shared-channel, multihop WDM networks. The analysis is comprehensive in that it considers all components of delay that packets in the network experience-namely, synchronization, queuing, transmission, and propagation. The results show that, in the presence of multicast traffic, WDM networks with ω相似文献   

Design of grooming architectures for optical WDM mesh networks: limited grooming with electronic wavelength conversion

In this article, we consider the problem of traffic grooming in optical wavelength division multiplexed (WDM) mesh networks under static traffic conditions. The objective of this work is to minimize the network cost and in particular, the electronic port costs incurred for meeting a given performance objective. In earlier work, we have shown the benefits of limited grooming switch architectures, where only a subset of wavelengths in a network are equipped with expensive SONET Add Drop Multiplexers (SADM) that provide the grooming functionality. In this work, we also consider the wavelength conversion capability of such groomers. This can be achieved using a digital cross-connect (DCS) in the grooming switch to switch low-speed connections between the SADMs (and hence, between wavelengths). The grooming switch thus avoids the need for expensive optical wavelength converters. Based on these observations, we propose a limited conversion-based grooming architecture for optical WDM mesh networks. The local ports at every node in this architecture can be one of three types: an add-drop port, a grooming port that allows wavelength conversion or a grooming port that does not allow wavelength conversion. The problem studied is: given a static traffic model, where should the different ports be placed in a network? We formulate this as an optimization problem using an Integer Linear Programing (ILP) and present numerical results for the same. We also present a heuristic-based approach to solve the problem for larger networks.     

Online multicasting in WDM networks with shared light splitter bank

We study online multicasting in WDM networks with shared light splitter bank. Our objective is either to maximize the network throughput or to minimize the blocking probability. Due to the nature of dynamic requesting for network resources by online multicast requests, the network usually is unable to allocate the resources needed for each request in advance. Instead, it either accepts the request by building an economic multicast tree for the request, in terms of the utilization of the network resources if it has sufficient resources available, or rejects the request, otherwise. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. Since optical light splitting and wavelength conversion switching in optical networks is cost expensive and its fabrication is difficult, it is assumed that only a limited number of light splitters and wavelength converters are installed at a node, which will be shared by all the incoming signals at the node. In addition, it is further assumed that only a fraction of nodes in the network are installed with such optical switches. In this article we first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modeling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.

Wavelength-exchanging cross connects (WEX)-a new class of photonic cross-connect architectures

All-optical wavelength division multiplexing (WDM) networks are expected to realize the potential of optical technologies to implement different networking functionalities in the optical domain. A key component in WDM networks is the optical switch that provides the basic functionality of connecting input ports to output ports. Existing WDM switches make use of space switches and wavelength converters (WCs) to realize switching. However, this not only increases the size and the complexity of the switch but also bears heavily on the cost. In this paper, the authors propose a new class of photonic switch architectures called wavelength-exchanging cross connect (WEX) that provides several advantages over existing switches by enabling a single-step space switching and wavelength conversion and thus eliminating the need for a separate conversion stage. This greatly enhances the switch architecture by reducing its size and complexity. The new class of cross-connect architectures is based on the proposed concept of a wavelength-exchange optical crossbar (WOC). The WOC concept is realized using the simultaneous exchange between two optical signals. The proposed WEX architecture is highly scalable. To establish scalability, the authors present a systematic method of developing instances of the switch architectures of an arbitrary large size.     

A generalized framework for analyzing time-space switched opticalnetworks

The advances in photonic switching have paved the way for realizing all-optical time switched networks. The current technology of wavelength division multiplexing (WDM) offers bandwidth granularity that matches peak electronic transmission speed by dividing the fiber bandwidth into multiple wavelengths. However, the bandwidth of a single wavelength is too large for certain traffic. Time division multiplexing (TDM) allows multiple traffic streams to share the bandwidth of a wavelength efficiently. While introducing wavelength converters and time slot interchangers to improve network blocking performance, it is often of interest to know the incremental benefits offered by every additional stage of switching. As all-optical networks in the future are expected to employ heterogeneous switching architectures, it is necessary to have a generalized network model that allows the study of such networks under a unified framework. A network model, called the trunk switched network (TSN), is proposed to facilitate the modeling and analysis of such networks. An analytical model for evaluating the blocking performance of a class of TSNs is also developed. With the proposed framework, it is shown that a significant performance improvement can be obtained with a time-space switch with no wavelength conversion in multiwavelength TDM switched networks. The framework is also extended to analyze the blocking performance of multicast tree establishment in optical networks. To the best of our knowledge, this is the first work that provides an analytical model for evaluating the blocking performance for tree establishment in an optical network. The analytical model allows a comparison between the performance of various multicast tree construction algorithms and the effects of different switch architectures     

Comprehensive performance modeling and analysis of multicasting in optical networks

Multicasting is becoming increasingly important in today's networks. In optical networks, optical splitters facilitate the multicasting of optical signals. By eliminating the transmission of redundant traffic over certain links, multicasting can improve network performance. However, in a wavelength-division multiplexed (WDM) optical network, the lack of wavelength conversion necessitates the establishment of a single multicast circuit (light-tree) on a single wavelength. On the other hand, establishing several unicast connections (lightpaths) to satisfy a multicast request, while requiring more capacity, is less constrained in terms of wavelength assignment. The objective of the paper is to evaluate the tradeoff between capacity and wavelength continuity in the context of optical multicasting. To this end, we develop accurate analytical models with moderate complexity for computing the blocking probability of multicast requests realized using light-trees, lightpaths, and combinations of light-trees and lightpaths. Numerical results indicate that a suitable combination of light-trees and lightpaths performs best when no wavelength conversion is present.     

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.     

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.