CN106656578B - A kind of software defined network extended method based on most rickle - Google Patents
A kind of software defined network extended method based on most rickle Download PDFInfo
- Publication number
- CN106656578B CN106656578B CN201611055837.1A CN201611055837A CN106656578B CN 106656578 B CN106656578 B CN 106656578B CN 201611055837 A CN201611055837 A CN 201611055837A CN 106656578 B CN106656578 B CN 106656578B
- Authority
- CN
- China
- Prior art keywords
- heap
- network
- rickle
- node
- root node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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 whole network is configured to one or more most rickles by the characteristics of present invention provides a kind of software defined network extended method based on most rickle, can obtain network topology structure using controller in software defined network；The network node being newly added and original heap can be incorporated into a heap using the insertion algorithm of most rickle, to realize the extension of network；A heap can be incorporated into for the heap being newly added and original heap by merging algorithm using the heap of most rickle, to realize the extension of network.The data structure of network is defined by optimization software, most rickle is used in network extension, the heap formed using can flexibly add node or multiple nodes the characteristics of most rickle into network, and the routing algorithm based on minimum heap optimization significantly reduces time complexity.
Description
Technical field
The present invention relates to fields of communication technology, extend more particularly, to a kind of software defined network based on most rickle
Method.
Background technique
Software defined network (Software Defined Network, SDN) is a kind of Novel net proposed by Emulex
Network innovates framework, and core technology OpenFlow is by separating network equipment control plane with data surface, to realize
The flexible control of network flow provides good platform for the innovation of core network and application.
Due to the firmware of traditional network equipment (interchanger, router) be by device manufacturer lock and control, so
SDN wishes to separate network-control with physical network topology, to get rid of limitation of the hardware to the network architecture.Enterprise in this way
With as upgrading, installation software modify to the network architecture, meet enterprise entire web site architecture is adjusted, dilatation or
Upgrading.And the hardware such as interchanger, router of bottom are then not necessarily to replace, and while saving a large amount of cost, network architecture iteration
Period will greatly shorten.
Software defined network is the hot spot in network research recent years field, it has separated network-based control plane and data
Plane, and the brain that plane is software defined network is controlled, ability greatly affects opening up for software defined network network
Malleability.Very burning hot for the research of software defined network expansibility at present, 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
Affix one's name to multi controller systems.Scheme can be divided into distributed director and east according to the type similarities and differences of controller in controller system
West is to two kinds of solutions of interface protocol.But optimize storage organization there is no solution combination routing algorithm, to expand
Open up network.
Summary of the invention
The present invention provide it is a kind of overcome the above problem or at least be partially solved the above problem based on the soft of most rickle
Part defines network expansion method, uses most rickle in network extension, can flexibly add into network using the characteristics of most rickle
The heap that supernumerary segment point or multiple nodes are formed, and the routing algorithm based on minimum heap optimization significantly reduces time complexity.
According to an aspect of the present invention, a kind of software defined network extended method is provided, comprising the following steps:
S1, network topology structure is obtained, and the whole network is configured to one or more most rickles；
S2, the network being newly added and most rickle are incorporated into a heap, realize the extension of network.
Preferably, the 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 establish connection from obtaining the topological structure of network；
S13, an empty most rickle is established, each node of topological structure is inserted into heap, constitutes initial most rickle.
Preferably, each most rickle includes minimum key pointer in the step S13, each node includes father
Pointer, left child pointers and right child pointers.
Preferably, the step S2 is specifically included:
The network node being newly added and original heap are incorporated into a heap using the insertion algorithm of most rickle, realize network
Extension；
The heap being newly added and original heap are incorporated into a heap using the merging algorithm of most rickle, realize the extension of network.
Preferably, insertion network node method specifically includes, by the institute for the node x being inserted into the step S2
There is pointer to be all initially empty, x is inserted into the root chained list of heap, if the root node of heap is the value that empty or root node value is greater than x,
The structure for adjusting heap, using insertion node as the node of heap.
Preferably, the method for merging the heap being newly added includes: to merge to calculate using the heap of most rickle in the step S2
Method connects two tables of two heaps that need to merge, and determines a new minimum node.
Preferably, the method for merging the heap being newly added specifically includes: an empty most rickle H is established, it 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 be 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 H2Root node,
The heap merged is H.
Compared with prior art, the beneficial effects of the present invention are: the present invention to utilize controller energy in software defined network
The whole network is configured to one or more most rickles by the characteristics of obtaining network topology structure；It can be incited somebody to action using the insertion algorithm of most rickle
The network node and original heap being newly added are incorporated into a heap, to realize the extension of network；Network is defined by optimization software
Data structure, network extension in use most rickle, using the characteristics of most rickle can flexibly into network add node or
The heap that multiple nodes are formed, and the routing algorithm based on minimum heap optimization significantly reduces time complexity, will can newly be added
Heap and original heap be incorporated into a heap, to realize the extension of network.
Detailed description of the invention
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 of the invention and conventional method 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 of the invention and conventional method 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 of the invention and conventional method are run
Time contrast schematic diagram.
Specific embodiment
With reference to the accompanying drawings and examples, specific embodiments of the present invention will be described in further detail.Implement below
Example is not intended to limit the scope of the invention for illustrating the present invention.
Fig. 1 shows a kind of software defined network extended method based on most rickle, comprising the following steps:
S1, it obtains the characteristics of network topology structure and the whole network is configured to one or more most rickles；Pass through software definition
Network central control device can obtain the characteristics of network topology structure, and the whole network is constituted one or more most rickles；
S2, the network being newly added and original heap are incorporated into a heap, realize the extension of network.
The 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 establish connection from obtaining the topological structure of network；
S13, an empty most rickle is established, each node of topological structure is inserted into heap, constitutes initial most rickle.
As shown in Fig. 2, most rickle H.min is made of one group of minimum stacking order tree.Each node x includes one and is directed toward its pair
The pointer of the pointer of parent and an one of child of direction.All children of x connect into a dual-circulation linked list, referred to as x-
Children table.Each of table child is respectively directed to its left brother and right brother there are two pointer.All root vertexes
Pointer connects into a dual-circulation linked list, referred to as the root table H of heap with its left and right.Have in Fibonacci heap using dual-circulation linked list
Two o'clock advantage: first, a node, which is deleted, from dual-circulation linked list only needs the time 0 (1)；Second, to two given chained lists,
They can connect into a dual-circulation linked list within the time 0 (1).
In the present embodiment, the step S2 includes:
The network node being newly added and original heap are incorporated into a heap using the insertion algorithm of most rickle, realize network
Extension；Using the insertion algorithm of most rickle, the initialization of each domain and assignment by ingress to be inserted construct the annular Two-way Chain of itself
The node is added in the root table of heap by table；
The heap being newly added and original heap are incorporated into a heap using the merging algorithm of most rickle, realize the extension of network.
It is as shown below to be inserted into network node program:
All pointers for the node x being inserted into all are initially empty first, x are inserted into the root chained list of heap, if heap
Root node is the value that empty or root node value is greater than x, then adjusts pile structure, using insertion node as the root node of heap.
As shown in figure 3, the method for merging the heap being newly added includes: to merge algorithm using the heap of most rickle, by what need to be merged
Two tables of two heaps are connected, and determine a new minimum node.
An empty most rickle H is established, by heap H to be combined1Root node be assigned to the root node of H, connect H and heap to be combined
H2Root list；If H1Root node be 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 H2Root node, the heap merged be H.
Fig. 4,5,6 are the Di Jiesitela based on minimum heap optimization when network density is respectively 0.3,0.6,0.9 respectively
The comparison of algorithm and traditional Dijkstra's algorithm runing time.In order to realize the Dijkstra's algorithm based on most rickle,
Need to construct a heap for there are tracer endpoints.Initialization needs " construction heap " operation and one " insertion " operation, and
Scanning each time needs " deleting a least member " operation.It is inserted into a node to need time O (1), extracts minimum node behaviour
Need time lg | V |, V represents endpoint, and each node can be extracted once, therefore, time complexity V*lg | V
|.One " deleting key element " operation needs time O (1), and each edge at most updates once, therefore time complexity is | E
| * O (1), E representative edge.So if using most rickle, the All Time of heap operation be O (| V | * lg | V |+| E |), and other
The time of task be O (| V |+| E |), therefore, the runing time of the Dijkstra's algorithm based on most rickle be O (| V | * lg | V |
+|E|)。
In traditional Dijkstra's algorithm, adjacency matrix is used as most basic data store organisation.Work as scanning
For endpoint array come when finding minimum endpoint, entire algorithm needs to spend the time of O (| V | 2).Each reaches set of paths earliest
D (X) update consumption one time constant, so, the whole service time be O (| V | 2+ | E |).
Finally, the present processes are only preferable embodiment, it is not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent replacement, improvement and so on should be included in protection of the invention
Within the scope of.
Claims (2)
1. a kind of software defined network extended method, which comprises the following steps:
S1, network topology structure is obtained, and the whole network is configured to one or more most rickles；It specifically includes:
S11, using the Floodlight in software defined network as controller, Mininet is as network simulator tectonic network；
S12, Floodlight is connect to obtain the topological structure of network with Mininet；
S13, an empty most rickle is established, each node of topological structure is inserted into the most rickle, constitutes initial most rickle；
S2, the network being newly added and most rickle are incorporated into a heap, realize the extension of network；It specifically includes:
The network node being newly added and original heap are incorporated into a heap using the insertion algorithm of most rickle, specifically included:
All pointers for the node x being inserted into all are initially empty, x are inserted into the root chained list of heap, if the root node of heap is sky
Or the value of root node is greater than the value of x, then adjusts the structure of heap, using insertion node as the node of heap；
The heap being newly added and original heap are incorporated into a heap using the merging algorithm of most rickle, realize the extension of network；Merge
Algorithm includes:
Merge algorithm using the heap of most rickle, two tables of two heaps that need to merge are connected, and determines a new most brief summary
Point, specifically includes:
An empty most rickle H is established, 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 be sky, H2Root node be not empty and H2Root node value be not less than H1Root node
Value, then be adjusted to H for the root node of H2Root node, the heap merged be H.
2. software defined network extended method according to claim 1, which is characterized in that in the step S13, each
Most rickle includes minimum key pointer, each node includes parent pointer, left child pointers and right child pointers.
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 CN106656578A (en) | 2017-05-10 |
| CN106656578B true 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的未来无线网络系统架构和扩展;李贺武等;《无线通信》;20151030(第10期);第44-50页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656578A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mayer et al. | Fogstore: Toward a distributed data store for fog computing | |
| US11115278B2 (en) | Learning by inference from brownfield deployments | |
| EP2348678B1 (en) | Network topology method, device and system | |
| US10554500B2 (en) | Modeling access networks as trees in software-defined network controllers | |
| CN105227460B (en) | A kind of seismic interpretation system based on SDN | |
| WO2016086709A1 (en) | Method and device for implementing capacity planning | |
| WO2018113792A1 (en) | Broadcast packet processing method and processing apparatus, controller, and switch | |
| US20120315037A1 (en) | Splitting and merging routing domains | |
| CN111695223A (en) | Network topology layout method and system | |
| CN108363545A (en) | A kind of data configuration method and data configuration device | |
| US20180019917A1 (en) | Configuration of a managed device | |
| US9712455B1 (en) | Determining availability of networking resources prior to migration of a server or domain | |
| CN108011827A (en) | A kind of data forwarding method based on SDN, system and controller | |
| CN108600022B (en) | Dynamic network layout accelerating method | |
| CN110572273A (en) | method for automatically deploying physical network | |
| CN106656578B (en) | A kind of software defined network extended method based on most rickle | |
| CN114124384B (en) | QKD network virtualization method and quantum key cloud platform | |
| EP2736201B1 (en) | Routing table management method and system | |
| WO2016091013A1 (en) | Method and device for service processing | |
| CN107404507B (en) | SDN resource processing method and device | |
| US9146976B2 (en) | Synchronization and reconciliation through identification | |
| CN110535693A (en) | A kind of network is opened up and mends generation method, network is opened up and mends generation system and network structure | |
| Banjar et al. | Daim: a mechanism to distribute control functions within openflow switches | |
| CN108173688A (en) | A kind of management method of the networking configuration content based on tree and version number | |
| CN104917767B (en) | home business access control method based on RBAC model |
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 |