共查询到15条相似文献,搜索用时 62 毫秒
1.
该文研究了WDM网状网中双链路失效问题,在假定所有链路共享风险链路组(Share Risk Link Group, SRLG)分离的条件下,提出了一种动态共享路径保护(Dynamic Shared-Path Protection,DSPP)算法。DSPP能根据网络状态动态调整链路代价,为每条业务请求选择一条最小代价的工作路由和两条最小代价且SRLG分离的保护路由。仿真表明,DSPP不仅能完全保护双链路失效,并且能在资源利用率、阻塞率和保护切换时间之间进行性能折衷。 相似文献
2.
本文研究了WDM网状网中双链路失效的动态共享链路保护设计问题,提出了一种新的启发式算法TBP (Two Backup Paths) 和一种改进的启发式算法OBP (One Backup Path).两种保护算法都能根据当前网络状态动态地动态调整链路代价,所选路由都是最小代价的路径.文本还研究了双链路失效的保护切换时间,详细描述了保护切换过程.仿真表明,(1)两种算法都能有效地保护双链路失效;(2)TBP的性能优于OBP;(3)与其他算法相比,TBP具有最快的保护切换时间. 相似文献
3.
抗毁WDM网中单SRLG故障的共享子通路保护 总被引:3,自引:0,他引:3
该文针对抗毁WDM网中单个共享风险链路组(Shared Risk Link Group,SRLG)故障,提出了一种动态共享子通路保护(Dynamic Shared Sub-Path Protection,DSSPP)算法.DSSPP为每条业务请求选择一条工作通路后,按照参数m把工作通路划分成若干条等长的子通路,其中m为子通路的长度,并为每条子通路各选择一条SRLG分离的保护通路.如果两条子通路SRLG分离,则它们对应的保护通路可以共享相同资源.在进行路由选择时,DSSPP考虑了负载均衡度和资源共享度,因此能有效地提高资源利用率和降低业务阻塞率.仿真表明,DSSPP不仅能保护单SRLG故障,而且能灵活地在资源利用率(阻塞率)和保护切换时间之间进行性能折衷. 相似文献
4.
5.
6.
网状WDM网中支持区分可靠性的共享通路保护算法 总被引:2,自引:0,他引:2
光纤链路由于共享了某些物理资源(如光缆、管道、通路等),因此存在一定的故障相关性,术语“共享风险链路组(SRLG)”就是用于描述链路之间的这种风险共享关系的。SRLG分离成为保护设计的重要约束。该文研究了支持区分可靠性的SRLG分离共享通路保护设计问题。结合SRLG条件故障概率的概念,提出了部分SRLG分离的共享保护算法PSD-SPP(PartialSRLG-DisjointShared-PathProtection),有效地解决了SRLG分离约束下的区分可靠性设计问题。仿真结果表明该算法既满足了用户的区分可靠要求,又能有效利用资源。 相似文献
7.
8.
利用网络链路资源被占用的部分信息实现保护资源共享,可以极大地改善网络对业务的丢弃性能.这对采用多协议标记交换(MPLS,Multiprotocol Label Switching)技术的IP over WDM网络来说,并不需要太大的代价.基于此,本文提出了在IP over WDM网中考虑通路保护的动态路由算法.对工作通路的选取,算法对选路成本和路由长度作了折衷考虑;而对于保护通路,则对其共享能力和路由长度作了权衡.仿真结果表明,本文算法不管是对业务的丢弃性能,还是对网络的链路负载平衡度,均取得了较满意的结果. 相似文献
9.
10.
11.
Arunita Jaekel 《Photonic Network Communications》2006,11(2):201-209
In recent years, there has been considerable research interest in the design of survivable wavelength division multiplexing
(WDM) networks. Many papers have proposed mixed-integer linear program (MILP) formulations as well as heuristics to optimally
allocate lightpaths, using protection based schemes. Such schemes provide quick and guaranteed recovery, but do not use resources
efficiently. About 50% of allocated resources remain idle, under fault-free conditions. If these “idle” resources were used
for low-priority connections (which could be pre-empted if necessary), the resource utilization would improve significantly.
This paper introduces two MILP formulations for priority-based dynamic lightpath allocation in survivable WDM networks. We define three different levels of service and allocate resources
based on the requested service level. An important advantage of our approach is that while we can handle multiple levels of
service, the traditional (single level) shared and dedicated path protection schemes can be treated simply as a special case
of the proposed formulations. The first formulation solves the problem optimally, but is quite time consuming. The second
formulation makes some simplifications, and is more efficient. The results demonstrate that our approach can significantly
improve resource utilization and is feasible for practical sized networks, particularly under low- to medium-traffic load.
For large networks and high traffic conditions, simpler heurtistic algorithms are more appropriate. In such cases, the proposed
MILP formulation can be a useful tool to validate the performance of the heuristics. 相似文献
12.
13.
This paper investigates the problem of protecting multicast sessions in mesh wavelength‐division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes. 相似文献
14.
针对弹性光网络频谱利用率降低和带宽阻塞率高等问题,该文提出一种频谱可用性和保护带宽共享度感知的生存性多路径策略(M-SDSAA)。首先,该策略对业务采用单路径路由,通过区分业务的持续时间,分别采用首次命中和末端命中的工作路径频谱分配方式,并且为不同大小共享频谱块设定不同链路权重值。若单路径路由或频谱分配失败,引入多路径传输策略,自适应选择消耗频隙数少的策略,并且引入共享保护机制,提高保护带宽共享度。最后,当业务阻塞时,且存在单路径业务的保护路径预置在频隙消耗次优的路径,则启动重配置机制进一步降低阻塞率,将该业务重配置到保护频隙消耗最少的路径。仿真结果表明所提算法能有效地提高频谱利用率,降低网络的带宽阻塞率。 相似文献
15.
p-Cycle survivable network design under the single link failure assumption has been studied extensively. Shared risk link group
(SRLG) is a concept that better reflects the nature of network failures. An SRLG is a set of links that may fail simultaneously
because of a common risk they share. The capability of dealing with SRLG failures is essential to network survivability. In
this paper, we extend the p-cycle survivable network design from the single link failure model to the single SRLG failure model. An integer linear programming
(ILP) formulation that minimizes spare capacity requirement is provided. To avoid enumerating all cycles of a network, we
also provide a polynomial-time algorithm to generate a basic candidate p-cycle set that guarantees 100% restorability in case of any single SRLG failure given enough spare capacities. Moreover,
we present the SRLG failure detection problem that prevents fast restoration upon an SRLG failure. To solve this problem,
we introduce the concept of SRLG-independent restorability, which enables the restoration of each link in a failed SRLG to start immediately without knowing which SRLG has failed.
We present an approach to optimal p-cycle design with SRLG-independent restorability and show that it is NP-hard to generate a candidate p-cycle set such that each link can be SRLG-independently restored by at least one cycle in the set. 相似文献