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.     

基于P环的恢复机制在WDM网状网中的应用

目前波分复用(WDM)网状网中所采用的恢复机制的恢复速度较慢,不能满足某些业务的需求。利用空闲容量建立的p环(pmcmtfigured cycles)具有环形网的速度和网状网的容量效率。它的操作方法简单,使用灵活,可以应用于WDM网和IP网等不同的网络。本文详细介绍了p环的基本原理、构造过程及优化方法或讨论了多故障的情形,并对一些新的研究方向作了评述,可供网络设计者参考。     

An optimized forwarding protocol for lifetime extension of wireless sensor networks

Optimized routing (from source to sink) in wireless sensor networks (WSN) constitutes one of the key design issues in prolonging the lifetime of battery‐limited sensor nodes. In this paper, we explore this optimization problem by considering different cost functions such as distance, remaining battery power, and link usage in selecting the next hop node among multiple candidates. Optimized selection is carried out through fuzzy inference system (FIS). Two differing algorithms are presented, namely optimized forwarding by fuzzy inference systems (OFFIS), and two‐layer OFFIS (2L‐OFFIS), that have been developed for flat and hierarchical networks, respectively. The proposed algorithms are compared with popular routing protocols that are considered as the closest counterparts such as minimum transmit energy (MTE) and low energy adaptive clustering hierarchy (LEACH). Simulation results demonstrate the superiority of the proposed algorithms in extending the WSN lifetime. Copyright © 2008 John Wiley & Sons, Ltd.     

On the design of Robust‐WDM local area networks

Robust wavelength division multiplexing (Robust‐WDM) is a proposal to realize cost‐effective WDM local area networks (LANs) which can get around the expensive need for laser wavelength stabilization. The type of these networks that relies on an access protocol with aperiodic reservations and lenient‐token‐passing based control channel (the AR/LTP protocol) is promising. We look at the deployment of the AR/LTP analytical model in designing this type of network. The model is used to predict the effect of component and network parameters on the waiting time characteristics of the network. An increase in node operation times (i.e. receiver response time, transmitter select time and reservation period) would result in increasing the average waiting time of a connection request, but the waiting time is more sensitive to the physical span of the network and its size. It is also observed that increasing the inter‐reservation threshold may result in little increase in waiting time up to some limit beyond which delay increases rapidly. Copyright © 2001 John Wiley & Sons, Ltd.     

Online CQI‐based optimization using k‐means and machine learning approach under sparse system knowledge

Modern cellular mobile networks are becoming more complicated and too expensive in terms of deployment, operation, and maintenance. Traffic demand in cellular networks typically experiences spatio‐temporal variations because of users' mobility and usage behaviour, which lead some of the cells to get overloaded without fully utilizing network capacity. To tackle these challenges, nowadays, self‐organizing networks (SONs) become an essential feature. This paper offers the development of an optimization framework for SONs based on channel quality indicator (CQI) and loading condition without detail knowledge of the network environment. Since the electrical tilt plays a key role in optimizing both coverage and capacity, the main motive is to ensure efficient network operation by electrical tilt‐based radio frequency (RF) performance optimization using a machine learning approach. This novel methodology shows two‐step optimization algorithms: (a) cluster formation based on handover success rate using k‐means algorithm and (b) reinforcement learning‐based optimization. Simulation and field trial shows that the proposed approach provides better results than the conventional method of prediction using genetic algorithm (GA) and other online approaches.     

Performance evaluation of multiuser diversity in multiuser two‐hop cooperative multi‐relay wireless networks using maximal ratio combining over Rayleigh fading channels

Multiuser diversity (MUD) cooperative wireless networks combine the features of the MIMO systems without confronting the physical layer constraints by providing multiple copies of the transmitted signal from the source to the destination with the help of the relay node. Cooperative wireless networks have attracted the full attention in the last few years and are implemented widely in many wireless communication systems to adapt for the fading impairments, provide higher data rates, and improve the performance of the wireless communication systems. In this paper, we present an informative study for the reason of evaluating the performance of the MUD in the multiuser two‐hop cooperative multi‐relay networks using maximal ratio combining. Furthermore, we derive tight closed‐form expressions of outage probability and symbol error probability for the amplify‐and‐forward and fixed decode‐and‐forward protocols with the MUD. Additionally, we conduct a simulation study to show to what extent our analytical and simulation results agree with each other. It is worthy to mention that our analytical and simulation results agree fairly with each other under high average signal‐to‐noise ratio, whereas they show that our proposed system with multiple relays provides significant improvements over those previously proposed systems having only one relay. Copyright © 2013 John Wiley & Sons, Ltd.     

A new approach for fast segment‐based protection in WDM mesh networks

We propose a new approach for developing segment‐based schemes for protection against single link/node failure in wavelength division multiplexing (WDM) mesh networks. In the proposed approach, every request is allocated a pair of link disjoint but most coupled primary and backup paths. Two paths are said to be most coupled if they share the maximum number of end nodes of some existing requests. Coupled paths reduce the total number of hops need to be traversed by a failure signal and, hence, potentially reduces the overall recovery time. We show that the problem of finding a pair of disjoint and most coupled paths is NP‐complete. Accordingly, we propose an efficient and fast protection algorithm called SPXP—Segment Pre‐Cross‐Connected Protection, to allocate disjoint and most coupled paths. The proposed SPXP algorithm reduces the recovery time by ensuring that backup resources are pre‐configured along each backup segment and, hence, is readily available upon a failure. Simulation results for different incremental traffic models and network topologies show that, for most cases, the proposed SPXP exhibits better performance in terms of blocking probability, resource usage, and recovery time compared with existing protection schemes. Copyright © 2010 John Wiley & Sons, Ltd.     

Self‐optimization of handover parameters for dynamic small‐cell networks

Seamless handover is an essential feature of cellular networks. For small‐cell networks, effective handover becomes particularly challenging. If some cells may be activated and deactivated dynamically, effective handover handling will become even more difficult. A key factor of good handover performance is “handover timing,” that is, making handover decision at a right time. If handover is executed too early or too late, users will experience temporary link disconnection, called radio link failure (RLF). Handover timing is controlled by handover parameters, which are set by the network. RLF prevention is directly related to the proper configuration of these parameters. In this paper, we propose a self‐optimization scheme that adjusts the handover parameters to minimize RLFs for dynamic small‐cell networks. Our scheme first detects the types of RLF and then adjusts the handover parameters according to the types of RLF. Unlike most existing schemes, our scheme adjusts both system common parameters and cell‐specific parameters together. In certain situations, such as when two adjacent cells do not have sufficient coverage overlap, RLFs may not be reduced to a satisfactory level by the handover parameter adjustment alone. To deal with such a case, our scheme adjusts the cell coverage in conjunction with the handover parameter optimization. The simulation results show that the proposed scheme can virtually eliminate RLFs. Copyright © 2013 John Wiley & Sons, Ltd.     

QoE‐based pseudo heartbeat message compression mechanism for future wireless network

Wireless multimedia services are increasingly becoming popular, which boosts the need for better quality‐of‐experience (QoE). However, there are many aspects leading to the degradation of real‐time video QoE, especially, a large number of always‐on‐line (AOL) applications existing in future wireless networks transmit heartbeat message periodically to keep always‐on, and hence induce heavy signaling costs and overload wireless networks. In this paper, we propose QoE‐based pseudo heartbeat message compression mechanism to reduce the number of signaling loads in the radio access network by intercepting the heartbeat message at a certain frequency in the proxy client. To maintain the protocol feature of the AOL applications, the heartbeat messages are reconstructed by the proxy server and sent to the application server. Furthermore, to analyze the influence of this mechanism on the video user, a new QoE perception model is proposed. Finally, combined the QoE perception model for video services with AOL services, the utility function for joint optimization multi‐services is developed to determine the optimum compression frequency. The simulation results show that the proposed mechanism greatly alleviates the signaling load and leads to a significant performance improvement on the QoE of video users, while a slight decrease in the QoE of AOL users. Copyright © 2016 John Wiley & Sons, Ltd.     

Automated optimization for memory‐efficient high‐performance deep neural network accelerators

The increasing size and complexity of deep neural networks (DNNs) necessitate the development of efficient high‐performance accelerators. An efficient memory structure and operating scheme provide an intuitive solution for high‐performance accelerators along with dataflow control. Furthermore, the processing of various neural networks (NNs) requires a flexible memory architecture, programmable control scheme, and automated optimizations. We first propose an efficient architecture with flexibility while operating at a high frequency despite the large memory and PE‐array sizes. We then improve the efficiency and usability of our architecture by automating the optimization algorithm. The experimental results show that the architecture increases the data reuse; a diagonal write path improves the performance by 1.44× on average across a wide range of NNs. The automated optimizations significantly enhance the performance from 3.8× to 14.79× and further provide usability. Therefore, automating the optimization as well as designing an efficient architecture is critical to realizing high‐performance DNN accelerators.     

An Ant-Based Approach for Dynamic RWA in Optical WDM Networks

In this paper, we propose a new ant-based algorithm for the dynamic routing and wavelength assignment (RWA) problem in optical WDM networks under the wavelength continuity constraint. Unlike conventional approaches, which usually require centralized global network information, our new RWA algorithm constructs the routing solution in a distributed manner by means of cooperative ants. To facilitate the ants’ foraging task, we adopt in our algorithm a probabilistic routing table structure for route selection. The new algorithm is highly adaptive in that it always keeps a suitable number of ants in the network to cooperatively explore the network states and continuously update the routing tables, so that the route for a connection request can be determined promptly by the current states of routing tables with only a small setup delay. Some new schemes for path scoring and path searching are also proposed to enhance the performance of our ant-based algorithm. Extensive simulation results upon three typical network topologies indicate that the proposed algorithm has a very good adaptability to traffic variations and it outperforms both the fixed routing algorithm and the promising fixed–alternate routing algorithm in terms of blocking probability. The ability to guarantee both a low blocking probability and a small setup delay makes the new ant-based routing algorithm very attractive for both the optical circuit switching networks and future optical burst switching networks     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

光网络中的波带交换技术

波分复用光网络已成为广域骨干网最可行的体系解决方案.波带交换(WBS)因其能减小光交叉连接器的端口数、控制复杂性和连接费用等,引起了广泛的关注.文章指出了WBS和传统波长路由的不同之处,对WBS的两种多粒度光交叉连接器结构进行了分析.文中还提出了基于WBS的各种方案和光路成组策略,讨论了WBS网络中的波带转换和故障恢复问题.     

多域光网络中基于优先级的波长路由分配算法

本文提出一种在多域光网络中基于优先级的路由波长分配算法.算法设计旨在解决复杂网络拓扑下,多任务请求路由波长分配问题.本文首先根据复杂网络拓扑情况与任务请求状况,完成多域的划分,对跨域任务的最短路由进行路由分裂;其次依据域内与域间优先级设定策略,完成多任务请求优先级设定;按照优先级顺序,采用模糊优化波长分配算法完成波长分配.仿真结果表明本算法在处理复杂网络拓扑、多任务路由波长分配问题上效果明显,有效的降低了网络请求阻塞率,提高了光网络资源利用率.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

Optimal power‐aware relay placement for cooperative wireless sensor networks

We study the problem of optimizing the symbol error probability (SEP) performance of cluster‐based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, similar line of research on optimal power allocation (for the source and relay nodes) can be found in literature. However, to achieve the best SEP performance at the destination of a cooperative wireless sensor network, joint optimization of power allocation and relay placement should be accomplished. To this aim, we reformulate the SEP of a multi‐hop cooperative communication in a general form and optimize transmitted power level and relay placement simultaneously. This analysis is developed for both amplify‐and‐forward and decode‐and‐forward relaying protocols. Simulation results demonstrate that the proposed joint optimization can effectively improve the SEP performance of the network. Copyright © 2013 John Wiley & Sons, Ltd.     

Distributed radio access technology selection for adaptive networks in high‐speed,B3G infrastructures

Wireless systems migrate towards the era of ‘Beyond the 3rd Generation’ (B3G). A fundamental facilitator of this vision is the evolution of high speed, adaptive networks, needed for better handling the offered demand and improving resource utilization. Adaptive networks dynamically select their configuration, in order to optimally adapt to the changing environment requirements and conditions. This paper presents optimization functionality that can be used to support network adaptability (cognition‐reconfigurability) in a B3G context. The paper starts from the business case that justifies the need for placing research onto adaptive networks and then continues with the management functionality for (re)configuration decisions, which is targeted to the dynamic selection of the appropriate radio access technologies (RATs). RAT selection is modelled through an optimization problem called (RAT, Demand and QoS‐Assignment problem—RDQ‐A), the solution of which assigns in a distributed manner the available RATs to adaptive Base Station transceivers and the demand (users) to these transceivers and to QoS levels, respectively. The RDQ‐A optimization problem is decoupled in several sub‐problems and is implemented in phases corresponding to the aforementioned assignments, while efficient custom greedy algorithms are mobilized in each phase for obtaining the optimum assignment. Finally, indicative results from the application of the proposed functionality to a simulated network are presented. Copyright © 2006 John Wiley & Sons, Ltd.     

A Node-Level Blocking Probability Analysis for WRONs

This work presents the blocking performance of a single node with (full or limited) wavelength conversion in wavelength routed optical networks (WRON) based on the theory of probability. A blocking probability model is proposed. Particularly, we pay more attention to investigate wavelength routing node performance improvement by using the more feasible case of limited wavelength conversion. Based on our analytical model, we calculate the blocking probability for a single wavelength routing node and then make a simulation to validate it. It is shown that a node with low conversion degrees having a small number of fiber link ports and a large number of wavelengths per link is a more realistic choice.     

Call admission control for non‐geostationary orbit satellite networks and other capacity‐varying networks

Many networks, such as non‐geostationary orbit satellite (NGOS) networks and networks providing multi‐priority service using advance reservations, have capacities which vary over time for some or all types of calls carried on these networks. For connection‐oriented networks, call admission control (CAC) policies which only use current capacity information may lead to excessive and intolerable dropping of admitted calls whenever the network capacity decreases. Thus novel CAC policies are required for these networks. We present the admission limit curve (ALC) and prove it is a constraint limiting the conditions under which any causal CAC policy may admit calls and still meet call dropping guarantees on an individual call basis. The ALC also leads to a lower bound on the call blocking performance achievable by any causal CAC policy which provides dropping guarantees to individual calls. Also, we introduce a new CAC policy which uses knowledge of future capacity changes to provide dropping guarantees on an individual call basis and which achieves blocking performance close to the lower bound. Copyright © 2000 John Wiley & Sons, Ltd.