New! View global litigation for patent families

CN105007223A - Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure - Google Patents

Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure Download PDF

Info

Publication number
CN105007223A
CN105007223A CN 201510420758 CN201510420758A CN105007223A CN 105007223 A CN105007223 A CN 105007223A CN 201510420758 CN201510420758 CN 201510420758 CN 201510420758 A CN201510420758 A CN 201510420758A CN 105007223 A CN105007223 A CN 105007223A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
optical
network
path
wavelength
routing
Prior art date
Application number
CN 201510420758
Other languages
Chinese (zh)
Inventor
沈建华
褚兵兵
Original Assignee
南京邮电大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Abstract

The invention discloses an optical network dynamic multicast routing wavelength allocation method based on an optical hierarchical structure. According to the method, an improved Edge Removal Light-Hierarchy (ERLH) algorithm is introduced into optical network dynamic multicast routing wavelength allocation; when a destination node is selected and a corresponding shortest path is added in an optical hierarchy, the cost of the path, quantity of surplus wavelength in the path and quantity of surplus wavelength of the whole network are considered comprehensively; according to the occupation situation of current resources of the network, the path is selected dynamically; and a new weight setting manner and a new dynamic regulation routing strategy are further proposed, so that the path added in the optical hierarchy is distributed in the path with the shortest distance, smallest load and largest ratio of the quantity of surplus wavelength to the cost, the network resource is fully reasonably used, and the blocking rate of the optical network is lowered.

Description

-种基于光层次架构的光网络动态多播路由波长分配方法 - kind of dynamic light level based on optical network architectures multicast routing wavelength assignment method

技术领域 FIELD

[0001] 本发明涉及一种光网络动态多播路由和波长分配方法,尤其涉及一种基于光层次架构的光网络动态多播路由和波长分配方法,属于光通信技术领域。 [0001] The present invention relates to an optical network Dynamic Multicast Routing and wavelength assignment methods, and particularly to an optical network architecture based on dynamic light level multicast routing and wavelength assignment methods, belonging to the technical field of optical communication.

背景技术 Background technique

[0002] 光网络是由网络节点和连接节点的多波长光纤链路构成。 [0002] The optical network is constituted by a multi-wavelength fiber link connecting the nodes and network nodes. 波分复用技术(WDM)可以在一根光纤中同时传输若干不同波长的光信号,具有技术方案成熟和易于扩展等特点, 是目前充分利用光纤带宽和提升系统容量最常用的方法之一。 Wavelength division multiplexing (WDM) optical signals may be simultaneously transmitted several different wavelengths, having a mature technical solutions and easy expansion characteristics in an optical fiber, it is currently one of the most common methods use the full fiber bandwidth and improve the system capacity.

[0003] 路由和波长分配(RWA)是WDM光网络中设计和优化的核心问题之一,主要是指在光网络中为从源节点到目的节点的连接请求选择合适的路由,并给该路由分配合适的波长。 [0003] Routing and Wavelength Assignment (the RWA) is a key problem in WDM Optical Network Design and Optimization, mainly refers to a request in an optical network connection is selected from a suitable source node to the destination node routing, and to route the allocate an appropriate wavelength. 多播是一种点到多点的通信方式,光网络中建立的点到多点波长信道称为光树, WDM光网络中的多播RWA问题即建立点到多点的光树。 Multicast is communication to-multipoint, multipoint optical network to establish an optical wavelength channel is called tree, multicast RWA problem in WDM optical networks, i.e., to establish light-multipoint tree. 在全分光WDM网络中,所有节点均可以分光,建立一个多播会话只需一个光树,称为Steiner问题。 In the full spectral WDM network, all nodes can spectrophotometry, establish a multicast session just a light tree, called the Steiner problem. 与普通的RWA问题相比,建立多播树光网络中存在包括稀疏分光器配置约束、波长连续性约束、能量损伤约束等约束问题。 RWA compared with the conventional problems, an optical network to establish the presence of the tree multicast sparse beam splitter configuration comprises a constraint, the wavelength continuity constraint, energy damage constraints constraints. 由于分光器价格昂贵,且会带来额外损耗,波长转换也会引入额外的代价,技术实现相对复杂,因此研究稀疏分光器配置和零波长转换器配置下的WDM光网络中的多播RWA问题具有更好的应用价值。 Since the splitter is expensive and will bring additional losses, wavelength conversion will introduce additional costs, technology is relatively complex, so the research of multicast RWA sparse splitter configuration and zero wavelength converter configuration of WDM optical network problems better value. 在稀疏分光器配置约束和波长连续性配置约束下的WDM光网络中RWA算法包括重路由到源、重路由到任何节点、仅限成员、成员优先等。 Beam splitter arranged in a sparse and the wavelength continuity constraint of WDM optical networks under configuration constraints RWA algorithm comprises rerouting to the source, any node re-routing members, only members of the priority and the like. 相关文献表明:以上四种经典算法中,成员优先算法较好的控制阻塞率,综合性能最优[XijunZhang,JohnWei,ChunmingQiao.ConstrainedMulticastRoutinginWDM NetworkswithSparseLightSplitting[J].IEEE/0SAJournalofLightwareTechnolo gy,2000:18 (12):1917-1927]。 The literature shows that: these four classical algorithm, the members of the first algorithm better control blocking rate, the best overall performance [XijunZhang, JohnWei, ChunmingQiao.ConstrainedMulticastRoutinginWDM NetworkswithSparseLightSplitting [J] .IEEE / 0SAJournalofLightwareTechnolo gy, 2000: 18 (12): 1917-1927].

[0004] 稀疏分光配置下的WDM网络可以看作一个无向图G(V,E,c,W)。 [0004] WDM network can configure the sparse spectral regarded as an undirected graph G (V, E, c, W). V代表图G的定点集。 V represents a set point G of FIG. 每个节点vGV,v是MI节点(不可多播节点)或MC节点(可多播节点)。 Each node vGV, v is MI node (non-multicast nodes) or MC node (node ​​may multicast).

[0005] V={v|v=MIorv=MC} (4) [0005] V = {v | v = MIorv = MC} (4)

[0006] E代表图G的边集,与网络中节点间的光纤链路相对应。 [0006] E set of edges represented in Figure G, fiber links in the network between nodes corresponds. W表不每根光纤支持的波长数。 W table does not support the number of wavelengths per fiber. 每条边eGE都关联一个代价函数C(e)。 Each edge is associated eGE a cost function C (e). 由于目标是最小化波长信道的使用,因此代价函数C(e)可以定义如下: Since the goal is to minimize the use of wavelength channels, so the cost function C (e) can be defined as follows:

[0007] C(e)=l,eGE (5) [0007] C (e) = l, eGE (5)

[0008] 考虑一个多播会话ms(s,D),且应满足以下限制:⑴波长连续性限制,即在没有波长转换器的条件下,一个光架构(例如光树或光层次)的所有链路必须使用相同的波长; (2)区别波长限制,两个光树若有相交则必须使用不同的波长;(3)稀疏分光限制。 [0008] Consider a multicast session ms (s, D), and should meet the following limitations: ⑴ wavelength continuity constraint, i.e., in the absence of the wavelength converter, an optical architecture (e.g. light or light tree hierarchy) all link must use the same wavelength; (2) the difference between the wavelength limits, two intersecting light trees must be used if different wavelengths; (3) the spectral sparse restriction. 请求建立一个完成从源s到所有目的节点集合D的多播会话的光架构的集合(例如光树)。 Request to establish a complete set (e.g., tree light) light architecture multicast session set D from the source s to all destination nodes. 不失一般性,假设在一个多播会话中有K= |D|个目的节点,建立该多播会话ms(s,D)需要k个光架构(例如光树或光层次ASiUDi),其中iG[l,k],l彡k彡KSN-1。 Without loss of generality, assume there are K = a multicast session | D | destination nodes to establish the multicast session ms (s, D) k required optical architectures (e.g. light or light tree hierarchy ASiUDi), wherein iG [l, k], l k San San KSN-1. 考虑网络资源的最佳利用,总代价应该最小。 Consider the best use of network resources, total costs should be minimal. 因此,一个多播会话的总代价可以由建立该多播会话的所有光架构的代价和计算得出 Therefore, the total cost of more than one multicast session can be derived from the calculation of the costs and establish the framework for all light multicast session

[0009] [0009]

Figure CN105007223AD00041

(6) (6)

[0010] 在稀疏分光配置的WDM光网络中,由于MI节点不能作为分支节点,因此光树架构被认为是充分利用波长信道数即最小化总代价的最佳方案。 [0010] In the WDM optical networks with sparse splitting, since MI node can not serve as a branch node, the light tree architecture is considered sufficient number of channels in a wavelength that is best to minimize the total cost. 交叉对开关(CPS)的出现使得一个度数大于等于4的节点能被访问两次。 CROSS appears switching (CPS) in such a degree greater than or equal to 4 nodes can be accessed twice. 通过利用不同的输入输出端口对,一个4度MI 节点在一个光架构中能连接两个继承节点。 By using different input and output port pair of a 4 MI in an optical node architecture can connect two successor nodes. 同时为了实现交叉对交换,该MI节点也应该连接两个前驱节点。 Meanwhile, in order to realize the exchange of the cross, the two MI node precursor nodes should be connected. 这样一个4度MI节点能被访问两次,多播架构将不再是光树,而是光层次,因为可能有环存在。 Such a node can be accessed MI 4 degrees twice, multicast architecture will no longer light the tree, but the light level, because there may ring exist.

[0011] 考虑一个多播会话ms(s,D),在光层次中,由于一个MI节点可能被遍历两次,而在子层次中用过的边不能被用在同样的光层次中。 [0011] Consider a multicast session ms (s, D), in the light level, since a node may be traversed twice MI, and used in the sub-hierarchy edges can not be used in the same light level. 因此,当建立多播会话的光层次时,子层次中已使用的边对于遍历剩余的目的节点无用。 Thus, when establishing an optical level multicast session, the sub-levels have been used to traverse the remaining unwanted edge destination node. 可用边消除光层次算法来计算光层次:即为计算光层次,在每一次迭代中找出与当前光层次LHk最近的目的节点七,将图&中该最短路径SPeii(屯,Cl)加入到当前光层次LHk㈦为di与当前光层次的最佳连接点);然后将最短路径SP。 Available algorithms edge erasing light level calculating light levels: level of light that is calculated to find out the current light level LHk latest seven destination node in each iteration, the shortest path in FIG. & SPeii (Tun, Cl) was added to LHk㈦ current light level to the light level of the current di is the best connection point); then the shortest path SP. ,(山,Cl)中的边从图Gi中删除生成新的图G1+1,同时更新MC_SET(图Gi*MC节点的集合)。 , (Hill, Cl) is deleted to generate a new edge G1 + 1 from FIG. FIG Gi while updating MC_SET (FIG set of nodes Gi * MC). 在下一次迭代中,计算图G1+1中的最短路径并找出与当前光层次最近的目的节点。 In the next iteration, calculates the shortest path in FIG G1 + 1 and identify a destination node nearest to the current light level. 由于是稀疏分光配置,类似光树架构,一个多播会话可能需要建立多个光层次。 Because it is sparse splitting configuration, similar to tree architecture light a multicast session may need to create multiple light levels. 由于交叉对开关的使用,使得一个4度MI节点可能被访问两次,已经证明在稀疏分光配置网络中,光层次多播架构比光树多播架构能更能充分利用波长信道[FenZhou,MiklosMolnar,Bernard Cousin.IsLight-treeStructureOptimalforMulticastRoutinginSparseLight SplittingWDMNetworks[J],InProc. 18thInternationalConferenceonComputer CommunicationsandNetworks,SanFrancisco,USA, 2009.]。 Since the use of the cross switch, so that a 4-degree nodes may be accessed twice MI, with sparse splitting has been demonstrated in the network, an optical architecture than the light level multicast tree multicast architecture can more fully use wavelength channels [FenZhou, MiklosMolnar , Bernard Cousin.IsLight-treeStructureOptimalforMulticastRoutinginSparseLight SplittingWDMNetworks [J], InProc. 18thInternationalConferenceonComputer CommunicationsandNetworks, SanFrancisco, USA, 2009.]. 因此,光层次多播架构是稀疏分光网络中的最佳多播路由方案。 Therefore, the light level multicast architecture is sparse spectral Best multicast routing scheme in the network.

[0012] 传统的边消除光层次算法中,每一次迭代时总选择离当前光层次最近的目的节点,并将对应的最短路径加入该光层次。 [0012] The conventional edge light level elimination algorithm, each selected from the current total light level nearest the destination node, the shortest path was added and the light level corresponding to iteration. 选择最近目的节点时只考虑了路径的代价,导致后期某些路径的代价可能不是最小的,但波长资源却很丰富,某些最短路径上可能不存在可分配的波长,却仍选择该链路加入光层次,从而产生链路拥塞及波长资源的浪费。 When you select a recent destination node only consider the cost of the path, the path leading to the cost of some of the latter may not minimal, but the wavelength is very rich in resources, wavelength distribution may not exist on some of the shortest path, but still choose the link adding light levels, resulting in a waste of resources to link congestion and wavelength. 因此,若用边消除光层次算法解决RWA问题,需要针对传统边消除光层次算法进行改进,在选择目的节点并将对应最短路径加入光层次时,把路径的代价和路径中波长资源同时考虑进来作为约束。 Thus, if the erasing light level RWA problem solving algorithm side, eliminating the need for a conventional edge light level algorithms improve, when selecting the shortest path corresponding to the destination node and the light level is added, and the cost of the path of a wavelength path resources simultaneously into account as a constraint.

发明内容 SUMMARY

[0013] 本发明所要解决的技术问题在于,针对引入克服边消除光层次算法建立光层次解决RWA问题时,由于未考虑链路中的波长资源而产生链路拥塞和波长资源的浪费,提出一种基于光层次架构的光网络动态多播路由和波长分配方法。 [0013] The present invention solves the technical problem to overcome when the edge for introducing light to eliminate light level hierarchical algorithm for establishing RWA problem to solve, since the wavelength link resources are not wasted in consideration of congestion, and the wavelength link resources, a proposed kinds of optical network architecture of dynamic light level multicast routing and wavelength assignment method.

[0014] 本发明的思路是在选择距离光层次最近的目的节点,并将其对应的最短路径加入光层次时,不是仅将代价最小的路径加入光层次[FenZhou,Molnar,M.,Cousin,B. Light-Hierarchy:Cost-EfficientStructureforMulticastRoutinginWDMMesh Networks[J],ComputersandCommunications(ISCC),DOL10, 2010,pp. 611-616],而是综合考虑路径的代价和路径中剩余波长数以及全网的剩余波长总数,并提出新的权重设定方式。 [0014] The idea of ​​the invention is selected from the light level nearest the destination node, and when the light level is added, not only the addition of the minimum path cost shortest paths corresponding light levels [FenZhou, Molnar, M., Cousin, B. Light-Hierarchy:. Cost-EfficientStructureforMulticastRoutinginWDMMesh networks [J], ComputersandCommunications (ISCC), DOL10, 2010, pp 611-616], but considering the cost of the total number of the remaining wavelength path route and the remaining number of wavelengths of the whole network and and propose new weight setting mode. 据此可以动态地调节选路策略:当网络中剩余的波长资源较丰富时增大选择最短路径的概率,网络中剩余波长数较小时增大选择路径中剩余波长数大的概率。 Thus can dynamically adjust routing policy: the probability of choosing the shortest path increases when the rich network resources remaining wavelength, increasing the selection path greater probability of remaining number of wavelengths in the network is small remaining number of wavelengths. 通过新的权重函数计算出的值最大的路径加入光层次,使得加入该光层次的路径分布在距离最短、负载最小以及剩余波长数和代价比值最大的路径上。 Calculated by the new weighting function value of the path the maximum light level is added, such that the light level is added to the distribution path in the shortest distance, minimum load and the number of wavelengths and the remaining ratio of the maximum cost of a path.

[0015] 传统的边消除光层次算法在选择路径加入光层次时采用公式(7)进行计算: [0015] The conventional edge light level elimination algorithm equation when the Path added light level (7) is calculated:

[0016] [0016]

Figure CN105007223AD00051

C7) C7)

[0017] 式中,函数C()是路径SP(I| |的代价。本发明是在边消除光层次算法(ERLH) 基础上进行改进,具体而言,本发明采取以下技术方案: [0017] In the formula, the function C () is the path SP (I | | the present invention is to eliminate the cost of the edge-light-level algorithm (ERLH) improved on the basis of, particularly, the present invention takes the following technical scheme:

[0018] 利用边消除光层次算法进行多播路由和波长分配,在选择路径加入光层次时采用公式(1)进行计算: 「00191 [0018] With the elimination of the edge light level algorithm Multicast Routing and wavelength assignment, selecting a path using the equation when the light level is added (1) is calculated: "00191

Figure CN105007223AD00052

(1) (1)

[0020] 式中,D表示目的节点的集合,MC_SET表示第i次更新后的拓扑图Gi*MC节点的集合,(d,c)表示c到d的最短路径,其中P()是权重函数,其表述如下: [0020] wherein, D denotes the set of destination nodes, MC_SET represents the set of topology after the i th updated Gi * MC node, (d, c) represents the shortest path c to d, where P () is a weighting function , which is expressed as follows:

[0021] [0021]

Figure CN105007223AD00053

(2) (2)

[0022] 式中,K=C(SPCiW,c)),表示路径(J,c)I的代价,N。 [0022] In the formula, K = C (SPCiW, c)), represents the path (J, c) I price, N. 越大说明路径经过的跳数越多,N。 The greater the number of hops of the path through, N. 越小说明路径经过的跳数越少;1^表示路径的剩余波长数,即路径上各段链路的最小剩余波长数,NW越大表示网络中剩余波长数越多,即路径的拥挤程度越小;如果NJI小表示网络中剩余波长资源越少。 The smaller the number of hops, the less the path followed; 1 ^ represents the remaining number of wavelength path, i.e., the minimum number of wavelengths of the remaining segments of each link on the path, NW greater the more the remaining number of wavelengths in the network, i.e., the degree of congestion of the path the smaller; if the network represents NJI small residual wavelength fewer resources. a为影响因子,它由整个网络中剩余波长总数决定,通过改变a的值,就可以实现不同的选路策略,选取不同的路由。 Effect is a factor, which is determined by the wavelength of the remaining total number of the entire network, by changing the value of a can be achieved in different routing policies, select a different route.

[0023] 在选择路径加入光层次时,本发明改进的边消除光层次算法的选路策略是当网络中剩余波长总数较大时,应增大短路径的选择,即应通过调整a增大权重函数P()中路径的波长信道数N。 [0023] When selecting a path of light level is added, according to the present invention, the improved routing strategies to eliminate the edge light level algorithm when the total number of the remaining wavelength larger networks, short path selection should be increased, i.e. be increased by adjusting a wavelength channel number weighting function P () in the path N. 的影响;当网络中剩余波长总数较小时,应增大小负载链路的选择,即应通过调整a增大权重函数P()中路径剩余波长数Nw的影响。 Effects; smaller when the total number of the remaining wavelength network, the link should be increased to select a small load, i.e. the path of the influence of the residual number of wavelengths Nw should be increased by adjusting a weighting function P a (). 这样可以充分的利用网络资源,合理地分配网络资源,不是仅根据路径的代价或剩余波长数进行路由选择,降低了网络阻塞率。 This can make full use of network resources, reasonable allocation of network resources, not only the cost of routing paths according to the number of remaining wavelengths or reduce the blocking probability.

[0024]下面给出a的设定: [0024] The following presents a set:

[0025]a= 9. 8Rw+0. 2 0 <Rw< 1 (3)式中Rw是网络的剩余波长率,Rw等于网络中剩余波长数和网络总波长数的比值。 [0025] a = 9. 8Rw + 0. 2 0 <Rw <1 (3) wherein Rw is the wavelength of the remaining network, the network is equal to the ratio of Rw remaining wavelengths and the total number of wavelength division multiplexed network. 影响因子a被设定为关于网络的剩余波长率Rw的连续函数,可以根据网络中剩余波长数实时动态地调节选路策略。 Factor is set to be a continuous function of wavelength respect to the remaining network Rw may be dynamically adjusted in real-time routing policy in accordance with the remaining number of wavelengths network.

[0026] 算法的框架如下: Frame [0026] The algorithm works as follows:

[0027] 1-1)利用Dijkstra算法计算出所有dGD到cGMC_SET的最短路径Sf, 根据网络中剩余波长数和网络总波长数的比值&通过公式(3)计算出a值,再通过公式(2)计算出路径SP(i>/,,c)的权重,最后通过公式(1)计算出最佳路径加入光层次,若计算出的最优光路不止一条,则选择具有离源节点s最近的连接点的那条路径; [0027] 1-1) calculating all shortest paths to cGMC_SET Sf dGD using Dijkstra algorithm, in accordance with the ratio of the number of wavelengths in the network and the total remaining number of network & wavelengths calculated by the formula (3) an a value, and then by the equation (2 ) calculated path SP (i> / ,, c) a weight, calculate the best path was added last light level by the equation (1), if the calculated optimum optical path is more than one, is selected from the source node s with the most recent that path connection point;

[0028] 1-2)将1-1)选出的最优光路的目的节点山从D中去除,将目的节点和最优光路中的MC节点加入MC_SET,若连接点(^是MI节点则从MC_SET中去除,最后把1-1)选出的最优光路中的链路从图Gi*去除; [0028] 1-2) to 1-1) Mount the selected destination node is removed from the optimum optical path D, the destination node and node MC optimum optical path added MC_SET, if the connection point (node ​​^ is the MI MC_SET removed from, and finally to 1-1) selecting the optimum optical path in the link is removed from FIG Gi *;

[0029] 1-3)若有目的节点可以连接到当前光层次,i-i+1并跳转1-1),否则,跳转1-4); [0029] 1-3) If the destination node may be connected to the current light level, i-i + 1 and jump 1-1), otherwise, jump 1-4);

[0030] 1-4)给光层次LHk分配波长; [0030] 1-4) to the optical wavelength level LHk are assigned;

[0031] 1-5)若目的节点D为空集,则多播会话建立完毕,否则,k-k+1,i- 1并跳转1_1) 〇 [0031] 1-5) If the destination node D is an empty set, then the multicast session establishment is completed, otherwise, k-k + 1, i- 1 and jump 1_1) square

[0032] 将改进的边消除光层次算法(ERLH算法)引入光网络的动态多播路由和波长分配中,在选择目的节点并将对应最短路径加入光层次时,综合考虑路径的代价和路径中剩余波长数以及全网的剩余波长总数,根据网络情况动态地选择路径;进一步提出新的权重设定方式,动态调节选路策略,将加入光层次的路径分布在最短、负载最小以及剩余波长数和代价比值最大的路径上,以充分合理利用网络资源,降低了光网络的阻塞率。 [0032] The improved dynamic light level algorithm to eliminate edge (ERLH algorithm) is introduced an optical network multicast routing and wavelength assignment, when selecting the shortest path corresponding to the destination node and the added light level, considering the cost of the path and the path the remaining number of wavelengths and the remaining total number of wavelengths of the whole network, select the path dynamically according to the network; further proposes a new weight setting manner, dynamically adjusting routing policy, the added light-level path distributed in the shortest possible, minimum load and the remaining number of wavelengths and the ratio of the largest cost of a path to fully utilize network resources, reduce the blocking rate of the optical network.

附图说明 BRIEF DESCRIPTION

[0033] 图1为本发明的光网络动态多播路由波长分配方法的流程图。 A flowchart of routing wavelength allocation method [0033] FIG. 1 of the present invention an optical network dynamic multicast.

具体实施方式 detailed description

[0034] 下面结合附图对本发明的技术方案进行详细说明。 [0034] DRAWINGS The technical solution of the present invention will be described in detail.

[0035] 图1为本光网络动态多播路由波长分配方法的流程图,利用边消除光层次算法进行多播路由和波长分配,在选择路径加入光层次时采用公式(1)进行计算: 「00361 [0035] FIG. 1 is a flowchart of the multicast routing method of the optical wavelength allocation network dynamics, to eliminate the use of the edge light algorithmic level multicast routing and wavelength assignment, selecting a path using the equation when the light level is added (1) is calculated: " 00361

Figure CN105007223AD00061

(1) (1)

[0037] 式中,D表示目的节点的集合,MC_SET表示第i次更新后的拓扑图Gi*MC节点的集合,表示c到d的最短路径,其中P()是权重函数,其表述如下: [0037] where, D represents the destination node set, MC_SET represents the set topology Gi * MC node of the i-th update represents the shortest path c to d, where P () is a weighting function, which is expressed as follows:

[0038] [0038]

Figure CN105007223AD00062

[0039] 式中,KrCXSPyAc)),表示路径啲代价,N。 [0039] In the formula, KrCXSPyAc)), represents the path cost of GOD, N. 越大说明路径经过的跳数越多,N。 The greater the number of hops of the path through, N. 越小说明路径经过的跳数越少;1^表示路径的剩余波长数,即路径上各段链路的最小剩余波长数,Nw越大表示网络中剩余波长数越多,即路径的拥挤程度越小;如果NJI小表示网络中剩余波长资源越少。 The smaller the number of hops, the less the path followed; 1 ^ represents the remaining number of wavelength path, i.e., the minimum number of wavelengths of the remaining segments of each link on the path, the more the greater the Nw remaining number of wavelengths in the network, i.e., the degree of congestion of the path the smaller; if the network represents NJI small residual wavelength fewer resources. a为影响因子,它由整个网络中剩余波长总数决定,通过改变a的值,就可以实现不同的选路策略,选取不同的路由。 Effect is a factor, which is determined by the wavelength of the remaining total number of the entire network, by changing the value of a can be achieved in different routing policies, select a different route.

[0040] 在选择路径加入光层次时,将改进的边消除光层次算法的选路策略是当网络中剩余波长总数较大时,应增大短路径的选择,即应通过调整Ct增大权重函数P0中路径的波长信道数N。 [0040] When selecting a path of light level is added, the improved routing strategies to eliminate the edge light level algorithm when the total number of the remaining wavelength larger networks, short path selection should be increased, i.e., the weight should be increased by adjusting the Ct wavelength channel number N. the function of the path P0 的影响;当网络中剩余波长总数较小时,应增大小负载链路的选择,即应通过调整a增大权重函数P()中路径剩余波长数Nw的影响。 Effects; smaller when the total number of the remaining wavelength network, the link should be increased to select a small load, i.e. the path of the influence of the residual number of wavelengths Nw should be increased by adjusting a weighting function P a (). 这样可以充分的利用网络资源,合理地分配网络资源,不是仅根据路径的代价或剩余波长数进行路由选择,降低了网络阻塞率。 This can make full use of network resources, reasonable allocation of network resources, not only the cost of routing paths according to the number of remaining wavelengths or reduce the blocking probability.

[0041]下面给出a的设定: [0041] The following presents a set:

[0042]a= 9. 8Rw+0. 2 0 彡Rw< 1 (3) [0042] a = 9. 8Rw + 0. 2 0 San Rw <1 (3)

[0043]式中Rw是网络的剩余波长率,Rw等于网络中剩余波长数和网络总波长数的比值。 [0043] wherein Rw is the wavelength of the remaining network, the network is equal to the ratio of Rw remaining wavelengths and the total number of wavelength division multiplexed network. 影响因子a被设定为关于网络的剩余波长率Rw的连续函数,可以根据网络中剩余波长数实时动态地调节选路策略。 Factor is set to be a continuous function of wavelength respect to the remaining network Rw may be dynamically adjusted in real-time routing policy in accordance with the remaining number of wavelengths network.

[0044] 若考虑多播会话ms(s,D。),该多播路由和波长分配方法的具体实现步骤如下: [0044] When the specific implementation steps multicast session ms (. S, D), the multicast routing and wavelength assignment methods consider the following:

[0045]Stepl:初始化网络,设置所有波长信道均为空闲状态; [0045] Stepl: network initialization, set all the wavelength channels are idle state;

[0046]Step2:判断是否有业务到达,若有,跳转Step3,若否,继续等待; [0046] Step2: determining whether a service arrives, if so, jump Step3, if not, continue to wait;

[0047]Step3:多播业务初始化,k- 1,D-D0; [0047] Step3: multicast traffic initialization, k- 1, D-D0;

[0048]St印4:初始化光层次LHk= {s},图GG,MC_SET- {s}; [0048] St plate 4: initializing light level LHk = {s}, FIG GG, MC_SET- {s};

[0049]Step5:利用Dijkstra算法计算出所有dGD到cGMC_SET的最短路径:SP(i| (心'),根据网络中剩余波长数和网络总波长数的比值IUI过公式(3)计算出a值, 再通过公式(2)计算出路径SP(;,K_<)的权重,最后通过公式(1)计算出最佳路径加入光层次,若计算出的最优光路不止一条,则选择具有离源节点s最近的连接点的那条路径; (Heart '), in accordance with the ratio of network remaining wavelengths and the total number of wavelength division multiplexed network IUI through equation (3) to calculate a value | SP (i: [0049] Step5: calculating all dGD to cGMC_SET shortest path using Dijkstra algorithm then calculated by the formula (2) the path SP (;, K_ <) weights finally calculated by the equation (1) the best path was added light level, the optimal optical path when the calculated more than one is selected having from source s that path node nearest the point of attachment;

[0050]St印6:将St印5选出的最优光路的目的节点山从0中去除,将目的节点和最优光路中的MC节点加入MC_SET,若连接点(^是MI节点则从MC_SET中去除,最后把Step5选出的最优光路中的链路从图Gi*去除; [0050] Printing St 6: the destination node of the optical path St Hill optimal printing 0 5 selected from the removed node to the destination node MC and the optimal optical path added MC_SET, if the connection point (node ​​MI is from ^ MC_SET removed, Step5 finally selected optimum optical path in FIG Gi * removed from the link;

[0051]St印7:判断是否有目的节点可以连接到当前光层次,若有,i-i+1并跳转St印5, 若否,跳转Step8 ; [0051] Printing 7 St: determines whether the destination node can be connected to the current light level, if so, i-i + 1 and plate 5 St jump, if No, go Step8;

[0052]St印8:给光层次LHk分配波长; [0052] St plate 8: level LHk are assigned to the optical wavelength;

[0053]St印9:若目的节点D为空集,则多播会话建立完毕,否则,k-k+1,i- 1并跳转Step4〇 [0053] St plate 9: If the destination node D is the empty set, then the multicast session establishment is completed, otherwise, k-k + 1, i- 1 and jump Step4〇

Claims (1)

1. 一种基于光层次架构的光网络动态多播路由波长分配方法,其特征在于,利用边消除光层次算法进行多播路由和波长分配,在选择路径加入光层次时采用公式(1)进行计算: An optical network based on dynamic light level multicast routing architecture wavelength allocation method, characterized in that, to eliminate the use of the edge light level algorithm Multicast Routing and wavelength assignment, selecting a path using the equation when the light level is added (1) calculation:
Figure CN105007223AC00021
(1) 式中,D表示目的节点的集合,MC_SET表示第i次更新后的拓扑图Gi中MC节点的集合,SP。 (1) wherein, D denotes the set of destination nodes, MC_SET topology represents the i-th MC updated set of nodes Gi, SP. , 表示C到d的最短路径,其中P0是权重函数,其表述如下: , D represents the shortest path C, where P0 is the weighting function, which is expressed as follows:
Figure CN105007223AC00022
(2) 式中,TVt=C(SPc,(^/,c)),表示路径5巧;W,c)的代价,N。 (2) where, TVt = C (SPc, (^ /, c)), 5 indicates the path clever; W, c) the cost, N. 越大说明路径经过的跳数越多,N。 The greater the number of hops of the path through, N. 越小说明路径经过的跳数越少,路径越短;表示路径的剩余波长数,即路径上各段链路的最小剩余波长数,NJI大表示网络中剩余波长数越多,即路径的拥挤程度越小;如果Nji小则表示网络中剩余波长资源越少;a为影响因子,由整个网络中剩余波长总数决定, 通过改变a的值,就可W实现不同的选路策略,选取不同的路由;a值通过如下方式设定影响因子: 曰=9. 8斬+0. 2 0《1 (3) 式中斬是网络的剩余波长率,R"等于网络中剩余波长数和网络总波长数的比值。影响因子a被设定为关于网络的剩余波长率斬的连续函数,可W根据网络中剩余波长数实时动态地调节选路策略; 算法的框架如下: 1-1)利用Dijkstra算法计算出所有dGD到CGMC_SET的最短路径SP<,| ((/'•('),根据网络中剩余波长数和网络总波长数的比值斬通过公式(3)计算出a值,再通过公式(2)计算出路径SP。,(4, The smaller the fewer the number of hops of the path through the shorter path; represents the number of remaining wavelength path, i.e., the minimum number of wavelengths of the remaining segments of each link on the path, the more the remaining NJI large number of wavelengths indicates the network, i.e., crowded route smaller extent; Nji small if the network resources represented by the fewer remaining wavelength; a is an impact factor, the total number of the remaining wavelength determined by the entire network, by changing the value of a, W can implement different routing policy, select a different routing; a value is set by way of influencing factors: said chopped = 98 + 0 20 "1 (3) where the remaining cut wavelength of the network, R" is equal to the network and the total number of wavelengths of wavelength remaining network. the ratio of the number of impact factor is set to a continuous function of the wavelength of the remaining network chopped, W may be the number of wavelengths according to the remaining network in real time to dynamically adjust routing policy; frame algorithm works as follows: 1-1) using the Dijkstra algorithm calculating all dGD to CGMC_SET shortest path SP <, | ((/ '• ('), cut 3) is calculated by the equation (a value according to the ratio of the total number of wavelengths remaining number of wavelengths and the networks, and then by the equation ( 2) calculate the path SP., (4, £')的权重,最后通过公式(1)计算出最佳路径加入光层次,若计算出的最优光路不止一条,则选择具有离源节点S最近的连接点的那条路径; 1-2)将1-1)选出的最优光路的目的节点di从D中去除,将目的节点和最优光路中的MC节点加入MC_SET,若连接点Ci是MI节点则从MC_SET中去除,最后把1-1)选出的最优光路中的链路从图Gi中去除; 1-3)若有目的节点可^连接到当前光层次,i^i+1并跳转1-1),否则,跳转1-4); 1-4)给光层次LHk分配波长; 1-5)若目的节点D为空集,则多播会话建立完毕,否则,k^k+1,i^ 1并跳转1-1)。 £ ') of the weight, and finally calculated by the equation (1) the best path was added light level, and most of the optical path when more than one is calculated, selecting that path having the nearest connection point of the source node S; 1-2 ) to 1-1) selecting the optimum di destination node is removed from the optical path D, the destination node and node MC optimum optical path MC_SET added, if MI is connected to a node point Ci MC_SET removed from, the final 1-1) the optimum optical path of the selected link is removed from the FIG Gi; 1-3) if the destination node can be connected to the current light level ^, i ^ i + 1 and jump 1-1), or jump 1-4); 1-4) assigned to the optical wavelength level LHk; 1-5) If the destination node D is an empty set, then the multicast session establishment is completed, otherwise, k ^ k + 1, i ^ 1 and Jump 1-1).
CN 201510420758 2015-07-16 2015-07-16 Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure CN105007223A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201510420758 CN105007223A (en) 2015-07-16 2015-07-16 Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201510420758 CN105007223A (en) 2015-07-16 2015-07-16 Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure

Publications (1)

Publication Number Publication Date
CN105007223A true true CN105007223A (en) 2015-10-28

Family

ID=54379749

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201510420758 CN105007223A (en) 2015-07-16 2015-07-16 Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure

Country Status (1)

Country Link
CN (1) CN105007223A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080166127A1 (en) * 2007-01-09 2008-07-10 Hitachi Communication Technologies, Ltd. Passive optical network system and wavelength assignment method
CN101547381A (en) * 2009-05-08 2009-09-30 北京科技大学 Multicast RWA method with signal power attenuation limit in all-optical network
CN101640817A (en) * 2009-09-02 2010-02-03 中兴通讯股份有限公司 Method and device for route finding and wavelength assignment in optical network
CN101820557A (en) * 2009-02-28 2010-09-01 华为技术有限公司 Wavelength allocation method, system and equipment of wavelength division multiplexing passive optical network
CN102595257A (en) * 2011-01-13 2012-07-18 四川省电力公司通信自动化中心 Optical multicast connection wavelength distribution method for economizing on utilization of wavelength converters in optical network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080166127A1 (en) * 2007-01-09 2008-07-10 Hitachi Communication Technologies, Ltd. Passive optical network system and wavelength assignment method
CN101820557A (en) * 2009-02-28 2010-09-01 华为技术有限公司 Wavelength allocation method, system and equipment of wavelength division multiplexing passive optical network
CN101547381A (en) * 2009-05-08 2009-09-30 北京科技大学 Multicast RWA method with signal power attenuation limit in all-optical network
CN101640817A (en) * 2009-09-02 2010-02-03 中兴通讯股份有限公司 Method and device for route finding and wavelength assignment in optical network
CN102595257A (en) * 2011-01-13 2012-07-18 四川省电力公司通信自动化中心 Optical multicast connection wavelength distribution method for economizing on utilization of wavelength converters in optical network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
FEN ZHOU: "Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?", 《2009 PROCEEDINGS OF 18TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS》 *
贾颜宁: "分光器和波长转换器稀疏配置下动态多播RWA问题研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *

Similar Documents

Publication Publication Date Title
Zhu et al. Traffic grooming in an optical WDM mesh network
US7188280B2 (en) Protecting route design method in a communication network
US20080298805A1 (en) System and Method for Wavelength Conversion and Switching
US20070242607A1 (en) Method and system for controlling distribution of network topology information
Christodoulopoulos et al. Dynamic bandwidth allocation in flexible OFDM-based networks
Jukan et al. Path selection methods with multiple constraints in service-guaranteed WDM networks
Wen et al. Routing, wavelength and time-slot-assignment algorithms for wavelength-routed optical WDM/TDM networks
US20130315580A1 (en) Software defined networking photonic routing systems and methods
US20040246973A1 (en) Quality of service based optical network topology databases
Srinivasan et al. Dynamic routing in WDM grooming networks
Yao et al. A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks
US20130010612A1 (en) Impairment Aware Path Computation Element Method and System
Hou et al. Robust and integrated grooming for power-and port-cost-efficient design in IP over WDM networks
CN1878047A (en) Method for diffusing crossed restriction information in wavelength division device
Chen et al. Hybrid switching and p-routing for optical burst switching networks
Sreenath et al. Virtual source based multicast routing in WDM networks with sparse light splitting
CN101583057A (en) Network routing method and device
Yang et al. Impairment-aware routing in translucent spectrum-sliced elastic optical path networks
US20090110402A1 (en) Distributed Wavelength Assignment Using Signaling Protocols in Wavelength Switched Optical Networks
US20090060512A1 (en) Distributed Wavelength Conversion Control for Signaling Protocols
US8200084B2 (en) Encoding for information needed for routing and wavelength assignment in wavelength switched optical networks
US20140341572A1 (en) Routing and Bandwidth Assignment for Flexible Grid Wavelength Switched Optical Networks
US20090142056A1 (en) Extending Routing Protocols to Accommodate Wavelength Switched Optical Networks
Agrawal et al. CAM05-6: Lightpath Topology Configuration for Wavelength-routed IP/MPLS Networks for Time-Dependent Traffic
US8244127B2 (en) Quality of service in an optical network

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination