基于约束路由的绿色虚拟拓扑设计算法

摘 要：针对Internet核心网日益严重的能耗问题,建立了绿色虚拟拓扑设计(GVTD)问题的形式化模型,通过业务汇聚、按需配置网络资源、动态虚拟拓扑设计和多粒度睡眠机制降低网络能耗。提出了一种基于约束路由的启发式算法——CBR-GVTD算法,利用单跳路由和多跳路由相结合的方法构建网络虚拟拓扑,并通过基于约束的路由实现网络功耗与路由性能的折衷。模拟结果表明,CBR-GVTD算法可在接口平均利用率为80%~90%和最大路由跳数不超过5的条件下,最多可降低62%~90%的网络功耗     

Green optical backbone networks: virtual topology adaptation using a page rank‐based rating system

An energy‐aware virtual topology rating system is proposed in this work, which can be utilized as a tool during the virtual topology reconfiguration procedure in an optical backbone network in order to reduce its energy consumption. It is well known that maintaining a static virtual topology in Internet Protocol (IP)‐over‐Wavelength Division Multiplexing (WDM) networks is not energy‐efficient. To that end, virtual topology adaptation algorithms have been developed to adjust the virtual topology to the constantly fluctuating traffic load. While these algorithms achieve significant energy savings, further reduction on the total network energy consumption can be achieved through the proposed rating system. The proposed rating system is a modified version of the page rank algorithm, which ranks websites in the Internet based on their importance. The proposed rating system attributes ratings to lightpaths, which indicate the relative significance of a lightpath in the virtual topology in terms of energy consumption. The rating can be used during the routing procedure as an energy efficiency indicator, in order to increase the number of lightpaths that are deactivated from the reconfiguration mechanism and increase the utilization per lightpath. The proposed reconfiguration scheme (page rank‐based virtual topology reconfiguration) achieves up to 12% additional energy savings in comparison to an existing virtual topology reconfiguration algorithm at the cost of slightly increased average hop distance. Copyright © 2015 John Wiley & Sons, Ltd.     

Energy‐aware traffic allocation to optical lightpaths in multilayer core networks

The amount of traffic that is generated by users and high‐demanding services is expected to rise dramatically in the forthcoming years. This will unavoidably deteriorate the performance and increase the consumed energy of core networks, thus constraining the growth of Internet. To this effect, multilayer traffic engineering schemes in IP/multiprotocol label switching over dense wavelength division multiplexing networks have been proposed for achieving improved performance and increased energy savings by flexibly allocating traffic to optical lightpaths. In particular, the consumed energy in a router can be minimized if the lightpaths are established so as to traverse a router without electronic processing and conversion of their signal between optical and electrical layer. Accordingly, this paper aims at providing an energy‐aware solution to the problem of traffic allocation to optical lightpaths in multilayer core networks. The problem is first formulated and then a solution based on a heuristic algorithm, called energy‐aware traffic allocation to optical lightpaths (ETAL) is proposed. The efficiency and worthiness of ETAL is validated through numerous scenarios and simulations. The derived results indicate that the proposed algorithm is an efficient traffic engineering solution that exhibits better performance in terms of consumed energy (up to 44%), when compared to other similar traffic allocation schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

An energy‐efficient localized topology control algorithm for wireless ad hoc and sensor networks

Topology control plays an important role in the design of wireless ad hoc and sensor networks and has demonstrated its high capability in constructing networks with desirable characteristics such as sparser connectivity, lower transmission power, and smaller node degree. However, the enforcement of a topology control algorithm in a network may degrade the energy‐draining balancing capability of the network and thus reduce the network operational lifetime. For this reason, it is important to take into account energy efficiency in the design of a topology control algorithm in order to achieve prolonged network lifetime. In this paper, we propose a localized energy‐efficient topology control algorithm for wireless ad hoc and sensor networks with power control capability in network nodes. To achieve prolonged network lifetime, we introduce a concept called energy criticality avoidance and propose an energy criticality avoidance strategy in topology control and energy‐efficient routing. Through theoretical analysis and simulation results, we prove that the proposed topology control algorithm can maintain the global network connectivity with low complexity and can significantly prolong the lifetime of a multi‐hop wireless network as compared with existing topology control algorithms with little additional protocol overhead. Copyright © 2008 John Wiley & Sons, Ltd.     

Energy‐aware virtual multi‐input‐multi‐output‐based routing for wireless ad hoc networks

Virtual multi‐input‐multi‐output (vMIMO) technology is becoming a promising way to improve the energy efficiency of wireless networks. Previous research always builds up the vMIMO‐based routing on the fixed structure such as clusters, and the MIMO mode is omitted in most cases. So, they cannot fully explore the advantage of vMIMO in routing. In this paper, we study a general routing scheme in which no fixed structure is required, and any communication mode of vMIMO is allowed for sake of the energy efficiency. We define two vMIMO‐based routing problems aiming to energy‐minimization and lifetime‐optimization. The first problem can be solved by our distributed energy‐minimum vMIMO‐based algorithm. The algorithm constructs the virtual cooperative graph, and applies the shortest path method on the virtual cooperative graph to solve this problem. The second problem is non‐deterministic polynomial‐time hard, and we design the distributed lifetime‐oriented vMIMO‐based algorithm, which is based on the modified Bellman‐Ford method. It can reach approximation ratio of four. The simulations show that our algorithms can work well in many situations. For example, distributed lifetime‐oriented vMIMO‐based algorithm can prolong the lifetime about 20.2% in dense topologies compared with the cooperative routing algorithm on average. Copyright © 2015 John Wiley & Sons, Ltd.     

Time‐aware and energy‐efficient opportunistic routing with residual energy collection in wireless sensor networks

In 1‐dimensional queue wireless sensor networks, how to balance end‐to‐end latency and energy consumption is a challenging problem. However, traditional best path routing and existing opportunistic routing protocols do not address them well because relay hop counts are usually much more, and the link appears more unreliable compared with general mesh topology. In this work, we formulate these 2 problems as a multiobjective optimization problem. Specifically, we first classify network packets into types of time tolerant and time critical and introduce a residual energy collection mechanism of neighboring nodes for forwarder set selection. We then propose a time‐aware and energy‐efficient opportunistic routing protocol (TE‐OR) to optimize energy consumption and to reduce latency for time‐critical packets. We evaluate TE‐OR by different parameters and compare it with existing protocols. The performance results show that TE‐OR achieves a trade‐off between energy consumption and time delay and balances energy consumption among nodes while guaranteeing the latency of time‐critical packets is minimized.     

Link optimization for energy‐constrained wireless networks with packet retransmissions

With the objective to minimize the energy consumption for packet based communications in energy‐constrained wireless networks, this paper establishes a theoretical model for the joint optimization of the parameters at the physical layer and data link layer. Multilevel quadrature amplitude modulation (MQAM) and automatic repeat request (ARQ) techniques are considered in the system model. The optimization problem is formulated into a three dimensional nonlinear integer programming (NIP) problem with the modulation order, packet size, and retransmission limit as variables. For the retransmission limit, a simple search method is applied to degenerate the three dimensional problem into a two dimensional NIP problem, for which two optimization algorithms are proposed. One is the successive quadratic programming (SQP) algorithm, combining with the continuous relaxation based branch‐and‐bound method, which can obtain the global optimal solution since the continuous relaxation problem is proved to be hidden convex. The other is a low‐complexity sub‐optimal iterative algorithm, combining with the nearest‐neighboring method, which can be implemented with a polynomial complexity. Numerical examples are given to illustrate the optimization solution, which suggests that the joint optimization of the physical/data link layer parameters contributes noticeably to the energy saving in energy‐constrained wireless networks. Copyright © 2010 John Wiley & Sons, Ltd.     

Multi‐topology routing based egress selection approach to achieve hybrid intra‐AS and inter‐AS traffic engineering

Hot‐potato routing is a border gateway protocol policy that selects the ‘closest’ egress router in terms of interior gateway protocol cost. This policy imposes inherent interactions between intra‐AS (Autonomous System) and inter‐AS traffic engineering. In light of this observation, we present a hybrid intra‐AS and inter‐AS traffic engineering scheme named egress selection based upon hot potato routing. This scheme involves link weight optimization, which can not only minimize the time that IP (Internet Protocol) packets travel across the network by assigning specified egress router but also balance the load among the internal links of the transit network. Egress selection based upon hot potato routing also incorporates multi‐topology routing technique to address the problem that one set of link weights might not guarantee specified egress routers. Accordingly, we formulate the link weights optimization problem using multi‐topology routing as a mixed integer linear programming model. And we present a new heuristic algorithm to make the problem tractable. Numerical results show that only a few topologies are needed to guarantee specified egress router, and maximum link utilization is also reduced. Copyright © 2014 John Wiley & Sons, Ltd.     

An energy‐efficient algorithm based on sleep‐scheduling in IP backbone networks

This paper relates to the problem of energy conservation in Internet backbone networks. We propose a new Distributed Green Algorithm based on Sleep‐scheduling (DGAS) to switch off some network links and nodes resulting in less energy consumption. Our solution does not depend on any centralized controller and uses a link‐state protocol like Open Shortest Path First to share required information. In addition, DGAS does not require any knowledge of traffic matrix and switches off network nodes and links in 2 phases. In the first phase, some core nodes are switched off on the basis of their usage in network paths. In the second phase, DGAS starts with a minimal topology on the basis of resulted topology from the first phase and adds some links to it to minimize network paths length. Results, obtained by several real network scenarios, show that DGAS can switch off up to 27% of core nodes and up to 80% of links compared to the maximum number of switchable links.     

Towards energy efficiency in virtual topology design of elastic optical networks

Elastic optical networks offer a reliable platform for achieving energy efficiency by supporting extensive optical grooming of variable‐rate data traffic along with the traditional electrical data aggregation methods. The procedure of routing and spectrum allocation in a topology of nodes has explicit effect to the amount of consumed power. A new energy‐efficient method for designing the virtual topology in IP‐over‐elastic networks is introduced and evaluated. It is concluded that it consumes less power under different elastic transponder types, it designs the virtual topology using fewer transponders, and finally, there is a slight increase in the number of end‐to‐end lightpath hops. The proposed method is characterized by high performance and low lightpath establishment complexity. Therefore, it is suitable for a broad range of network configurations and transponder types.     

Dynamic link sleeping reconfigurations for green traffic engineering

The high volume of energy consumption has become a great concern to the Internet community because of high energy waste on redundant network devices. One promising scheme for energy savings is to reconfigure network elements to sleep mode when traffic demand is low. However, due to the nature of today's traditional IP routing protocols, network reconfiguration is generally deemed to be harmful because of routing table reconvergence. To make these sleeping network elements, such as links, robust to traffic disruption, we propose a novel online scheme called designate to sleep algorithm that aims to remove network links without causing traffic disruption during energy‐saving periods. Considering the nature of diurnal traffic, there could be traffic surge in the network because of reduced network capacity. We therefore propose a complementary scheme called dynamic wake‐up algorithm that intelligently wakes up minimum number of sleeping links needed to control such dynamicity. This is contrary to the normal paradigm of either reverting to full topology and sacrificing energy savings or employing on‐the‐fly link weight manipulation. Using the real topologies of GEANT and Abilene networks respectively, we show that the proposed schemes can save a substantial amount of energy without affecting network performance.     

IP/ MPLS over WDM网中考虑QoS的VPN业务设计

本文研究了在IP／MPLS over WDM网络中支持不同QoS要求的VPN业务的逻辑拓扑设计问题。对于给定的网络物理拓扑和业务需求矩阵，本文提出，基于不同时延要求的VPN业务逻辑拓扑设计可以运用两种方法加以解决。一为基于迭代的线性规划方法，适合于规模较小的网络。另一个为启发式算法，可运用于网络规模较大的环境。对比仿真结果表明，启发式算法不但较好地解决了不同QoS要求的VPN业务的选路和波长分配问题，还较好地降低了链路的最大负载。     

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.     

Load‐balanced data gathering in Internet of Things using an energy‐aware cuckoo‐search algorithm

This paper deals with the lifetime problem in the Internet of Things. We first propose an efficient cluster‐based scheme named “Cuckoo‐search Clustering with Two‐hop Routing Tree (CC‐TRT)” to develop a two‐hop load‐balanced data aggregation routing tree in the network. CC‐TRT uses a modified energy‐aware cuckoo‐search algorithm to fairly select the best cluster head (CH) for each cluster. The applied cuckoo‐search algorithm makes the CH role to rotate between different sensors round by round. Subsequently, we extend the CC‐TRT scheme to present two methods for constructing multi‐hop data aggregation routing trees, named “Cuckoo‐search Clustering with Multi‐Hop Routing Tree (CC‐MRT)” and “Cuckoo‐search Clustering with Weighted Multi‐hop Routing Tree (CC‐WMRT).” Both CC‐MRT and CC‐WMRT rely on a two‐level structure; they not only use an energy‐aware cuckoo‐search algorithm to fairly select the best CHs but also adopt a load‐balanced high‐level routing tree to route the aggregated data of CHs to the sink node. However, CC‐WMRT slightly has a better performance thanks to its low‐level routing strategy. As an advantage, the proposed schemes balance the energy consumption among different sensors. Numerical results show the efficiency of the CC‐TRT, CC‐MRT, and CC‐WMRT algorithms in terms of the number of transmissions, remaining energy, energy consumption variance, and network lifetime.     

On energy‐efficient aggregation routing and scheduling in IEEE 802.15.4‐based wireless sensor networks

In wireless sensor networks, continued operation of battery‐powered devices plays a crucial role particularly in remote deployment. The lifetime of a wireless sensor is primarily dependent upon battery capacity and energy efficiency. In this paper, reduction of the energy consumption of heterogeneous devices with different power and range characteristics is introduced in the context of duty scheduling, dynamic adjustment of transmission ranges, and the effects of IEEE 802.15.4‐based data aggregation routing. Energy consumption in cluster‐based networks is modeled as a mixed‐integer linear and nonlinear programming problem, an NP‐hard problem. The objective function provides a basis by which total energy consumption is reduced. Heuristics are proposed for cluster construction (Average Energy Consumption and the Maximum Number of Source Nodes) and data aggregation routing (Cluster‐based Data Aggregation Routing) such that total energy consumption is minimized. The simulation results demonstrate the effectiveness of balancing cluster size with dynamic transmission range. The heuristics outperform other modified existing algorithms by an average of 15.65% for cluster head assignment, by an average of 22.1% for duty cycle scheduling, and by up to 18.6% for data aggregation routing heuristics. A comparison of dynamic and fixed transmission ranges for IEEE 802.15.4‐based wireless sensor networks is also provided. Copyright © 2012 John Wiley & Sons, Ltd.     

A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks

In this paper, we have developed an integrated online algorithm for dynamic routing of bandwidth guaranteed label switched paths (LSPs) in IP-over-WDM optical networks. Traditionally, routing at an upper layer (e.g., IP layer) is independent of wavelength routing at the optical layer. Wavelength routing at the optical layer sets up a quasi-static logical topology which is then used at the IP layer for IP routing. The coarse-grain wavelength channels and the pre-determined virtual topologies with respect to some a priori assumed traffic distribution are barriers to efficient resource use and inflexible to changing traffic. We take into account the combined knowledge of resource and topology information at both IP and optical layers. With this added knowledge, an integrated routing approach may extract better network efficiencies, be more robust to changing traffic patterns at the IP layer than schemes that either use dynamic routing information at the IP layer or use a static wavelength topology only. LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one-by-one. There is no a priori knowledge regarding the arrivals and characteristics of future LSP set-up requests. Our proposed algorithm considers not only the importance of critical links, but also their relative importance to routing potential future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP requests with bandwidth requirements. Moreover, link residual bandwidth information that captures the link's capability of routing future LSPs is also incorporated into route calculation. Extensive simulation was conducted to study the performance of our proposed algorithm and to compare it with some existing ones, such as the integrated minimum hop routing algorithm and the maximum open capacity routing algorithm. Simulation results show that our proposed algorithm performs better than both routing algorithms in terms of the number of LSP set-up requests rejected and the total available bandwidth between router pairs.     

QoS‐aware cross‐domain collaborative energy‐saving mechanism for FiWi virtual networks

The fiber‐wireless (FiWi) access network is a very promising solution for next‐generation access networks. Because of the different protocols between its subnets, it is hard to globally optimize the operation of FiWi networks. Network virtualization technology is applied to FiWi networks to realize the coexistence of heterogeneous networks and centralized control of network resource. The existing virtual resource management methods always be designed to optimize virtual network (VN) request acceptance rate and survivability, but seldom consider energy consumption and varied requirements of quality of service (QoS) satisfaction, which is a hot and important topic in the industrial field. Therefore, this paper focuses on the QoS‐aware cross‐domain collaborative energy saving mechanism for FiWi virtual networks. First, the virtual network embedding (VNE) model, energy consumption model, and VNE profit model of FiWi networks are established. Then, a QoS‐aware in‐region VN embedding mechanism is proposed to guarantee service quality of different services. After that, an underlying resource updating mechanism based on energy efficiency awareness is designed to realize low‐load ONU and wireless routers co‐sleep in FiWi networks. Finally, a QoS‐aware re‐embedding mechanism is presented to allocate proper resource to the VNs affected by the sleeping mechanism. Especially for video VNs, a re‐embedding scheme which adopts traffic splitting and multipath route is introduced to meet resource limitation and low latency. Simulation results show that the proposed mechanism can reduce FiWi network's energy consumption, improve VNE profit, and ensure high embedding accepting rate and strict delay demand of high‐priority VNs.     

A novel energy‐aware routing mechanism for SDN‐enabled WSAN

Energy consumption is one of the most important design constraints when building a wireless sensor and actuator network since each device in the network has a limited battery capacity, and prolonging the lifetime of the network depends on saving energy. Overcoming this challenge requires a smart and reconfigurable network energy management strategy. The Software‐Defined Networking (SDN) paradigm aims at building a flexible and dynamic network structure, especially in wireless sensor networks. In this study, we propose an SDN‐enabled wireless sensor and actuator network architecture that has a new routing discovery mechanism. To build a flexible and energy‐efficient network structure, a new routing decision approach that uses a fuzzy‐based Dijkstra's algorithm is developed in the study. The proposed architecture can change the existing path during data transmission, which is the key property of our model and is achieved through the adoption of the SDN approach. All the components and algorithms of the proposed system are modeled and simulated using the Riverbed Modeler software for more realistic performance evaluation. The results indicate that the proposed SDN‐enabled structure with fuzzy‐based Dijkstra's algorithm outperforms the one using the regular Dijkstra's and the ZigBee‐based counterpart, in terms of the energy consumption ratio, and the proposed architecture can provide an effective cluster routing while prolonging the network lifetime.     

Applying PTF/VTF routing policies in multilayer IP/MPLS-based ASON/GMPLS multi-domain networks

The IP/MPLS-based ASON/GMPLS hybrid network architecture enables the interaction between the IP layer and the optical dense wavelength division multiplexing (DWDM) layer. This architecture makes it possible to transfer huge amounts of traffic data on DWDM networks, while supporting Internet Protocol (IP)-based service applications. Additionally, this architecture provides a unified routing scenario, which allows the dynamic routing in both the IP layer and/or optical layer. Cross- layer routing has been addressed in single domain networks scenarios, where the routing policies Physical Topology First (PTF) and Virtual Topology First (VTP) have been proposed and applied. However, applying cross-layer routing using both routing topology policies PTF and VTF has not been investigated in a multi-domain networks scenario yet. In this study, we address this issue and propose a routing scheme to establish traffic connections in the optical WDM layer and the IP layer, which makes the applicability of PTF and VTF in multilayer multi-domain network feasible.