Green grooming in spectrum-sliced elastic optical path networks

With the continuous expansion in network scale and the rapid growth of Internet traffic, a high-capacity and power-efficient transport system is required. The Spectrum-Sliced Elastic Optical Path Network (SLICE) based on Orthogonal Frequency Division Multiplexing has been considered as a promising solution due to flexible spectrum provisioning. In a SLICE, compared with traditional components, the bandwidth variable transponder and cross-connects have higher power costs. So it is necessary to make a green footprint in this new networking framework. In this paper, we make a comprehensive study of green grooming in SLICEs, with the objective to save both spectrum and power consumptions. An Integer Linear Programming formulation with various SLICE constraints is presented for the optimization problem above. Under the large-scale network scenario, we also propose the auxiliary graph model which reflects spectrum/power usage, grooming policies implemented by adjusting link costs according to a comprehensive power consumption model, as well as a threshold-based spectrum reservation scheme. As a result, an efficient heuristic called green grooming algorithm is designed. The extensive simulation results demonstrate that our heuristic obtains near-optimal results and achieves a better performance in terms of spectrum and power efficiencies compared with benchmarks, under various topology structures.     

A spectrum spacing mechanism to enhance traffic grooming in elastic optical networks

Photonic Network Communications - Elastic optical networks allow for a division of the optical spectrum into frequency slots, which can be combined to create channels with bandwidth defined by...     

Renewable energy-aware grooming in optical networks

The optical layer of a network is the energy-efficient technology to provision high bandwidths for data transport. Unfortunately, occasional electronic processing is unavoidable in current networks. This process is much more energy-consuming than the optical transport. Recent research has already yielded great improvements in terms of energy efficiency. It is, however, observed that increased energy efficiency typically leads to higher overall energy consumption. Therefore, it is imperative to reduce the environmental impact by additional means: maximizing the use of renewable energy. We present an approach to greenhouse gas (GHG) emission-reducing grooming by considering the heterogeneous distribution of fossil and renewable energy sources. We analyze various two-step solutions for the route calculation and lightpath provisioning problem in IP-over-WDM mesh networks. We show that it is possible to reduce GHG emissions at a stable level of energy consumption and improved blocking performance compared to previous energy-efficient solutions.     

WDM光网络中的业务量疏导

波分复用（WDM）技术在主干传送网中巳广泛应用，WDM光网络的研究进展也非常迅速，光网络中的业务量疏导定义为复用、解复用和交换低速率业务流到大容量的光路中的行为。介绍了WDM光网络的业务量疏导的重要性，研究方法及其最新研究进展情况。     

Traffic grooming and clique partitioning‐based spectrum assignment in elastic optical networks

We adopt a fragmentation reducing policy for spectrum assignment and incorporate it with multicast traffic grooming in EON. To reduce fragmentation, the spectrum is partitioned based on the clique partitioning approach and spectral slots are assigned to traffic demands depending on which partition they belong. Simulation results predict that the proposed approach has better spectrum slot utilization compared to the state‐of‐the‐art non‐partitioning approach and the proposed approach reduces fragmentation, and also has less blocking ratio compared to the state‐of‐the‐art partitioning approach.     

WDM光网络中的动态流量疏导

针对波分复用光网络中的业务疏导问题,文章基于通道组交换网络模型,采用波分复用网络中的相对容量算法来解决业务疏导的路由、波长分配和时隙分配问题.基于该模型的算法能够将波长和时隙分配这两个通常分开解决的问题一步解决,因此比现有方法具有更好的效能,仿真也验证了这一点.     

Survivable integrated grooming in multi-granularity optical networks

Survivability is an important issue to ensure the service continuity in optical network. At the same time, with the granularity of traffic demands ranging from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in order to utilize resources effectively. Therefore, multi-granularity grooming is proposed to save the cost and reduce the number of switching ports in Optical-Cross Connects (OXCs). However, current works mostly addressed the survivable wavelength or waveband grooming. Therefore, in this paper, we propose three heuristic algorithms called Multi-granularity Dedicated Protection Grooming (MDPG), Multi-granularity Shared Protection Grooming (MSPG) and Multi-granularity Mixed Protection Grooming (MMPG), respectively. All of them are performed based on the Survivable Multi-granularity Integrated Auxiliary Graph (SMIAG) that includes one Wavelength Integrated Auxiliary Graph (WIAG) for wavelength protection and one waveBand Integrated Auxiliary Graph (BIAG) for waveband protection. Numerical results show that MMPG has the lowest average port-cost, the best resource utilization ratio and the lowest blocking probability among these three algorithms. Compared with MDPG, MSPG has lower average port-cost, better resource utilization ratio and lower blocking probability.     

Adaptive subcarrier-distribution algorithm for routing and spectrum allocation in OFDM-based elastic optical networks

In this paper, we have proposed the adaptive subcarriers-distribution routing and spectrum allocation (ASD-RSA) algorithm, which is the first elastic optical network routing and spectrum allocation algorithm based on distributed subcarriers. It allocates lightpaths to request adaptively and proved to achieve much lower bandwidth blocking probability than traditional routing and spectrum allocation algorithms based on centralized subcarriers with integer linear programming and dynamic simulation methods. Additionally, the ASD-RSA algorithm performs the best with three alternate routing paths; this character will decrease the calculating amount of both alternate routing path searching and spectrum allocation immensely in large networks.     

Multicast multi-granular grooming based on integrated auxiliary grooming graph in optical networks

In order to improve the bandwidth utilization efficiency and reduce the blocking probability for multicast requests in optical networks, the multicast traffic grooming approach was proposed to groom a lot of low-speed traffic to a few of high-speed light-trees. At the same time, in order to save the ports and the cost of optical cross-connect, the multicast waveband grooming approach was proposed to groom multiple light-trees to a few of waveband tunnels. However, the existing approaches all did not consider the joint performances of improving bandwidth utilization efficiency, reducing blocking probability and saving ports for multicast requests. Therefore, in this article, we propose a new multicast multi-granular grooming approach to perform the hierarchical sequential grooming to improve the joint performances based on a newly developed integrated auxiliary grooming graph (IAGG) that includes multiple wavelength integrated grooming graphs (WIGGs) and one waveband virtual topology layered graph (BVLG) to support both the multicast traffic grooming and multicast waveband grooming. In order to achieve the map of light-tree to the virtual topology layer in WIGG or BVLG, we present a light-segment map method, where a light-tree will be divided to several light-segments each of which will be independently mapped to the virtual topology layer. Since different definitions of blocking probability may lead to different objectives, we define two kinds of blocking probability, mean blocking probability of requests (MBPR) and mean blocking probability of users (MBPU). According to the two definitions of blocking probability, we propose two multicast multi-granular grooming heuristic algorithms, Heuristic Algorithm with minimizing MBPR and Heuristic Algorithm with minimizing MBPU based on IAGG. Simulation results show that the two proposed algorithms are both efficient and have better performances than traditional multicast grooming algorithm.     

Waveband grooming and IP aggregation in optical networks

An automatically switched optical network (ASON) can be used as the transport layer of generalized multiprotocol label switching (GMPLS) networks. The design of an ASON involves determining the number of optical cross-connects (OXC) in the network, the required number of ports per OXC, and the interconnection topology of the OXCs. Given the number of ports per OXC, we present a linear algorithm to find the number of OXCs and to identify a cost-effective topology. We then develop a scheme that can be used to perform waveband grooming for several different topologies of an ASON that uses single-layer multigranular OXCs. We identify the bottlenecks and investigate the effect of traffic grooming schemes in the design of an ASON as a function of the peak access rate per customer. We evaluate the topologies and architectures for a national trunk network.     

光网络绿色业务量疏导研究

简述了光网络绿色业务量疏导的基本问题,综述了有关方面近年来的研究状况,包括绿色网络功耗模型的研究、绿色业务量疏导算法的研究、绿色网络生存性问题的研究等。根据对各种方法的对比分析,指出了光网络中绿色业务量疏导领域还需进一步研究的共享保护、时间感知等新方法和新课题。     

Logical topology design for dynamic traffic grooming in WDM optical networks

Traffic grooming in optical networks refers to consolidation of subwavelength client connections onto lightpaths. Depending on whether client connections are given in advance or randomly arrive/depart, traffic grooming is classified as static and dynamic. Dynamic traffic grooming has been traditionally performed through establishing/releasing lightpaths online. In this paper, the authors propose an alternate approach to design a static logical topology a priori and then route randomly arriving client connections on it to avoid frequent lightpath setup/teardown. Two problems are considered: 1) minimize resource usage constrained by traffic blocking requirements and 2) maximize performance constrained by given resources. These are formulated as integer linear-programming (ILP) problems. The numerical results show that the resource usage dramatically decreases when the blocking requirement is relaxed, and the grooming performance slowly increases when given more resources. In addition, the number of ports at client nodes has more profound impact on traffic grooming than the number of wavelengths.     

Routing,modulation level and spectrum allocation with dynamic modulation level conversion in elastic optical networks

Elastic optical network is introduced as a promising technology to provide multi-bitrate-friendly data transmission in the optical layer. Elastic optical networks are based on flexible modulation format conversion, which can make more efficient use of spectrum resources than current fix-grid WDM networks. In this paper, we define the routing, modulation level and spectrum resource allocation (RMLSA) problem and then propose two novel dynamic modulation level conversion (MLC) enabled RMLSA algorithms. Numerical simulations are conducted to compare the performance of the path modulation level conversion (Path-MLC) and link modulation level conversion (Link-MLC) with different MLC thresholds with K-shortest paths RSA in terms of blocking rate, occupied spectrum and the number of MLCs across two topologies. The results verify that the Link-MLC with unlimited MLC achieves the lowest blocking rate and moderate spectrum utilization at the expense of intermediate node modulation conversions in two topologies. Smaller MLC threshold has higher blocking rate and occupied less spectrum resource. The results also suggest that the Path-MLC approach is more resource efficient than the Link-MLC with relatively higher blocking rate, and this method maybe more preferable in the networks with tight budget and/or energy constraints.     

Analysis of optical networks with heterogeneous grooming architectures

Traffic grooming in optical networks employing wavelength division multiplexing (WDM) has gained prominence due to the prevailing disparity between the user requirement and wavelength capacity. Nodes in an optical network get upgraded to the latest grooming technology slowly with time. Hence, WDM grooming networks are expected to employ heterogeneous grooming architectures. In this paper, we develop an analytical model to evaluate the blocking performance of WDM grooming networks with heterogeneous grooming capabilities. We demonstrate the accuracy of the analytical model by comparing the analytical results with that of the simulation. We observe that analytical models with and without precise knowledge of the grooming architectures predict similar performance. The proposed analytical model can be employed by resource placement algorithms that identify a set of nodes and links that need to be upgraded when the resources are limited.     

弹性光网络中基于自适应调制的碎片感知共享通路保护算法

为了提高弹性光网络(EON)的频谱利用率,提出一种基于自适应调制的碎片感知共享通路保护算法。该算法利用频谱块承载权重(SBBW)衡量不同频谱块接纳业务的能力,优先选择SBBW大的链路构成候选工作路径,并利用分配前、后SBBW差值最小的频谱块建立工作路径。然后选择可用频谱块和保护频谱块承载能力大的链路构成候选保护路径,建立保护路径时优先使用分配前、后SBBW差值最小的保护频谱块,建立失败时才选择分配前、后SBBW差值最小的可用频谱块。仿真结果表明:该算法可以降低带宽阻塞率、频谱碎片率和备用容量冗余。     

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.     

Adaptive minimum symbol-error-rate decision feedback equalization for multilevel pulse-amplitude modulation

The design of decision feedback equalizers (DFEs) is typically based on the minimum mean square error (MMSE) principle as this leads to effective adaptive implementation in the form of the least mean square algorithm. It is well-known, however, that in certain situations, the MMSE solution can be distinctly inferior to the optimal minimum symbol error rate (MSER) solution. We consider the MSER design for multilevel pulse-amplitude modulation. Block-data adaptive implementation of the theoretical MSER DFE solution is developed based on the Parzen window estimate of a probability density function. Furthermore, a sample-by-sample adaptive MSER algorithm, called the least symbol error rate (LSER), is derived for adaptive equalization applications. The proposed LSER algorithm has a complexity that increases linearly with the equalizer length. Computer simulation is employed to evaluate the proposed alternative MSER design for equalization application with multilevel signaling schemes.     

Exploring node light-splitting capability for burst grooming in optical burst switched networks

Optical burst switching (OBS) is a switching concept which lies between optical circuit switching and optical packet switching. Both node switching time and burst size can impact the resource efficiency of an OBS network. To increase resource utilization, burst grooming has been proposed where numerous data bursts are coalesced to form a larger burst that will be switched as one unit in order to reduce the resource waste and switching penalty. In this article, assuming burst grooming can only be realized at edge nodes, we study the burst grooming problem where sub-bursts originating from the same source may be groomed together regardless of their destinations under certain conditions. We explore the capability that core nodes can split incoming light signals to support multicast to achieve more efficient burst grooming. Specifically, core nodes can transmit the groomed burst to multiple downstream nodes if the sub-bursts in the groomed burst have different destinations. The groomed burst will traverse a tree which spans the source and all the destinations of the sub-bursts in the groomed burst. The destination egress nodes recognize, de-burstify, and drop the sub-bursts destined to these nodes, i.e., the sub-bursts destined to these egress nodes are removed from the groomed burst. At the same time, the remaining sub-bursts may be groomed with sub-bursts at these egress nodes subject to burst grooming criteria. We propose two effective burst grooming algorithms, (1) a no over-routing waste approach (NoORW); and (2) a minimum relative total resource ratio approach (MinRTRR). Our simulation results have shown that the proposed algorithms are effective in terms of the burst blocking probability, the average burst end-to-end delay, the number of sub-bursts per groomed burst, as well as the resource waste.     

Traffic grooming in mesh WDM optical networks - performance analysis

Traffic grooming is an important task in interworking between the wavelength-division multiplexing (WDM) optical network that supplies "pipes" at the wavelength granularity, and the attached client networks that usually require connections of subwavelength granularity. The focus of this paper is to conduct performance analysis of grooming dynamic client traffic in WDM optical networks with a mesh topology. This paper first briefly introduces the traffic grooming problem in WDM optical networks and the issues related to performance analysis. It then develops two link blocking models, an exact model based on the stochastic knapsack problem and an approximation model based on an approximate continuous time Markov chain (CTMC). The end-to-end performance analysis is conducted using the reduced load approximation. The result obtained from analysis is shown to be accurate compared with the numerical result obtained from simulation.