光网络中基于SRLG约束的动态RWA算法

在IPoverWDM光网络中,需要为每条工作光路提供光通路保护,即提供一条保护光路。光网络中引入了共享风险链路组(SRLG)的概念,要求工作光路与保护光路不共享风险链路组。不考虑波长分配提出一种新的启发式算法,该算法同时计算两条SRLG分离且总费用低;在此算法基础上利用分层图的思想,提出WDM网络中的一种在SRLG约束条件下的动态选路波长分配算法。     

WDM业务量疏导网络中的动态共享通路保护算法

本文研究了WDM业务量疏导网状网中的生存性问题,基于分层图模型提出了一种动态的业务量疏导共享通路保护算法(SPPTG).该算法根据网络拓扑信息、资源使用情况和到达的业务连接请求动态调整波长通道的代价,在此基础上为到达的低速业务连接请求寻找两条链路分离的通路,分别作为工作通路和保护通路,并且保证保护通路尽量共享已有的保护资源,从而有效提高全网的资源利用率.仿真表明SPPTG算法具有很好的阻塞性能,同时可以充分共享保护资源.     

基于FTTH的光网络保护系统的研究

针对FTTH光纤线路的保护问题,提出了一种无源光网络光纤线路切换保护系统.光纤线路切换设备通过不同的光纤链路连接远端设备的两个光通信端口,当某一个与远端设备连接的分支光纤链路出现故障时,光纤线路切换设备通过连接备用的分支光纤链路,保障通信的及时恢复.实验结果表明,ONU能够在50ms内自动完成在光口1和光口2间的识别与光路保护切换,极大地提高了PON光纤线路保护的可靠性和生存性,有利于FTTH/B的应用.     

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

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

WDM疏导网络的共享子通路保护算法

研究了WDM疏导网络中的生存性问题,提出一种支持多粒度业务的共享子通路保护算法(GSSP)。GSSP首先根据网络当前状态动态调整链路权值,在此基础上选择一条最短路作为工作通路;然后将该通路分为互不重叠的等长子通路,分别找出它们的保护通路,并且允许共享保护资源。GSSP可以保证业务连接的可靠性,又允许网络管理者根据不同的优化策略调整子通路长度,可以在恢复时间和资源利用率之间进行折中。最后对GSSP进行了仿真研究,给出了仿真结果。     

一种不共享风险的双路径选路算法

光网络中,为一个连接请求建立连接时,从光路保护方面来说,不仅需要为其寻找到一条工作路由,而且需要提供一条备份路由,并要求这两条路径物理分离,对于光网络还提出了共享风险链路组的概念。该文提出一种新的启发式算法,完成两条路径共享风险链路组分离,同时总费用尽量低,并对算法进行了分析与仿真。     

抗毁WDM网中单SRLG故障的共享子通路保护

该文针对抗毁WDM网中单个共享风险链路组(Shared Risk Link Group,SRLG)故障,提出了一种动态共享子通路保护(Dynamic Shared Sub-Path Protection,DSSPP)算法.DSSPP为每条业务请求选择一条工作通路后,按照参数m把工作通路划分成若干条等长的子通路,其中m为子通路的长度,并为每条子通路各选择一条SRLG分离的保护通路.如果两条子通路SRLG分离,则它们对应的保护通路可以共享相同资源.在进行路由选择时,DSSPP考虑了负载均衡度和资源共享度,因此能有效地提高资源利用率和降低业务阻塞率.仿真表明,DSSPP不仅能保护单SRLG故障,而且能灵活地在资源利用率(阻塞率)和保护切换时间之间进行性能折衷.     

PON接入网光路故障探讨

电信接入网中光纤接入比例越来越高,新一代接入网PON(无源光网络:Passive Optical Network)由此诞生。PON网络中作为承载数据流、信息流的光纤,光路的稳定性、可用性、可修复性如何,密切关系着整个PON网络的性能。文中对PON网络中的几个典型的光路问题进行探讨,并给出解决办法及规避的建议。     

可远控高精度光保护系统设计与实现

设计了一种利用以太网进行远程操控的光路保护方案.给出了整体方案、系统的软硬件设计以及最后的实现结果.该系统操作简单,易于实现,且可以实现对光路的远端监视与控制.尤其采用对数放大器后,对光纤光功率信号的测量更精确且范围大.     

WDM光网络中节能的1∶1保护路由波长分配算法研究

基于光网络中1∶1保护和共享保护的保护光路在非故障情况下是＂虚光路＂的特性,提出了一种节能的1∶1保护路由波长分配（RWA）算法,称为PA算法,它通过最小化网络中的承载了工作光路的光纤数来减少光中继设备产生的能耗,从而降低整个网络的能耗。仿真结果显示,PA算法具有较好的节能效果,相对于传统的RWA算法,它减少了超过40...     

Routing and Wavelength Assignment in Optical Networks Using Logical Link Representation and Efficient Bitwise Computation

In this paper, we propose and evaluate a new approach for implementing efficient routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks. In our method, the state of a fiber is given by the set of free wavelengths in this fiber and is efficiently represented as a compact bitmap. The state of a multiple-fiber link is also represented by a compact bitmap computed as the logical union of the individual bitmaps of the fibers in this link. Likewise, the state of a lightpath is represented by a similar bitmap computed as the logical intersection of the individual bitmaps of the links in this path. The count of the number of 1-valued bits in the bitmap of the route from source to destination is used as the primary reward function in route selection. A modified Dijkstra algorithm is developed for dynamic routing based on the bitmap representation. The algorithm uses bitwise logical operations and is quite efficient. A first-fit channel assignment algorithm is developed using a simple computation on the bitmap of the selected route. The resulting bitwise routing algorithm combines the benefits of least loaded routing algorithms and shortest path routing algorithms. Our extensive simulation tests have shown that the bitwise RWA approach has small storage overhead, is computationally fast, and reduces the network-wide blocking probability. The blocking performance of our RWA method compares very favorably with three routing methods: fixed alternate routing, shortest path using flooding, and Dijkstra’s algorithm using mathematical operations. Our simulation experiments have also evaluated the performance gain obtained when the network access stations are equipped with finite buffers to temporarily hold blocked connection requests.     

Distributed schemes for diverse path computation in multidomain MPLS networks

MPLS is currently used by several JSPs to carry some high-value traffic components, such as telephony over IP trunks and VPNs. For this type of traffic, service availability is a critical QoS dimension that needs to be protected from network failures. With MPLS-TE, this can be achieved by means of path protection schemes, where active and backup LSPs are routed along diverse paths. Besides protection, path diversity can be exploited for load balancing, another common means of QoS improvement. In order to preserve other QoS requirements, the paths must meet certain constraints (e.g., bandwidth availability, low load) and/or minimize some metric (e.g., hop count). This requires the ability to establish path diversity in an optimal way. In many cases of practical interest, the QoS traffic has an interdomain scope. This is the case for ToIP and VPN traffic between different carriers, or between different ASs owned by the same carrier, as found, for example, after corporate acquisitions or mergers. Therefore, path diversity is a requirement for interdomain traffic engineering. In this work we address path diversity in a multidomain network, where individual domains are capable of connection-oriented forwarding and endowed with an MPLS-TE control plane. For administrative and/or scalability reasons intradomain routing information is not disseminated externally, so dynamic path computation must be achieved by a distributed scheme based on interdomain collaboration. We briefly describe three alternative schemes recently proposed for interdomain diverse path computation, and quantitatively assess their performance with simulations over real ISP topologies.     

Joint wireless and optical resources allocation for availability-guaranteed service in survivable fiber-wireless access network

The fiber-wireless (FIWi) access network not only leverages the technical merits of wireless and optical access networks, but also provides a potential opportunity for the design of survivable access networks. Previous works have studied the survivability of FiWi access network against network component failure by means of backup fiber deployment and wireless rerouting. However, most of these works put less attention on the connection availability and ignore the joint allocation of wireless and optical resources, which plays an important role in improving the global network performance gain. In this paper, we consider a notable failure scenario in FiWi access network but less mentioned in previous works, i.e., single shared-risk link group failure. We first propose a model for FiWi network to estimate the connection availability of service demand. Then, a novel resource allocation approach is proposed to provide the availability-guaranteed service. Under the requirements of bandwidth and connection availability, we deal with the optimal allocation of joint wireless and optical resources with the objective of minimum resource consumption. Numerical results demonstrate that the proposed scheme can reduce the resource consumption significantly compared to the resource allocation without considering connection availability.     

Spare Capacity Reprovisioning for Shared Backup Path Protection in Dynamic Generalized Multi-Protocol Label Switched Networks

Spare capacity allocation serves as one of the most critical tasks in dynamic GMPLS networks to meet the stringent network availability constraint stipulated in the SLA of each connection. In this paper, an availability-aware spare capacity reconfiguration scheme based on shared backup path protection (SBPP) is proposed, aiming to guarantee the E2E availability of each LSP. We first provide an E2E availability model for a SBPP connection that is composed of a working and a SRG-disjoint shared backup LSP pair in the presence of all possible single, and dual simultaneous failures. Partial restoration is identified to further improve the capacity efficiency, and achieve finer service differentiation. For this purpose, restoration attempt is defined as a parameter for each connection that can be manipulated at the source node when the spare capacity of each link is scheduled. Based on the developed model, a Linear Program (LP) is formulated to perform inter-arrival spare capacity reconfiguration along each pre-determined shared backup LSP to meet the availability constraint of each connection. Simulation is conducted to verify the derived formulation, and to demonstrate the benefits gained in terms of the spare capacity saving ratio, where the conventional SBPP scheme that achieves 100% restorability for any single failure is taken as a benchmark. We will show that the simulation results validate the proposed E2E availability model, where a significant reduction on the required redundancy can be achieved in the effort of meeting a specific availability constraint for each SBPP connection.      

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.     

Connection Availability Analysis of Shared Backup Path-Protected Mesh Networks

Dual-span failures dominate the system unavailability in a mesh-restorable network with full restorability to single-span failures. Traditional availability analysis based on reliability block diagrams is not suitable for survivable networks with shared spare capacity. Therefore, a new concept is proposed to facilitate the calculations of connection availability. A U.S. network consisting of 19 nodes and 28 spans yielding 171 bidirectional connections is investigated. We find that networks with shared backup path protection can have average connection unavailabilities of the same order of magnitude as those with dedicated automatic protection switching, however, with a much better capacity efficiency. The proposed method can exactly calculate the unavailability of a specific connection with known restoration details or the average connection performance without any restoration details by presuming the dual-span failures to be the only failure mode and an arbitrary allocation rule of spare capacity     

Path switching-a quasi-static routing scheme for large-scale ATMpacket switches

A quasi-static routing scheme called path switching for large-scale ATM packet switch systems is proposed. Previously the Clos network has been used as the model for many large-scale ATM switch architectures, in which the most difficult issue is path and bandwidth assignment for each connection request. The static routing scheme, such as multirate circuit switching, does not fully exploit the statistical multiplexing gain. In contrast, the dynamic routing scheme, such as straight matching, requires slot-by-slot computation of route assignment. Path switching is a compromise of these two routing schemes. It uses a predetermined periodical connection pattern in the central stage, look-ahead selection in the input stage, and output queueing in the last stage. The scheduling of path switching consists of capacity assignment and route assignment. The capacity assignment is constrained by the quality of service of connection requests. The route assignment is based on the timespace interleaving of the coloring of bipartite multigraphs. We show that path switching can handle multirate and multimedia traffic effectively in the Clos network     

Novel disjoint path selection scheme based on link availability in ASON

Risk-disjoint routing is an efficient way to improve network survivability.In this article, a partial risk-disjoint routing algorithm based on link availability (PRDRA-LA) is proposed based on the complete risk-disjoint routing algorithm (CRDRA).While calculating the protection path with PRDRA-LA, the links that share risks with the links in the working path are filtered by link availability.In addition, the risk disjoint degree between the protection path and the working path can be adjusted freely.Simulation results showed that when compared with CRDRA, routing connections with PRDRA-LA can achieve improved survivability while the number of connections that can be successfully routed over the current network is kept from serious decline.     

Connection availability analysis of span-restorable mesh networks

Dual-span failures are the key factor of the system unavailability in a mesh-restorable network with full restorability of single-span failures. Availability analysis based on reliability block diagrams is not suitable to describe failures of mesh-restorable networks with widely distributed and interdependent spare capacities. Therefore, a new concept of restoration-aware connection availability is proposed to facilitate the analysis. Specific models of span-oriented schemes are built and analyzed. By using the proposed computation method and presuming dual-span failures to be the only failure mode, we can exactly calculate the average connection unavailability with an arbitrary allocation rule for spare capacity and no knowledge of any restoration details, or the unavailability of a specific connection with known restoration details. Network performance with respect to connection unavailability, traffic loss, spare capacity consumption, and dual failure restorability is investigated in a case study for an optical span-restorable long-haul network.