CN106656578A - Software defined network expansion method based on minimum heap - Google Patents
Software defined network expansion method based on minimum heap Download PDFInfo
- Publication number
- CN106656578A CN106656578A CN201611055837.1A CN201611055837A CN106656578A CN 106656578 A CN106656578 A CN 106656578A CN 201611055837 A CN201611055837 A CN 201611055837A CN 106656578 A CN106656578 A CN 106656578A
- Authority
- CN
- China
- Prior art keywords
- heap
- network
- node
- rickle
- software defined
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a software defined network expansion method based on a minimum heap. A controller in the software defined network is used for acquiring characteristics of a network topology structure, and the whole network is constructed into one or more minimum heaps. A minimum heap insertion algorithm is used for merging a newly-added network node and the original heap into a heap, and thus, network expansion is realized. A minimum heap merging algorithm is used for merging the newly-added heap and the original heap to a heap, and network expansion is realized. Through optimizing the data structure of the software defined network, the minimum heap is adopted in the network expansion, the characteristics of the minimum heap are used for adding the node in the network flexibly or the heap formed by multiple nodes, and a routing algorithm optimized based on the minimum heap obviously reduces the time complexity.
Description
Technical field
The present invention relates to communication technical field, extends more particularly, to a kind of software defined network based on most rickle
Method.
Background technology
Software defined network (Software Defined Network, SDN), is a kind of Novel net proposed by Emulex
Network innovate framework, its core technology OpenFlow by the way that network equipment chain of command and data surface are separated, it is achieved thereby that
The flexible control of network traffics, the innovation for core network and application provides good platform.
Because the firmware of traditional network equipment (switch, router) is to be locked by equipment manufacturers and controlled, so
SDN wishes to separate network control with physical network topology, so as to break away from restriction of the hardware to the network architecture.So enterprise just may be used
With as upgrading, install software the network architecture is modified, meet enterprise whole web site architecture is adjusted, dilatation or
Upgrading.And the hardware such as switch, router of bottom is then without the need for replacement, while saving substantial amounts of cost, network architecture iteration
Cycle will greatly shorten.
Software defined network is the focus in network research recent years field, and it has separated network-based control plane and data
Plane, and control plane is the brain of software defined network, its ability greatly affects opening up for software defined network network
Malleability.Research currently for software defined network expansibility is very burning hot, and corresponding solution has also had not
It is few.According to the difference of controller number, solution can be divided into following two class：The functional improvement of single controller node and portion
Administration's multi controller systems.Scheme can be divided into distributed director and east according to the species similarities and differences of controller in controller system
West is to two kinds of solutions of interface protocol.But solution does not optimize storage organization with reference to routing algorithm, so as to expand
Exhibition network.
The content of the invention
The present invention provide it is a kind of overcome the problems referred to above or solve the above problems at least in part based on the soft of most rickle
Part defines network expansion method, and in network extension most rickle is adopted, and flexibly can add in network using the characteristics of most rickle
Plus the heap that node or multiple nodes are formed, and time complexity is significantly reduced based on the routing algorithm of minimum heap optimization.
According to an aspect of the present invention, there is provided a kind of software defined network extended method, comprise the following steps：
S1, acquisition network topology structure, and the whole network is configured to into one or more most rickles；
S2, the new network for adding is incorporated into into a heap with most rickle, realizes the extension of network.
Used as preferred, step S1 is specifically included：
S11, using the Floodlight in software defined network as controller, Mininet is constructed as network simulator
Network；
S12, Floodlight and Mininet set up connection from the topological structure for obtaining network；
S13, the most rickle for setting up a sky, by each node insertion heap of topological structure, constitute initial most rickle.
Used as preferred, in step S13, each most rickle includes minimum key pointer, and each node includes father
Pointer, left child pointers and right child pointers.
Used as preferred, step S2 is specifically included：
The new network node for adding is incorporated into into a heap with original heap using the insertion algorithm of most rickle, network is realized
Extension；
The new heap for adding is incorporated into into a heap with original heap using the algorithm that merges of most rickle, the extension of network is realized.
As preferred, in step S2, insert network node method and specifically include, by the institute of the node x being inserted into
There is pointer to be all initially empty, x is inserted in the root chained list of heap, if the root node of heap is the value of the value more than x of empty or root node,
The structure of adjustment heap, will insert node of the node as heap.
Used as preferred, in step S2, merging the method for the new heap for adding includes：Merged using the heap of most rickle and calculated
Method, two tables of two heaps that need to merge are connected, and determine a new minimum node.
Used as preferred, the method for merging the new heap for adding is specifically included：The most rickle H of a sky is set up, will be to be combined
Heap H1Root node be assigned to the root node of H, connect H and heap H to be combined2Root list；If H1Root node for sky, H2Root section
Point is not empty and H2Root node value be not less than H1Root node value, then the root node of H is adjusted to into H2Root node,
The heap for having merged is H.
Compared with prior art, the beneficial effects of the present invention is：The present invention is using controller energy in software defined network
The characteristics of obtaining network topology structure, by the whole network one or more most rickles are configured to；Can be by using the insertion algorithm of most rickle
The new network node for adding is incorporated into a heap with original heap, so as to realize the extension of network；Network is defined by optimization software
Data structure, network extension in adopt most rickle, using most rickle the characteristics of can flexibly in network addition node or
The heap that multiple nodes are formed, and time complexity is significantly reduced based on the routing algorithm of minimum heap optimization, will can newly add
Heap be incorporated into a heap with original heap, so as to realize the extension of network.
Description of the drawings
Fig. 1 is the method flow block diagram of the embodiment of the present invention；
Fig. 2 is the most rickle schematic diagram of the embodiment of the present invention；
Fig. 3 is the network expansion method schematic diagram of the embodiment of the present invention；
When Fig. 4 is that network density is 0.3 in the embodiment of the present invention, network expansion method and the conventional method of the present invention are run
Time contrast schematic diagram；
When Fig. 5 is that network density is 0.6 in the embodiment of the present invention, network expansion method and the conventional method of the present invention are run
Time contrast schematic diagram；
When Fig. 6 is that network density is 0.6 in the embodiment of the present invention, network expansion method and the conventional method of the present invention are run
Time contrast schematic diagram.
Specific embodiment
With reference to the accompanying drawings and examples, the specific embodiment of the present invention is described in further detail.Hereinafter implement
Example is not limited to the scope of the present invention for illustrating the present invention.
Fig. 1 shows a kind of software defined network extended method based on most rickle, comprises the following steps：
The whole network is simultaneously configured to one or more most rickles by the characteristics of S1, acquisition network topology structure；By software definition
The characteristics of network central control device can obtain network topology structure, by the whole network one or more most rickles are constituted；
S2, the new network for adding is incorporated into into a heap with original heap, realizes the extension of network.
Step S1 is specifically included：
S11, using the Floodlight in software defined network as controller, Mininet is constructed as network simulator
Network；
S12, Floodlight and Mininet set up connection from the topological structure for obtaining network；
S13, the most rickle for setting up a sky, by each node insertion heap of topological structure, constitute initial most rickle.
As shown in Fig. 2 most rickle H.min is made up of one group of minimum stacking order tree.Each node x points to its pair comprising one
The pointer of parent and a pointer for pointing to one of child.All children of x connect into a dual-circulation linked list, referred to as x-
Children tables.Each child in table has two pointers, is respectively directed to its left fraternal and right brother.All of root vertex
A dual-circulation linked list, referred to as the root table H of heap are connected into its left and right pointer.Have using dual-circulation linked list in Fibonacci heap
2 advantages：First, deleting a node from dual-circulation linked list only needs the time 0 (1)；Second, to two chained lists for giving,
They can connect into a dual-circulation linked list within the time 0 (1).
In the present embodiment, step S2 includes：
The new network node for adding is incorporated into into a heap with original heap using the insertion algorithm of most rickle, network is realized
Extension；Using the insertion algorithm of most rickle, each domain of ingress to be inserted is initialized and assignment, construct the annular Two-way Chain of itself
Table, the node is added in the root table of heap；
The new heap for adding is incorporated into into a heap with original heap using the algorithm that merges of most rickle, the extension of network is realized.
Insertion network node program is as follows：
All pointers of the node x being inserted into all are initially empty first, x is inserted in the root chained list of heap, if heap
Root node is the value of the value more than x of empty or root node, then adjust pile structure, will insert root node of the node as heap.
As shown in figure 3, merge the method for the new heap for adding including:Merge algorithm using the heap of most rickle, by what is need to merged
Two tables series connection of two heaps, and determine a new minimum node.
The most rickle H of a sky is set up, by heap H to be combined1Root node be assigned to the root node of H, connection H and heap to be combined
H2Root list；If H1Root node for sky, H2Root node be not empty and H2Root node value be not less than H1Root node
Value, then the root node of H is adjusted to into H2Root node, the heap for having merged be H.
Fig. 4,5,6 are respectively the Di Jiesitela based on minimum heap optimization when network density is respectively 0.3,0.6,0.9
The contrast of algorithm and traditional Dijkstra's algorithm run time.In order to realize based on the Dijkstra's algorithm of most rickle,
Need to construct a heap for there is spike end points.Initialization needs one " construction heap " operation and one " insertion " operation, and
Scanning each time needs one " deletion least member " operation.One node of insertion needs time O (1), extracts minimum node behaviour
Time lg | V |, V is needed to represent end points, and each node can be extracted once, therefore, time complexity is V*lg | V
|.One " deletion key element " operation needs time O (1), and each edge at most to update once, therefore time complexity is | E
| * O (1), E representative edges.So, if using most rickle, the All Time of heap operation is O (| V | * lg | V |+| E |), and other
The time of task is O (| V |+| E |), therefore, it is O (| V | * lg | V | based on the run time of the Dijkstra's algorithm of most rickle
+|E|)。
In traditional Dijkstra's algorithm, adjacency matrix is used as most basic data store organisation.Work as scanning
Finding during minimum end points, whole algorithm needs the time for spending O (| V | 2) to end points array.Each reaches earliest set of paths
D (X) updates and consumes a time constant, so, the whole service time is O (| V | 2+ | E |).
Finally, the present processes are only preferably embodiment, are not intended to limit protection scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent substitution and improvements made etc. should be included in the protection of the present invention
Within the scope of.
Claims (7)
1. a kind of software defined network extended method, it is characterised in that comprise the following steps：
S1, acquisition network topology structure, and the whole network is configured to into one or more most rickles；
S2, the new network for adding is incorporated into into a heap with most rickle, realizes the extension of network.
2. software defined network expansion algorithm according to claim 1, it is characterised in that step S1 is specifically included：
S11, using the Floodlight in software defined network as controller, Mininet is used as network simulator tectonic network；
S12, Floodlight is connected the topological structure for obtaining network with Mininet；
S13, the most rickle for setting up a sky, by each node of topological structure the most rickle is inserted, and constitutes initial most rickle.
3. software defined network extended method according to claim 2, it is characterised in that in step S13, each
Most rickle includes minimum key pointer, and each node includes parent pointer, left child pointers and right child pointers.
4. software defined network expansion algorithm according to claim 2, it is characterised in that step S2 is specifically included：
The new network node for adding is incorporated into into a heap with original heap using the insertion algorithm of most rickle；
The new heap for adding is incorporated into into a heap with original heap using the algorithm that merges of most rickle, the extension of network is realized.
5. software defined network extended method according to claim 4, it is characterised in that in step S2, inserts net
Network nodal method is specifically included：
All pointers of the node x being inserted into all are initially empty, x is inserted in the root chained list of heap, if the root node of heap is sky
Or value of the value of root node more than x, then the structure of heap is adjusted, node of the node as heap will be inserted.
6. software defined network extended method according to claim 4, it is characterised in that in step S2, merges new
The method of the heap of addition includes：
Merge algorithm using the heap of most rickle, two tables of two heaps that need to merge are connected, and determine a new most brief summary
Point.
7. software defined network extended method according to claim 6, it is characterised in that the method for merging the new heap for adding
Specifically include：
The most rickle H of a sky is set up, by heap H to be combined1Root node be assigned to the root node of H, connect H and heap H to be combined2's
Root list；If H1Root node for sky, H2Root node be not empty and H2Root node value be not less than H1Root node
Value, then be adjusted to H by the root node of H2Root node, the heap for having merged be H.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611055837.1A CN106656578B (en) | 2016-11-25 | 2016-11-25 | A kind of software defined network extended method based on most rickle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611055837.1A CN106656578B (en) | 2016-11-25 | 2016-11-25 | A kind of software defined network extended method based on most rickle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656578A true CN106656578A (en) | 2017-05-10 |
| CN106656578B CN106656578B (en) | 2019-10-18 |
Family
ID=58811234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611055837.1A Active CN106656578B (en) | 2016-11-25 | 2016-11-25 | A kind of software defined network extended method based on most rickle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656578B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104092565A (en) * | 2014-06-24 | 2014-10-08 | 复旦大学 | Multi-tenant policy-driven type software-defined networking method for cloud data center |
| CN105162759A (en) * | 2015-07-17 | 2015-12-16 | 哈尔滨工程大学 | SDN network DDoS attack detecting method based on network layer flow abnormity |
-
2016
- 2016-11-25 CN CN201611055837.1A patent/CN106656578B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104092565A (en) * | 2014-06-24 | 2014-10-08 | 复旦大学 | Multi-tenant policy-driven type software-defined networking method for cloud data center |
| CN105162759A (en) * | 2015-07-17 | 2015-12-16 | 哈尔滨工程大学 | SDN network DDoS attack detecting method based on network layer flow abnormity |
Non-Patent Citations (1)
| Title |
|---|
| 李贺武等: "SDN+:基于SDN的未来无线网络系统架构和扩展", 《无线通信》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656578B (en) | 2019-10-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mayer et al. | Fogstore: Toward a distributed data store for fog computing | |
| US8826032B1 (en) | Systems and methods for network change discovery and host name resolution in storage network environments | |
| CN103139037A (en) | Method and device used for achieving flexible virtual local area network | |
| Das et al. | Routing in ad hoc networks using a spine | |
| KR102014433B1 (en) | System and method for supporting discovery and routing degraded fat-trees in a middleware machine environment | |
| US8873563B2 (en) | Techniques for next-hop optimization | |
| US20110280572A1 (en) | Converged network extension | |
| CN105227460B (en) | A kind of seismic interpretation system based on SDN | |
| JP2013526234A (en) | Virtual cluster exchange | |
| CN105324964A (en) | System and method for supporting multi-homed fat-tree routing in a middleware machine environment | |
| PT1461903E (en) | Technique of determining connectivity solutions for network elements | |
| WO2018113792A1 (en) | Broadcast packet processing method and processing apparatus, controller, and switch | |
| WO2013066604A1 (en) | Control and provisioning in a data center network with at least one central controller | |
| CN108228171A (en) | A kind of project tree query and display methods based on tree structure | |
| CN105933227A (en) | Methods for routing decision and flow table consistency optimization in software defined satellite network | |
| CN105721192A (en) | Method and apparatus for realizing capacity planning | |
| CN108400922B (en) | Virtual local area network configuration system and method and computer readable storage medium thereof | |
| CN106656578A (en) | Software defined network expansion method based on minimum heap | |
| US8654777B2 (en) | Methods and apparatus for realizing a configurable multi-bridge | |
| CN111711532B (en) | Unified management method for heterogeneous network equipment | |
| CN106301643A (en) | A kind of method followed the tracks of for configurable clock generator and control equipment | |
| CN110535693A (en) | A kind of network is opened up and mends generation method, network is opened up and mends generation system and network structure | |
| US20140351213A1 (en) | Synchronization and reconciliation through identification | |
| CN101686121A (en) | Method, systems and device of data synchronization | |
| CN108173688A (en) | A kind of management method of the networking configuration content based on tree and version number |
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 |