CN103825762A - Traffic grooming and distinction importance protection method based on clustering - Google Patents
Traffic grooming and distinction importance protection method based on clustering Download PDFInfo
- Publication number
- CN103825762A CN103825762A CN201410066885.5A CN201410066885A CN103825762A CN 103825762 A CN103825762 A CN 103825762A CN 201410066885 A CN201410066885 A CN 201410066885A CN 103825762 A CN103825762 A CN 103825762A
- Authority
- CN
- China
- Prior art keywords
- link
- wavelength
- bunch
- node
- circle
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Images
Abstract
The invention discloses a traffic grooming and distinction importance protection method based on clustering, and belongs to the technical field of communication networks. The method includes the following steps that a network is divided into clusters, and services in the clusters are directly groomed through a layered auxiliary picture; the shortest paths between the clusters are looked for by means of a cluster convergence layer for the services between the clusters and then are mapped onto the layered auxiliary picture for grooming; according to the situation of multiple priority services in an independent wavelength after grooming, importance of wavelength links is distinguished; by means of an intelligent telescopic P ring, grading protection is effectively carried out. By means of the method, dynamic services are quickly and efficiently groomed, and the utilization rate of network resources is greatly improved; meanwhile, different service quality guarantees are achieved through distinction of the importance of the link wavelengths, the situation that resources are seriously wasted due to the fact that the services are protected one by one in a traditional method is avoided by means of P-Cycle comprehensive protection, arriving and leaving of the services can be perceived, the P ring is dynamically extended and retracted, current network intelligent requirements are met, protection resource cost is greatly reduced, and the network capacity of bearing the services is improved.
Description
Technical field
The invention belongs to communication network technology field, relate to the Traffic grooming based on sub-clustering and the guard method of differentiation importance degree in a kind of WDM network.
Background technology
WDM Network data rate ranges generally arrives 622Mbps (OC-12) at 155Mbps (OC-3) at present, but wavelength speed is its tens times even hundred times.And traditional routing mode, a low speed business is monopolized a wavelength, has wasted massive band width resource.For efficent use of resources, Traffic grooming technology is arisen at the historic moment.Carry more substantial business datum and dredge rear each wavelength; once fault, loses seriously, must carry out appropriate protection to it, and because the number of services of different priorities in the aggregated flow after dredging differs; in the time of protection, answer distinguishing protection dynamics, could be more rationally effectively.
Traffic grooming merges into a high velocity stream transmission multiple low rate traffic, shares same wavelength capacities, to improve wavelength resource utilance and to increase network throughput.The optimization problem of Traffic grooming is a NP difficult problem, the people such as ZhuK utilize integral linear programming (ILP) model to dredge in " Traffic Grooming in an Optical WDM Mesh Network ", but ILP need know traffic matrix in advance, calculate length consuming time, and consuming time with network size expand increase severely, be not suitable for the network demand of current dynamic change.The people such as De T divide group to dredge together at a distance of nearer business source destination node in " Traffic grooming; routing; and wavelength assignment in an optical WDM mesh networks based on clique partitioning ", being equivalent to subregion dredges, can effectively improve and dredge efficiency, but its also to require service request be static.The people such as Wu J utilize the comprehensive auxiliary view of many granularities to dredge dynamic service in " Survivable integrated grooming in multi-granularity optical networks ", can the convenient restriction of effectively considering wavelength, port distribute route and wavelength, if but network size is larger, still need overall pathfinding, efficiency is not high.For this reason, solve that dynamic service amount dredges is a current difficult problem urgently to be resolved hurrily how effective and rapidly.
After efficiently dredging, the traffic carrying capacity of carrying in each wavelength huge and wherein priority service quantity at different levels differ, once fault is lost seriously, therefore further provide, to meet the distinguishing protection of user QoS demand most important to the lifting of network service quality.The people such as Alshaer H in " Probabilistic Differentiated Availability Services in WDMNetworks Protected by Shared Protection Schemes " for the IP operation that can dredge; distinguish the demand of high rudimentary business and select the different share protect path of reliability; can reduce network blocking probability; but it also reckons without and dredges number of services at different levels in rear each wavelength and differ; may exist reserved resource to expend for business protections at different levels merely excessive, and share protect can not reach the effect of protection completely.In a word, it is consuming time long that conventional I LP dredges model, and a point group is only dredged for static traffic; dredge and still need overall pathfinding efficiency not high by auxiliary view; and existing dredging protects general to carry out distinguishing protection one by one for business at different levels, causes reserved resource to expend excessive.Therefore, find a kind of method to dredge fast and effectively dynamic service, and to realize rational distinguishing protection for the complex situations of " a wavelength multi-service " after dredging be industry urgent problem.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of Traffic grooming and guard method of differentiation importance degree based on sub-clustering, the method is by network cluster dividing, break the whole up into parts, thereby carry out dynamic service amount while dredging without overall pathfinding, in bunch business bunch in directly dredge, shortest path between first finding bunch across bunch business, dredge again, improved and dredged efficiency; Thereafter each priority service ratio situation of rear each wavelength span is dredged in perception, divides importance degree, design intelligent P circle and carry out distinguishing protection, and perception service arrives and leaves, dynamic retractility P circle.
For achieving the above object, the invention provides following technical scheme:
Traffic grooming based on sub-clustering and distinguish an importance degree guard method, comprises the following steps: network is divided into bunch, and in bunch, business directly utilizes layering auxiliary view to dredge; Between bunch business first utilize bunch convergence-level find bunch between shortest path, then shine upon on layering auxiliary view and dredge; According to dredge the situation that has multipriority business in a rear exclusive wavelength simultaneously, distinguish wavelength span importance degree; Recycle intelligent scalable P circle and effectively carry out cascade protection.
Further, before dredging, first calculate its maximal independent set according to network topology, choose node in a minimum set of nodes in maximal independent set as leader cluster node, the node being directly connected with it, as member node, carries out sub-clustering.
Further, in bunch, business directly utilizes layering auxiliary view to dredge, between bunch business first utilize bunch convergence-level find bunch between shortest path, then shine upon on layering auxiliary view and dredge.
Further, for dredge the situation that has multipriority business in a rear exclusive wavelength simultaneously, distinguish wavelength span importance degree LI, establish in a wavelength of one section of link and after dredging, have the business of multiple grade to pass through, higher level service has S
1individual, middle rank has S
2individual, rudimentary have a S
3individual, α, beta, gamma is adjustability coefficients, C is wavelength capacities,
be in three kinds of business capacity minimum value link wavelength importance degree formula is as follows:
LI＝αS
1+βS
2+γS
3
If
for high protected level link wavelength; If
for low protected level link wavelength,
Wherein, α > β > γ > 0,
for rounding downwards;
α in formula, beta, gamma can be regarded grade-3 service weight separately as, adjusts as required, considers the grade of service and size, and the rudimentary business of higher level service and big data quantity can be protected preferably.
Further, according to the importance degree distinguishing protection rank of link wavelength, utilize P-Cycle to carry out respectively two, single link failure protection; High protected level link wavelength is placed on P-Cycle gap-bridging link, utilize after the fault of gap-bridging link, P-Cycle is upper forms two these features of Protection path, all gap-bridging links are implemented to double-link failure protection, but intersecting can not appear in all gap-bridging links on same P-Cycle, if during with two gap-bridging link simultaneous faultss of assurance, can form two nonoverlapping Protection paths on circle; Low protected level link wavelength is placed in P-Cycle circle uplink as far as possible and protects.
Further, distinguish link wavelength protected level according to link wavelength importance degree, by in high protected level set, with bunch and exist the link wavelength order of same node point to place, choose a link wavelength in set, first find apart from the nearest node of its head and the tail node, be connected, be more also connected with the head and the tail node of next link wavelength in the head and the tail node set off in search set of this link, a to the last gap-bridging link wavelength, with its head and the tail node set off in search nearest node, be connected and finish this circle; Add up this hour circle uplink, to be leaving out of circle uplink from low protection set, if still have residue link in low protection set, from a node of Article 1 link, find the node that shortest path connects Article 2 link, then from a node of another node set off in search Article 3 link of Article 2 link, by that analogy, finally get back to another node of Article 1 link, form a circle; For guaranteeing that P-Cycle can be not excessive, above sought shortest path is at a distance of being all no more than 2 jumpings.
Further, arrive and leave dynamic retractility P-Cycle according to service dynamic; Specifically comprise: when business arrives, if the high protected level of link to be protected, set out with one of them end points of new link, find and connect upper two the adjacent gap-bridging link end points of the circle nearest with it, again from another two end points of these two adjacent gap-bridging links, find shortest path, connect another end points of new link, finally leave out the circle uplink of these two gap-bridging links of former connection; If low protected level, from an end points of new link, finds and connects summit on the circle nearest with it, then from another end points of new link, find and connect and summit on the adjacent circle in the upper summit of circle before, finally leave out former circle uplink; When business is left, if without the link gap-bridging link of protecting, find summit on two circles that end points of this link is adjacent, find shortest path and connect between these two summits, in like manner find the shortest path between two summits adjacent with another end points; If circle uplink, finds shortest path and connects summit on two circles that this link is adjacent; Above-mentioned sought shortest path, only have its distance be less than former road apart from time just replace.
Further, layering auxiliary view divides each wavelength plane in optical-fiber network into one deck, coordinates upper triangular matrix recording wavelength residual capacity, and business is made rational planning for and dredged; Bunch convergence-level represents whole bunch with leader cluster node, according to bunch between connection determine after bunch converging whether be directly connected, if be still directly connected after having direct reachable path bunch to converge between bunch, if must just can reach through one or more bunches between bunch, after bunch converging, be not connected, relation between simplifying bunch, shortest path between finding fast effectively bunch.
Beneficial effect of the present invention is: the Traffic grooming based on sub-clustering that the present invention proposes and the guard method of differentiation importance degree, by reasonably network being carried out to sub-clustering, and utilize layering auxiliary view and virtual cluster convergence-level fully make rational planning for route and wavelength capacities, thereby realization is effectively dredged fast to dynamic service, has greatly improved network resource utilization; Realize different service quality guarantees by distinguishing link wavelength importance degree simultaneously; utilize P-Cycle general protection to avoid conventional needle to protect one by one the resource cost bringing excessive to business; and the arrival of perception service, leave; dynamic retractility P circle; meet current intelligent network demand; fully reduce reserved resource expense, strengthened the ability of network carrying business.
Accompanying drawing explanation
In order to make object of the present invention, technical scheme and beneficial effect clearer, the invention provides following accompanying drawing and describe:
Fig. 1 is the Traffic grooming based on sub-clustering and distinguishes importance degree protection flow chart;
Fig. 2 is for dredging layering auxiliary view and wavelength residue unit capacity matrix;
Fig. 3 for bunch in dredge example;
Fig. 4 is virtual cluster convergence-level;
Fig. 5 is gap-bridging link protection schematic diagram under double-link failure;
Fig. 6 is P-Cycle expansion schematic diagram;
Fig. 7 is that P-Cycle shrinks schematic diagram.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Fig. 1 is the Traffic grooming based on sub-clustering and distinguishes importance degree protection flow chart, as shown in the figure, adopted in the method traffic grooming module and distinguishing protection module.Wherein, in traffic grooming module bunch in business directly utilize layering auxiliary view to dredge, between bunch business first utilize virtual cluster convergence-level find bunch between shortest path, then be mapped on layering auxiliary view and dredge.Distinguishing protection module is each priority service ratio in perceived wavelength link first; assess its importance degree rank; utilize respectively again P circle to carry out single, double link failure protection; the wavelength span of single link failure protection is placed in P circle circle uplink, and the wavelength span of double-link failure protection is placed in P circle gap-bridging link.The simultaneously arrival of perception service, leave dynamic retractility P circle.
One, traffic grooming module
1, based on maximal independent set sub-clustering
Cut apart and be equivalent to reduce route pathfinding scope due to network, can reduce route computation complexity, the present invention adopts the sub-clustering based on maximal independent set to carry out network to cut apart.Choose summit in the minimum maximal independent set of number of nodes as leader cluster node, using with maximal independent set in the adjacent node of leader cluster node as its member node.This cluster-dividing method both can guarantee that leader cluster node quantity was unlikely too much, can make again leader cluster node comparatively be evenly dispersed in topology.
2, bunch in, dredge
The present invention for bunch in business, directly utilize layering auxiliary view to dredge, as shown in Figure 2.Divide level according to every optical fiber medium wavelength quantity, in figure, m represents wavelength residue unit capacity, records its value with matrix, dredges rear renewal at every turn.Choosing while dredging route, preferentially choose residue wavelength capacities enough use wavelength.Be elaborated with following example.
Suppose the topology of one bunch, network and wavelength residual capacity matrix as shown in Figure 3, topology only comprises 1 optical fiber, and 2 wavelength of every optical fiber, take OC-1 as a unit, wavelength capacities is 8, with Ser(a, b, c) expression business, wherein a refers to source node, and b refers to destination node, and c refers to ask unit capacity.If following 3 business continuities arrive: Ser1(1,4,1), Ser2(3,5,1), Ser3(3,4,1).
When Ser1 arrives, the shortest path take shortest path first searching node 1 to node 4 is as 1-4, and route assignment and residual capacity matrix are as shown in Fig. 3 (a); Then Ser2 arrives, shortest path has two 3-1-4-5 and 3-1-2-5, but owing to being free wavelength entirely in 3-1-2-5, if select this route to need newly to open wavelength resource, and 1-4 is occupied, and the enough Ser2 transmission of its residue wavelength, therefore select 3-1-4-5 to distribute, and upgrade residual capacity matrix, as shown in Fig. 3 (b); Last Ser3 arrives, and 3-1 remains wavelength in addition can be for it, but 1-4 taken completely, and Layer1 can not meet the route of 3-4, therefore need to be from La
yin er2, supplement, therefore dredge Ser3 to route 3-1 (Layer1)-1-4 (Layer2), as shown in Fig. 3 (c).
Can find out, sub-clustering is dwindled the network size of dredging, and has reduced complexity, can make rational planning for and dredge route with layered auxiliary view, therefore bunch in utilize layering auxiliary view breakout service effect remarkable.
2, bunch between, dredge
Business between the present invention is directed to bunch, first utilize virtual cluster convergence-level find bunch between shortest path, then be mapped on layering auxiliary view and dredge, as shown in Figure 4.Virtual cluster convergence-level is to refer to each bunch with each leader cluster node in network, if two bunches of direct neighbors are connected its leader cluster node.Virtual cluster convergence-level utilizes hierarchical topology to carry out layering equally.Link service condition between in bunch convergence-level bunch is carried out to mark, with N
u/ N
crepresent wherein N
cinitial value is Cu Jian UNICOM degree size, i.e. two bunches of direct connected separation number of links, if two bunches have public member node, are also calculated therein; N
ulink service condition between representing bunch, if there is occupied and this n bar link of n bar link all to have residue wavelength capacities, N
u=n.The preferential wavelength shortest path that selection has been used and residual capacity is enough in bunch convergence-level, with bunch in dredge identically, utilize layering auxiliary view to dredge.
Two, distinguishing protection module
1, distinguish wavelength span importance degree
Because the source destination node of each business may be different; institute is also not quite similar through route; causing dredging number of services at different levels in rear each wavelength differs; if carry out distinguishing protection one to one for each business; can expend a large amount of reserved resources; reduce network resource utilization, carry out cascade protection targetedly therefore need to find a kind of new method.For this reason, the importance degree (Link Importance, LI) of definition wavelength span, to press severity level distinguishing protection.If have the business of multiple grade to pass through after dredging in a wavelength of one section of link, higher level service has S
1individual, middle rank has S
2individual, rudimentary have a S
3individual, α, beta, gamma is adjustability coefficients, C is wavelength capacities,
be capacity minimum value in three kinds of business, link wavelength importance degree is as shown in formula (1).
LI＝αS
1+βS
2+γS
3 （1）
If
for high protected level link wavelength; If
for low protected level link wavelength.
Wherein, α > β > γ > 0,
for rounding downwards.
α in formula; β; γ is grade-3 service weight separately, can adjust as required the minimum capacity business number contrast that the multipotency of why with one wavelength holds; to have considered the grade of service and size; not only higher level service need to be protected preferably, and the rudimentary business of big data quantity need to be protected equally preferably, once lose and may cause mass data to retransmit because of it; expend massive band width and time, therefore network may block up more.For example, suppose that wavelength capacities is OC-8, α; β; γ is respectively 3,2, and 1; and only have a rudimentary business to transmit therein; but this volume of business is OC-6, calculates 0+0+1 >=1 by formula, so time judge; the link wavelength that transmits this business is senior link wavelength, should give good safeguard measure.
2, hierarchical intelligence P circle protection
Because single link failure in network the most often occurs, and the possibility that dual link simultaneous faults also occurs, but three link simultaneous faultss almost can be ignored.Therefore, give 100% double-link failure protection for the link wavelength of high protected level, the link wavelength of low protected level gives 100% single link failure protection.Again owing to dredging business proportion differences at different levels in rear each wavelength span; after assessment importance degree; may not be a continuous path with the wavelength span of importance degree rank, but be dispersed in network, if take the method for traditional proprietary or share protect; protection efficiency is too low; and P-Cycle protection algorithm, protection efficiency is high, and for the wavelength span disperseing; P-Cycle also can be enclosed comparatively easily in a P circle, therefore takes P-Cycle method to distinguish the protection of importance degree.The present invention will be specifically addressed from the following aspects.
(1) P-Cycle distinguishing protection algorithm
P-Cycle algorithm, has high protection efficiency.In when protection, its gap-bridging link is more than the Protection path that encloses uplink, has two Protection paths, if use up one, other one with regard to redundancy.Therefore, protect for making full use of P-Cycle, proposed the P-Cycle algorithm of distinguishing protection level.
Its main thought is: in the time that wavelength span is low protected level, become P-Cycle circle uplink, for it provides single link failure protection; In the time being high protected level, become P-Cycle gap-bridging link, and in same circle, all gap-bridging links do not intersect, if when guaranteeing two gap-bridging link simultaneous faultss, circle is upper can form two nonoverlapping Protection paths, for it provides double-link failure protection.
Take Fig. 5 as example, illustrate under double-link failure, how gap-bridging link is protected.In figure there is intersection in gap-bridging link 1-3 and 2-4, and in the time of their simultaneous faultss, the protection path on P-Cycle will overlap and lead to a conflict, and cannot protect simultaneously; And intersecting does not just appear in gap-bridging link 1-4 and 2-4, in the time that they break down simultaneously, P-Cycle can protect simultaneously.
(2) P-Cycle generates
According to aforementioned link wavelength importance degree formula, will dredge rear link wavelength and be divided into high protected level H={h
1, h
2..., h
n, and low protected level L={l
1, l
2..., l
m, concrete steps are as follows:
Step1: the link wavelength by set in H by with bunch or have same endpoints order to arrange, obtain newly gathering H={h
1, h
2..., h
n;
Step2: h from set H
1start, find distance h
1the node that two-end-point is nearest, is connected, then from h
1two-end-point sets out, and finds and connects h
2two-end-point shortest path, by that analogy until h
n.If but h wherein
iand h
i+1when spacing is greater than 2 jumping, with h
itwo-end-point set off in search nearest node, is connected and finishes this circle; Again from h
i+1start this step of repetition, until all link wavelengths in traversal H.
Step3: adding up this hour circle uplink, will be deleting from set L of circle uplink, if now gather L for empty, algorithm finishes; If obtain newly gathering L={l
1, l
2..., l
k, 1≤k≤m, from l
1end points set off in search shortest path connect l
2an end points, then from l
2another end points set off in search shortest path connect l
3an end points, to the last from l
klast end points set out and be connected to l
1, form a circle with this; For guaranteeing that P-Cycle can be not excessive, link is no more than 2 jumpings apart.
(3) P-Cycle expansion
Because service dynamic arrives and leaves, the importance degree of link wavelength changes at any time, in the time having new link wavelength to protect, can cause P-Cycle more and more if always set up new P-Cycle, reduces resource utilization.Therefore a kind of circle expansion algorithm based on existing P-Cycle is proposed.But for avoiding causing recovery time long because circle is oversize after expansion, treat that extended protection link wavelength distance P-Cycle should be no more than 1 jumping.Suppose existing circle C
1, as shown in Figure 6, link (i, j) and (i+1, j+1) they are upper any two the adjacent gap-bridging links of circle, and node i and i+1 are adjacent, and j and j+1 are adjacent, wait link to be protected for (h, k), and h is nearest apart from i, and concrete steps are as follows:
Step1: if (h, k) protected level is senior, jump Step2; If rudimentary, jump Step3;
Step2: node from node h set off in search shortest path clamping ring, because h is nearest apart from i, connects hi, then find the adjacent node i+1 that shortest path connects h and i; Find respectively shortest path connecting link (i, j) and (i+1, j+1) another two node j and j+1 from another node k of (h, k); Leave out former circle uplink (i, i+1) and (j, j+1).In this step, the shortest path of seeking is no more than 1 jumping, cancels circle expansion if exceed, and algorithm finishes.
Step3: node i from node h set off in search shortest path clamping ring, then connect the adjacent node i+1 of i from k set off in search shortest path; Leave out former circle uplink (i, i+1).In this step, the shortest path of seeking is no more than 1 jumping, cancels circle expansion if exceed, and algorithm finishes.
(4) P-Cycle shrinks
Same is efficent use of resources in the time having link not need to protect again, should shrink P-Cycle, therefore proposes P-Cycle contraction algorithm.Suppose existing circle C
2link wavelength (h; k) business in is left, does not need to protect, if (h again; k) while being gap-bridging link; link (i, j) and (i+1, j+1) are two adjacent gap-bridging links of its left and right; as shown in Fig. 7 (a), concrete steps are as follows:
Step1: circle C
2the left and right adjacent node of upper node h is i and i+1, finds shortest path and connects i and i+1, in like manner, finds left and right adjacent node j and j+1 that shortest path connects k; For guaranteeing that P-Cycle can be not excessive, the shortest path of herein finding need be shorter than former circle uplink (i, i+1), (j, j+1), shrinks otherwise cancel, and algorithm finishes.
Step2: leave out former circle uplink (i, h), (h, i+1), (j, k) and (k, j+1).
If when (h, k) is circle uplink, node i and i+1 are (h, k) left and right adjacent node, as shown in Fig. 7 (b), concrete steps are as follows:
Step1: find shortest path between i and i+1, if this shortest path is less than former circle uplink (i, i+1), connect; Cancel and shrinking if be greater than, algorithm finishes.
Step2: leave out former circle uplink (i, h), (k, i+1).
Finally explanation is, above preferred embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is described in detail by above preferred embodiment, but those skilled in the art are to be understood that, can make various changes to it in the form and details, and not depart from the claims in the present invention book limited range.
Claims (8)
1. a Traffic grooming based on sub-clustering and distinguish importance degree guard method: it is characterized in that: comprise the following steps: network is divided into bunch, and in bunch, business directly utilizes layering auxiliary view to dredge; Between bunch business first utilize bunch convergence-level find bunch between shortest path, then shine upon on layering auxiliary view and dredge; According to dredge the situation that has multipriority business in a rear exclusive wavelength simultaneously, distinguish wavelength span importance degree; Recycle intelligent scalable P circle and effectively carry out cascade protection.
2. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: first calculate its maximal independent set according to network topology before dredging; choose node in a minimum set of nodes in maximal independent set as leader cluster node; the node being directly connected with it, as member node, carries out sub-clustering.
3. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: in bunch, business directly utilizes layering auxiliary view to dredge; between bunch business first utilize bunch convergence-level find bunch between shortest path, then shine upon on layering auxiliary view and dredge.
4. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: for dredge the situation that has multipriority business in a rear exclusive wavelength simultaneously; distinguish wavelength span importance degree LI; if have the business of multiple grade to pass through after dredging in a wavelength of one section of link, higher level service has S
1individual, middle rank has S
2individual, rudimentary have a S
3individual, α, beta, gamma is adjustability coefficients, C is wavelength capacities,
be in three kinds of business capacity minimum value link wavelength importance degree formula is as follows:
LI＝αS
1+βS
2+γS
3
If
for high protected level link wavelength; If
for low protected level link wavelength,
Wherein, α > β > γ > 0,
for rounding downwards.
5. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: according to the importance degree distinguishing protection rank of link wavelength, utilize P-Cycle to carry out respectively two, single link failure protection; High protected level link wavelength is placed on P-Cycle gap-bridging link, utilize after the fault of gap-bridging link, P-Cycle is upper forms two these features of Protection path, all gap-bridging links are implemented to double-link failure protection, but intersecting can not appear in all gap-bridging links on same P-Cycle, if during with two gap-bridging link simultaneous faultss of assurance, can form two nonoverlapping Protection paths on circle; Low protected level link wavelength is placed in P-Cycle circle uplink as far as possible and protects.
6. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: distinguish link wavelength protected level according to link wavelength importance degree, by in high protected level set, with bunch and exist the link wavelength order of same node point to place, choose a link wavelength in set, first find apart from the nearest node of its head and the tail node, be connected, also be connected with the head and the tail node of next link wavelength in the head and the tail node set off in search set of this link again, a to the last gap-bridging link wavelength, with its head and the tail node set off in search nearest node, be connected and finish this circle, add up this hour circle uplink, to be leaving out of circle uplink from low protection set, if still have residue link in low protection set, from a node of Article 1 link, find the node that shortest path connects Article 2 link, then from a node of another node set off in search Article 3 link of Article 2 link, by that analogy, finally get back to another node of Article 1 link, form a circle, for guaranteeing that P-Cycle can be not excessive, above sought shortest path is at a distance of being all no more than 2 jumpings.
7. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: arrive and leave dynamic retractility P-Cycle according to service dynamic; Specifically comprise: when business arrives, if the high protected level of link to be protected, set out with one of them end points of new link, find and connect upper two the adjacent gap-bridging link end points of the circle nearest with it, again from another two end points of these two adjacent gap-bridging links, find shortest path, connect another end points of new link, finally leave out the circle uplink of these two gap-bridging links of former connection; If low protected level, from an end points of new link, finds and connects summit on the circle nearest with it, then from another end points of new link, find and connect and summit on the adjacent circle in the upper summit of circle before, finally leave out former circle uplink; When business is left, if without the link gap-bridging link of protecting, find summit on two circles that end points of this link is adjacent, find shortest path and connect between these two summits, in like manner find the shortest path between two summits adjacent with another end points; If circle uplink, finds shortest path and connects summit on two circles that this link is adjacent; Above-mentioned sought shortest path, only have its distance be less than former road apart from time just replace.
8. Traffic grooming and the guard method of differentiation importance degree based on sub-clustering according to claim 1: it is characterized in that: layering auxiliary view divides each wavelength plane in optical-fiber network into one deck, coordinate upper triangular matrix recording wavelength residual capacity, business is made rational planning for and dredged; Bunch convergence-level represents whole bunch with leader cluster node, according to bunch between connection determine after bunch converging whether be directly connected, if be still directly connected after having direct reachable path bunch to converge between bunch, if must just can reach through one or more bunches between bunch, after bunch converging, be not connected, relation between simplifying bunch, shortest path between finding fast effectively bunch.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410066885.5A CN103825762B (en) | 2014-02-26 | 2014-02-26 | A kind of Traffic grooming and differentiation importance degree guard method based on sub-clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410066885.5A CN103825762B (en) | 2014-02-26 | 2014-02-26 | A kind of Traffic grooming and differentiation importance degree guard method based on sub-clustering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103825762A true CN103825762A (en) | 2014-05-28 |
| CN103825762B CN103825762B (en) | 2017-05-31 |
Family
ID=50760609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410066885.5A Active CN103825762B (en) | 2014-02-26 | 2014-02-26 | A kind of Traffic grooming and differentiation importance degree guard method based on sub-clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103825762B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515644A (en) * | 2015-11-26 | 2016-04-20 | 电子科技大学 | Monitoring trail design method based on limited monitoring resource in all optical network |
| CN105721196A (en) * | 2016-01-20 | 2016-06-29 | 昆明理工大学 | Link importance evaluation method of directed communication network |
| CN106067139A (en) * | 2016-05-31 | 2016-11-02 | 北京红马传媒文化发展有限公司 | A kind of mthods, systems and devices of construction feature database |
| CN106301952A (en) * | 2016-09-18 | 2017-01-04 | 北京邮电大学 | A kind of SDN datum plane link backup method and device |
| CN107835046A (en) * | 2017-01-24 | 2018-03-23 | 大连大学 | A kind of method for routing |
| CN110248393A (en) * | 2019-06-17 | 2019-09-17 | 西北工业大学 | A kind of cluster-dividing method based on portfolio weight |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7577359B2 (en) * | 2004-05-03 | 2009-08-18 | At&T Intellectual Property I, L.P. | System and method for SONET transport optimization (S-TOP) |
| CN102137313B (en) * | 2011-04-29 | 2013-06-19 | 东北大学 | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network |
-
2014
- 2014-02-26 CN CN201410066885.5A patent/CN103825762B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| BENSONG CHEN, GEORGE N. ROUSKAS: ""A Framework for Hierarchical Traffic Grooming in WDM Networks of General Topology"", 《INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS》 * |
| 王汝言，刘成耀，吴大鹏，徐印: ""ＷＤＭ 网络中基于分簇的静态业务量疏导算法"", 《光通信***与网络技术》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515644A (en) * | 2015-11-26 | 2016-04-20 | 电子科技大学 | Monitoring trail design method based on limited monitoring resource in all optical network |
| CN105515644B (en) * | 2015-11-26 | 2017-10-31 | 电子科技大学 | Monitoring mark design method based on limited monitoring resource in a kind of all-optical network |
| CN105721196A (en) * | 2016-01-20 | 2016-06-29 | 昆明理工大学 | Link importance evaluation method of directed communication network |
| CN105721196B (en) * | 2016-01-20 | 2019-02-19 | 昆明理工大学 | A kind of Link Significance evaluation method of oriented communication network network |
| CN106067139A (en) * | 2016-05-31 | 2016-11-02 | 北京红马传媒文化发展有限公司 | A kind of mthods, systems and devices of construction feature database |
| CN106301952A (en) * | 2016-09-18 | 2017-01-04 | 北京邮电大学 | A kind of SDN datum plane link backup method and device |
| CN107835046A (en) * | 2017-01-24 | 2018-03-23 | 大连大学 | A kind of method for routing |
| CN110248393A (en) * | 2019-06-17 | 2019-09-17 | 西北工业大学 | A kind of cluster-dividing method based on portfolio weight |
| CN110248393B (en) * | 2019-06-17 | 2022-07-05 | 西北工业大学 | Clustering method based on traffic weight |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103825762B (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103825762A (en) | Traffic grooming and distinction importance protection method based on clustering | |
| US8144629B2 (en) | Admission control for services | |
| US7860392B2 (en) | Optical network topology databases based on a set of connectivity constraints | |
| CN105933174B (en) | A kind of precomputation restoration methods based on apart from adaptive routing and frequency spectrum distribution | |
| EP1921808B1 (en) | Preemptive transmission protection scheme for data services | |
| CN106817306B (en) | Method and device for determining target route | |
| CN103346979B (en) | Flow distribution method and equipment in SPBM network | |
| CN110289996A (en) | A kind of business route computing method based on SR | |
| CN102014075B (en) | Traffic policing method and device | |
| US20110222394A1 (en) | Fabric extra traffic | |
| CN102143052A (en) | Method, equipment and system for lossless bandwidth | |
| CN101155131A (en) | Method for establishing label switched path of minimized path preemption cost | |
| CN1731768A (en) | Method for forwarding traffic in a connectionless communications network | |
| CN102469019B (en) | Device and method for allocating aggregated link bandwidth in packet-switched network | |
| CN101610433A (en) | The multi-constraint condition routing selection method that a kind of support policy is resolved | |
| Hu et al. | Location-constrained survivable network virtualization | |
| CN102904810B (en) | Label switching path calculating method and label switching path calculating device | |
| WO2016165142A1 (en) | Preserving method and device for virtual network | |
| WO2016119265A1 (en) | Network service establishment method, cooperation control centre and network system | |
| CN108476175B (en) | Transfer SDN traffic engineering method and system using dual variables | |
| CN105847146B (en) | A method of it improving level distribution SDN and controls plane router efficiency | |
| CN105357124A (en) | MapReduce bandwidth optimization method | |
| CN106506362B (en) | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss | |
| CN101258715B (en) | Method for bandwidth allocation of replacement router within remote communication network and system for managing router of guaranteed bandwidth services with remote communication network | |
| CN101599979B (en) | Method for realizing IP telecommunication network based on tunnel |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |