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.     

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.     

Wavelength retuning without service interruption in an all‐optical survivable network

This paper proposes a new wavelength retuning (WRT) scheme in an all‐optical WDM network. Compared with the existing WRT schemes developed for all‐optical networks, which can alleviate the wavelength‐continuity constraint but cannot avoid service interruption or data loss, the proposed scheme is able to alleviate the wavelength‐continuity constraint and reduce the connection blocking probability with no service interruption to the on‐going traffic. This is achieved by allocating two routes, one for active path and one for backup path, to each incoming connection request and conducting WRT only on the backup path. The backup path provides an alternate path in case of a failure, while the active path carries traffic under normal conditions. Thus, WRT on the backup path will not cause any impact on data transmission. An optimal backup path WRT scheme and a heuristic algorithm are developed and the performance evaluation on the proposed schemes is presented. The simulation results show that the proposed optimal scheme reduces the connection blocking probability by 46.8% on average, while the proposed heuristic scheme reduces the blocking probability by 28.3% on average, all compared with the scheme without WRT. Copyright © 2009 John Wiley & Sons, Ltd.     

WDM光网络的多优先级业务疏导机制

IP over WDM网络中,业务疏导能有效提高波长带宽利用率.然而,单一化的业务疏导机制难以满足不同业务的QoS要求,也很难做到经济合理地使用光路.提出了一种支持多优先级业务的疏导机制,该机制根据光路传输的时延和丢包特性来选择恰当的疏导路径,同时,该机制结合了抢占和流量分割技术,能有效地实现流量分割和多路抢占,降低了业务的阻塞概率.仿真结果显示,该疏导机制在保证业务QoS的同时,降低了高优先级业务的阻塞概率;在业务负载低时,能有效减少抢占.     

Aggregate History of User Mobility Pattern for QoS Provisioning in Multimedia Wireless Networks

Multimedia traffic is expected to be included in the next generation of wireless networks. As in wireline networks, the wireless network must also be capable of providing guaranteed quality-of-service (QoS) over the lifetime of mobile connections. In this paper, a bandwidth reservation scheme incorporating a user mobility prediction is proposed to manage the QoS of the networks. The mobility prediction scheme is developed based on the aggregate history of mobile users. Based on the mobility prediction, bandwidth is reserved to guarantee the uninterrupted handoff process. Simulation results demonstrate that the proposed scheme can guarantee the required QoS requirements in terms of handoff call dropping probability and new call blocking probability while maintaining efficient bandwidth utilization.     

IP over WDM网络中能耗自感知的混合疏导专有保护算法

针对绿色生存性IP over WDM网络中资源开销大、网络阻塞率高的问题,提出一种能耗自感知的混合疏导专有保护(HG-PA-DPP)算法。首先在IP层的核心路由器对低粒度业务请求集中疏导;然后通过实时感知WDM层的链路负载和双层器件带来的链路能耗状态定义链路权值,基于分层图在不同波长平面上为各业务请求寻找权值小且链路分离的工作路径和保护路径,同时在业务的中间节点处对不需要光-电-光转换的光路进行光旁路处理;最后,将空闲或保护资源设置为休眠模式以实现节能。仿真结果表明,所提算法在高负载时有着更好的节能效果,且在大网络拓扑下资源开销(RO)为传统算法的76.5%,阻塞率(BP)仅为传统算法的61.1%。     

Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks

Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization.     

Models of Restoration Probability in WDM Networks Employing Active Restoration

The ever-increasing demand for network bandwidth makes network survivability an issue of great concern. Lightpath restoration is a valuable approach to guaranteeing an acceptable level of survivability in WDM optical networks with better resource utilization than that of its protection counterpart. Active restoration (AR) is a newly proposed lightpath restoration scheme [M. Mostafa et al. OSA Journal of Optical Networking, vol. 3, no. 4, pp. 247–260] that combines the best of protection and reactive restoration while avoiding their shortcomings. In this paper, we conduct detailed performance analysis on the restoration probability of AR-based WDM networks. In particular, analytical models of restoration probability are developed respectively for networks with full-wavelength conversion capability and for networks without wavelength conversion capability under different backup path searching schemes. Based on the new models, we investigate the effects of wavelength availability, wavelength conversion capability, path length as well as backup path seeking methods on the restoration probability.     

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

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

Optical burst switching: a viable solution for terabit IP backbone

Wavelength-division multiplexing has emerged as an important physical layer technology. Optical transmission provides a physical layer capable of carrying bits at the speed at the order of a gigabit per second. Optical burst switching is proposed to overcome the shortcomings of conventional WDM deployment, such as lack of fine bandwidth granularity in wavelength routing and electronic speed bottlenecks in SONET/SDH. We describe an architecture for IP network over the OBS WDM transmission core. The use of MPLS-type technique for forwarding data bursts and the inclusion of a medium access control layer between the optical (WDM) and IP layers are the key ingredients of the proposed architecture. In particular, the architecture is based on provisioning MPLS paths, also called label switched paths, of desired quality of service through the OBS WDM transmission core. The MAC layer performs various OBS-specific functions, such as burst assembly, burst scheduling, and offset setting/traffic shaping. While burst assembly and burst scheduling are relatively straightforward, we point out that the offset setting strategy has significant impact on the performance of IP network operating over OBS WDM core. We describe a shaping scheme to set the offset, an important system parameter for OBS, between the successive data bursts of a given data stream (label switched path) and their associated control packets. This scheme results in robust operation of the network and also facilitates traffic engineering. Guidelines are provided for implementing various IP QoS mechanisms in the optical backbone using OBS.     

Availability-Aware Provisioning Strategies for Differentiated Protection Services in Wavelength-Convertible WDM Mesh Networks

In an optical WDM mesh network, different protection schemes (such as dedicated or shared protection) can be used to improve the service availability against network failures. However, in order to satisfy a connections service-availability requirement in a cost-effective and resource-efficient manner, we need a systematic mechanism to select a proper protection scheme for each connection request while provisioning the connection. In this paper, we propose to use connection availability as a metric to provide differentiated protection services in a wavelength-convertible WDM mesh network. We develop a mathematical model to analyze the availabilities of connections with different protection modes (i.e., unprotected, dedicated protected, or shared protected). In the shared-protection case, we investigate how a connection's availability is affected by backup resource sharing. The sharing might cause backup resource contention between several connections when multiple simultaneous (or overlapping) failures occur in the network. Using a continuous-time Markov model, we derive the conditional probability for a connection to acquire backup resources in the presence of backup resource contention. Through this model, we show how the availability of a shared-protected connection can be quantitatively computed. Based on the analytical model, we develop provisioning strategies for a given set of connection demands in which an appropriate, possibly different, level of protection is provided to each connection according to its predefined availability requirement, e.g., 0.999, 0.997. We propose integer linear programming (ILP) and heuristic approaches to provision the connections cost effectively while satisfying the connections' availability requirements. The effectiveness of our provisioning approaches is demonstrated through numerical examples. The proposed provisioning strategies inherently facilitate the service differentiation in optical WDM mesh networks.     

IP over WDM网中的综合选路算法

研究了IP over WDM网中,当节点不具备波长变换能力并且配备有限光收发器对时,如何利用综合选路(IR)算法为到达业务请求建立标签交换路径(LSP)。提出一种新颖的辅助图模型(AGM)表示网络的当前状态,基于AGM提出一种动态IR算法-最小光收发器对法(MTA)。MTA总是选择占用光收发器对最少的通路来建立LSP,仿真结果表明：与已有算法相比,MTA可以降低全网的阻塞率,从而提高业务通过率,并且有利于减少业务连接所经光／电变换的次数。     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

In this paper a novel call level model based on the extension of the classical Erlang multi‐rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi‐service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP‐based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright © 1999 John Wiley & Sons, Ltd.     

Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

Analysis of blocking probability in optical burst switched networks

In this article, we study the blocking probability in a wavelength division multiplexing (WDM) based asynchronous bufferless optical burst switched (OBS) network, equipped with a bank of wavelength converters. Our analysis encloses two wavelength reservation schemes JIT (just-in-time) and JET (just-enough-time), and two-class data rate. The contribution of our work includes: (i) derivation of an accurate model for blocking probability of lower priority bursts in case of a non-preempted model; (ii) provision of the analytical model for blocking probability calculation in the OBS network, which includes these variables: two signaling schemes, partial wavelength conversion, two-class data, traffic intensity, cross-connect speed, number of wavelengths in WDM fiber, number of fibers in the node, number of wavelength converters, and number of nodes in the path; (iii) simulation results, which show that partial wavelength conversion provide quite satisfactory quality of service. We compare performance in a single OBS node, under various sets of parameter values. The OBS network shows great flexibility in terms of used multiclass data, and there is no dependence on the used higher layer protocol.     

多光纤WDM网中支持QoS的波长重路由算法

在WDM网上，波长连续性限制会降低网络的信道利用率，增加光路建立请求的阻塞率。采用波长重路由技术可以减少波长连续性限制对网络性能的影响。该文采用波长图模型，对多光纤WDM网中支持QoS的波长重路由算法进行了探讨，提出一种支持QoS的波长重路由算法－－动态选择法，并采用两种网络模型，在不同负载的动态业务下对所提算法进行了仿真研究；仿真结果表明所提算法既满足了上层业务不同的QoS要求，同时又充分利用了有限的网络资源，使全网的平均阻塞率降低。     

QoS aware traffic grooming and integrated routing on IP over WDM networks

In this article, we consider traffic grooming and integrated routing in IP over WDM networks. The challenges of this problem come from jointly considering traffic grooming, IP routing, and lightpath routing and wavelength assignment (RWA). Due to the high bandwidth of optical fiber, there exists a mismatch between the capacity needed by an IP flow and that provided by a single lightpath. Traffic grooming is therefore used to increase the network utilization by aggregating multiple IP flows in a single lightpath. However, traffic grooming incurs additional delays that might violate Quality-of-Service (QoS) requirements of IP users. In this work, the tradeoff between traffic grooming and IP QoS routing is well-formulated as a mixed integer and linear optimization problem, in which the revenue from successfully provisioning IP paths is to be maximized. Problem constraints include IP QoS, routing, optical RWA, and the WDM network capacity. We propose a novel Lagrangean relaxation (LGR) algorithm to perform constraint relaxation and derive a set of subproblems. The Lagrangean multipliers are used in the proposed algorithm to obtain a solution in consideration of grooming advantage and resource constraints simultaneously. Through numerical experiments and comparisons between the proposed algorithm and a two-phase approach, LGR outperforms the two-phase approach under all experimental cases. In particular, the improvement ratio becomes even more significant when the ratio of IP flow to the wavelength capacity is smaller.     

Design Method of Logical Topologies with Quality of Reliability in WDM Networks

As the bandwidth capacity of WDM networks continues to grow rapidly,traffic loss caused by a failure of network components is becoming unacceptable. To prevent such traffic loss and thus enhance network reliability, a protection method that prepares backup lightpaths for each working path is now being developed. In this paper, we first introduce the concept of QoR (quality of reliability), which is a realization of QoS with respect to the reliability needed in a WDM network. We define QoR in terms of the recovery time from when a failure occurs to when traffic on the affected primary lightpath is switched to the backup lightpath. After that, we propose a heuristic algorithm that can be used to design a logical topology that satisfies the QoR requirement for every node pair. The objective is to minimize the number of wavelengths needed for a fiber in the logical topology to carry the traffic with the required QoR. We compare this algorithm with two existing algorithms and show that it enables more effective use of wavelength resources; with the proposed algorithm, up to 25% fewer wavelengths are needed than with the other algorithms.     

Performance analysis for voice/data integration on a finite-buffermobile system

Personal communication service (PCS) networks offer mobile users diverse telecommunication applications, such as voice, data, and image, with different bandwidth and quality-of-service (QoS) requirements. This paper proposes an analytical model to investigate the performance of an integrated voice/data mobile network with finite data buffer in terms of voice-call blocking probability, data loss probability, and mean data delay. The model is based on the movable-boundary scheme that dynamically adjusts the number of channels for voice and data traffic. With the movable-boundary scheme, the bandwidth can be utilized efficiently while satisfying the QoS requirements for voice and data traffic. Using our model, the impact of hot-spot traffic in the heterogeneous PCS networks, in which the parameters (e.g., number of channels, voice, and data arrival rates) of cells can be varied, can be effectively analyzed. In addition, an iterative algorithm based on our model is proposed to determine the handoff traffic, which computes the system performance in polynomial-bounded time. The analytical model is validated by simulation