CN103888352B - A kind of energy-conservation weight design method in IP network - Google Patents
A kind of energy-conservation weight design method in IP network Download PDFInfo
- Publication number
- CN103888352B CN103888352B CN201410064637.7A CN201410064637A CN103888352B CN 103888352 B CN103888352 B CN 103888352B CN 201410064637 A CN201410064637 A CN 201410064637A CN 103888352 B CN103888352 B CN 103888352B
- Authority
- CN
- China
- Prior art keywords
- link
- line card
- network topology
- network
- energy
- 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.)
- Expired - Fee Related
Links
Abstract
The invention discloses a kind of energy-conservation weight design method in IP network, energy-conservation link weight is designed by junction link layer and Internet, thus determine that in network, service distribution is to close part dead wire card and link, with the purpose of minimizing energy consumption, optimize energy-saving effect, secondly, consider the actual consumption composition in IP network, under the conditions of not revising procotol, it is applicable to the IP network of random scale, achieves energy-conservation to greatest extent, ensure connectivity and the service quality of network simultaneously.
Description
Technical field
The invention belongs to network communication technology field, more specifically, relate to energy-conservation weight in a kind of IP network
Method for designing.
Background technology
In an ip network, due to potential economic interests and the impact of intended environment, unnecessary energy resource consumption is reduced
Becoming the focal point in a network research, these energy consumption problems are commonly called " GreenNet " problem.Gushed in recent years
Revealing many GreenNet technology, they save energy consumption for network from various aspects, wherein, on link layer, due to link
Energy consumption almost loads unrelated with it, therefore can be energy-conservation by closing link；In Internet, energy consumption perception route exactly for
Network considers energy expenditure when formulating routing policy, mainly studies how to use minimum network inside the Internet autonomous system
Resource provides routing forwarding service, to realize the energy consumption minimized target of the whole network, typically follows the principle of resource consolidation, will flow
Be aggregated in the equipment of a part, close or equipment that dormancy is idle thus save energy, and examine when carrying out flow and integrating
Consider the availability to network and service quality, as limited the peak use rate etc. of link.
In the prior art, Chabarek etc. establishes the MINP model of power saving, by taking link weight into consideration
Carry out service distribution in integration networks with link utilization, thus close idle link minimizing network energy consumption, MINP model
Optimization aim is the energy consumption minimizing link, and constraints is that in each of the links, flow load is less than link capacity, Qi Zhonglian
Right of way heavily determines service distribution.But MINP model can only solve small scale network, and optimization aim only includes link energy consumption, and
Physical link energy consumption only accounts for network energy consumption small part.
Mingui Zhang etc. combines link layer and Internet sets up energy saving model MIP, MIP model than MINP model more
Having practical significance, it mainly includes router and link energy consumption in view of the composition of energy consumption in network, and route energy consumption is most, but
Being to close route to relate to protocol modification more complicated, route major part energy consumption, from line card, therefore determines by redistribution
In network, business closes part dead wire card and link to save energy consumption.MIP model optimization target is to minimize link and line
The energy consumption of card, constraints is that in each of the links, flow load is less than link capacity, and wherein service distribution is based on many commodity
Flow model.But MIP model route based on multiple commodity flow model, need Centralized Controller specified services route rather than router
Determining route according to link weight, this needs to change network environment and is therefore not suitable for traditional IP, and MIP model also can only simultaneously
Solve small scale network.
Po-Kai Tseng etc. proposes a kind of heuritic approach CA based on genetic algorithm, and MINP model decomposition is become by it
Two subproblems: subproblem 1 is to find out some by genetic algorithm to solve, the corresponding a set of link on off state of each solution, each solution
Corresponding new network is all at least UNICOM；Subproblem 2 is that known new link in network opens situation, by using simulated annealing
Algorithm iteration adjusts weight, makes do not have link to overload in final network by business redistribution, and last constantly iteration is found
Excellent solution, unlatching number of links is minimum and does not has link to overload i.e. to find a set of link on off state to make in network.But CA algorithm is also
Only considered link energy consumption, and physical link energy consumption only accounts for network energy consumption small part, secondly, CA algorithm target in design
It is to close more directed edges, and reality needs close physical link and could realize energy-conservation, it is therefore desirable to add physical link
Constraint is the most more of practical significance.
Summary of the invention
It is an object of the invention to overcome the deficiencies in the prior art, it is provided that the energy-conservation weight design side in a kind of IP network
Method, designs link weight by junction link layer and Internet, thus determines that in network, service distribution is closed the most idle
Line card and link, achieve energy-conservation to greatest extent, ensures connectivity and the service quality of network simultaneously.
For achieving the above object, the energy-conservation weight design method in a kind of IP network of the present invention, it is characterised in that bag
Include following steps:
(1), input given network topological information and traffic matrix, and equivalent initializes the link weight of network；Institute
The topology information stated include node serial number, link number, line card numbering, link capacity, link and node corresponding relation, link and
Line card corresponding relation；Described traffic matrix include active, mesh node to the service traffics between SD；
(2), the judgement to all links has been judged whether, if having link not to be judged to rule enter step (3), if
Judge that all links then enter step (7)；
(3), calculate the utilization rate of each link, select optimum link Lbest:
According to current ink weight, calculate every pair of source, mesh in current network topology T by dijkstra's algorithm and save SD
Between shortest path, the business route of every couple of SD uses Shortest path routing and flows through all links of shortest path, thus counts
Calculate business load total in each of the links and link utilization UL, when having a plurality of shortest path when between a pair SD, use ECMP
(Equal Cost Multipath Routing) algorithm shunts, business is distributed evenly on all shortest paths；
According to current each link utilization UL, find out current lowest link utilization rate Umin, obtain in link utilization scope
Limit β UminWherein, gain factorBy all utilization rates at [Umin,βUmin]] between and be not determined
Link as alternative link collection S, S={L | UL∈[Umin,βUmin]], according on the line card that current network link is corresponding
The port number opened, finds out from S and opens a minimum link of port number on corresponding line card as optimum link Lbest, finally
Close LbestWith its reverse link, obtain new network topology T1, then recalculate in new network topology T1 shortest path between each SD
Footpath and link utilization, if the link opening port number minimum on corresponding line card has a plurality of, then select wherein link utilization
Minimum one as optimum link Lbest；
(4) if new network topology T1 not UNICOM, i.e. exist and cannot communicate between a pair SD, then reopen LbestWith
Its reverse link, does not revise current network topology T, skips to step (2)；If new network topology T1 UNICOM, skip to step
(5)；
(5) peak use rate of new network topology T1 link, is calculatedWhenTime, then new network topology T1
In do not have link to overload, using new network topology T1 as current network topology T, and record the L being currently powered offbestAnti-with it
To link ID, skip to step (2)；WhenTime, then network topology exists overload, i.e. can occur congested to need balanced flow
Amount, then continue step (6)；
(6), call flow equalization algorithm based on Neighborhood-region-search algorithm amendment and open link weight, the business between guiding SD
Trend, redistributes business load for the link opened, carries out flow equalization；If flow equalization success, by new network topology
T1 is as current network topology T, and records the L being currently powered offbestWith its reverse link ID, and skip to step (2)；If
Flow equalization failure then reopens current LbestWith its reverse link, do not revise current network topology T, skip to step (2)；
(7), idle line card is closed；Close being turned off line card upper port corresponding to link, add up and now open on line card
The number of port, if opening port number on line card is 0, then line card is idle and closes, and records this line card ID；If line
Opening port number on card is not 0, then continue to keep this line card to open；
(8), export final each link weight, be closed line card and link ID.
Wherein, between described link, relation and link and line card corresponding relation are: have polylith on a routing node
Line card, one piece of line card has multiple port, the corresponding link of each port, and each of the links two ends correspondence has line card and route joint
Point；In described step (2), each of the links to network topology only judges once.
The goal of the invention of the present invention is achieved in that
Energy-conservation weight design method in IP network of the present invention, sets energy-conservation meter link by junction link layer and Internet
Weight, thus determine that in network, service distribution is to close part dead wire card and link, with the purpose of minimizing energy consumption, excellent
Change energy-saving effect, secondly, it is contemplated that the actual consumption composition in IP network, be applicable to appoint under the conditions of not revising procotol
The IP network of meaning scale, achieves energy-conservation to greatest extent, ensures connectivity and the service quality of network simultaneously.
Meanwhile, the energy-conservation weight design method in IP network of the present invention also has the advantages that
(1), the most energy-conservation.The present invention has taken link layer and Internet into consideration, is closed by service distribution in network
Idle line card and link realize energy-conservation.General algorithm does not consider that the energy consumption difference of equipment room is come certainly according only to the utilization rate of link
Locking equipment closing sequence, but first the present invention determines that equipment is closed priority and ensured the preferential line card closing big energy-consuming, secondly
It is only link, with the purpose of minimizing energy consumption, optimizes energy-saving effect；
(2) high practicability.General algorithm is when designing link layer and being energy-conservation, and energy conservation object is that closedown is as much as possible oriented
Limit, but close physical link and could realize energy-conservation, actual energy-saving effect is poor.Present invention adds the pact of physical link
Two directed edges that physical link is corresponding can be carried out same operation when weight adjusts, it is ensured that their state and weight by bundle
Identical, finally realize the energy-conservation of physical link.
(3) the high suitability.Random scale topology can be carried out energy-conservation by the present invention, it is not necessary to agreement in amendment network, suitable
Close traditional IP.
Accompanying drawing explanation
Fig. 1 is the flow chart of the energy-conservation weight design method in IP network of the present invention；
Table 1 is network topological information table；
Table 2 is traffic matrix table；
Table 3 is the current utilization table of each directed edge in network topology；
Table 4 is current opening end mouth number table on each line card；
The link weight table that table 5 present invention finally exports.
Detailed description of the invention
Below in conjunction with the accompanying drawings the detailed description of the invention of the present invention is described, in order to those skilled in the art is preferably
Understand the present invention.Requiring particular attention is that, in the following description, when known function and design detailed description perhaps
When can desalinate the main contents of the present invention, these are described in and will be left in the basket here.
Embodiment
Fig. 1 is the flow chart of the energy-conservation weight design method in IP network of the present invention.
In the present embodiment, as it is shown in figure 1, a kind of energy-conservation weight design method in IP network, comprise the following steps:
Network topological information that S101, input are given and traffic matrix, and equivalent initializes the link weight of network；Institute
The topology information stated include node serial number, link number, line card numbering, link capacity, link and node corresponding relation, link and
Line card corresponding relation；Described traffic matrix include active, mesh node to the service traffics between SD；In the present embodiment, give
Fixed 5 nodes, 10 physical links and 16 pieces of line cards, its corresponding relation is as shown in table 1；And link weight is initialized as 30,
The traffic matrix then generated by Gravity Models is as shown in table 2；
| Physical link ID | Source node | Destination node | Link capacity | Source line card | Destination line card |
| 0 | 0 | 1 | 10000 | 0 | 4 |
| 1 | 0 | 2 | 10000 | 1 | 6 |
| 2 | 0 | 4 | 10000 | 2 | 13 |
| 3 | 4 | 0 | 10000 | 13 | 2 |
| 4 | 1 | 2 | 10000 | 3 | 5 |
| 5 | 2 | 1 | 10000 | 5 | 3 |
| 6 | 2 | 3 | 10000 | 8 | 9 |
| 7 | 2 | 4 | 10000 | 7 | 12 |
| 8 | 3 | 4 | 10000 | 10 | 11 |
| 9 | 4 | 1 | 10000 | 14 | 15 |
Table 1
The directed link that physical link reference numeral is 2N and 2N+1 of numbered N, then in the present embodiment, numbered 0
Physical link reference numeral is the directed link of 0 and 1, the directed link that physical link reference numeral is 2 and 3 of numbered 1, with
This analogizes；
| Traffic ID | Source node | Destination node | Business size |
| 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 3000 |
| 2 | 0 | 2 | 3750 |
| 3 | 0 | 3 | 1500 |
| 4 | 0 | 4 | 3750 |
| 5 | 1 | 0 | 3000 |
| 6 | 1 | 1 | 0 |
| 7 | 1 | 2 | 3750 |
| 8 | 1 | 3 | 1500 |
| 9 | 1 | 4 | 3750 |
| 10 | 2 | 0 | 4000 |
| 11 | 2 | 1 | 4000 |
| 12 | 2 | 2 | 0 |
| 13 | 2 | 3 | 2000 |
| 14 | 2 | 4 | 5000 |
| 15 | 3 | 0 | 1333 |
| 16 | 3 | 1 | 1333 |
| 17 | 3 | 2 | 1667 |
| 18 | 3 | 3 | 0 |
| 19 | 3 | 4 | 1667 |
| 20 | 4 | 0 | 4000 |
| 21 | 4 | 1 | 4000 |
| 22 | 4 | 2 | 5000 |
| 23 | 4 | 3 | 2000 |
| 24 | 4 | 4 | 0 |
Table 2
S102, having judged whether the judgement to all links, each of the links only judges once, if there being link not to be judged to
Rule enters step S103, if it is decided that complete all links then enter step S107；
S103, calculate the utilization rate of each link, select optimum link Lbest:
According to current ink weight, calculate every pair of source, mesh in current network topology T by dijkstra's algorithm and save SD
Between shortest path, the business route of every couple of SD uses Shortest path routing and flows through all links of shortest path, thus counts
Calculate business load total in each of the links and link utilization, when having a plurality of shortest path when between a pair SD, use ECMP
(Equal Cost Multipath Routing) algorithm shunts, business is distributed evenly on all shortest paths；
According to current each link utilization UL, find out current lowest link utilization rate Umin, obtain in link utilization scope
Limit β UminWherein, gain factorBy all utilization rates at [Umin,βUmin]] between and be not closed
Link as alternative link collection S, S={L | UL∈[Umin,βUmin]], according on the line card that current network link is corresponding
The port number opened, finds out from S and opens a minimum link of port number on corresponding line card as optimum link Lbest, finally
Close LbestWith its reverse link, obtain new network topology T1, then recalculate in new network topology T1 eachSShortest path between D
And link utilization, if the link opening port number minimum on corresponding line card has a plurality of, then select wherein that link utilization is
Low one as optimum link Lbest；
Proceed by first round link from step S103 to judge, in the present embodiment, current lowest link utilization rate Umin=
0.23, upper limit β Umin=0.69, alternative link collection S={0,1 .., 19}, the utilization rate of each directed edge is as shown in table 3；According to table 1
The line card of input and the corresponding relation of link, obtain opening port number on corresponding line card as shown in table 4；
| Directed edge ID | Limit utilization rate |
| 0 | 0.30 |
| 1 | 0.30 |
| 2 | 0.43 |
| 3 | 0.47 |
| 4 | 0.24 |
| 5 | 0.23 |
| 6 | 0.23 |
| 7 | 0.24 |
| 8 | 0.24 |
| 9 | 0.23 |
| 10 | 0.23 |
| 11 | 0.24 |
| 12 | 0.35 |
| 13 | 0.30 |
| 14 | 0.50 |
| 15 | 0.50 |
| 16 | 0.30 |
| 17 | 0.35 |
| 18 | 0.47 |
| 19 | 0.43 |
Table 3
| Line card ID | Open port number |
| 0 | 1 |
| 1 | 1 |
| 2 | 2 |
| 3 | 2 |
| 4 | 1 |
| 5 | 2 |
| 6 | 1 |
| 7 | 1 |
| 8 | 1 |
| 9 | 1 |
| 10 | 1 |
| 11 | 1 |
| 12 | 1 |
| 13 | 2 |
| 14 | 1 |
| 15 | 1 |
Table 4
In the present embodiment, S finds correspondence and opens the link of the minimum line card of port number, find the chain of numbered 0
Opening port on the correspondence line card of road is 1, and link utilization is 0.3 to be all corresponding links opening the minimum line card of port number
One of middle utilization rate minimum, therefore Lbest=0, its reverse edge numbered 1, close directed edge 0 and 1, then recalculate topology
In shortest path and link utilization between each SD.
If the new network topology T1 not UNICOM of S104, i.e. exist and cannot communicate between a pair SD, then reopen LbestWith
Its reverse link, does not revise current network topology T, skips to step S102；If new network topology T1 UNICOM, skip to step
S105；
S105, calculate the peak use rate of new network topology T1 linkWhenTime, then new network topology
T1 does not has link overload, using new network topology T1 as current network topology T, and record the L being currently powered offbestAnd its
Reverse link ID, skips to step S102；WhenTime, then network topology exists overload, congested needs i.e. can be occurred to equalize
Flow, then continue step S106；In the present embodiment, the peak use rate of linkDetermine closedown directed edge 0
With 1, then skip to step S102；
S106, call the amendment of flow equalization algorithm and open link weight, guide the business trend between SD, for the link opened
Redistribute business load, carry out flow equalization；If flow equalization success, new network topology T1 is opened up as current network
Flutter T, and record the L being currently powered offbestWith its reverse link ID, and skip to step S102；If flow equalization failure,
Reopen current LbestWith its reverse link, do not revise current network topology T, skip to step S102；
So far, the 1st take turns judgement link complete, close directed edge ID be 0 and 1, physical link ID is 0, has carried out altogether 10
Wheel link judge, the most often take turns such operation and no longer describe in detail, wherein the 1st, 2,6,8 take turns proceed to step S105 edge closing success；The
3,5,6,7,10 take turns and proceed to network maximum link utilization after step S106 calls flow equalization algorithm and be respectively 1.1,
1.225,1.025,1.233,1.233, network exists link overload, therefore flow equalization failure, edge closing failure；4th take turns into
Row is to the failure of step S104 network not UNICOM's edge closing；
S107, the idle line card of closedown；Close being turned off line card upper port corresponding to link, add up and now open on line card
The number of port, if opening port number on line card is 0, then line card is idle and closes, and records this line card ID；If line
Opening port number on card is not 0, then continue to keep this line card to open；
S108KL, export final each link weight, be closed line card and link ID.In the present embodiment, each chain of final output
The weight on road is as shown in table 5；
| Physical link ID | Link weight |
| 0 | INF |
| 1 | 30 |
| 2 | INF |
| 3 | 30 |
| 4 | INF |
| 5 | 30 |
| 6 | INF |
| 7 | 30 |
| 8 | 30 |
| 9 | 30 |
Table 5
In the present embodiment, understand in conjunction with table 1 and table 5, pent line card ID:0,4,8,9, pent physical link
ID:0,2,4,6。
Although detailed description of the invention illustrative to the present invention is described above, in order to the technology of the art
Personnel understand the present invention, the common skill it should be apparent that the invention is not restricted to the scope of detailed description of the invention, to the art
From the point of view of art personnel, as long as various change limits and in the spirit and scope of the present invention that determine in appended claim, these
Change is apparent from, and all utilize the innovation and creation of present inventive concept all at the row of protection.
Claims (3)
1. the energy-conservation weight design method in an IP network, it is characterised in that comprise the following steps:
(1), input given network topological information and traffic matrix, and equivalent initializes the link weight of network；Described
Topology information includes node serial number, link number, line card numbering, link capacity, link and node corresponding relation, link and line card
Corresponding relation；Described traffic matrix include active, mesh node to the service traffics between SD；
(2), judge in network topology all links whether can proper communication, if there being link not to be judged, enter step
(3), if it is determined that complete all links then enter step (7)；
(3), calculate the utilization rate of each link, select optimum link Lbest:
According to current ink weight, calculate in current network topology T between every pair of source, mesh joint are to SD by dijkstra's algorithm
Shortest path, the business route of every couple of SD uses Shortest path routing and flows through all links of shortest path, thus calculates
Business load total in each of the links and link utilization UL, when having a plurality of shortest path when between a pair SD, use ECMPAlgorithm shunts, and business is distributed evenly on all shortest paths；
According to current each link utilization UL, find out current lowest link utilization rate Umin, obtain link utilization range limit β
UminWherein, gain factorBy all utilization rates at [Umin,βUmin]] between and the chain that was not determined
Road is as alternative link collection S, S={L | UL∈[Umin,βUmin]], open according on the line card that current network link is corresponding
Port number, find out from S and open a minimum link of port number on corresponding line card as optimum link Lbest, finally close
LbestWith its reverse link, obtain new network topology T1, then recalculate in new network topology T1 between each SD shortest path and
Link utilization, if the link opening port number minimum on corresponding line card has a plurality of, then selects wherein link utilization minimum
One as optimum link Lbest；
(4) if new network topology T1 not UNICOM, i.e. exist and cannot communicate between a pair SD, then reopen LbestReverse with it
Link, does not revise current network topology T, skips to step (2)；If new network topology T1 UNICOM, skip to step (5)；
(5) peak use rate of new network topology T1 link, is calculatedWhenTime, then new network topology T1 does not has
There is link to overload, using new network topology T1 as current network topology T, and record the L being currently powered offbestWith its reverse strand
Road ID, skips to step (2)；WhenTime, then network topology exists overload, i.e. can occur congested to need balancing flow, then
Continue step (6)；
(6), call flow equalization algorithm based on Neighborhood-region-search algorithm amendment unlatching link weight, guide the business between SD to walk
To, redistribute business load for the link opened, carry out flow equalization；If flow equalization success, by new network topology T1
As current network topology T, and record the L being currently powered offbestWith its reverse link ID, and skip to step (2)；If stream
Amount equalizes and the most then reopens current LbestWith its reverse link, do not revise current network topology T, skip to step (2)；
(7), idle line card is closed；Close being turned off line card upper port corresponding to link, add up and now open port on line card
Number, if on line card open port number be 0, then line card is idle and closes, and records this line card ID；If on line card
Opening port number is not 0, then continue to keep this line card to open；
(8), export final each link weight, be closed line card and link ID.
Energy-conservation weight design method in IP network the most according to claim 1, it is characterised in that between described link
Relation and link and line card corresponding relation be: has polylith line card on a routing node, one piece of line card has multiple port, often
The corresponding link of individual port, each of the links two ends correspondence has line card and routing node.
Energy-conservation weight design method in IP network the most according to claim 1, it is characterised in that described step (2)
In each of the links of network topology is only judged once.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410064637.7A CN103888352B (en) | 2014-02-25 | 2014-02-25 | A kind of energy-conservation weight design method in IP network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410064637.7A CN103888352B (en) | 2014-02-25 | 2014-02-25 | A kind of energy-conservation weight design method in IP network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103888352A CN103888352A (en) | 2014-06-25 |
| CN103888352B true CN103888352B (en) | 2016-11-02 |
Family
ID=50957077
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410064637.7A Expired - Fee Related CN103888352B (en) | 2014-02-25 | 2014-02-25 | A kind of energy-conservation weight design method in IP network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103888352B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302217A (en) * | 2015-05-25 | 2017-01-04 | 华为技术有限公司 | A kind of data link management method and device |
| CN105323166B (en) * | 2015-11-17 | 2018-05-29 | 东北大学 | A kind of method for routing preferential based on network energy efficiency towards cloud computing |
| CN105337861B (en) * | 2015-11-18 | 2018-05-04 | 东北大学 | A kind of method for routing based on energy efficiency priority and cognitive theory |
| CN105763445B (en) * | 2016-02-01 | 2020-01-24 | 北京邮电大学 | Green energy-oriented link management method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6288811B1 (en) * | 2000-10-17 | 2001-09-11 | Seneca Networks | WDM optical communication system with channels supporting multiple data formats |
| CN102412987A (en) * | 2011-11-08 | 2012-04-11 | 四川大学 | Multilayer network energy consumption optimization method facing IP over TDM over DWDM |
| CN103236898A (en) * | 2013-05-02 | 2013-08-07 | 重庆邮电大学 | Environmentally-friendly energy-saving network exclusive protection method |
| CN103338414A (en) * | 2013-05-28 | 2013-10-02 | 苏州大学 | Method for minimizing IP over WDM network energy consumption |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9231852B2 (en) * | 2011-07-25 | 2016-01-05 | Futurewei Technologies, Inc. | Greening the network with the power consumption statuses of network components |
-
2014
- 2014-02-25 CN CN201410064637.7A patent/CN103888352B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6288811B1 (en) * | 2000-10-17 | 2001-09-11 | Seneca Networks | WDM optical communication system with channels supporting multiple data formats |
| CN102412987A (en) * | 2011-11-08 | 2012-04-11 | 四川大学 | Multilayer network energy consumption optimization method facing IP over TDM over DWDM |
| CN103236898A (en) * | 2013-05-02 | 2013-08-07 | 重庆邮电大学 | Environmentally-friendly energy-saving network exclusive protection method |
| CN103338414A (en) * | 2013-05-28 | 2013-10-02 | 苏州大学 | Method for minimizing IP over WDM network energy consumption |
Non-Patent Citations (2)
| Title |
|---|
| Link Weight Design For Green IP Networks[C];Jing Wu, Yan Kai, Hongfang Yu;《Asia Communications and Photonics Conference(ACP)》;20131231;全文 * |
| Saving energy in IP-over-WDM networks by;Idzikowski F, Orlowski S, Raack C, et al.;《Optical Network Design and Modeling》;20100106;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103888352A (en) | 2014-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103888352B (en) | A kind of energy-conservation weight design method in IP network | |
| CN110086713B (en) | Domain-divided routing method for wide-area quantum key distribution network | |
| CN102710489B (en) | Dynamic shunt dispatching patcher and method | |
| CN103179046B (en) | Based on data center's flow control methods and the system of openflow | |
| Fisher et al. | Greening backbone networks: reducing energy consumption by shutting off cables in bundled links | |
| CN104272653B (en) | Congestion control in grouped data networking | |
| CN103825823B (en) | Data forwarding method based on different priorities in software-defined network | |
| CN104579964B (en) | A kind of quantum cryptography networks dynamic routing architecture system | |
| US9455900B2 (en) | Method and apparatus for shortest path bridging of multicast traffic | |
| CN106549779A (en) | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service | |
| Li et al. | Safe and practical energy-efficient detour routing in IP networks | |
| Jiang et al. | Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy | |
| CN104871490A (en) | Multi-path communication device capable of improving energy use efficiency and traffic distribution method for improving energy use efficiency thereof | |
| CN106161102A (en) | A kind of IP RAN network optimization emulation mode and system | |
| CN110417652A (en) | It is a kind of based on the software defined network routing algorithm of Segment routing strategy and application | |
| CN108337179A (en) | Link flow control method and device | |
| CN106685816A (en) | Routing calculation method based on SDN, SDN controller, and system | |
| WO2014040554A1 (en) | Method and apparatus for determining energy-efficient routing | |
| CN102255816B (en) | Method and device for load sharing | |
| CN103368694A (en) | Network transmission method adopting spatial network coding | |
| Ren et al. | A sdn-based dynamic traffic scheduling algorithm | |
| CN207304583U (en) | A kind of edge network architecture of Internet of things based on software defined network | |
| CN107046504A (en) | Method and controller for the traffic engineering in communication network | |
| CN104009932B (en) | A kind of flow based on Openflow rules arbitrarily compares carrying method | |
| Yang et al. | Hop-by-hop computing for green Internet routing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| 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: 20161102 Termination date: 20190225 |