IP over WDM光网络的共享保护方式

共享保护方式是一种有效而又经济的保护方式。文章讨论了三种共享保护方式及各自的特点。使用交换光纤（OSF）的共享保护方式利用IP网络控制器来实现，主要应用于环形网络拓扑；利用OXC的共享保护方式基于多协议标记交换（MPLS）控制平面，可以用于任何网络拓扑结构；通过合理的逻辑拓扑而实现的共享保护则用于保护SONET/WDM和IP/WDM网络的设计。     

带有负载均衡机制的网状WDM网络抗毁策略研究

研究了带有负载均衡机制的抗毁网状WDM网络,旨在保证网络具有抗毁能力的同时尽量减少全网光域所使用的资源,即在选择工作路径和保护路径时尽量保证全网的负载均衡。以波长数量最小化为优化目标,建立规划模型分别对多纤网状WDM网络中的共享路径保护和共享链路保护策略进行了研究,同时辅以负载均衡机制对网络资源利用率进一步优化。仿真结果表明,该结构在保证网络抗毁性的同时,能够有效地减少全网总体所需的波长数,降低网络成本。     

一种新型的EPON保护结构

提出了一种EPON网络中共享支路光纤的Ⅴ型保护结构.在定量分析的基础上,对Ⅴ型保护结构结构和光纤全保护倒换方式进行生存性比较.通过MATLAB仿真分析证明,Ⅴ型保护结构具有与光纤全保护倒换方式相同的平均生存性,但支路光纤成本却是后者的1/2.     

一种光网络中可用性的计算方法

光纤骨干通信网中,一条光纤的断裂会引起大量业务中断.因此,对于每一条工作光路可配置一条链路分离的保护光路.采用共享通路保护时光路连接的可用性计算是网络设计时的重要问题.现对共享通路保护方式下光路连接可用性的计算给出了推导过程和一种明显的计算公式.最后给出实例,通过与仿真结果的比较验证了计算方法的正确性.     

WDM光网络中的共享通道保护方法

本文提出了全光网中提高资源利用率的共享保护方法,并把此方法与专用的预选路由保护方法做了比较,此外,从光纤数,波长数,业务强度,共享程度和拓朴结构对该保护方法做了详细的分析.结论表明共享保护通道可以极大提高网络的性能,使得网络阻塞率减低,提高网络资源利用率.     

弹性光网络中基于安全性感知的差异化虚拟光网络的映射策略

针对虚拟环境下底层网络中光纤的概率性故障,传统的100%保护至少需要配置一条保护路径,造成资源冗余度高和虚拟网络请求接受率低的问题,该文提出一种基于安全性感知的差异化虚拟光网络的映射(SA-DVNM)策略,在链路发生故障时为差异化虚拟网络请求提供安全保证。在SA-DVNM策略中,设计了一个综合考虑物理节点对之间跳数和相邻带宽大小的节点权重式避免链路映射过长,并提出路径频谱资源使用均衡的链路映射机制,最小化瓶颈链路的数量。当单路径传输失败时,SA-DVNM策略设计允许路径分割的资源分配机制,为保障时延敏感业务的安全性,SA-DVNM策略在路由选择中设计了基于时延差优化的多路径路由频谱分配方法。仿真结果表明该文所提策略在概率故障环境中能够降低带宽阻塞率,提高频谱资源利用率和虚拟光网络接受率。     

WDM光网络中基于链路的动态组播共享保护算法

针对WDM光网络中单链路失效的情况,提出了一种基于链路的保护动态组播业务的优化共享保护算法(Link-based optimized shared-protection algorithm for multicast sessions,LB-OSPM).该算法在对工作树任意光纤链路失效情况寻找保护路径时,允许组播内不同保护路径共享预留波长资源,同时通过引入预留波长使用情况矩阵和波长预留矩阵记录预留波长资源的使用情况,实现了不发生冲突的不同组播的保护链路间共享预留波长资源.研究采用欧洲光网络(European Optical Network,EON)的拓扑对不同波长资源配置和网络负载情况下LB-OSPM算法的网络连接阻塞率做了仿真.结果表明,通过引入共享机制,LB-OSPM算法在对单链路失效保证100％恢复率的同时可以获得更低的连接阻塞率,提高了波长资源利用效率.     

虚拟共享保护环的组网分析

当今各大运营商为减少投资成本,在传输网络中普遍存在共享光纤虚拟保护环的情况,为实现完全保护,达到组网灵活、简单的目的,本文介绍了几种针对虚拟共享保护环的组网方法,并对其进行分析比较,提出了较为简单、实用、安全的组网方式。     

小区光纤到户FTTH设计策略

在当今的网络信息化时代中,小区光纤到户已经成为一种普遍现象,而作为一项至关重要的宽带接入网技术,FTTH技术也开始备受关注。为实现FTTH技术的良好应用,文中对小区光纤到户工程中的FTTH设计策略进行了分析,包括FTTH及其接入方式概述、小区光纤到户FTTH模式设计、小区光纤到户FTTH设计中的光缆类型选择以及小区光纤到户FTTH光缆工程设计策略。希望可以为FTTH接入网技术的良好应用与小区光纤到户质量的提升提供一定参考。     

WDM网络动态组播业务管道失效保护

在光网络的建设中,为降低建设成本,多条链路往往经过同一条管道。在很多情况下,光纤链路的失效是由管道故障引起的,需要为网络的管道故障提供保护。该文研究了动态组播业务的单管道故障保护,给出了两种专有保护算法(SDP-DP和SDS-DP)和一种保护波长共享保护算法(SDS-SDP),并对各算法的连接阻塞率进行了仿真分析。仿真表明,在大部分情况下,由于SDS-SDP共享了连接请求之间的保护波长,SDS-SDP算法的连接阻塞率最低;而在低网络负载的情况下,SDP-DP算法有最低的连接阻塞率。     

GMPLS网络中的混合共享光路保护算法

提出了一种混合共享光路保护(HSLP)算法,用以解决通路保护方法中备份路径建立成功率低的问题.在本算法中,首先执行通路保护方法,如果备份路径建立失败,则动态划分工作路径段.用户的服务请求,包括恢复时间和可靠性等,可以通过限制备份路径的跳数来满足.仿真结果表明,HSLP 算法不仅能够获得较低的保护失败率,而且可以使资源利用率与平均恢复时间获得更好的折中.     

Topological Design and Lightpath Routing in WDM Mesh Networks: A Combined Approach

Multicommodity flow models are commonly used to formulate the logical topology design (LTD) problem and the lightpath routing (LR) problem as mixed integer linear programming (MILP) problems. In general, MILP formulations are intractable even for relatively small networks due to the combinatorial complexity of the problem. In this paper we propose improvements to these models and a method to solve the LTD and the LR problems in a combined manner. The interest is two fold: firstly, by tackling the two problems with separate models, problem instances of realistic size (up to 14 nodes in this paper) can be dealt with. Furthermore, different combinations of optimization models and objective functions can be investigated in a modular manner. Secondly, the mechanisms proposed to combine the problems allow to keep track of the global design problem when solving each individual step.     

ASON动态光通路建立的阻塞分析

光路阻塞率是智能光网络性能重要的度量指标之一.文章对影响自动交换光网络(ASON)阻塞率的因素进行了综述,对其中的两个因素:资源保留方式和波长变换器(WC)配置方式作了重点介绍.文章还应用曾用于电路交换网的基于通路图和Lee氏的计算方法近似地对阻塞率进行了计算.     

Optimal routing in circuit switched communication networks

Consideration is given to the optimal circuit routing problem in an existing circuit-switched network. The objective is to find circuit routing which accommodates a given circuit demand while maximizing the residual capacity of the network. In addition, the cost of accommodating the circuit demand should not exceed a given amount. Practical considerations require that a solution be robust to the variations in circuit demand and cost. The objective function for the optimal circuit routing problem is not a smooth one. In order to overcome the difficulties of nonsmooth optimization, the objective function is approximated by smooth concave functions. The optimization algorithm for the circuit routing problem is obtained as a limiting case of the sequence of optimal routing strategies for the corresponding smooth convex optimization problems, and the proof of its convergence to the optimal solution is given. An approach to calculating the optimal multicommodity flow is presented. The optimization algorithm efficiently handles networks with a large number of commodities, satisfies the robustness requirements, and can be used to solve circuit routing problems for large networks     

Near optimal routing and capacity management for PWCE-based survivable WDM networks

Protected Working Capacity Envelope (PWCE) has been proposed to simplify resource management and traffic control for survivable WDM networks. In a PWCE-based network, part of the link capacity is reserved for accommodating working routes, and the remaining capacity is reserved for backup routes. The shortest path routing is applied in PWCE-based networks. An arrival call is accepted only when each link along the shortest path has a free working channel. Such a working path routing scheme greatly simplifies the call admission control process for dynamic traffic, and it is especially suitable for implementation in a distributed manner among network nodes. In this article, we investigate two protection strategies: Bundle Protection (BP) and Individual Protection (IDP). In BP, only one backup path can be used to protect a failure component, whereas multiple backup paths can be used in IDP. We formulate four mixed integer non-linear programming (MINLP) problems using BP and IDP strategies for single link and single node failure protection. Each model is designed to determine link metrics for shortest working path routing, working and backup channel assignments, and backup path planning. Our objective is to minimize call-blocking probability on the bottleneck link. Since these models are highly non-linear and non-convex, it is difficult to obtain exact global optimal solutions. We propose a Simulated Annealing-based Heuristic (SAH) algorithm to obtain near optimal solutions. This SAH adopts the concepts of simulated annealing as well as the bi-section technique to minimize call-blocking probabilities. To evaluate the performance, we made simulation comparisons between SAH and the unity link weight assignment scheme. The results indicate that SAH can greatly reduce call-blocking probabilities on benchmark and the randomly generated networks.     

Algorithms for Dynamic Routing in All-Optical Networks

In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.     

Reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks

This paper introduces a novel approach, called Short Leap Shared Protection with spare capacity Reallocation (SLSP-R), to deal with dynamic reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks. SLSP-R is based on the SLSP framework and is designed to quantify the impact of computation complexity on network performance. The basic idea for SLSP-R is to subdivide a lengthy optimization process into several subtasks in order to trade the optimization quality with computation time. For this purpose, we compare three strategies for grouping working paths before an integer programming (InP) formulation is solved, namely, the Most Overlapped, Most Diverse, and Randomly Distributed. Analytical modeling of the problem is provided to show the feasibility of the subgrouping strategy. A numerical experiment as well as simulation-based study are conducted on four networks with different topology to evaluate the SLSP-R algorithm. The design methodology to determine the size of each subset of working paths is verified in the simulation.     

Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks

In wireless networks, throughput optimization is an essential performance objective that cannot be adequately characterized by a single criterion (such as the minimum transmitted or sum-delivered throughput) and should be specified over all source-destination pairs as a rate region. For a simple and yet fundamental model of tandem networks, a cross-layer optimization framework is formulated to derive the maximum throughput region for saturated multicast traffic. The contents of network flows are specified through network coding (or plain routing) in network layer and the throughput rates are jointly optimized in medium access control layer over fixed set of conflict-free transmission schedules (or optimized over transmission probabilities in random access). If the network model incorporates bursty sources and allows packet queues to empty, the objective is to specify the stability region as the set of maximum throughput rates that can be sustained with finite packet delay. Dynamic queue management strategies are used to expand the stability region toward the maximum throughput region. Network coding improves throughput rates over plain routing and achieves the largest gains for broadcast communication and intermediate network sizes. Throughput optimization imposes fundamental tradeoffs with transmission and processing energy costs such that the throughput-optimal operation is not necessarily energy efficient.     

An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networks

Fast recovery and minimum utilization of resources are the two main criteria for determining the protection scheme quality. We address the problem of providing a hybrid protection approach on elastic optical networks under contiguity and continuity of available spectrum constraints. Two main hypotheses are used in this paper for backup paths computation. In the first case, it is assumed that backup paths resources are dedicated. In the second case, the assumption is that backup paths resources are available shared resources. The objective of the study is to minimize spectrum utilization to reduce blocking probability on a network. For this purpose, an efficient survivable Hybrid Protection Lightpath (HybPL) algorithm is proposed for providing shared or dedicated backup path protection based on the efficient energy calculation and resource availability. Traditional First-Fit and Best-Fit schemes are employed to search and assign the available spectrum resources. The simulation results show that HybPL presents better performance in terms of blocking probability, compared with the Minimum Resources Utilization Dedicated Protection (MRU-DP) algorithm which offers better performance than the Dedicated Protection (DP) algorithm.     

Reconstruction of multiple neuromagnetic sources using augmented evolution strategies-- a comparative study.

The localization of dipolar sources in the brain based on electroencephalography (EEG) or magnetoencephalography (MEG) data is a frequent problem in the neurosciences. Deterministic standard approaches such as the Levenberg-Marquardt (LM) method often have problems in finding the global optimum of the associated nonlinear optimization function, when two or more dipoles are to be reconstructed. In such cases, probabilistic approaches turned out to be superior, but their applicability in neuromagnetic source localizations is not yet satisfactory. The objective of this study was to find probabilistic optimization strategies that perform better in such applications. Thus, hybrid and nested evolution strategies (NES) which both realize a combination of global and local search by means of multilevel optimizations were newly designed. The new methods were benchmarked and compared to the established evolution strategies (ES), to fast evolution strategies (FES), and to the deterministic LM method by conducting a two-dipole fit with MEG data sets from neuropsychological experiments. The best results were achieved with NES.