Investigation of launch power and regenerator placement effect on the design of mixed-line-rate (MLR) optical WDM networks

Photonic Network Communications - In recent years, owing to the consistent increase in volume and heterogeneity of the traffic, telecommunication networks have undergone significant innovations....     

On the effect of channel spacing,launch power,and regenerator placement on the design of mixed-line-rate optical networks

Due to the increasing heterogeneity and the growing volume of traffic, telecom backbone networks are going through significant innovations. Wavelength-division multiplexed (WDM) optical networks can now cost-effectively support the growing heterogeneity of traffic demands by having mixed line rates (MLR) over different wavelength channels.The coexistence of wavelength channels with different line rates, e.g., 10/40/100 Gbps, in the same fiber brings up various design issues: in this study, we focus on (1) choice of channel spacing; (2) choice of launch power; and (3) regenerator placement. Channel spacing affects the signal quality in terms of bit-error rate (BER), and hence affects the maximum reach of lightpaths, which is a function of line rates. Various approaches to set an opportunistic width of the channel spacing can be considered, viz., (i) uniform fixed channel spacing specified by the ITU-T grid (typically 50 GHz); (ii) different channel spacing for different line rates; or (iii) optimal value of channel spacing for all line rates that leads to minimum cost.The launch optical power of a signal is another important parameter that affects the network cost. Adjacent channels on different line rates, especially 10 Gbps and 100 Gbps, may exhibit serious degradation of signal quality and optical reach for both the channels due to cross-phase modulation (XPM) between them. Launch power plays a role in such a scenario as it governs the BER by affecting both the signal power and the noise power due to XPM. Moreover, intelligent choice of launch powers on different line rates can significantly reduce the number of regenerators required in the network. The tradeoff between placement of regenerators and choice of launch power is an important problem to address for MLR network design.In this work, we investigate the effects of channel spacing and launch optical power by evaluating the cost of a MLR network for different values of these parameters. We also study the interplay between regenerator placement and launch power. Our results show that (a) it is possible to identify optimal values of channel spacing for a minimum-cost MLR network design, and (b) controlling the power of 10 Gbps and 100 Gbps channels shows maximum sensitivity to the network cost.     

Rerouting technique with dynamic traffic in WDM optical networks

In this paper, we have proposed an efficient wavelength rerouting algorithm for dynamic provisioning of lightpath. In wavelength division multiplexed (WDM) networks rerouting of lightpath can be used to improve throughput and to reduce blocking probability. We have proposed a shortest path wavelength rerouting (SPWRR) algorithm for dynamic traffic in WDM optical networks. The results have shown that SPWRR algorithm can improve blocking performance of the network. In this paper, low complexity algorithm has been developed which is used for the calculation of blocking probability of network. The proposed algorithm has also been applied on the realistic network such as NSFnet for calculation and optimization of blocking probability of the network.     

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

流量疏导是当今光网络研究中的一个前沿和热点问题,在波分复用(WDM)光网络中使用流量疏导技术能有效降低网络的成本,减少网络节点中业务信息的处理量.文章讨论了动态流量疏导的意义及其分类,分析了关于在各种网络结构中动态流量疏导的研究近况,最后对今后的发展方向做了一番展望.     

Provisioning algorithms for WDM optical networks

This paper concerns connection provisioning for optical networks employing wavelength division multiplexing. A heuristic algorithm is developed and numerically studied for routing and wavelength assignment of a set of static connection requests. The algorithm runs much faster than the optimum solution of this problem. An adaptation of the algorithm is proposed to design restorable networks which can handle a specified set of failures. The proposed algorithm is based on taking all failures into consideration simultaneously, and performs better than developing independent designs for each failure     

A wavelength-buffering scheme for dynamic traffic in optical wavelength-division multiplexing networks

In optical wavelength-division multiplexing (WDM) networks, traffic can be very “bursty” at a fine time scale, even though it may seem to be smooth at coarser scales (e.g., Poisson or Poisson-related traffic). This paper analyzes the instantaneous characterization of Poisson traffic at a fine time scale. The analysis shows that the irregular oscillation of the instantaneous traffic load and the occurrence of blockings in a light-loaded network are highly correlated. Specifically, most blockings occur concentratively at the peaks of the instantaneous load. In some other time, network resources may not be sufficiently utilized. To make better utilization of network resources, a novel wavelength-buffering (WB) scheme is proposed for the first time in this paper. By reserving a portion of resources in a “wavelength buffer” under light loading and releasing them when the load goes up, a number of blockings brought by the oscillation of the traffic load can be avoided. Simulation results show that compared with other schemes such as adaptive routing, wavelength conversion (WC), and rerouting, the novel wavelength-buffering scheme achieves significantly better performance with respect to the network utilization and overall blocking probability.

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.     

Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

In this article we investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. Due to the huge amount of traffic a WDM backbone network can support and the large geographic area it can cover, constructing and upgrading such an optical WDM network can be costly. Hence, it is extremely important for network operators to apply traffic engineering strategies to cost-effectively support different bandwidth granularity services using only the appropriate amount of network resources. This requires an optical WDM network to have multigranularity switching capability, and such a network tends to be a multivendor heterogeneous network. However, WDM network heterogeneity increases the difficulty and challenge of efficient traffic provisioning. In this article we present different TE issues that need to be carefully considered in such an optical WDM network, and propose possible solutions and extensions for the generalized multiprotocol label switching optical network control plane. We extend an existing generic graph model to perform efficient traffic grooming and achieve different TE objectives through simple shortest path computation algorithms. We show that our approach is very practical and very suitable for traffic engineering in a heterogeneous multigranularity optical WDM mesh network.     

Simulation-based SONET ADM optimization approach for dynamic traffic grooming in WDM optical networks

The article addresses a simulation-based optimization approach for allocation of ADMs in WDM optical networks with stochastic dynamic traffic. Since ADMs are expensive, it is desirable that if each node in WDM optical networks can use a minimum number of ADMs to achieve a near-ideal performance. In this article, first, the utilization statistics of ADMs are gathered by simulation. Then, ADMs are allocated based on the utilization statistics. In this respect, a simple sorting mechanism is used. The distinguished feature of the proposed approach is that it shows the way to allocate ADMs at the nodes of WDM optical networks with stochastic dynamic traffic. The experimental results ensure that the proposed approach can solve the problem of allocating ADMs in practical WDM optical networks considering stochastic dynamic traffic.

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

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

Provisioning QoS in inter-domain traffic engineering

This work describes an architectural framework that allows inter-domain Traffic Engineering Label Switched Paths (TE-LSPs) with guaranteed quality of service (QoS) to be setup. Such TE-LSPs, called EQ-links, are setup by coordinating path computation elements (PCEs) of neighboring autonomous systems (ASs) along a pre-determined inter-AS path, computed through cooperative interaction between pairs of neighboring ASs. After defining the architectural requirements for the framework, we describe and analyze the Inter-AS Path Computation Protocol (IA-PCP), which computes an interdomain path at the AS level, i.e., selecting a sequence of ASs to the destination, based on a loose source routing approach. The results of the IA-PCP computations are then fed to the PCEs for complete path computation. The proposed architecture has been actually implemented within the testbed of the EuQoS project, which is aimed at enabling end-to-end QoS in the Internet. We report results related to the setup time of EQ-links, measured in the pan-European testbed of the EuQoS project, showing that path computation and setup takes an affordable time overhead.     

Routing and wavelength assignment with multigranularity traffic in optical networks

We propose a novel switching architecture of multigranularity optical cross-connects (MG-OXCs) for dealing with multigranularity traffic in the optical domain. MG-OXCs can cooperate with the generalized multiprotocol label switching (MPLS) control plane, which provides the advantages of cost reduction, better scalability in physical size, and unified traffic management. Detailed discussions are provided on the characteristics and implementation issues for the switching architecture. Based on the proposed MG-OXCs, two routing and wavelength assignment (RWA) with tunnel allocation algorithms are presented: dynamic tunnel allocation (DTA) and capacity-balanced static tunnel allocation (CB-STA). In the former, we use fixed alternate routing with k-shortest paths to inspect network resources along each alternate path for dynamically setting up lightpaths. For the latter, fiber and waveband tunnels are allocated into networks at the planning stage (or off-line) according to weighted network link-state (W-NLS). We will show that with the proposed algorithms, the RWA problem with tunnel allocation in the optical networks containing MG-OXCs can be solved effectively. Simulation is conducted on networks with different percentages of switching capacity and traffic load. The simulation results show that DTA is outperformed by CB-STA in the same network environment due to a well-disciplined approach for allocating tunnels with CB-STA.. We also find that the mix of the two approaches yields the best performance given the same network environment apparatus.     

A novel grooming algorithm with the adaptive weight and load balancing for dynamic holding-time-aware traffic in optical networks

To maximize the resource utilization of optical networks, the dynamic traffic grooming, which could efficiently multiplex many low-speed services arriving dynamically onto high-capacity optical channels, has been studied extensively and used widely. However, the link weights in the existing research works can be improved since they do not adapt to the network status and load well. By exploiting the information on the holding times of the preexisting and new lightpaths, and the requested bandwidth of a user service, this paper proposes a grooming algorithm using Adaptively Weighted Links for Holding-Time-Aware (HTA) (abbreviated as AWL-HTA) traffic, especially in the setup process of new lightpath(s). Therefore, the proposed algorithm can not only establish a lightpath that uses network resource efficiently, but also achieve load balancing. In this paper, the key issues on the link weight assignment and procedure within the AWL-HTA are addressed in detail. Comprehensive simulation and experimental results show that the proposed algorithm has a much lower blocking ratio and latency than other existing algorithms.     

考虑业务优先级的多信道CRANET合作动态功率控制

针对多信道认知自组织网络(CRANET)中不同业务接人类型的优先级对次用户(SU)发射功率的影响,设计了次用户间业务传输的优先级感知因子,考虑到对主用户系统产生的累积干扰量约束,采用微分博弈建立了合作动态功率控制模型(CoDPCM),获得在总联盟下的合作动态功率控制最优解,同时,考虑到自私次用户的非合作性,建立了非合作动态功率控制模型(NoCoDPCM),获得了反馈Nash(纳什)均衡解,并从理论上进行了性能比较.仿真结果表明,与非合作动态功率控制模型相比,合作动态功率控制模型在发射功率、支付量和系统总体吞吐量等方面表现出较好性能.     

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

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

GMPLS-controlled dynamic translucent optical networks

The evolution of optical technologies has paved the way to the migration from opaque optical networks (i.e., networks in which the optical signal is electronically regenerated at each node) to transparent (i.e., all-optical) networks. Translucent optical networks (i.e., optical networks with sparse opto-electronic regeneration) enable the exploitation of the benefits of both opaque and transparent networks while providing a suitable solution for dynamic connections. Translucent optical networks with dynamic connections can be controlled by the GMPLS protocol suite. This article discusses the enhancements that the GMPLS suite requires for the control of dynamic translucent optical networks with quality of transmission guarantees. Such enhancements concern QoT-awareness and regenerator-awareness and can be achieved by collecting and disseminating the information on QoT and regenerator availability, respectively, and by efficiently leveraging such information for traffic engineering purposes. More specifically, the article proposes two distributed approaches, based on the routing protocol and the signaling protocol, for disseminating regenerator information in the GMPLS control plane. Moreover, three strategies are introduced to efficiently and dynamically designate the regeneration node(s) along the connection route. Routing and signaling approaches are compared in terms of blocking probability, setup time, and control plane load during provisioning and restoration.     

Optimized traffic profile for FlexGrid optical networks

A precise alignment between point-to-point free space optical (FSO) networks is crucial in order to maximize the performance of data transmission. A sway or low-frequency vibration of FSO base station can affect line-of-sight quality and hence may lead to the occurrence of higher BER. Therefore, the work presented in this paper is to demonstrate an improved auto-alignment single-channel FSO transmission system at X-axis detection area. The receiver base station was fed with pulsed signal laser from a tunable laser source with a central wavelength of 1550 nm. The detection mechanism responds from an analog input signal received that corresponds to the X-axis direction of transmitter vibration. The detection performance of the system was observed by using two approaches: auto-searching of artificial intelligence (AI) detection with stop command and without stop command. The obtained results indicate that the bit sequence of the pulsed signal has low loss by implementing the auto-searching of AI detection with stop command features and hence improves the efficiency of the overall FSO transmission system.     

Dimensioning optical networks under traffic growth models

In this paper, we consider the problem of dimensioning a large optical wavelength-division multiplexing (WDM) network assuming the traffic is growing over time. Traffic between pairs of nodes is carried through lightpaths which are high-bandwidth end-to-end circuits, occupying a wavelength on each link of the path between two nodes. We are interested in dimensioning the WDM links so that the first lightpath request rejection will occur, with high probability, after a specified period of time T. Here we introduce the concept of capacity exhaustion probability - the probability that at least one lightpath request will be rejected in the time period (0,T) due to lack of bandwidth/capacity on some link. We propose a network dimensioning method based on a traffic growth model which eventually results in a nonlinear optimization problem with cost minimization as the objective and route capacity exhaustion probabilities as the constraints. Computation of exact capacity exhaustion probabilities requires large computing resources and is thus feasible only for small networks. We consider a reduced load approximation for estimating capacity exhaustion probabilities of a wavelength routed network with arbitrary topology and traffic patterns. We show that the estimates are quite accurate and converge to the correct values under a limiting regime in the desired range of low-capacity exhaustion probabilities.     

State-dependent dynamic traffic management for telephone networks

Dynamic traffic management (DTM) is described. The overall system architecture and data flow, routing, and congestion control are addressed. The main design considerations are reviewed, focusing on the update cycle, protective allowance, multiple alternate routes, congestion-control thresholds, and algorithm extensions. The immediate benefits that automation and near-real-time responsiveness entail in traffic management are outlined. These lie in the areas of capital savings, traffic management automation, and trunk servicing