Survivable traffic grooming with non‐service‐interruptive wavelength retuning in a WDM mesh network

This paper proposes a new survivable traffic grooming wavelength retuning (STGWR) scheme in an all‐optical wavelength division multiplexing (WDM) network. In a dynamic WDM network, a connection may require a bandwidth less than a wavelength capacity. In addition, a connection should be protected against any network failures. Survivable traffic grooming (STG) can protect connections at subwavelength granularities. Wavelength retuning is a promising approach in an all‐optical WDM network, where a signal must remain on the same wavelength from its source to the destination, to alleviate the wavelength continuity constraint and reduce the connection blocking probability. Although both STG and wavelength retuning have attracted extensive research attentions nowadays, no effort has been made to combine these two promising approaches in one network. In this paper, we propose a wavelength retuning scheme with no service interruption in an all‐optical network with STG capability. The scheme allocates two routes, one for the active path and other for the backup path, in a shared mesh restoration manner to each incoming connection request and conducts wavelength retuning only on the backup path. Both wavelength retuning and mesh protection are done at the connection level instead of at the lightpath level. The simulation results of the proposed schemes are also presented. Copyright © 2008 John Wiley & Sons, Ltd.     

Resource Planning for Dynamic Traffic Grooming in WDM Optical Networks

Dynamic traffic grooming in wavelength division multiplexing (WDM) optical networks refers to consolidating dynamically arriving subwavelength connections onto lightpaths. Most studies on dynamic traffic grooming focused on designing effective algorithms to achieve better performance (typically blocking probability) with given resources such as wavelengths and transponders. In this paper, we study the reverse problem: given the blocking requirement in dynamic traffic grooming, how to determine the resources needed to meet this requirement. We call it resource planning for dynamic traffic grooming. It is raised in a situation that after the initial deployment of optical networks, service providers often need to upgrade resources to accommodate increasing traffic demands. We formulate it as an ILP problem, and developed heuristics to solve this problem for large networks. Numerical results show that the heuristics can achieve good performance, and network resources increase slowly when requiring lower client call blocking probability.     

Traffic grooming in an optical WDM mesh network

In wavelength-division multiplexing (WDM) optical networks, the bandwidth request of a traffic stream can be much lower than the capacity of a lightpath. Efficiently grooming low-speed connections onto high-capacity lightpaths will improve the network throughput and reduce the network cost. In WDM/SONET ring networks, it has been shown in the optical network literature that by carefully grooming the low-speed connection and using wavelength-division multiplexer (OADM) to perform the optical bypass at intermediate nodes, electronic ADMs can be saved and network cost will be reduced. In this study, we investigate the traffic-grooming problem in a WDM-based optical mesh topology network. Our objective is to improve the network throughput. We study the node architecture for a WDM mesh network with traffic-grooming capability. A mathematical formulation of the traffic-grooming problem is presented in this study and several fast heuristics are also proposed and evaluated     

A cost effective approach for survivable multicast traffic grooming in bidirectional multiwavelength ring networks

In this paper, we address the problem of survivable multicast traffic grooming in WDM bidirectional ring networks. The rapid growth of multicast applications such as video conferencing, distance learning, and online auction, has initiated the need for cost-effective solutions to realize multicasting in WDM optical networks. Many of these applications, being time critical and delay sensitive, demand robust and fault-tolerant means of data communication. The end user traffic demands in metro environment are in fractional bandwidth as compared to the wavelength channel capacity. Providing survivability at connection level is resource intensive. Hence cost-effective solutions that require minimum resources for realizing survivable multicasting are in great demand. In order to realize multicast traffic grooming in bidirectional ring networks, we propose a node architecture based on Bidirectional Add Drop Multiplexers (BADM) to support bidirectional add/drop functionality along with traffic duplication at each node. We also propose two traffic grooming algorithms, namely Survivable Grooming with Maximum Overlap of Sessions (SGMOS) and Survivable Grooming with Rerouting of Sessions (SGRS). Extensive simulation studies reveal that the proposed algorithms consume minimum resources measured in terms of BADM grooming ports, backup cost, and wavelengths.     

Traffic grooming for survivable WDM networks - shared protection

We investigate the survivable traffic-grooming problem for optical mesh networks employing wavelength-division multiplexing (WDM). In the dynamic provisioning context, a typical connection request may require bandwidth less than that of a wavelength channel, and it may also require protection from network failures, typically fiber cuts. Based on a generic grooming-node architecture, we propose three approaches for grooming a connection request with shared protection: protection-at-lightpath level (PAL); mixed protection-at-connection level (MPAC); separate protection-at-connection level (SPAC). In shared-mesh protection, backup paths can share resources as long as their corresponding working paths are unlikely to fail simultaneously. These three schemes explore different ways of backup sharing, and they trade-off between wavelengths and grooming ports. Since the existing version of the problem for provisioning one connection request with shared protection is NP-complete, we propose effective heuristics. Under today's typical connection-bandwidth distribution where lower bandwidth connections outnumber higher bandwidth connections, we find the following: 1) it is beneficial to groom working paths and backup paths separately, as in PAL and SPAC; 2) separately protecting each individual connection, i.e., SPAC, yields the best performance when the number of grooming ports is sufficient; 3) protecting each specific lightpath, i.e., PAL, achieves the best performance when the number of grooming ports is moderate or small.     

A novel robust routing algorithm for multi-granularity connection requests in wavelength division multiplexing mesh networks

In this paper, we propose a novel robust routing algorithm based on Valiant load-balancing under the model of polyhedral uncertainty (i.e., hose uncertainty model) for WDM (wavelength division multiplexing) mesh networks. Valiant load-balanced robust routing algorithm constructs the stable virtual topology on which any traffic patterns under the hose uncertainty model can be efficiently routed. Considering there are multi-granularity connection requests in WDM mesh networks, we propose the method called hose-model separation to solve the problem for the proposed algorithm. Our goal is to minimize total network cost when constructing the stable virtual topology that assures robust routing for the hose model in WDM mesh networks. A mathematical formulation (integer linear programming, ILP) about Valiant load-balanced robust routing algorithm is presented. Two fast heuristic approaches are also proposed and evaluated. We compare the network throughput of the virtual topology constructed by the proposed algorithm with that of the traditional traffic grooming algorithm under the same total network cost by computer simulation.     

光网络选路和波长分配研究

文章在叙述了光网络中选路和波长分配(RWA)要解决的基本问题后,对有关方面的近年研究作了综述,主要包括:虚拓扑重构、业务量疏导的RWA、多播RWA、抗毁网络的RWA.抗毁问题涉及WDM网络的抗毁选路、区分可靠性、网状网的快速恢复、多故障下的抗毁.     

Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath traffic-grooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.     

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.     

Survivable lightpath provisioning in WDM mesh networks under shared path protection and signal quality constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical-electrical-optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.     

Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks

This paper addresses the problem of dynamically provisioning both low-speed unicast and multicast connection requests in mesh-based wavelength division multiplexing (WDM) optical networks. Several routing/provisioning schemes to dynamically provision both unicast and multicast connection requests are presented. In addition, a constraint-based grooming strategy is devised to utilize the overall network resources as efficiently as possible. Based on this strategy, several different sequential multicast grooming heuristics are first presented. Then, we devise a hybrid grooming approach and combine it with sequential approaches to achieve a grooming scheme that is biased toward serving multicast traffic demands in comparison with all other sequential grooming approaches. To achieve our objective, we decompose the problem into four subproblems: 1) routing problem; 2) light-tree-based logical-topology-design problem; 3) provisioning problem; and 4) traffic-grooming problem. The simulation results of the proposed schemes are compared with each other and with those of conventional nongrooming approaches. To the best of our knowledge, this is the first detailed paper to address and examine the problem of grooming dynamic multicast traffic demands.     

WDM疏导网络中的基于连接的动态恢复

针对WDM网络中单链路出错的生存性流量疏导问题,提出了一种基于连接的动态恢复机制(DRAC).DRAC不预留任何资源,当链路出错时,通过在网络中动态的发现资源来对错误进行恢复,将一个出错连接转发到一条新的多跳路径.仿真结果显示,提出的这种动态恢复机制拥有很高的恢复概率.     

Design and Performance Evaluation of Traffic Grooming Algorithms in WDM Multi-Ring Networks

In this paper, we propose novel traffic grooming algorithms to reduce the cost of the entire system in WDM multi-ring networks. In order to achieve this goal, it is important to construct a virtual topology and groom the traffic in these networks. We consider four kinds of virtual topologies of WDM multi-ring networks according to the way in which traffic is transmitted among rings. Accordingly, we design four kinds of traffic grooming (TG) algorithms depending on the considered virtual topologies: mixed (MTG), partially mixed (PMTG), separate (STG), and independent (ITG) traffic grooming algorithms. Each algorithm consists of a separation, a connection-ring construction, and a grooming procedure. In the separation procedure, all traffic connections are classified into intra and inter-connections. The connection-ring construction procedure makes full connection-rings from traffic connections. The grooming procedure groups connection-rings onto a wavelength in order to reduce the number of SONET add/drop multiplexers (SADMs) and wavelengths and to improve the utilization of network resources. To analyze the performance of each algorithm, a circular multi-ring architecture with uniform traffic is considered. The simulation results show that ITG and PMTG are more efficient in terms of wavelengths. STG and PMTG require a smaller number of SADMs.     

Strategies for optimal logical topology design and traffic grooming

Traffic grooming techniques are used to combine low-speed data streams onto high-speed lightpaths with the objective of minimizing the network cost, or maximizing the network throughput. In this article, we present a complete suite of efficient Integer Linear Program (ILP) formulations for logical topology design and traffic grooming on mesh WDM networks. Our formulations can be easily modified to implement different objective functions and, contrary to previous formulations, our ILP formulation can be used to generate optimal solutions for practical sized networks with hundreds of requests. Our first set of formulations addresses the complete logical topology design traffic grooming problem, including RWA and traffic routing. The second set uses the simplifying assumption that RWA is not an issue. The last two sets address optimal traffic grooming alone, where the logical topology is already specified. We have studied these formulations, using simulation with networks having up to 30 nodes, and with hundreds and, in some cases, over a thousand low-speed data streams and have shown that the formulations are able to generate optimal solutions within a reasonable amount of time.     

WDM光网络多跳业务量疏导算法

针对具有多跳疏导能力的WDM光网络进行了研究,提出了一种基于固定备选路由的多跳业务量疏导算法（FO-HC-MH）。该算法对备选路由的跳数进行限制,因而可以节约使用网络的收发器资源。仿真实验表明,与FO-MH算法相比,在网络负载较低的情况下该算法节约效果明显。     

Cost Effective Shared Path Protection for WDM Optical Mesh Networks with Partial Wavelength Conversion

In this paper, we study routing and wavelength assignment of connection requests in survivable WDM optical mesh networks employing shared path protection with partial wavelength conversion while 100% restorability is guaranteed against any single failures. We formulate the problem as a linear integer program under a static traffic model. The objective is to minimize the total cost of wavelength-links and wavelength converters used by working paths and protection paths of all connections. A weight factor is used which is defined as the cost ratio of a wavelength converter and a wavelength-link. Depending on the relative cost of bandwidth and wavelength conversion, the optimization objective allows a proper tradeoff between the two. The proposed algorithm, the shortest-widest-path-first (SWPF) algorithm, uses a modified Dijkstra's algorithm to find a working path and a protection path for each connection request in the wavelength graph transformed from the original network topology. When there are multiple candidate paths that have the same minimum total cost, the path along which the maximum number of converters used at each node is minimized is chosen by the SWPF algorithm. We have evaluated the effectiveness of the proposed algorithm via extensive simulation. The results indicate that the performance of the proposed algorithm is very close to that of the optimal solutions obtained by solving the ILP formulation and outperforms existing heuristic algorithms in terms of total number of converters used and the maximum number of converters required at each node in the network. The proposed algorithm also achieves slightly better performance in terms of total cost of wavelength-links and converters used by all connections. We also investigated shared path protection employing converter sharing. The results show that the technique can reduce not only the total number of converters used in the network but also the maximum number of converters required at each node, especially when a large number of converters are needed in the network. In this study, although the ILP formulation is based on static traffic, the proposed algorithm is also applicable to routing dynamic connection requests.     

Some studies on path protection in WDM networks

Path protection in WDM networks is one of the popular ways to design resilient WDM networks. Although complete ILP formulations for optimal design of WDM networks have been proposed in literature, the computational cost of actually solving such formulations make this approach impractical, even for moderate sized networks. This high computational cost arises mainly due to the large number of integer variables in the formulations, which increases the complexity exponentially. As a result, most practical solutions use heuristics, which do not provide any guarantees on the performance. In this article, we propose two novel ILP formulations, which drastically reduce the number of integer variables compared to existing ILPs. This leads to much more efficient formulations. We also present a simple heuristic that may be used for larger networks for which ILP formulations become computationally intractable.     

Constrained light-tree design for WDM mesh networks with multicast traffic grooming

Multicast applications such as IPTV, video conferencing, telemedicine and online multiplayer gaming are expected to be major drivers of Internet traffic growth. The disparity between the bandwidth offered by a wavelength and the bandwidth requirement of a multicast connection can be tackled by grooming multiple low bandwidth multicast connections into a high bandwidth wavelength channel or light-tree. Light-trees are known to be especially suited for networks that carry ample multicast traffic. In this paper, we propose new algorithms to address the problem of multicast traffic grooming. In particular, an Integer Linear Programming (ILP) formulation is proposed for optimal assignments of hop constrained light-trees for multicast connections so that network throughput can be maximized. Hop constrained light-trees improve the scalability of the approach by reducing the search space of the ILP formulation. Since solving the ILP problem is very time consuming for realistically large networks, we are motivated to propose a heuristic algorithm with a polynomial complexity, called Dividable Light-Tree Grooming (DLTG) algorithm. This algorithm is based on grooming traffic to constrained light-trees and also divides a light-tree to smaller constrained light-trees on which traffic is groomed for better resource utilization. Simulations show that the proposed DLTG heuristic performs better than other algorithms. It achieves network throughputs which are very close to the ILP formulation results, but with far lower running times.     

一种新型动态流量疏导策略

在WDM光网络中业务流量疏导能够有效地降低网络建设成本.为了疏导网络中的动态业务,提出动态业务流量的可重构疏导方案,并给出相应快速在线算法.此算法通过动态调整网络的虚拟拓扑结构,可使网络适应各种动态业务.计算机模拟结果表明,该算法能得到较优的疏导结果.     

业务疏导技术在WDM网络及OPS网络中的应用

在波分复用(WDM)光网络中,可使用业务疏导(Traffic Grooming)技术来提高网络性能,降低网络成本.详细阐述了WDM光网络中业务疏导的基本概念及主要目标,并对国内外研究现状进行了总结.最后介绍了OPS光交换网络中使用的业务疏导技术.