CN105515976B - Simplify route selection method between a kind of electric power backbone optical network domain - Google Patents
Simplify route selection method between a kind of electric power backbone optical network domain Download PDFInfo
- Publication number
- CN105515976B CN105515976B CN201510873630.4A CN201510873630A CN105515976B CN 105515976 B CN105515976 B CN 105515976B CN 201510873630 A CN201510873630 A CN 201510873630A CN 105515976 B CN105515976 B CN 105515976B
- Authority
- CN
- China
- Prior art keywords
- domain
- node
- routing
- inter
- formula
- 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.)
- Active
Links
- 230000003287 optical effect Effects 0.000 title claims abstract description 8
- 238000010187 selection method Methods 0.000 title claims abstract description 6
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000004891 communication Methods 0.000 claims description 43
- 238000007796 conventional method Methods 0.000 claims description 28
- 230000004069 differentiation Effects 0.000 claims description 22
- 238000012423 maintenance Methods 0.000 claims description 8
- 102000003712 Complement factor B Human genes 0.000 claims description 6
- 108090000056 Complement factor B Proteins 0.000 claims description 6
- 238000012795 verification Methods 0.000 claims description 2
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 239000011159 matrix material Substances 0.000 claims 1
- 230000001105 regulatory effect Effects 0.000 abstract description 2
- 238000006424 Flood reaction Methods 0.000 abstract 1
- 230000015572 biosynthetic process Effects 0.000 abstract 1
- 238000013519 translation Methods 0.000 description 5
- 238000005457 optimization Methods 0.000 description 3
- 238000007689 inspection Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000013468 resource allocation Methods 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 210000000988 bone and bone Anatomy 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000013439 planning Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Invention describes between a kind of electric power backbone optical network domain simplify route selection method, this method comprises the following steps: (1) between switching domain advertising of route node initial information；(2) simplify Route Selection between domain.This method, which passes through information exchange between level, domain, reduces information content, and formation advertizing node list completes inter-domain routing information exchange, effectively distinguishes repeated information, inhibit the information content that floods.Update and the router-level topology of routing iinformation can be realized by the cooperation between distributed node using this method.Set multiple target dynamic regulating method, allow operator to be adjusted according to class of service, while calculating routing, comprehensively considers operation characteristic, the resource information of link, the Route Selection for realizing resourceoriented can effectively reduce the complexity of link resource information distribution.
Description
Technical field
The invention belongs to technical field of electric power communication, and in particular to simplify Route Selection between a kind of electric power backbone optical network domain
Method.
Background technique
Power telecom network, which carries, will largely do concerning the business in power network safety operation, moreover, with these industry
Work work IPization trend it is gradually obvious, the requirement to the flexibility of electric power backbone communication network is also higher and higher.However, at present
Powerline network causes due to lacking reasonable planning and network path selection there are also the method that radio frequency channel is distributed very much
There is the bottleneck of link in provincial backbone network.Therefore, as powerline network scale increases, across the radio frequency channel point of routed domain
It is highlighted with problem.Radio frequency channel distribution technique across routed domain is also the important of the resource reasonability distribution of solution powerline network
Means need technical staff's enough attention.At present in terms of the radio frequency channel resource allocation for cross over routed domain, one urgently to be resolved
The problem of be that and lack effective Global Topological resource information, since the missing of Global Topological resource information even influences nothing
Method obtains the allocation plan of optimization.
Summary of the invention
The technical problem to be solved by the present invention is in view of the drawbacks of the prior art, provide a kind of electric power backbone optical network domain
Between simplify route selection method, using this method should be able to according to the index request of electrical network business, flexibly select optimization aim, realize
Electrical network business dynamic routing quickly calculates, and can reduce the calculating demand of link circuit resource allocation algorithm.
The technical scheme is that simplified route selection method includes between a kind of provided electric power backbone optical network domain
Following specific steps:
(1) between switching domain advertising of route node initial information:
(1.1) conventional method is used, the inter-domain routing of the online electric power backbone communication network for reading commission maintenance power grid is logical
Node attribute information is accused, the affiliated hierarchical information of the inter-domain routing advertizing node is therefrom obtained；
(1.2) conventional method, the affiliated level of the obtained inter-domain routing advertizing node of checking step (1.1) are used.Pass through through
The affiliated hierarchical value of the inter-domain routing advertizing node checked is crossed, between the domain for limiting the electric power backbone communication network of commission maintenance power grid
Route scope: the level is by human configuration or setting in initial procedure, and level number is more than or equal to 0.The level
Numerical value is lower, and corresponding level is lower.When the hierarchical value of inter-domain routing advertizing node is 0, indicate that 0 is the domain in this domain
Between advertising of route node, step (1) leaves it at that.At this point, the responsibility of the inter-domain routing advertizing node is real to the interior routing in domain
Update is applied, the advertizing node into domain sends associated broadcast message.Hierarchical value is higher, the electric power bone of the commission maintenance power grid
The inter-domain routing range of dry communication network is wider.If the affiliated level of advertizing node is greater than 0, (1.3) are entered step；
(1.3) conventional method is used, above layers grade inter-domain routing advertizing node is formed into list, makes the listuser structure
Make the notice link of inter-domain routing advertizing node；
(1.4) pass through the resource pipe of the notice link of advertising of route node between step (1.3) obtained listuser structural domain
Managing device LRM, (abbreviation of full name in English " Link Resource Management ", Chinese translation are " resource manager ".) obtain
Bottom neighbor list；
(1.5) according to step (1.4) obtained neighbor list, the RC (full name in English of more above-mentioned inter-domain routing advertizing node
The abbreviation of " Routing Controller ", Chinese translation be " path control deivce ") number it is whether identical as the RC number of neighbours,
If identical, (1.6) are entered step, are otherwise directly entered step (1.7)；
(1.6) verification step (1.5) obtains whether the information in relation to above-mentioned inter-domain routing advertizing node is to repeat to update letter
Breath, if it is more new information is repeated, step leaves it at that, and if not more new information is repeated, then enters step (1.7)；
(1.7) determine whether neighbours RC number and the RC of advertizing node number are different, if it is different, starting OSPF
(abbreviation of full name in English " Open Shortest Path First ", Chinese translation are " ospf ") link
More new procedures, complete the update of the notice link information of the inter-domain routing advertizing node, and the inter-domain routing of update is noticed
Link state database is written in the notice link information of node；
(1.8) the notice link information of above-mentioned inter-domain routing advertizing node is updated to all electric power backbone communication networks
Inter-domain routing advertizing node, starts the routing update program of the inter-domain routing advertizing node, and follows following step, and utilization is above-mentioned
The information of updated inter-domain routing advertizing node carries out inter-domain routing selection；
(2) simplify Route Selection between domain:
(2.01) in line computation network GiConnection dimension, use RA_cd1(i) network G is indicatediConnection dimension,
In formula, N_node(Gi) it is network GiPresent in router number, d_Gi(vi) it is network GiMiddle router viConnection
Degree；
(2.02) in line computation network GiIn resource service condition, use RA_cd2(i) network G is indicatediMiddle resource uses feelings
Condition,
In formula, N_link(Gi) indicate network GiPresent in chain travel permit number, N_ λ (j) indicate link j in remaining radio frequency channel
Number, MaxN_ λ (Gi) it is network GiIn maximum can use radio frequency channel number, MinN_ λ (Gi) it is network GiIn minimum can use number of channels
Mesh；
(2.03) in summary network GiConnection dimension RA_cd1(i) and resource service condition RA_cd2(i), outlet is obtained
By domain selective factor B RA_cl (i)
It is limited to select the higher region of routed domain selective factor B as next routed domain when being routed；
(2.04) determine that step (2.03) selects the specific routing of next routed domain；
(2.05) in view of energy communication service is many kinds of, in order to avoid complicated classification and service channel management, originally
Invention divides energy communication service according to priority, and specific priority mapping mode can be according to the specific need of business
It wants, the delay as needed for business, delay jitter and packet loss.The important principle that routing is calculated in domain is exactly to need to protect
Hindering the higher business of priority has preferable service quality, and building for high-level service channel is preferentially ensured when establishing optical path
Vertical, to promote the QoS of business, (abbreviation of full name in English " Quality of Service ", Chinese translation are " Service Quality
Amount ".) performance indicator.The present invention select the grade of service, radio frequency channel occupancy, next-hop node degree of communication and with the road purpose Yu Jian
The index calculated by four indexs of distance of advertizing node as intra-area routes.It is assumed that alternative next-hop set of routes quantity is m, it will
Aforementioned four attribute is respectively defined as xij, i=1,2 ..., m；J=1,2,3,4, x in formulaijFor selected attribute value, wherein i
Indicate the serial number of next-hop routing, j indicates the serial number of selected index, if j=1 indicates the grade of service, j=2 indicates that radio frequency channel occupies
Rate, j=3 indicate next-hop node degree of communication, and j=4 is indicated at a distance from purpose inter-domain routing advertizing node；
(2.06) it is the consistency for ensureing index magnitude, conventional method is used first, to xijIt is standardized, obtains square
Battle array Y=(yij)m×4, y in formulaijFor xijIndex after standardization, m are alternative next-hop set of routes quantity；Standardization
xijWhen, ensure that the superiority and inferiority trend of index matches using conventional method.By taking the present invention as an example, the more high then weight of the grade of service is higher,
The more high then weight of radio frequency channel occupancy is lower, and the more high then weight of next-hop node degree of communication is higher, notices and saves with purpose inter-domain routing
The more remote then weight of distance of point is lower；
(2.07) conventional method is then used, to y described in step (2.06)ijIt is normalized, obtainsI=1 in formula, 2 ..., m, j=1,2,3,4, pijFor the y after normalizedij, to meet
(2.08) entropy of the grade of service is calculated separatelyIn formula, j=1, i are next-hop
The serial number of routing, k are the entropy of constant factor, the radio frequency channel occupancyIn formula, j=2, under i is
One jumps the serial number of routing, and k is the entropy of constant factor, the next-hop node degree of communicationIn formula, j
=3, i are the serial number of next-hop routing, and k is constant factor, the entropy at a distance from purpose inter-domain routing advertizing nodeIn formula, j=4, i are the serial number of next-hop routing, and k is constant factor；
(2.09) conventional method is used, obtains the differentiation of the grade of service respectively using entropy obtained by step (2.08)
Factor gj=1-ej, j=1, e in formula1For the entropy of the grade of service, the differentiation factor g of the radio frequency channel occupancyj=1-
ej, j=2, e in formula2For the entropy of the radio frequency channel occupancy, the differentiation factor g of the next-hop node degree of communicationj=1-ej,
In formula, j=3, e3Entropy, the difference at a distance from purpose inter-domain routing advertizing node for the next-hop node degree of communication
Alienation factor gj=1-ej, in formula, j=4, e4For the entropy at a distance from purpose inter-domain routing advertizing node；
(2.10) conventional method is used, determines the weight of the grade of service respectivelyJ=1 in formula, g1For
The weight of the differentiation factor of the grade of service, the radio frequency channel occupancyJ=2 in formula, g2For the radio frequency channel
The weight of the differentiation factor of occupancy, the next-hop node degree of communicationIn formula, j=3, g3It is described next
The differentiation factor of hop node degree of communication, the weight at a distance from purpose inter-domain routing advertizing nodeFormula
In, j=4, g4For the differentiation factor at a distance from purpose inter-domain routing advertizing node；
(2.11) conventional method is used, ω is utilizedjIndex choosing next-hop routes the magnitude of value
In formula, d_v (i) is the degree of communication of next-hop routing, d_vminFor the minimum d_v (i) in routed domain, d_vmaxFor road
By the maximum d_v (i) in domain, N_ λ (i) is that radio frequency channel number, N_ λ can be used in next linkminFor the minimum N_ λ in routed domain
(i), N_ λmaxFor the maximum N_ λ (i) in routed domain, N_node is the number of nodes in routed domain, and Rank_t (i) is carrying electric power
The rank of business.
The working principle of the invention is: by information exchange between level, domain, reducing and needs to hand in inter-domain routing calculating process
The information content changed.After obtaining the affiliated level of advertizing node, determines routing compass of competency, form advertizing node list.Pass through local
LRM, RC module complete inter-domain routing information exchange, in information exchanging process, effectively distinguish repeated information, inhibit to flood
Information content.The treatment mechanism of inter-domain routing information is provided, link update, LSA (full name in English " Link in ospf protocol are cooperated
The abbreviation of State Advertisement ", Chinese translation are " Link State Notification ") ageing process, form domain-to-domain link data
Library.The link requirements feature for considering power business simultaneously according to the optimization aim of different kinds of business setting routing, and is supported
Operator's flexible configuration can distinguish processing according to class of service difference.
The beneficial effects of the present invention are: can realize routing iinformation more by the cooperation between distributed node using this method
New and router-level topology.Set multiple target dynamic regulating method allows operator to be adjusted according to class of service, is calculating road
By while, comprehensively consider operation characteristic, the resource information of link, realize the Route Selection of resourceoriented, can effectively reduce chain
The complexity of road resource information distribution.
Specific embodiment
Embodiment 1:
(1) between switching domain advertising of route node initial information:
(1.1) conventional method is used, the inter-domain routing of the online electric power backbone communication network for reading commission maintenance power grid is logical
Node attribute information is accused, the affiliated hierarchical information of the inter-domain routing advertizing node is therefrom obtained；
(1.2) conventional method, the affiliated level of the obtained inter-domain routing advertizing node of checking step (1.1) are used.Pass through through
The affiliated hierarchical value of the inter-domain routing advertizing node checked is crossed, between the domain for limiting the electric power backbone communication network of commission maintenance power grid
Route scope: the level numerical value is lower, and corresponding level is lower.The level of advertising of route node between inspection result display field
Value is 0, indicates that 0 is the inter-domain routing advertizing node in this domain, and step (1) leaves it at that, at this point, inter-domain routing notice section
The responsibility of point is to implement to update to the interior routing in domain, and the advertizing node into domain sends associated broadcast message；
(2) simplify Route Selection between domain:
(2.01) in line computation network GiConnection dimension, use RA_cd1(i) network G is indicatediConnection dimension,
In formula, N_node(Gi) it is network GiPresent in router number, d_Gi(vi) it is network GiMiddle router viConnection
Degree；
(2.02) in line computation network GiIn resource service condition, use RA_cd2(i) network G is indicatediMiddle resource uses feelings
Condition,
In formula, N_link(Gi) indicate network GiPresent in chain travel permit number, N_ λ (j) indicate link j in remaining radio frequency channel
Number, MaxN_ λ (Gi) it is network GiIn maximum can use radio frequency channel number, MinN_ λ (Gi) it is network GiIn minimum can use number of channels
Mesh；
(2.03) in summary network GiConnection dimension RA_cd1(i) and resource service condition RA_cd2(i), outlet is obtained
By domain selective factor B RA_cl (i)
It is limited to select the higher region of routed domain selective factor B as next routed domain when being routed；
(2.04) determine that step (2.03) selects the specific routing of next routed domain；
(2.05) grade of service, radio frequency channel occupancy, next-hop node degree of communication are selected and is noticed with purpose inter-domain routing
The index that four indexs of distance of node are calculated as intra-area routes.It is assumed that alternative next-hop set of routes quantity is m, by above-mentioned four
A attribute is respectively defined as xij, i=1,2 ..., m；J=1,2,3,4, x in formulaijFor selected attribute value, wherein under i expression
One jumps the serial number of routing, and j indicates the serial number of selected index, if j=1 indicates the grade of service, j=2 indicates radio frequency channel occupancy, j=3
Indicate next-hop node degree of communication, j=4 is indicated at a distance from purpose inter-domain routing advertizing node；
(2.06) it is the consistency for ensureing index magnitude, conventional method is used first, to xijIt is standardized, obtains square
Battle array Y=(yij)m×4, y in formulaijFor xijIndex after standardization, m are alternative next-hop set of routes quantity；Standardization
xijWhen, ensure that the superiority and inferiority trend of index matches using conventional method, the more high then weight of the grade of service is higher, and radio frequency channel occupancy is higher
Then weight is lower, and the more high then weight of next-hop node degree of communication is higher, at a distance from purpose inter-domain routing advertizing node more it is remote then
Weight is lower；
(2.07) conventional method is then used, to y described in step (2.06)ijIt is normalized, obtainsI=1 in formula, 2 ..., m, j=1,2,3,4, pijFor the y after normalizedij, to meet
(2.08) entropy of the grade of service is calculated separatelyIn formula, j=1, i are next-hop
The serial number of routing, k are the entropy of constant factor, the radio frequency channel occupancyIn formula, j=2, under i is
One jumps the serial number of routing, and k is the entropy of constant factor, the next-hop node degree of communicationIn formula, j
=3, i are the serial number of next-hop routing, and k is constant factor, the entropy at a distance from purpose inter-domain routing advertizing nodeIn formula, j=4, i are the serial number of next-hop routing, and k is constant factor；
(2.09) conventional method is used, obtains the differentiation of the grade of service respectively using entropy obtained by step (2.08)
Factor gj=1-ej, j=1, e in formula1For the entropy of the grade of service, the differentiation factor g of the radio frequency channel occupancyj=1-
ej, j=2, e in formula2For the entropy of the radio frequency channel occupancy, the differentiation factor g of the next-hop node degree of communicationj=1-ej,
In formula, j=3, e3Entropy, the difference at a distance from purpose inter-domain routing advertizing node for the next-hop node degree of communication
Alienation factor gj=1-ej, in formula, j=4, e4For the entropy at a distance from purpose inter-domain routing advertizing node；
(2.10) conventional method is used, determines the weight of the grade of service respectivelyJ=1 in formula, g1For
The weight of the differentiation factor of the grade of service, the radio frequency channel occupancyJ=2 in formula, g2For the radio frequency channel
The weight of the differentiation factor of occupancy, the next-hop node degree of communicationIn formula, j=3, g3It is described next
The differentiation factor of hop node degree of communication, the weight at a distance from purpose inter-domain routing advertizing nodeFormula
In, j=4, g4For the differentiation factor at a distance from purpose inter-domain routing advertizing node；
(2.11) conventional method is used, ω is utilizedjIndex choosing next-hop routes the magnitude of value
In formula, d_v (i) is the degree of communication of next-hop routing, d_vminFor the minimum d_v (i) in routed domain, d_vmaxFor road
By the maximum d_v (i) in domain, N_ λ (i) is that radio frequency channel number, N_ λ can be used in next linkminFor the minimum N_ λ in routed domain
(i), N_ λmaxFor the maximum N_ λ (i) in routed domain, N_node is the number of nodes in routed domain, and Rank_t (i) is carrying electric power
The rank of business.
Embodiment 2:
(1) between switching domain advertising of route node initial information:
Step (1.1) is the same as embodiment 1；
(1.2) conventional method, the affiliated level of the obtained inter-domain routing advertizing node of checking step (1.1) are used.Pass through through
The affiliated hierarchical value of the inter-domain routing advertizing node checked is crossed, between the domain for limiting the electric power backbone communication network of commission maintenance power grid
Route scope: the level numerical value is lower, and corresponding level is lower.The level of advertising of route node between inspection result display field
Value is greater than 0, enters step (1.3)；
(1.3) conventional method is used, above layers grade inter-domain routing advertizing node is formed into list, makes the listuser structure
Make the notice link of inter-domain routing advertizing node；
(1.4) pass through the resource pipe of the notice link of advertising of route node between step (1.3) obtained listuser structural domain
It manages device and obtains bottom neighbor list；
(1.5) according to step (1.4) obtained neighbor list, the RC of more above-mentioned inter-domain routing advertizing node number whether with
The RC number of neighbours is identical, and comparison result shows not identical, is directly entered step (1.7)；
(1.7) determine whether neighbours RC number and the RC of advertizing node number are different, it is as a result identical, do not start then
OSPF link more new procedures；
(1.8) the notice link information of above-mentioned inter-domain routing advertizing node is updated to all electric power backbone communication networks
Inter-domain routing advertizing node, starts the routing update program of the inter-domain routing advertizing node, and follows following step, and utilization is above-mentioned
The information of updated inter-domain routing advertizing node carries out inter-domain routing selection；
(2) simplify Route Selection between domain:
Step (2.01)~(2.11) are the same as embodiment 1.
Claims (1)
1. simplifying route selection method between a kind of electric power backbone optical network domain, this method comprises the following steps:
(1) between switching domain advertising of route node initial information:
(1.1) conventional method is used, section is noticed in the inter-domain routing of the online electric power backbone communication network for reading commission maintenance power grid
Point attribute information, therefrom obtains the affiliated hierarchical information of the inter-domain routing advertizing node；
(1.2) conventional method, the affiliated level of the obtained inter-domain routing advertizing node of checking step (1.1), by by examining are used
The affiliated hierarchical value for the inter-domain routing advertizing node looked into limits the inter-domain routing of the electric power backbone communication network of commission maintenance power grid
Range: the level numerical value is lower, and corresponding level is lower, when the hierarchical value of inter-domain routing advertizing node is 0, indicates 0
Inter-domain routing advertizing node as in this domain, step (1) leaves it at that, at this point, the responsibility of the inter-domain routing advertizing node is
Implement to update to the interior routing in domain, the advertizing node into domain sends associated broadcast message；Hierarchical value is higher, the commission dimension
The inter-domain routing range for protecting the electric power backbone communication network of power grid is wider, if the affiliated level of advertizing node is greater than 0, enters step
(1.3)；
(1.3) conventional method is used, above layers grade inter-domain routing advertizing node is formed into list, makes the listuser structural domain
Between advertising of route node notice link；
(1.4) pass through the resource manager of the notice link of advertising of route node between step (1.3) obtained listuser structural domain
Obtain bottom neighbor list；
(1.5) according to step (1.4) obtained neighbor list, the RC of more above-mentioned inter-domain routing advertizing node number whether with neighbours
RC number it is identical, if identical, enter step (1.6), be otherwise directly entered step (1.7)；
(1.6) verification step (1.5) obtains whether the information in relation to above-mentioned inter-domain routing advertizing node is to repeat to update information, such as
Fruit is to repeat more new information, and step leaves it at that, and if not more new information is repeated, then enters step (1.7)；
(1.7) determine whether neighbours RC number and the RC of advertizing node number are different, if it is different, starting OSPF link is more
New procedures, complete the update of the notice link information of the inter-domain routing advertizing node, and the inter-domain routing of update is noticed and is saved
Link state database is written in the notice link information of point；
(1.8) the notice link information of above-mentioned inter-domain routing advertizing node is updated between the domain of all electric power backbone communication networks
Advertising of route node, starts the routing update program of the inter-domain routing advertizing node, and follows following step, using it is above-mentioned more
The information of new inter-domain routing advertizing node carries out inter-domain routing selection；
(2) simplify Route Selection between domain:
(2.01) in line computation network GiConnection dimension, use RA_cd1(i) network G is indicatediConnection dimension,
In formula, N_node(Gi) it is network GiPresent in router number, d_Gi(vi) it is network GiMiddle router viDegree of communication；
(2.02) in line computation network GiIn resource service condition, use RA_cd2(i) network G is indicatediMiddle resource service condition,
In formula, N_link(Gi) indicate network GiPresent in chain travel permit number, N_ λ (j) indicate link j in remaining number of channels,
MaxN_λ(Gi) it is network GiIn maximum can use radio frequency channel number, MinN_ λ (Gi) it is network GiIn minimum can use radio frequency channel number；
(2.03) in summary network GiConnection dimension RA_cd1(i) and resource service condition RA_cd2(i), routed domain is obtained
Selective factor B RA_cl (i)
It is limited to select the higher region of routed domain selective factor B as next routed domain when being routed；
(2.04) determine that step (2.03) selects the specific routing of next routed domain；
(2.05) select the grade of service, radio frequency channel occupancy, next-hop node degree of communication and with purpose inter-domain routing advertizing node
The index that is calculated as intra-area routes of four indexs of distance.It is assumed that alternative next-hop set of routes quantity is m, by aforementioned four category
Property is respectively defined as xij, i=1,2 ..., m；J=1,2,3,4, x in formulaijFor selected attribute value, wherein i indicates next-hop
The serial number of routing, j indicate the serial number of selected index, if j=1 indicates the grade of service, j=2 indicates radio frequency channel occupancy, and j=3 is indicated
Next-hop node degree of communication, j=4 are indicated at a distance from purpose inter-domain routing advertizing node；
(2.06) it is the consistency for ensureing index magnitude, conventional method is used first, to xijIt is standardized, obtains matrix Y
=(yij)m×4, y in formulaijFor xijIndex after standardization, m are alternative next-hop set of routes quantity；Standardization xij
When, ensure that the superiority and inferiority trend of index matches using conventional method, the more high then weight of the grade of service is higher, and radio frequency channel occupancy gets over Gao Ze
Weight is lower, and the more high then weight of next-hop node degree of communication is higher, more remote at a distance from purpose inter-domain routing advertizing node, weighs
It is again lower；
(2.07) conventional method is then used, to y described in step (2.06)ijIt is normalized, obtainsFormula
Middle i=1,2 ..., m, j=1,2,3,4, pijFor the y after normalizedij, to meet
(2.08) entropy of the grade of service is calculated separatelyIn formula, j=1, i are next-hop routing
Serial number, k be constant factor, the radio frequency channel occupancy entropyIn formula, j=2, i are next-hop
The serial number of routing, k are the entropy of constant factor, the next-hop node degree of communicationIn formula, j=3,
I is the serial number of next-hop routing, and k is constant factor, the entropy at a distance from purpose inter-domain routing advertizing nodeIn formula, j=4, i are the serial number of next-hop routing, and k is constant factor；
(2.09) conventional method is used, obtains the differentiation factor of the grade of service respectively using entropy obtained by step (2.08)
gj=1-ej, j=1, e in formula1For the entropy of the grade of service, the differentiation factor g of the radio frequency channel occupancyj=1-ej, formula
Middle j=2, e2For the entropy of the radio frequency channel occupancy, the differentiation factor g of the next-hop node degree of communicationj=1-ej, in formula,
J=3, e3Entropy, the differentiation at a distance from purpose inter-domain routing advertizing node for the next-hop node degree of communication
Factor gj=1-ej, in formula, j=4, e4For the entropy at a distance from purpose inter-domain routing advertizing node；
(2.10) conventional method is used, determines the weight of the grade of service respectivelyJ=1 in formula, g1It is described
The weight of the differentiation factor of the grade of service, the radio frequency channel occupancyJ=2 in formula, g2For radio frequency channel occupancy
The weight of the differentiation factor of rate, the next-hop node degree of communicationIn formula, j=3, g3For the next-hop section
The differentiation factor of point-connectivity, the weight at a distance from purpose inter-domain routing advertizing nodeIn formula, j=
4, g4For the differentiation factor at a distance from purpose inter-domain routing advertizing node；
(2.11) conventional method is used, ω is utilizedjIndex choosing next-hop routes the magnitude of value
In formula, d_v (i) is the degree of communication of next-hop routing, d_vminFor the minimum d_v (i) in routed domain, d_vmaxFor routed domain
Interior maximum d_v (i), N_ λ (i) are that radio frequency channel number, N_ λ can be used in next linkminFor the minimum N_ λ (i) in routed domain, N_
λmaxFor the maximum N_ λ (i) in routed domain, N_node is the number of nodes in routed domain, and Rank_t (i) is carrying power business
Rank.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510873630.4A CN105515976B (en) | 2015-12-02 | 2015-12-02 | Simplify route selection method between a kind of electric power backbone optical network domain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510873630.4A CN105515976B (en) | 2015-12-02 | 2015-12-02 | Simplify route selection method between a kind of electric power backbone optical network domain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105515976A CN105515976A (en) | 2016-04-20 |
| CN105515976B true CN105515976B (en) | 2019-01-04 |
Family
ID=55723632
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510873630.4A Active CN105515976B (en) | 2015-12-02 | 2015-12-02 | Simplify route selection method between a kind of electric power backbone optical network domain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105515976B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506360B (en) * | 2016-11-11 | 2019-08-13 | 华北电力大学（保定） | A kind of fiber optic network route equalization method based on link dynamic load |
| CN106559266B (en) * | 2016-11-23 | 2019-06-07 | 国网安徽省电力公司芜湖供电公司 | Ospf area division methods based on density clustering algorithm in a kind of powerline network |
| CN113037626B (en) * | 2019-12-24 | 2022-11-11 | 中国电信股份有限公司 | Processing method and processing device for optical transmission route |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1814247A1 (en) * | 2004-11-19 | 2007-08-01 | Huawei Technologies Co., Ltd. | Identification methods of domain-to-domain link based on automatically switched optical network |
| CN102638311A (en) * | 2012-04-23 | 2012-08-15 | 西安电子科技大学 | Optical network-on-chip system based on wavelength allocation and communication method of system |
| CN103415025A (en) * | 2013-06-13 | 2013-11-27 | 国家电网公司 | Passive optical network optimization method based on ONU-WG |
| CN104299053A (en) * | 2014-10-13 | 2015-01-21 | 国家电网公司 | Method for selecting optimal path of power distribution and utilization communication network based on genetic algorithm |
| CN104468355A (en) * | 2014-11-21 | 2015-03-25 | 国家电网公司 | Route selection method under reliability restraint condition |
-
2015
- 2015-12-02 CN CN201510873630.4A patent/CN105515976B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1814247A1 (en) * | 2004-11-19 | 2007-08-01 | Huawei Technologies Co., Ltd. | Identification methods of domain-to-domain link based on automatically switched optical network |
| CN102638311A (en) * | 2012-04-23 | 2012-08-15 | 西安电子科技大学 | Optical network-on-chip system based on wavelength allocation and communication method of system |
| CN103415025A (en) * | 2013-06-13 | 2013-11-27 | 国家电网公司 | Passive optical network optimization method based on ONU-WG |
| CN104299053A (en) * | 2014-10-13 | 2015-01-21 | 国家电网公司 | Method for selecting optimal path of power distribution and utilization communication network based on genetic algorithm |
| CN104468355A (en) * | 2014-11-21 | 2015-03-25 | 国家电网公司 | Route selection method under reliability restraint condition |
Non-Patent Citations (4)
| Title |
|---|
| 一种低压电力线通信改进分级蚁群路由算法;张 良1 刘晓胜 戚佳金 周 岩 徐殿国;《电工技术学报 2014年2月 第29卷第2期》;20140228;全文 |
| 国家电力调度数据网的设计与实施;王益民;《电网技术 2015年 第29卷 第22期》;20051130;全文 |
| 智能光网络中分层路由的新算法;罗 沛, 黄善国, 连伟华, 李彬, 顾畹仪;《北京邮电大学学报 2009年4月第32卷第2期》;20090430;全文 |
| 电力骨干光通信网业务路由优化策略研究;赵子岩，沈亮，蔡伟，李俊娥，刘剑;《光网络 2014年第5期 光通信技术》;20141231;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105515976A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100377529C (en) | Route designing method | |
| US9363164B2 (en) | Logical inter-cloud dispatcher | |
| US7889652B1 (en) | Traffic engineering using extended bandwidth accounting information | |
| CN108156041B (en) | Differentiated virtual optical network mapping method based on security perception | |
| CN105515976B (en) | Simplify route selection method between a kind of electric power backbone optical network domain | |
| CN106464522A (en) | A method and system for network function placement | |
| CN104871490B (en) | The multipath communication device of energy ecology and its method for distributing business for improving energy ecology can be improved | |
| EP2577919B1 (en) | Reducing network power consumption | |
| JP2006109454A (en) | Method and apparatus for path selection in telecommunication network | |
| US8989018B2 (en) | Method and apparatus for providing a route recommendation | |
| US10237202B2 (en) | Network control device, network control method, and recording medium for program | |
| CN109787801A (en) | A kind of network service management methods, devices and systems | |
| CN106559266B (en) | Ospf area division methods based on density clustering algorithm in a kind of powerline network | |
| CN105207859A (en) | OTN network planning setting method in power communication network | |
| US7734813B2 (en) | Method and system for communicating predicted network behavior between interconnected networks | |
| CN108650177A (en) | The method and system of cross-domain service configuration are carried out to SPTN equipment | |
| CN105530199A (en) | Resource mapping method and device based on SDN (Software Defined Network) multi-domain optical network virtualization technology | |
| CN103873304A (en) | Power distribution communication network structure | |
| CN102761480B (en) | A kind of resource allocation methods and device | |
| US9762479B2 (en) | Distributed routing control in a vast communication network | |
| CN104168194A (en) | Cluster network path control method equipment and cluster network system | |
| CN104994019B (en) | A kind of horizontal direction interface system for SDN controllers | |
| US20060036762A1 (en) | System and method for automatic path generation in a computer network | |
| CN105207906A (en) | Service path determining method and device | |
| CN108600115A (en) | The method and device of network bandwidth resources optimization |
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 |