多光纤WDM网中的QoS路由算法

利用区分光业务(DOS)模型可以将WDM光传送网中客户层(如IP)具有不同QoS要求的业务汇聚力较粗粒度的流,直接映射到光信道上,从而使客户层业务的不同QoS要求可以体现在DOS域的边缘光节点处的光路建立请求的不同优先级上。该文首先探讨了如何将多光纤WDM网转化为波长图,从而一次性解决选路和分配波长(RWA)问题,在此基础上,提出两种用于多光纤WDM网的QoS路由算法,对二者进行了比较,并进行了计算机仿真。     

Survivable WDM mesh networks

In a wavelength-division-multiplexing (WDM) optical network, the failure of network elements (e.g., fiber links and cross connects) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect a mesh-based WDM optical network from such failures. These approaches are based on two survivability paradigms: 1) path protection/restoration and 2) link protection/restoration. The study examines the wavelength capacity requirements, and routing and wavelength assignment of primary and backup paths for path and link protection and proposes distributed protocols for path and link restoration. The study also examines the protection-switching time and the restoration time for each of these schemes, and the susceptibility of these schemes to multiple link failures. The numerical results obtained for a representative network topology with random traffic demands demonstrate that there is a tradeoff between the capacity utilization and the susceptibility to multiple link failures. We find that, on one hand, path protection provides significant capacity savings over link protection, and shared protection provides significant savings over dedicated protection; while on the other hand, path protection is more susceptible to multiple link failures than link protection, and shared protection is more susceptible to multiple link failures than dedicated protection. We formulate a model of protection-switching times for the different protection schemes based on a fully distributed control network. We propose distributed control protocols for path and link restoration. Numerical results obtained by simulating these protocols indicate that, for a representative network topology, path restoration has a better restoration efficiency than link restoration, and link restoration has a faster restoration time compared with path restoration.     

Energy and delay aware routing algorithm for fiber-wireless networks

Access networks consume significant portion of the overall energy consumed by internet. The power consumption growth rate of internet is higher than any other consumer of energy. With the introduction of more and more bandwidth hungry applications, there is a huge pressure to reduce network energy consumption while still growing network capacity and functionality. We propose an energy and delay aware routing algorithm for fiber-wireless (FiWi) networks (EDAR) which not only reduce the energy consumption of the FiWi networks and but also does not degrade the overall delay of the network. We introduce dynamic thresholds for switching nodes into sleep and active mode. Our analyses show a significant reduction in the energy consumption of the FiWi networks while keeping the performance of the network up to an acceptable limit.     

Design of node configuration for all-optical multi-fiber networks

It is cost-effective to install multiple fibers in each link of an all-optical network, because the cost of fibers is relatively low compared with the installation cost. The resulting network can provide a large capacity for good quality of service, future growth, and fault tolerance. If a node has more incoming/outgoing fibers, it requires larger optical switches. Using the current photonic technology, it is difficult to realize large optical switches. Even if they can be realized, they are expensive. To overcome this problem, we design a node configuration for all-optical networks. We exploit the flexibility that, to establish a lightpath across a node, we can select any one of the available channels in the incoming link and any one of the available channels in the outgoing link. As a result, the proposed node configuration requires significantly smaller optical switches while it can result in nearly the same blocking probability as the existing one. We demonstrate that a good network design is to adopt the proposed node configuration and slightly more fibers in each link, so that the network requires small optical switches while it has a small blocking probability     

多光纤波分复用网的一种新的备用路由算法

基于经典的LLR算法,研究了波分复用光网络的路由问题,提出了一种用于多光纤网的新算法—LLHR,该算法综合考虑了链路负载和路由跳数两个因素。文章深入研究了网络光纤数、备用路由数和网络负载对算法性能的影响。计算机仿真结果表明,与LLR算法相比,该算法能有效降低网络的阻塞率,提高网络的性能。     

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.     

EBvN: efficient BvN in multi-fiber/multi-wavelength overlaid-star optical networks

Overlaid-star networks with reservation-based scheduling could be appropriate networks for metro areas. The Birkhoff?Cvon Neumann (BvN) scheduling could be used at the core nodes of an overlaid network to schedule lossless traffic transmission among edge nodes. The common method is to schedule traffic separately for each wavelength channel, called separated BvN (SBvN) scheduling in this paper. However, SBvN cannot schedule all traffic demands, especially at high-traffic loads. In this paper, the BvN scheduling procedure is modified to efficiently schedule traffic in overlaid-star networks with multi-fiber/multi-wavelength architecture, called efficient BvN (EBvN). Instead of using one processor to schedule traffic on one wavelength channel in each core node, the proposed EBvN technique uses only one processor to schedule all traffic demands on all fibers/wavelength channels at the same time. Performance evaluation results under both uniform and non-uniform traffic distributions show that more traffic demands can be scheduled under EBvN compared with SBvN. In addition, the scheduling speed of EBvN is mostly faster than SBvN. Finally, EBvN can provide bound on the maximum scheduling time of EBvN. As a trade-off between scheduling time and residual traffic, EBvN with filling empty cells (EBvN_FEC) is proposed that can reduce residual traffic, but at the expense of slightly increasing scheduling time. EBvN_FEC is more effective than EBvN under non-uniform traffic distribution.     

On the performance of different node configurations in multi-fiber optical packet-switched networks

With the development of optical packet-switching (OPS) technologies, multi-fiber OPS networks will play an important role in the future data transmissions. In such networks, instead of constructing some extremely expensive node configurations with strictly non-blocking switching function, a more practical solution is multi-board switches that contain a number of small-sized switching boards. In this article, we have evaluated the performance of several different multi-board switches, based on the following two main objectives: (i) better understanding the effects of different connection schemes between switching boards and optical buffers and (ii) investigating possible schemes for achieving comparable performance to that of the ideal, strictly non-blocking switches. Extensive simulation results have shown that unlike circuit-switched net- works, multi-board OPS cannot easily perform comparably to the strictly non-blocking switch by having slightly more fibers per link. Also, such a problem can be tackled by several different approaches. The most efficient one is to equip the switch with more buffers rather than to increase the switching-board size or to enhance the buffer sharing between different switching boards.     

Survivable wireless networking — Autonomic bandwidth sharing in mesh networks

Mesh networking has recently received considerable attention, largely as a mechanism for providing enhanced connectivity without the need to install additional expensive infrastructure. It relies on the fact that underutilised local area connectivity can be used to connect constrained devices to those that possess wide-area uplink capabilities. However, at present, proposals for uplink bandwidth sharing are limited by the use of a traditional view of routing in which multiple end-user devices are associated with each individual uplink in such a way that all their off-network traffic is routed through that particular gateway. While this has the merit of simplicity, it is possible for a subset of gateways to be overloaded while others remain underutilised. We propose a new type of local mesh network, called the Coalition Peering Domain, the goal of which is to maximise Internet connectivity dynamically, smoothing out the usage of uplink capacity, albeit at the cost of slightly more complex control and management. Within this paper, we describe three main routing and addressing issues and then propose novel mechanisms that partially address those issues.     

Optimal deployment of large wireless sensor networks

A spatially distributed set of sources is creating data that must be delivered to a spatially distributed set of sinks. A network of wireless nodes is responsible for sensing the data at the sources, transporting them over a wireless channel, and delivering them to the sinks. The problem is to find the optimal placement of nodes, so that a minimum number of them is needed. The critical assumption is made that the network is massively dense, i.e., there are so many sources, sinks, and wireless nodes, that it does not make sense to discuss in terms of microscopic parameters, such as their individual placements, but rather in terms of macroscopic parameters, such as their spatial densities. Assuming a particular interference-limited, capacity-achieving physical layer, and specifying that nodes only need to transport the data (and not to sense them at the sources, or deliver them at the sinks once their location is reached), the optimal node placement induces a traffic flow that is identical to the electrostatic field created if the sources and sinks are replaced by a corresponding distribution of positive and negative charges. Assuming a general model for the physical layer, and specifying that nodes must not only transport the data, but also sense them at the sources and deliver them at the sinks, the optimal placement of nodes is given by a scalar nonlinear partial differential equation found by calculus of variations techniques. The proposed formulation and derived equations can help in the design of large wireless sensor networks that are deployed in the most efficient manner, not only avoiding the formation of bottlenecks, but also striking the optimal balance between reducing congestion and having the data packets follow short routes.     

Survivable virtual topology mapping in IP-over-WDM networks using differential evolution optimization

In IP-over-wavelength division multiplexing networks, a virtual topology is placed over the physical topology of the optical network. Given that a simple link failure or a node failure on the physical topology can cause a significant loss of information, an important challenge is to make the routing of the virtual topology on to the physical topology survivable. This problem is known as survivable virtual topology mapping (SVTM) and is known to be an NP-complete problem. So far, this problem has been optimally solved for small instances by the application of integer linear programming and has been sub-optimally solved for more realistic instances by heuristic strategies such as ant colony optimization and genetic algorithms. In this paper, we introduce the application of differential evolution (DE) to solve the SVTM problem and enhancements based on DE are proposed as well. Three algorithms based on DE are developed. The enhanced variants have better convergence rate, get better quality of solutions and require few control parameters. We present the impact of these parameters on the system’s performance improvement. Algorithms are evaluated in different test bench optical networks, as NSFnet and USA, demonstrating that the enhanced DE algorithm overcomes the other two, for small instances. The three algorithms reach a 100  survivable mapping for small instances. The three algorithms also find positive survivable mappings and reduce the network wavelength links. Results show the effectiveness and efficiency of the proposed algorithms.     

WDM网状网中基于光连接抗毁业务量疏导保护算法

研究了WDM网状网中基于光连接(connection)的抗毁业务量疏导通道(path)保护问题,以最大化网络的吞吐量为目标,提出了新的基于共享风险链路组(Shared Risk Link Group,SRL G)的共享保护算法和专用保护算法.并以NSFNET为仿真网络,比较说明了这两种算法在网络拥塞率和波长利用率方面的性能优劣.     

Survivable elastic optical networks: survey and perspective (invited)

Elastic optical networks (EONs) have been receiving extensive attention because of their inherent flexibility and the efficiency with which they allocate fiber-bandwidth. For an EON, survivability is of crucial importance because of the very high bandwidth that it carries on each optical channel. In this article, we review the current state of the art of survivable EONs which reviews the literature to summarize the following aspects: (a) spectrum resource sharing among backup lightpaths, (b) sharing of high-speed optical transponders, (c) effect of spectrum conversion, (d) bandwidth squeezed restoration (BSR), (e) joint restoration by multiple sub-band optical channels, (f) multi-layer survivability, and (g) energy efficiency. Apart from a summary on the current research status, we also discuss open research issues which are important to survivable EONs from the perspectives of (a) impact of spectrum conversion, (b) impact of elastic optical transponder configuration, (c) impact of physical layer impairments and limitations, (d) protection-path-based spectrum defragmentation, and (e) network availability.     

Survivable lightpath routing: a new approach to the design ofWDM-based networks

Network restoration is often done at the electronic layer by rerouting traffic along a redundant path. With wavelength-division multiplexing (WDM) as the underlying physical layer, it is possible that both the primary and backup paths traverse the same physical links and would fail simultaneously in the event of a link failure. It is, therefore, critical that lightpaths are routed in such a way that a single link failure would not disconnect the network. We call such a routing survivable and develop algorithms for survivable routing of a logical topology. First, we show that the survivable routing problem is NP-complete. We then prove necessary and sufficient conditions for a routing to be survivable and use these conditions to formulate the problem as an integer linear program (ILP). Due to the excessive run-times of the ILP, we develop simple and effective relaxations for the ILP that significantly reduces the time required for finding survivable routings. We use our new formulation to route various logical topologies over a number of different physical topologies and show that this new approach offers a much greater degree of protection than alternative routing schemes such as shortest path routing and a greedy routing algorithm. Finally, we consider the special case of ring logical topologies for which we are able to find a significantly simplified formulation. We establish conditions on the physical topology for routing logical rings in a survivable manner     

Survivable spectrum-shared ability in flexible bandwidth optical networks with distributed data centers

The survivable spectrum-shared ability problems are addressed by considering the shared-path protection in flexible bandwidth optical networks with distributed data centers. The overall objective of this paper is to investigate the effect of the spectrum-shared ability on the spectrum efficiency and the blocking probability of cloud service requests. We propose a survivable algorithm with the spectrum-shared ability (SA_SSA) to minimize blocking probability of cloud service requests and to improve the spectrum efficiency in shared-path protection. For comparison, an existing shared-path protection algorithm named Aggressive algorithm with spectrum-shared ability is also introduced. Simulation results show that, considering the different spectrum-shared abilities, our proposed SA_SSA has a better performance in terms of blocking probability, number of frequency slots/Erlang, spectrum occupation ratio, and spectrum redundancy ratio compared to Aggressive algorithm in flexible bandwidth optical networks with distributed data centers. Meanwhile, the spectrum efficiencies of the SA_SSA and Aggressive algorithms improve as the spectrum-shared abilities are strengthened.     

Energy-efficient node deployment strategy for wireless sensor networks

To balancing energy consumption in wireless sensor networks, we proposed a fixed time interval node broadcasting scheme under variational acceleration straight-line movement model. Simulation results show that the approach proposed in this paper has a superior performance on energy consumption balance compared to uniform broadcasting methods.     

Energy conserving movement-assisted deployment of ad hoc sensor networks

Sensor network deployment is very challenging due to hostile and unpredictable nature of usage environments. In this letter, we propose two methods for the self-deployment of mobile sensors. The first one is a randomized solution that provides both simplicity and applicability to different environments. Inspired by simulated annealing, it improves both speed and energy conservation of the deployment process. The other method is suggested for environments where sensors form a connected graph, initially. At the cost of this extra limitation, we gain considerable improvements.     

Survivable virtual concatenation for data over SONET/SDH in optical transport networks

Next-generation SONET/SDH technologies-namely, generic framing procedure, virtual concatenation, and link-capacity-adjustment scheme-enable network operators to provide integrated data and voice services over their legacy SONET/SDH infrastructure to generate new revenue. An important open research problem on data over SONET/SDH (DoS) is survivability: SONET automatic protection switching is too resource inefficient for data services, and the protection mechanisms of data networks are too slow for mission-critical applications. We propose two approaches for provisioning survivable DoS connections. Our approaches exploit the tradeoff between resource overbuild and fault-recovery time while utilizing the inverse-multiplexing capability of virtual concatenation to increase backup sharing. Our results show that one approach achieves low resource overbuild and much faster fault recovery than that of data networks, and the other approach achieves fast fault recovery comparable to SONET 50-ms protection (for typical U.S. backbone networks) while still achieving modest backup sharing. We further investigate the tradeoff between network blocking performance and network control and management complexity resulting from the number of paths M a connection can be inversely multiplexed onto: larger M leads to more freedom in routing and better network performance but increases network control and management complexity. Our results indicate that the network blocking performance for small values of M (e.g., M=2 for some representative backbone network topologies) is almost as good as the case in which M is infinity.     

可生存光纤—无线融合宽带接入网规划方法

光纤—无线融合（fiber-wireless,FiWi）宽带接入网的出现不仅为随时随地的灵活宽带接入提供了新的技术参考,同时也为可生存宽带接入网的低成本设计增加了研究契机。研究了可生存FiWi接入网的网络规划问题,提出一种基于无线重路由保护的可生存网络规划方法。当任意光纤链路断裂时,失效的光网络单元可通过无线重路由将业务转移到其他可用的光网络单元承载。重点解决了无线路由器部署、备份射频接口配置及光网络单元容量分配的联合优化问题,目标是通过最小化网络部署成本实现业务的完全保护。采用整数线性规划方法获得了小规模网络规划问题的最优解,同时提出了适用于大规模网络规划问题的启发式算法。仿真结果证实了所提方法在降低网络部署成本方面的有效性。