多域光网中基于动态域序列的分段共享保护算法

127 浏览量更新于2024-08-28 收藏 651KB PDF 举报

"一种基于动态域序列化方案的多域光网新型段共享保护算法" 本文是一篇关于多域光网格网络生存性研究的研究论文，发表在PhotonNetwCommun期刊2011年第22期，由Shengfeng Zhang、Shu Du、Yunfeng Peng、Xiaolong Yang和Keping Long共同撰写。文章主要探讨了如何在不断扩大的网络规模下，解决多域光网络中的生存性设计问题。生存性是光网络设计中的关键因素，尤其是在多域网络中，由于网络规模的扩展和域间的隐私需求，保护策略的设计变得尤为复杂。路径计算元素（Path Computation Element, PCE）被证明是一种有效的架构，能够用于多域多层网络中的最优流量工程路径计算。在PCE架构的基础上，作者提出了一个新的动态域序列化方案。这个方案考虑了域间链接的负载均衡，旨在优化不同域之间的通信效率和资源利用率。随后，他们提出了一种改进的段共享保护方法，称为DDSP（Dynamic Domain-sequencing Segment Protection）。DDSP方法的目标是提供100%的保护覆盖率，确保在网络出现故障时，能够迅速恢复服务，保证网络的稳定性和可靠性。 DDSP算法的核心思想是将网络划分为多个域，并且动态调整域之间的序列，以便在保持整体网络性能的同时，有效地分散和共享保护资源。这种段共享保护机制能够有效减少冗余链路的需求，降低网络的建设成本，同时增强网络的恢复能力。通过实施DDSP，网络可以快速识别并隔离故障，自动选择最佳备用路径，实现故障切换，从而确保业务连续性。这种方法对于提高多域光网络的容错能力和应对突发流量变化具有重要意义。该研究论文提出了一个创新的解决方案，即基于动态域序列化的段共享保护算法，用于提升多域光网格网络的生存性和效率。这一方法有望成为未来大规模光网络设计和优化的重要参考。

278 Photon Netw Commun (2011) 22:276–287

each physical single-domain network. Finally, an end-to-end

inter-domain routing can be established from the source node

to the destination node.

Based on the hierarchical routing with topology aggre-

gation, some researchers propose several survivable rout-

ing approaches for multi-domain networks. The authors of

[17] propose an LSSP (local segment-shared protection)

approach that proceeds in two steps to achieve inter-domain

survivable routing. LSSP ﬁrst computes one inter-domain

working path for each connection request and then com-

putes one intra-domain link-disjoint local shared segment-

backup path for each segment-working path in each single

domain. However, the egress gateway selected by the LSSP

is more often than not the optimal one, which will lead to

a long working path spanning the following domains. In

[18], we propose a local segment-shared protection based

on source egress gateway selection for multi-domain optical

mesh networks, called GSLSSP. A new source egress gate-

way selecting mechanism is adopted in this solution. For each

connection request, this mechanism can enable the source

node to select a better egress gateway node to the destina-

tion domain and compute one inter-domain working path

near the optimal path, and then one intra-domain link-dis-

joint local segment-backup path for each working-segment

path is computed in each single domain passed by the work-

ing path. To consider the load balancing on the virtual topol-

ogy, the authors in [19] propose ELSSP. When calculating

the primary path, ELSSP is to assign to each virtual link a

cost according to wavelength usage on each physical link

in each domain. Then, each primary light path is divided,

and segment-shared protection was provided in the passing

domains of the primary path. The authors of [20] propose a

new solution for multi-domain optical networks based on

p-cycles (pre-conﬁgured cycles). Moreover, a topology

aggregation model adapted to p-cycle computations is pro-

posed for scalability and security reasons. Based on this

topology aggregation model, the proposed solution can have

a good trade-off between resource utilization and running

time compared to existing solutions. In [21], two-step shared-

path protection strategy is proposed; it can get a work-

ing/backup path pair with a satisfying resource utiliza-

tion ratio. Nevertheless, the working/backup path pair route

across the entire network may lead to long switch time and

can’t tolerate multi-failures that each single domain has one

failing link.

However, hierarchical routing can lead to inaccurate path

selection due to the aggregation process. Therefore, the sur-

vivable routing approaches described above do not always

provide optimal diverse paths. Hence, another novel routing

procedure is needed to compute optimal inter-domain paths

and moreover, diverse path pairs. Path computation element

(PCE) [22] has been proposed for inter-domain path com-

putation in multi-domain MPLS/GMPLS networks, and it

can achieve optimal inter-domain path computation via the

BRPC algorithm [23].

The enhancing PCE-based route exclusion scheme enha-

ncement is proposed in [24]. This scheme can improve the

ability to ﬁnd diverse paths from the PCE-based route exclu-

sion scheme, while keeping simplicity, and is particularly

useful when the number of boundary nodes is small, but not

considering the path-shared protection. In [25] a PCEP exten-

sion enabling novel BRPC solution mechanism for inter-

domain protected path is proposed. To avoid the duplication

of the requests in the PCReq message, a single request ID

object is encapsulated in the PCReq SVEC object, implicitly

indicating the 1+1 path request type. Then, the PCEP PCRep

message is extended to support the presence of multiple dis-

joint trees. However, the detail algorithm of the diverse path

computation is not provided in the paper. The authors of [26]

present a distributed routing algorithm for ﬁnding two dis-

joint (primary and backup) QoS paths that run across multiple

domains. In the paper, based on the disjoint paths algorithm

an aggregated representation of a multi-domain network that

is sufﬁciently accurate and small enough to minimize the

link-state overhead is presented. Consequently, a distributed

routing algorithm that uses the aggregated representation to

ﬁnd disjoint paths in an efﬁcient manner is presented. How-

ever, the authors assume that the source PCE has some infor-

mation about the paths between the border nodes of the des-

tination domain and the destination. The assumption does

not hold in the inter-domain scenario due to scalability and

security constraints.

PCE can achieve inter-domain optimal route computation

and protection via the BRPC algorithm, whereas depending

on the predetermined sequence of domains. The schemes

above all assume that the sequence of domains is computed

out before, but not provide a scheme for selection of sequence

of domains. Moreover, they do not consider spare capacity

sharing, with which consumed network resources can be sig-

nificantly reduced.

In this paper, we extend our previous work [18]suited

for the hierarchical network to be applied to the PCE-

based inter-domain network architecture. We ﬁrst pro-

pose a scheme for selection of sequence of domains, and

then propose a path-shared protection approach for multi-

domain network. To the best of our knowledge, this is the

ﬁrst PCE-based segment-shared protection with a dynamic

domain-sequencing scheme for multi-domain optical mesh

networks.

The remainder of this paper is organized as follows.

Section 2 presents the network model. Section 3 proposes

the procedure of our approach and analyzes its complexity.

Section 4 presents another algorithm, OPT, for optimizing

dynamic domain sequencing. Section

5 evaluates the perfor-

mance of our heuristics via simulations. Finally, concluding

remarks are made in Sect. 6.

123

剩余11页未读，继续阅读

weixin_38607971

粉丝: 3
资源: 972

多域光网中基于动态域序列的分段共享保护算法

Segment-Tree based Cost Aggregation for Stereo Matching code

sanke-segment-algorithm

Signaling-based path-segment protection in mesh optical networks

Optimizing the cleanliness in multi-segment disk amplifiers based on vector flow schemes

数据融合matlab代码-temporal-segment-networks:时间段网络

数据融合matlab代码-temporal-segment-networks:yjxiong的时间分段网络分支

Segment-tree based cost aggregation for stereo matching with enhanced segmentation

数据融合matlab代码-temporal-segment-networks:来自https://github.com/yjxiong/tem

Displaying-on-Seven-Segment-of-FPGA-using-Verilog

color-segment-by-k-means.rar_K._color algorithm_k mean segment_k

最新资源