CN108600096A - A kind of domain energy-saving method for routing based on quick heavy-route - Google Patents
A kind of domain energy-saving method for routing based on quick heavy-route Download PDFInfo
- Publication number
- CN108600096A CN108600096A CN201810261504.7A CN201810261504A CN108600096A CN 108600096 A CN108600096 A CN 108600096A CN 201810261504 A CN201810261504 A CN 201810261504A CN 108600096 A CN108600096 A CN 108600096A
- Authority
- CN
- China
- Prior art keywords
- link
- network
- links
- chained list
- stored
- 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
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000012217 deletion Methods 0.000 claims abstract description 21
- 230000037430 deletion Effects 0.000 claims abstract description 21
- 230000014509 gene expression Effects 0.000 claims 1
- 230000001174 ascending effect Effects 0.000 abstract description 6
- 238000005516 engineering process Methods 0.000 abstract description 5
- 239000011159 matrix material Substances 0.000 abstract description 3
- 239000005431 greenhouse gas Substances 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- CURLTUGMZLYLDI-UHFFFAOYSA-N Carbon dioxide Chemical compound O=C=O CURLTUGMZLYLDI-UHFFFAOYSA-N 0.000 description 2
- 238000005265 energy consumption Methods 0.000 description 2
- 230000007613 environmental effect Effects 0.000 description 2
- ZEFNOZRLAWVAQF-UHFFFAOYSA-N Dinitolmide Chemical compound CC1=C(C(N)=O)C=C([N+]([O-])=O)C=C1[N+]([O-])=O ZEFNOZRLAWVAQF-UHFFFAOYSA-N 0.000 description 1
- 229910002092 carbon dioxide Inorganic materials 0.000 description 1
- 239000001569 carbon dioxide Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000004134 energy conservation Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000004083 survival effect Effects 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/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/10—Current supply arrangements
-
- 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/22—Alternate routing
Abstract
The invention discloses a kind of domain energy-saving method for routing based on quick heavy-route, all nodes in network are stored in queue Q, calculate the shortest path using arbitrary node v between the shortest path tree spt (v) of root and all nodes pair；All links in network are stored in chained list L, is taken out from chained list L to any one link (u, v), counts the link ring LC belonging to link (u, v)；It counts in all link rings formed, the number that each link occurs, and ascending sort is carried out according to the number that each link occurs, be stored in chained list M；All links for deleting that flag attribute is 0 are closed in network, the link set P of all link rings is calculated, the deletion attribute of all links in P is labeled as 1.The method of the present invention does not need real-time traffic matrix, and quick Reroute techniques and power-saving technology can link together, and takes into account energy saving and network performance.
Description
Technical field
The invention belongs to Internet technical fields, and in particular to a kind of domain energy-saving routing side based on quick heavy-route
Method.
Background technology
With the rapid development of global economy, incident is a large amount of discharges of greenhouse gases.More and more researchs
Show that the environmental problem that greenhouse gases are brought is threatening this earth environment for the survival of mankind.The portion that European Union is announced
Report is pointed out, if the discharge capacity to carbon dioxide can reduce 15%-30%, just can guarantee the increasing of the year two thousand twenty global temperatures
Long control is at 2 degrees Celsius or less.The discharge of greenhouse gases equally influences expanding economy.Will not at the beginning of design internet
It is energy saving to be used as design object, but more emphasize how to increase the robustness of network using redundant configuration.Internet is usual
Cope with burst flow according to peak flow come the configuration of planned network, therefore when network flow is relatively low, all equipment according to
So consuming energy.In order to cope with the failure in network, internet is configured with a large amount of redundance unit, only when main equipment is sent out
When raw failure, stand-by equipment can be just utilized, and be further exacerbated by the energy consumption of internet.Measurement of correlation shows
In Abilene networks, link utilization substantially remains in 20% or less.The design object and energy conservation and environmental protection of internet be the back of the body road and
It speeds, therefore it is technically a challenging research field that it is energy saving, which to study internet,.
With the rapid development of global economy, adjoint energy consumption has become people and begs for extensively in its evolution
By and a problem must solving.Research shows that the excess emissions of greenhouse gases will carry out catastrophic shadow to climate zone
It rings.How to build green earth becomes the topic that the whole world is paid close attention to jointly.The fast development of internet becomes global maximum
The communications infrastructure, the quantity of the medium-and-large-sized equipment of network drastically increases, and consumes huge energy.It is based on to realize
The energy-saving scheme of quick heavy-route, it is necessary to avoid the occurrence of route loop.Existing quick rerouting scheme may insure that routing does not have
There is loop, but these schemes are mainly for single fault situation in network.However, energy-efficient routing needs pass as much as possible simultaneously
The node and link in network are closed, so that energy saving maximization.Therefore, existing quick rerouting scheme can not be applied directly
In energy-efficient routing.In order to solve this problem, how the backup path between calculate node pair was so that should for present invention research
Path can bypass multilink, then be modeled to being based on quick heavy-route problem, finally propose a kind of based on fast
The domain energy-saving method for routing of fast heavy-route.
Invention content
The present invention provides a kind of domain energy-saving method for routing based on quick heavy-route, includes the following steps：
All nodes in network are stored in queue Q, are calculated using arbitrary node v as the shortest path tree spt of root
(v), and according to shortest path tree, the shortest path between all nodes pair is calculated；
All links in network are stored in chained list L, are taken out from chained list L to any one link (u, v), statistics
Link ring LC belonging to the link (u, v)；Wherein, it for any one link (u, v), is added in the link (u, v)
Node at least one network, path (u, u of formation2…ui、ui+1…V) be link (u, v) a backup path, if backup
Path does not include link (u, v), then the ring of link (u, v) and backup path composition is ring LC；
The number for counting in all link rings formed, the number that each link occurs, and occurring according to each link into
Result after sequence is stored in chained list M by row ascending sort；Wherein, the deletion label for initializing all links, if wherein depositing
It is 0 in the deletion flag attribute of link, indicates that respective links are that can close link；
All links for deleting that flag attribute is 0 are closed in network, the link set P of all link rings are calculated, by institute in P
There is the deletion attribute of link to be labeled as 1.
Wherein, in the step of counting the link ring LC belonging to the link (u, v), judgment method is：
IfThen LC (u, v)=LC (u,v)U{sp(u,t)·sp(t,V) },
Middle sp (u, t) indicates the shortest path of node u to node t.
Compared with prior art, the present invention provides a kind of domain energy-saving method for routing based on quick heavy-route, by net
All nodes in network are stored in queue Q, are calculated using arbitrary node v as the shortest path tree spt (v) of root, and according to most short
Path tree calculates the shortest path between all nodes pair；All links in network are stored in chained list L, from chained list L
It takes out to any one link (u, v), counts the link ring LC belonging to the link (u, v)；Count all link rings formed
In, the number that each link occurs, and ascending sort is carried out according to the number that each link occurs, the result after sequence is stored
In chained list M；Wherein, the deletion label for initializing all links indicates if the deletion flag attribute that wherein there is link is 0
Respective links are that can close link；All links for deleting that flag attribute is 0 are closed in network, the link of all link rings is calculated
The deletion attribute of all links in P is labeled as 1 by set P.The method of the present invention does not need real-time traffic matrix, and can incite somebody to action
Quick Reroute techniques and power-saving technology link together, and take into account energy saving and network performance.
Description of the drawings
Fig. 1 is a kind of flow diagram of domain energy-saving method for routing based on quick heavy-route provided by the invention.
Fig. 2 is a kind of logical schematic of domain energy-saving method for routing based on quick heavy-route provided by the invention.
Specific implementation mode
Further more detailed description is made to technical scheme of the present invention With reference to embodiment.Obviously, it is retouched
The embodiment stated is only a part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention,
The every other embodiment that those of ordinary skill in the art are obtained under the premise of not making creative work, should all belong to
The scope of protection of the invention.
To make the object, technical solutions and advantages of the present invention clearer, the present invention is made below in conjunction with attached drawing further
Ground is described in detail.
For the convenience of description, we first define some labels, these labels are suitable for entire invention.
In figure G=(V, E), for any one link (u, v) in network, we claim path (u, u2,...ui,
ui+1... v) be the link a backup path and if only ifBy link (u,V) it is backed up with it
The ring of path composition is the ring LC (Link Circle) of the link, can be expressed as C (u,v)。
Refering to fig. 1, Fig. 1 is that a kind of flow of domain energy-saving method for routing based on quick heavy-route provided by the invention is shown
It is intended to.The step of this method includes：
S110：All nodes in network are stored in queue Q, are calculated using arbitrary node v as the shortest path tree of root
Spt (v), and according to shortest path tree, calculate the shortest path between all nodes pair.
S120：All links in network are stored in chained list L, from chained list L take out to any one link (u,
V), the link ring LC belonging to the link (u, v) is counted；Wherein, for any one link (u, v), to the link (u, v)
The middle node being added at least one network, path (u, u of formation2、…ui、ui+1…V) it is one of link (u, v) backup road
Diameter, if backup path does not include link (u, v), the ring that link (u, v) and backup path form is ring LC.
S130：Time for counting in all link rings formed, the number that each link occurs, and occurring according to each link
Number carries out ascending sort, and the result after sequence is stored in chained list M；Wherein, the deletion label of all links is initialized, if its
It is middle there are the deletion flag attribute of link be 0, indicate respective links be can close link.
S140：All links for deleting that flag attribute is 0 are closed in network, the link set P of all link rings is calculated, it will
The deletion attribute of all links is labeled as 1 in P.
In the step of counting the link ring LC belonging to the link (u, v), judgment method is：
IfThenWherein sp (u, t) table
Show the shortest path of node u to node t.
It is as follows to provide the specific embodiment of the invention, each step of the present embodiment is described in detail, because of the embodiment
Process it is relatively more, only list calculating (b, a) process of transit node below.
Step 1：For all node v ∈ V in network, calculate using node v as the shortest path tree spt (v) of root；
Step 2：According to the shortest path tree that step 1 constructs, the shortest path between all nodes pair, shortest path are calculated
For：
a b、a c、a b d、b a、b c、b d、c a、c b、c d、d b a、d b、d c
Step 3：All links in network are stored in chained list L={ (a, b), (a, c), (b, c), (b, d), (c, d) }
In；
Step 4：Because chained list is not sky, step 5 is executed；
Step 5：Taken out from chained list L to an element (a, b), at this time chained list L=(a, c), (b, c), (b, d), (c,
d)}；
Step 6：All nodes in network are stored in queue Q, Q={ a, b, c, d }
Step 7：Because queue Q is not sky, 8 are thened follow the steps；
Step 8：First node t=a is taken out from Q, at this time queue Q={ b, c, d }, execute step 7；
Step 7：Because queue Q is not sky, 8 are thened follow the steps；
Step 8：First node t=b is taken out from Q, at this time queue Q={ c, d }, execute step 7；
Step 7：Because queue Q is not sky, 8 are thened follow the steps；
Step 8：First node t=c is taken out from Q, at this time queue Q={ d }, at this time LC (a, b)={ (a, c, b) },
Execute step 7；
Step 7：Because the link has had ring, 4 are thened follow the steps；Above-mentioned process is repeated, LC (a, c) is calculated
={ (a, b, c) }, LC (b, c)={ (b, d, c) }, LC (b, d)={ (b, c, d) }, LC (c, d)={ (c, b, d) }；LC(a,b)
={ (a, c, b) }
Step 9：According to the number that the calculated link ring statistics each of the links of step 8 occur, (a, b) number is 2, (a,
C) number is 2, and (b, c) number is 4, and (b, d) number is 3, and (c, d) number is 3；
Step 10：Ascending sort, (a, c), (a, b), (c, d), (b, d), (b, c) are carried out according to the number that link occurs
Step 11：The deletion flag attribute for initializing all links is 0, and indicating the link, this can be closed；
Step 12：Result after sequence is stored in chained list M, at this time M=(a, c), (a, b), (c, d), (b, d),
(b,c)}
Step 13：Because chained list M is not sky, 14 are thened follow the steps；
Step 14：From taking out first element (a, b) in M and deleting it from M, indicate to close the link in network
(a, b), at this time M={ (a, b), (c, d), (b, d), (b, c) }；
Step 15：The link set Q, Q={ (a, b), (b, c), } for calculating all and link ring e, by all links in Q
It deletes attribute and is labeled as 1, therefore link (a, b), (b, c) cannot be closed, execute step 13；
Step 13：Because chained list M is not sky, 14 are thened follow the steps；
Step 14：First element (a, b) is taken out from M, at this time M={ (c, d), (b, d), (b, c) }, because of (a, b)
Deletion attribute be 1, so execute step 13；
Step 13：Because chained list M is not sky, 14 are thened follow the steps；
Step 14：From taking out first element (c, d) in M and deleting it from M, indicate to close the link in network
(c, d), at this time M={ (b, d), (b, c) }；
Step 15：All and link set Q, Q={ (c, b), (b, d) } of link ring (c, d) are calculated, by all chains in Q
The deletion attribute on road is labeled as 1, therefore link (c, b), (b, d) cannot be closed, and executes step 13；
Step 13：Because chained list M is not sky, 14 are thened follow the steps；
Step 14：First element (b, d) is taken out from M, at this time M={ (b, c) }, because the deletion attribute of (b, d) is
1, so executing step 13；
Step 13：Because chained list M is not sky, 14 are thened follow the steps；
Step 14：First element (b, c) is taken out from M, at this time M={ }, because the deletion attribute of (b, c) is 1,
Execute step 13；
Step 13：Because chained list M is not sky, then this method terminates, and the collection for closing link is combined into { (a, c), (c, d) }.
Compared with prior art, the present invention provides a kind of domain energy-saving method for routing based on quick heavy-route, by net
All nodes in network are stored in queue Q, are calculated using arbitrary node v as the shortest path tree spt (v) of root, and according to most short
Path tree calculates the shortest path between all nodes pair；All links in network are stored in chained list L, from chained list L
It takes out to any one link (u, v), counts the link ring LC belonging to the link (u, v)；Count all link rings formed
In, the number that each link occurs, and ascending sort is carried out according to the number that each link occurs, the result after sequence is stored
In chained list M；Wherein, the deletion label for initializing all links indicates if the deletion flag attribute that wherein there is link is 0
Respective links are that can close link；All links for deleting that flag attribute is 0 are closed in network, the link of all link rings is calculated
The deletion attribute of all links in P is labeled as 1 by set P.The method of the present invention does not need real-time traffic matrix, and can incite somebody to action
Quick Reroute techniques and power-saving technology link together, and take into account energy saving and network performance.
It these are only embodiments of the present invention, be not intended to limit the scope of the invention, it is every to utilize the present invention
Equivalent structure or equivalent flow shift made by specification and accompanying drawing content is applied directly or indirectly in other relevant technologies
Field is included within the scope of the present invention.
Claims (2)
1. a kind of domain energy-saving method for routing based on quick heavy-route, which is characterized in that include the following steps：
All nodes in network are stored in queue Q, are calculated using arbitrary node v as the shortest path tree spt (v) of root, and
According to shortest path tree, the shortest path between all nodes pair is calculated；
All links in network are stored in chained list L, are taken out from chained list L to any one link (u, v), described in statistics
Link ring LC belonging to link (u, v)；Wherein, it for any one link (u, v), is added at least in the link (u, v)
Node in one network, path (u, u of formation2…ui、ui+1…V) be link (u, v) a backup path, if backup path
Not comprising link (u, v), then the ring of link (u, v) and backup path composition is ring LC；
It counts in all link rings formed, the number that each link occurs, and risen according to the number that each link occurs
Sequence sorts, and the result after sequence is stored in chained list M；Wherein, the deletion label for initializing all links, if wherein there is chain
The deletion flag attribute on road is 0, indicates that respective links are that can close link；
All links for deleting that flag attribute is 0 are closed in network, the link set P of all link rings are calculated, by all chains in P
The deletion attribute on road is labeled as 1.
2. the domain energy-saving method for routing according to claim 1 based on quick heavy-route, which is characterized in that in statistics institute
In the step of stating the link ring LC belonging to link (u, v), judgment method is：
If, then
, the shortest path of wherein sp (u, t) expressions node u to node t.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810261504.7A CN108600096B (en) | 2018-03-28 | 2018-03-28 | Intra-domain energy-saving routing method based on fast rerouting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810261504.7A CN108600096B (en) | 2018-03-28 | 2018-03-28 | Intra-domain energy-saving routing method based on fast rerouting |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108600096A true CN108600096A (en) | 2018-09-28 |
| CN108600096B CN108600096B (en) | 2020-08-04 |
Family
ID=63624728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810261504.7A Expired - Fee Related CN108600096B (en) | 2018-03-28 | 2018-03-28 | Intra-domain energy-saving routing method based on fast rerouting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108600096B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752200A (en) * | 2012-06-27 | 2012-10-24 | 华为技术有限公司 | Network energy-saving method and device |
| WO2016078240A1 (en) * | 2014-11-19 | 2016-05-26 | 中兴通讯股份有限公司 | Method and device for detecting routing ring formation |
| CN106411770A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | Data center network energy-saving routing algorithm based on software defined network (SDN) architecture |
| CN107835127A (en) * | 2017-12-15 | 2018-03-23 | 山西大学 | A kind of intra-area routes power-economizing method based on network entropy |
-
2018
- 2018-03-28 CN CN201810261504.7A patent/CN108600096B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752200A (en) * | 2012-06-27 | 2012-10-24 | 华为技术有限公司 | Network energy-saving method and device |
| WO2016078240A1 (en) * | 2014-11-19 | 2016-05-26 | 中兴通讯股份有限公司 | Method and device for detecting routing ring formation |
| CN105681119A (en) * | 2014-11-19 | 2016-06-15 | 中兴通讯股份有限公司 | Method and apparatus for detecting routing loop |
| CN106411770A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | Data center network energy-saving routing algorithm based on software defined network (SDN) architecture |
| CN107835127A (en) * | 2017-12-15 | 2018-03-23 | 山西大学 | A kind of intra-area routes power-economizing method based on network entropy |
Non-Patent Citations (1)
| Title |
|---|
| 黄鸿: ""一种平滑的基于链路排序的节能算法"", 《计算机科学》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108600096B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jiang et al. | Enhancing network performance by edge addition | |
| CN105590321B (en) | A kind of block-based subgraph building and distributed figure processing method | |
| CN101650191B (en) | Road network topology aggregation method and device | |
| CN103199510B (en) | The ordered binary decision diagram modeling method that distribution network failure recovers | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN109902203A (en) | The network representation learning method and device of random walk based on side | |
| CN105119834B (en) | A kind of source address destination address joint lookup method based on compound trie tree constructions | |
| CN103368851A (en) | Openflow flow table storage and optimization method based on resource reuse | |
| CN106936645B (en) | The optimization method of tree network topology structure based on queueing theory | |
| CN103593708A (en) | Method for multi-failure power restoration of power distribution network | |
| CN101692227A (en) | Building method of large-scale and high-reliable filing storage system | |
| CN104378229A (en) | Link prediction method for opportunity network | |
| CN110391977A (en) | A kind of method, system and the storage medium of network failure protection | |
| CN112256471A (en) | Erasure code repairing method based on separation of network data forwarding and control layer | |
| CN108600096A (en) | A kind of domain energy-saving method for routing based on quick heavy-route | |
| CN103249109B (en) | Based on the energy-saving routing method of the radio sensing network of irregular cellular automata | |
| CN105574076A (en) | Key value pair storage structure based on Bloom Filter and method | |
| Liu et al. | A survey of transport protocol for wireless sensor networks | |
| CN112260799A (en) | Erasure code repair system based on separation of network data forwarding and control layer | |
| CN105681425A (en) | Multi-node repairing method and system based on distributed storage system | |
| WO2018209541A1 (en) | Coding structure based on t-design fractional repetition codes, and coding method | |
| CN107835127B (en) | Intra-domain routing energy-saving method based on network entropy | |
| CN103166861B (en) | A kind of layered multicast maximum throughput metering method solving optical-fiber network | |
| WO2022095583A1 (en) | Target detection method based on stream convolution | |
| CN107707471A (en) | The energy-saving scheme of minimum conversion link number based on extensive SDN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200804 |