CN106161257A - A kind of adaptive power conservation method for routing based on link utilization towards SDN - Google Patents
A kind of adaptive power conservation method for routing based on link utilization towards SDN Download PDFInfo
- Publication number
- CN106161257A CN106161257A CN201610781660.7A CN201610781660A CN106161257A CN 106161257 A CN106161257 A CN 106161257A CN 201610781660 A CN201610781660 A CN 201610781660A CN 106161257 A CN106161257 A CN 106161257A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- path
- sdn
- 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.)
- Granted
Links
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
-
- 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
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- 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
The invention discloses a kind of adaptive power conservation method for routing based on link utilization towards SDN.The defect existed for feature and the current energy-saving routing algorithm of SDN, the link utilization of real-time change as link cost, is first obtained the information of network topology structure and traffic matrix before being routed by the inventive method.Then network topology is done optimization beta pruning, alleviates the calculating time of routing algorithm.This routing plan is guaranteed qos demand while energy-conservation, and after running a period of time, inlet flow is automatically gathered on specific heavy duty link.Finally by non-loaded link-down on the premise of ensureing network connectivty.The method has preferable energy-saving effect and relatively low time complexity in artificial network.
Description
Technical field
The invention belongs to network energy-saving technical field, be specifically related in SDN the flow by utilizing real-time change
Matrix selects the energy-saving routing protocol in path.The present invention relates to calculate optimal path based on link utilization and flow is focused on weight
Loaded link, and the method closing the link not used.
Background technology
Current energy-saving and emission-reduction are increasingly becoming a key issue of the Internet, because along with the high speed development of the Internet brings
Energy consumption is high, utilization rate is low, waste the problems such as huge.And the simultaneously increase of energy consumption cost also limit the Internet enters one
Step development.Traditional Design of Network System has two principles, and one is excess resources supply, and i.e. supply is more than demand, and this can make net
Network bears the peak load of burst；Another is to devise some complexity, reserve link and equipment, i.e. Redundancy Design, and this can
Malfunction and failure with reply burst.But the energy consumption problem that the two principle is brought also can not be ignored.To improve energy utilization rate, letter
Change network is target, it is proposed that a kind of new network innovation framework SDN, and user can be with self-defined any network route wanting to realize
With transmission strategy.
It is suggested in cable network range tie level and the two kinds of Energy Saving Strategy of network level at present.System-level
Method is if network element can predict the idling cycle of its link, can be reduced by its relevant interface of this closedown
Energy consumption is in the idling cycle doped.But this needs to redesign or existing network element of upgrading, and which greatly enhances reality
Existing complexity and difficulty.The method of network level then uses a different method, and research worker attempts the network of minimizing activity
Element, such as node or link, still ensures the connectedness of network simultaneously.But, there are this many defects in these solutions, it is impossible to
Take into account change and the QoS demand of network topological information.
Summary of the invention
It is an object of the invention to the feature for SDN and the defect of current energy-efficient routing technology existence, propose one
Towards the adaptive power conservation method for routing based on link utilization of SDN, utilize the characteristic of SDN and by energy-conservation road
Realized the adaptive function of link flow by algorithm, greatly reduce the complexity of agreement, there is preferable energy-saving effect and phase
To relatively low time complexity.
It is an object of the invention to be achieved through the following technical solutions: a kind of towards SDN based on link utilization
The adaptive power conservation method for routing of rate, comprises the following steps:
Network topology and bandwidth availability ratio situation that router is collected by step (1) pass to SDN controller, according to network
Information calculates internodal optimal path and puts in path candidate table with standby；
Global network topology information is analyzed by step (2), and the link without flow is carried out beta pruning optimization；
Step (3) performs energy-saving routing algorithm, if optimal path length more than threshold values D or is unsatisfactory for QoS demand, then
Enable path candidate.Otherwise, then select to be calculated the optimal path of gained by the DFS algorithm improved；Detailed process is as follows:
Source node v is added stacked by 3-1., if node v's was designated for 1 (representing the most accessed), v adds path array.
If 3-2. path is less than threshold values D, then continue；Otherwise by this path beta pruning, and enable path candidate.
3-3. is not empty when stack, travels through all nodes.It is not accessed if there is neighbor node, and is and source node
Be connected with the node n of most that link of bandwidth, then jump out traversal loop.If judging the bandwidth availability ratio of this link
Exceed maximum link utilization LtU, then select the node n of the link of the secondary maximum bandwidth utilization rate less than LtU.
If node for the purpose of 3-4. this neighbor node n, then it represents that find a paths.If having traveled through all nodes
Do not find qualified node, then the mark of v be set to 1 and play stack, now stack top element is assigned to node v.Otherwise, will
N is assigned to node v v is stacked, is identified and is set to 1, is finally added into path array.
3-5. if there is no the link of the maximum bandwidth utilization rate being connected with neighbor node, then plays stack and by stack top element
It is assigned to node v.
After this energy-saving routing method is run certain period by step (4) SDN, flow automatically gathers heavy duty road
On footpath, finally ensure on the premise of connectedness by produce again without the link-down of flow process.
The invention has the beneficial effects as follows: for feature and the defect of current energy-saving routing algorithm existence of SDN, this
The link utilization of real-time change as link cost, is first obtained network topology structure before being routed by bright method
Information with traffic matrix.Then network topology is done optimization beta pruning, alleviates the calculating time of routing algorithm.This routing plan exists
Guaranteed qos demand while energy-conservation, after running a period of time, inlet flow is automatically gathered in specific heavy duty link
On.Finally by non-loaded link-down on the premise of ensureing network connectivty.The method has preferably in artificial network
Energy-saving effect and relatively low time complexity.
Accompanying drawing explanation
Fig. 1 is the flow chart of the inventive method.
Detailed description of the invention
The present invention is further illustrated below in conjunction with the accompanying drawings.
As it is shown in figure 1, a kind of adaptive power conservation based on link utilization towards SDN that the present invention provides route
Method, comprises the following steps:
Network topology and bandwidth availability ratio situation that router is collected by step (1) pass to SDN controller, according to network
Information calculates internodal optimal path and puts in path candidate table with standby；
Global network topology information is analyzed by step (2), does not has flow to pass through according to link and ensures connectedness
Standard is by closable link beta pruning；
Step (3) performs energy-saving routing algorithm, if optimal path length more than threshold values D or is unsatisfactory for QoS demand, then
Enable path candidate.Otherwise, then select to be calculated the optimal path of gained by the DFS algorithm improved；Detailed process is as follows:
Source node v is added stacked by 3-1., if node v's was designated for 1 (representing the most accessed), v adds path array.
If 3-2. path is less than threshold values D, then continue；Otherwise by this path beta pruning, and enable path candidate.
3-3. is not empty when stack, travels through all nodes.It is not accessed if there is neighbor node, and is and source node
Be connected with the node n of most that link of bandwidth, then jump out traversal loop.If judging the bandwidth availability ratio of this link
Exceed maximum link utilization LtU, then select the node n of the link of the secondary maximum bandwidth utilization rate less than LtU.
If node for the purpose of 3-4. this neighbor node n, then it represents that find a paths.If having traveled through all nodes
Do not find qualified node, then the mark of v be set to 1 and play stack, now stack top element is assigned to node v.Otherwise, will
N is assigned to node v v is stacked, is identified and is set to 1, is finally added into path array.
3-5. if there is no the link of the maximum bandwidth utilization rate being connected with neighbor node, then plays stack and by stack top element
It is assigned to node v.
Step (4) SDN this energy-saving routing method is run certain period (the simply a kind of rough estimate of this time value,
When real network can not obtain definite by being affected by a variety of factors), final flow rate automatically gathers heavy duty
On path, finally ensure on the premise of connectedness by produce again without the link-down of flow process.
Claims (1)
1. the adaptive power conservation method for routing based on link utilization towards SDN, it is characterised in that include following
Step:
Network topology and bandwidth availability ratio situation that router is collected by step (1) pass to SDN controller, according to the network information
Calculate internodal optimal path to put in path candidate table with standby；
Global network topology information is analyzed by step (2), and the link without flow is carried out beta pruning optimization；
Step (3) performs energy-saving routing algorithm, if optimal path length more than threshold values D or is unsatisfactory for QoS demand, then enables
Path candidate.Otherwise, then select to be calculated the optimal path of gained by the DFS algorithm improved；Detailed process is as follows:
Source node v is added stacked by 3-1., if node v's was designated for 1 (representing the most accessed), v adds path array.
If 3-2. path is less than threshold values D, then continue；Otherwise by this path beta pruning, and enable path candidate.
3-3. is not empty when stack, travels through all nodes.It is not accessed if there is neighbor node, and is to be connected with source node
With the node n of most that link of bandwidth, then jump out traversal loop.If judging that the bandwidth availability ratio of this link exceedes
Maximum link utilization LtU, then select the node n of the link of the secondary maximum bandwidth utilization rate less than LtU.
If node for the purpose of 3-4. this neighbor node n, then it represents that find a paths.If having traveled through all nodes not
Find qualified node, then the mark of v be set to 1 and play stack, now stack top element is assigned to node v.Otherwise, n is composed
It is worth to node v v is stacked, is identified and be set to 1, be finally added into path array.
3-5. if there is no the link of the maximum bandwidth utilization rate being connected with neighbor node, then plays stack and by stack top element assignment
To node v.
After this energy-saving routing method is run certain period by step (4) SDN, flow automatically gathers heavy duty path
On, finally ensure on the premise of connectedness by produce again without the link-down of flow process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610781660.7A CN106161257B (en) | 2016-08-30 | 2016-08-30 | A kind of adaptive power conservation method for routing based on link utilization towards SDN network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610781660.7A CN106161257B (en) | 2016-08-30 | 2016-08-30 | A kind of adaptive power conservation method for routing based on link utilization towards SDN network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106161257A true CN106161257A (en) | 2016-11-23 |
| CN106161257B CN106161257B (en) | 2019-05-03 |
Family
ID=57344284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610781660.7A Active CN106161257B (en) | 2016-08-30 | 2016-08-30 | A kind of adaptive power conservation method for routing based on link utilization towards SDN network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106161257B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107317697A (en) * | 2017-05-25 | 2017-11-03 | 清华大学 | OSPF and SDN hybrid networks a kind of method for configuring route |
| CN107835130A (en) * | 2017-12-12 | 2018-03-23 | 中国联合网络通信集团有限公司 | A kind of flow allocation method and device |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
| CN109194577A (en) * | 2018-10-23 | 2019-01-11 | 清华大学 | A kind of traffic engineering method and device of the Segment routing network based on partial deployment |
| CN110086847A (en) * | 2019-03-12 | 2019-08-02 | 中国科学院计算技术研究所 | Data distributing method, medium and electronic equipment |
| CN113424500A (en) * | 2019-02-12 | 2021-09-21 | 赫思曼自动化控制有限公司 | Method for routing in time-sensitive networks |
| CN113872804A (en) * | 2021-09-24 | 2021-12-31 | 北京金山云网络技术有限公司 | Bandwidth allocation method and device, electronic equipment and computer-readable storage medium |
| CN113872804B (en) * | 2021-09-24 | 2024-05-28 | 北京金山云网络技术有限公司 | Bandwidth allocation method, device, electronic equipment and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752200A (en) * | 2012-06-27 | 2012-10-24 | 华为技术有限公司 | Network energy-saving method and device |
| CN105245458A (en) * | 2015-10-23 | 2016-01-13 | 北京邮电大学 | Backbone network energy consumption optimization method based on SDN centralized control |
| WO2016077948A1 (en) * | 2014-11-17 | 2016-05-26 | 华为技术有限公司 | Switch port control method, apparatus and system |
| CN105897586A (en) * | 2016-05-20 | 2016-08-24 | 电子科技大学 | Hybrid SDN network-oriented Energy-saving flow scheduling method |
-
2016
- 2016-08-30 CN CN201610781660.7A patent/CN106161257B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752200A (en) * | 2012-06-27 | 2012-10-24 | 华为技术有限公司 | Network energy-saving method and device |
| WO2016077948A1 (en) * | 2014-11-17 | 2016-05-26 | 华为技术有限公司 | Switch port control method, apparatus and system |
| CN105245458A (en) * | 2015-10-23 | 2016-01-13 | 北京邮电大学 | Backbone network energy consumption optimization method based on SDN centralized control |
| CN105897586A (en) * | 2016-05-20 | 2016-08-24 | 电子科技大学 | Hybrid SDN network-oriented Energy-saving flow scheduling method |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107317697A (en) * | 2017-05-25 | 2017-11-03 | 清华大学 | OSPF and SDN hybrid networks a kind of method for configuring route |
| CN107317697B (en) * | 2017-05-25 | 2020-01-07 | 清华大学 | Route configuration method of OSPF (open shortest Path first) and SDN (software defined network) hybrid network |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
| CN107959633B (en) * | 2017-11-18 | 2021-04-23 | 浙江工商大学 | Multi-path load balancing method based on price mechanism in industrial real-time network |
| CN107835130A (en) * | 2017-12-12 | 2018-03-23 | 中国联合网络通信集团有限公司 | A kind of flow allocation method and device |
| CN109194577A (en) * | 2018-10-23 | 2019-01-11 | 清华大学 | A kind of traffic engineering method and device of the Segment routing network based on partial deployment |
| CN113424500A (en) * | 2019-02-12 | 2021-09-21 | 赫思曼自动化控制有限公司 | Method for routing in time-sensitive networks |
| CN113424500B (en) * | 2019-02-12 | 2023-10-24 | 赫思曼自动化控制有限公司 | Method for routing in a time-sensitive network |
| CN110086847A (en) * | 2019-03-12 | 2019-08-02 | 中国科学院计算技术研究所 | Data distributing method, medium and electronic equipment |
| CN110086847B (en) * | 2019-03-12 | 2021-03-09 | 中国科学院计算技术研究所 | Data distribution method, medium, and electronic device |
| CN113872804A (en) * | 2021-09-24 | 2021-12-31 | 北京金山云网络技术有限公司 | Bandwidth allocation method and device, electronic equipment and computer-readable storage medium |
| CN113872804B (en) * | 2021-09-24 | 2024-05-28 | 北京金山云网络技术有限公司 | Bandwidth allocation method, device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106161257B (en) | 2019-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106161257B (en) | A kind of adaptive power conservation method for routing based on link utilization towards SDN network | |
| CN103559084B (en) | A kind of virtual machine migration method at Energy-saving Data center | |
| CN104917173B (en) | Adapt to the distribution optimization method of power distribution network Large Copacity load transfer | |
| CN104578153A (en) | Recognition method of topological structure of electric network | |
| CN103077082A (en) | Method and system for distributing data center load and saving energy during virtual machine migration | |
| CN104992009A (en) | Multi-agent system based distributed voltage control method for active power distribution network | |
| CN110224427B (en) | Information physical system modeling method based on micro-grid energy control strategy | |
| CN105721577A (en) | Server load balancing method for software defined network | |
| CN105119279B (en) | A kind of distributed power source planing method and its system | |
| CN112615368A (en) | Distributed sensing-based platform area topology generation method and sensing terminal device | |
| CN105120502B (en) | Intelligent distribution network wireless sensor network real-time, reliability optimization method | |
| CN110445186B (en) | Self-synchronizing microgrid control system and secondary frequency modulation control method | |
| CN106505575A (en) | A kind of Line Flow economic load dispatching method based on Granule Computing | |
| CN105305501A (en) | Multi-mode space time nested dynamic output power adjusting method of hydropower station under real-time load change | |
| CN106329546B (en) | A kind of active distribution network new distributed optimal reactive power based on equal network loss ratio | |
| Yang et al. | Wind blows, traffic flows: Green internet routing under renewable energy | |
| CN105430538A (en) | Inter-domain routing method based on optical network sub-topological graph | |
| CN108880909A (en) | A kind of network energy-saving method and device based on intensified learning | |
| CN116341829A (en) | Green power information block processing method and system | |
| CN105515025B (en) | A kind of three-phase imbalance optimization method of low-voltage network | |
| CN105990833B (en) | One kind being based on the matched power distribution network dynamic reconfiguration method of Run-time scenario | |
| CN105046026B (en) | A kind of ability to transmit electricity appraisal procedure counted and node power is injected with power network topology | |
| CN203503005U (en) | Speed regulation simulation system suitable for pump storage group | |
| CN102662759A (en) | Energy saving method based on CPU (central processing unit) load in cloud OS (operating system) | |
| CN102156408A (en) | System and method for tracking and controlling maximum power point in dynamically self-adaptive evolvement process |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20161123 Assignee: Hangzhou Greentown Information Technology Co.,Ltd. Assignor: HANGZHOU DIANZI University Contract record no.: X2023330000109 Denomination of invention: An Adaptive Energy Efficient Routing Method Based on Link Utilization for SDN Networks Granted publication date: 20190503 License type: Common License Record date: 20230311 |