CN109039895A - The search system and method for optimization Decoupling design based on OpReduce system - Google Patents
The search system and method for optimization Decoupling design based on OpReduce system Download PDFInfo
- Publication number
- CN109039895A CN109039895A CN201810651403.0A CN201810651403A CN109039895A CN 109039895 A CN109039895 A CN 109039895A CN 201810651403 A CN201810651403 A CN 201810651403A CN 109039895 A CN109039895 A CN 109039895A
- Authority
- CN
- China
- Prior art keywords
- network
- routing
- candidate
- route
- opreduce
- 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/14—Routing performance; Theoretical aspects
-
- 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/74—Address processing for routing
- H04L45/742—Route cache; Operation thereof
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- 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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/7453—Address table lookup; Address filtering using hashing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the search systems and method of a kind of optimization Decoupling design based on OpReduce system, characterized in that including candidate route acquisition module, routing evaluation module and network-action container；Candidate route acquisition module is used for the list information of the routing of the candidate according to needed for the position acquisition of virtual machine, then list information is transferred to routing evaluation module, routing evaluation module from network information database for retrieving the useful network information, and it scores each candidate routing, it initiates to execute the instruction of network task to network-action container after determining most desired routing, network-action container implements network virtual terminal insertion in network.Advantage: significant network performance gain is obtained in conventional practice；By avoiding the greedy possible suboptimality of route search algorithm, improving the stability of system, save considerable topology search cost according to all possible Route Selection based on global view.
Description
Technical field
The present invention relates to one kind to be related to route management system, in particular for optimizing the search system of Decoupling design and its searching
Suo Fangfa.
Background technique
In order to manage each tenant routing configuration simplicity, such as VXLAN and NVGRE are widely used beyond the clouds
Tunneling.However, by the flow for simply excavating tenant, network operator loses flow visibility and reliability.
When producing multi-tenant data center, management network virtual terminal insertion/update is the history based on single tenant
The quantity of task, these tenants is up to tens of thousands of.Network virtual terminal insertion request is triggered by many sources, including network load is dynamic
State, link are blocked and failure, hot spot, tenant leave etc..Solving scalability issues is to realize efficient tenant's routing management
The first step.
Insertion/update of VTN is simple just as finding a random overlay network for tenant.On the contrary, VTN may need
Safety equipment and other performance indicators needed for meeting various demands, such as the delay of guaranteed bandwidth bounded, this depends on renting
The Service Level Agreement at family.As these insertion targets become to become increasingly complex, routine search and optimization coupling solution can
It is uncertain to find real Optimization route.Insertion target is to try to reduce the communications cost of all virtual links, due to
Shortage mapping between virtual link and physical link, traditional search and optimization coupling solution are related to virtual link in optimization
Any performance indicator when all there is suboptimality.
Summary of the invention
The technical problem to be solved by the present invention is to overcome the deficiencies of existing technologies, provide based on the excellent of OpReduce system
Change the search system and method for Decoupling design.
In order to solve the above technical problems, the present invention provides a kind of search of optimization Decoupling design based on OpReduce system
System, characterized in that including candidate route acquisition module, routing evaluation module and network-action container；The candidate routing
The list information that module is used for the routing of the candidate according to needed for the position acquisition of virtual machine is obtained, is then transferred to list information
Evaluation module is routed, routing evaluation module is used to retrieve the useful network information from network information database, and to each time
Routing is initiated to execute the instruction of network task, network row to network-action container by scoring after determining most desired routing
Visibly moved device implements network virtual terminal insertion in network.
Further, the candidate route acquisition module includes that route search engine candidate acquisition and route-caching candidate obtain
It takes.
Further, the route search engine candidate obtains and includes the following steps:
For step 1. by each network node and highly relevant, all core switch distribution height are 1, other nodes just
The height that begins is infinity；
Step 2. distributes a height from core switch to other nodes keep tracks, for them, and the height of node is its all neighbour
The smallest height placed in the middle adds 1；
Step 3. is all to form the figure layer that the number of plies is height of node with mutually level node, if all nodes on path
With different height, path definition is straight line path by we, and straight line path is from the source of lower level to higher level upwards
Destination or downwards be from the source of higher level to the destination of lower level；
For step 4. in order to connect two management program H1 and H3, H1 needs the straight line path that same endpoints are shared with H3,
Shared same endpoints are defined as management program collection [H1;H3], then the communication from H1 is arrived using linear path first
Up to common node, h3 is then returned to by another linear path, therefore, routing connection [H1;H3] it is straight by above-mentioned two
Thread path composition；
Similarly, the routing for connecting all virtual machines of tenant is made of step 5. several straight line paths, wherein every straight line
Path comes from a virtual machine management program, and all these paths all terminate at the same common node；
Step 6. finds all common nodes of management program collection, for each common node, finds from common node to each
One downward straight line path of management program, and these paths are combined to generate a routing candidate.
Further, the route-caching candidate obtains and includes the following steps:
The search result of the candidate routing of step 1. is cached using dictionary data structure, and wherein key is virtual machine placement, and
And the value is all required lists routed that virtual machine is placed, and it is each to route the list for being stored as physical link ID, it uses
In from network information database retrieve link related information；
Step 2. is associated with relatively long proving period by each entry in dictionary, and holds again after entry expires
Row route search；
Step 3. is that hashed key and physical link ID distribute 32 bit address.
Further, the routing evaluation module can by what is provided in objective function and jointed with network information database
Related network information for assessing these candidate's routings scores to each candidate routing, and the objective function is to pass through
It is all possible to route candidate global view to realize.
Further, the network-action container mainly includes the following steps:
Step 1. configures interchanger in routing and forwards come the communication needed for instructing interchanger to execute；
Step 2. executes network configuration in batch processing, facilitates the routing management of large-scale data center.
A kind of searching method of the search system of the optimization Decoupling design based on OpReduce system, characterized in that
Include the following steps:
Step 1): after receiving controller request, the system candidate route list according to needed for the position acquisition of virtual machine first is waited
Routing by acquisition come from route search engine or route-caching；
Step 2: being defined as objective function for appraisal procedure, to score each Route Selection candidate；
Step 3): the useful network information is retrieved from network information database；
Step 3): after the most desired routing of determination, network task is executed by network-action container, implements net in network
The insertion of network virtual terminal.
Advantageous effects of the invention: the complex optimization target of routing update may be implemented, thus in conventional practice
It is middle to obtain significant network performance gain；By avoiding greed according to all possible Route Selection based on global view
The possible suboptimality of route search algorithm, improves the stability of system, while saving considerable topology search cost.
Detailed description of the invention
Fig. 1 is system schematic of the invention.
Specific embodiment
The invention will be further described below in conjunction with the accompanying drawings.Following embodiment is only used for clearly illustrating the present invention
Technical solution, and not intended to limit the protection scope of the present invention.
As shown in Figure 1, a kind of be based on OpReduce(route search device) search system of the optimization Decoupling design of system, it wraps
Include candidate route acquisition module, routing evaluation module and network-action container；Candidate's route acquisition module includes routing
Search engine candidate obtains and route-caching candidate obtains, the column for the routing of the candidate according to needed for the position acquisition of virtual machine
Then list information is transferred to routing evaluation module by table information, routing evaluation module from network information database for examining
The network information of Suo Youyong, and score each candidate routing, it is sent out after determining most desired routing to network-action container
The instruction for executing network task is acted, network-action container implements network virtual terminal insertion in network.
H1 ~ H4 in Fig. 1 is four management programs, and E1, E2 are two primary routing nodes, and C1 ~ C3 is three advanced roads
By node.1. ~ 6. it is processing step of the invention:
1. for by each network node and highly relevant, all core switch distribution height are 1 to step, other nodes just
The height that begins is infinity；
2. distributes a height from core switch to other nodes keep tracks for them, the height of node is its all neighbour to step
The smallest height placed in the middle adds 1；
Step 3. it is all with mutually level node composition the number of plies for height of node figure layer, if all sections on path
Point has different height, and path definition is straight line path by we, and straight line path is from the source of lower level to higher upwards
The destination of layer is from the source of higher level to the destination of lower level downwards；
4. in order to connect two management program H1 and H3, H1 needs the straight line path that same endpoints are shared with H3 to step,
Shared same endpoints are defined as management program collection [H1;H3], then the communication from H1 is arrived using linear path first
Up to common node, h3 is then returned to by another linear path, therefore, routing connection [H1;H3] it is straight by above-mentioned two
Thread path composition；
5. similarly, the routing for connecting all virtual machines of tenant is made of step several straight line paths, wherein every straight line
Path comes from a virtual machine management program, and all these paths all terminate at the same common node；
6. finds all common nodes of management program collection to step, for each common node, finds from common node to each
One downward straight line path of management program, and these paths are combined to generate a routing candidate.Controller driving is originally
System, system return to Optimization route to controller, then by controller control data transmission.
A kind of searching method of the search system of the optimization Decoupling design based on OpReduce, includes the following steps:
Step 1, after receiving request, the route search device routing candidate list according to needed for the position acquisition of virtual machine first.This
A little routing candidates may be from route search engine or route-caching (if the position for having explored virtual machine before).
Step 2, in order to help to assess, appraisal procedure is defined as objective function, with to each Route Selection candidate carry out
Scoring.The design of objective function is realized by the candidate global view of all possible routing.
Step 3 retrieves the useful network information (that is: connection load) from network information database.
Step 4, finally, after the most desired routing of determination, " route search person " executes net by network-action container
Network task (i.e. interchanger configuration) implements network virtual terminal insertion in network.
A. route search engine:
Step 1. is by each network node and highly relevant, and in network, we are by each node and highly relevant.Institute
There is core switch distribution height 1, the elemental height of other nodes is infinity.
Step 2. distributes a height from core switch to other nodes keep tracks, for them.The height of node is it
The smallest height adds 1 in all neighbours.
Step 3. is all to form the figure layer that the number of plies is height of node with mutually level node.If the institute on path
There is node that there is different height, path definition is straight line by we.Straight line path is upwards (from the source of lower level to higher level
Destination) or downwards (from the source of higher level to the destination of lower level).
For step 4. in order to connect two management programs H1 and H3, it is shared that H1 needs one of one and the straight line path of H3
The straight line path of same endpoints.Shared endpoint is defined as management program collection [H1;H3].Then the communication from H1 can be first
Common node is first reached using linear path, h3 is then returned to by another linear path.Therefore, routing connection
[H1;H3] it is made of above-mentioned two straight line paths.
Similarly, the routing for connecting all virtual machines of tenant is made of step 5. several straight line paths, wherein every
Straight line path comes from a virtual machine management program, and all these paths all terminate at the same common node.
Step 6. finds all common nodes of management program collection, for each common node, find from common node to
One downward straight line path of each management program, and these paths are combined to generate a routing candidate.
B. tenant's route-caching:
The search result of the candidate routing of step 1. is cached using dictionary (hash table) data structure, and wherein key is virtual
Machine is placed, and the value is all required lists routed that VM is placed.It is each to route the column for being stored as physical link ID
Table can be used for retrieving link related information (for example, utilization rate, state) from network information database.
Step 2. is associated with relatively long proving period (such as a few weeks) by each entry in dictionary, and in item
Mesh re-executes route search after expiring.
Step 3. is that hashed key and physical link ID distribute 32 bit address.
C. objective function:
Step 1. provides the candidate global view of all possible routing, so that objective function is not limited to greedy and local letter
Number.
The related network information provided in step 2. network information database can be used for assessing these candidate's routings.
D. network-action container:
Step 1. configures interchanger in routing and forwards come the communication needed for instructing interchanger to execute.
Step 2. executes network configuration in batch processing in order to facilitate the routing management of large-scale data center.
The above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformations can also be made, these improvement and deformations
Also it should be regarded as protection scope of the present invention.
Claims (7)
1. a kind of search system of the optimization Decoupling design based on OpReduce system, characterized in that including candidate route acquisition
Module, routing evaluation module and network-action container；Candidate's route acquisition module according to the position of virtual machine for obtaining
The list information of required candidate routing is taken, list information is then transferred to routing evaluation module, routing evaluation module is used for
The useful network information is retrieved from network information database, and is scored each candidate routing, determines most desired road
By the rear instruction for initiating execution network task to network-action container, network-action container implements network virtual terminal in network
Insertion.
2. the search system of the optimization Decoupling design according to claim 1 based on OpReduce system, characterized in that institute
Stating candidate route acquisition module includes that route search engine candidate obtains and route-caching candidate acquisition.
3. the search system of the optimization Decoupling design according to claim 2 based on OpReduce system, characterized in that institute
It states route search engine candidate and obtains and include the following steps:
For step 1. by each network node and highly relevant, all core switch distribution height are 1, other nodes just
The height that begins is infinity；
Step 2. distributes a height from core switch to other nodes keep tracks, for them, and the height of node is its all neighbour
The smallest height placed in the middle adds 1；
Step 3. is all to form the figure layer that the number of plies is height of node with mutually level node, if all nodes on path
With different height, path definition is straight line path by we, and straight line path is from the source of lower level to higher level upwards
Destination or downwards be from the source of higher level to the destination of lower level；
For step 4. in order to connect two management program H1 and H3, H1 needs the straight line path that same endpoints are shared with H3,
Shared same endpoints are defined as management program collection [H1;H3], then the communication from H1 is arrived using linear path first
Up to common node, h3 is then returned to by another linear path, therefore, routing connection [H1;H3] it is straight by above-mentioned two
Thread path composition；
Similarly, the routing for connecting all virtual machines of tenant is made of step 5. several straight line paths, wherein every straight line
Path comes from a virtual machine management program, and all these paths all terminate at the same common node；
Step 6. finds all common nodes of management program collection, for each common node, finds from common node to each
One downward straight line path of management program, and these paths are combined to generate a routing candidate.
4. the search system of the optimization Decoupling design according to claim 2 based on OpReduce system, characterized in that institute
It states route-caching candidate and obtains and include the following steps:
The search result of the candidate routing of step 1. is cached using dictionary data structure, and wherein key is virtual machine placement, and
And the value is all required lists routed that virtual machine is placed, and it is each to route the list for being stored as physical link ID, it uses
In from network information database retrieve link related information；
Step 2. is associated with relatively long proving period by each entry in dictionary, and holds again after entry expires
Row route search；
Step 3. is that hashed key and physical link ID distribute 32 bit address.
5. the search system of the optimization Decoupling design according to claim 1 based on OpReduce system, characterized in that institute
It states routing evaluation module and can be used for assessing these candidate roads by what is provided in objective function and jointed with network information database
By related network information score each candidate routing, the objective function is by all possible routing candidate
Global view is realized.
6. the search system of the optimization Decoupling design according to claim 1 based on OpReduce system, characterized in that institute
Network-action container is stated mainly to include the following steps:
Step 1. configures interchanger in routing and forwards come the communication needed for instructing interchanger to execute；
Step 2. executes network configuration in batch processing, facilitates the routing management of large-scale data center.
7. a kind of searching method of the search system of the optimization Decoupling design based on OpReduce system based on claim 1,
It is characterized in that
Include the following steps:
Step 1): after receiving controller request, the system candidate route list according to needed for the position acquisition of virtual machine first is waited
Routing by acquisition come from route search engine or route-caching；
Step 2: being defined as objective function for appraisal procedure, to score each Route Selection candidate；
Step 3): the useful network information is retrieved from network information database；
Step 3): after the most desired routing of determination, network task is executed by network-action container, implements net in network
The insertion of network virtual terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810651403.0A CN109039895B (en) | 2018-06-22 | 2018-06-22 | OpReduce system-based search system and method for optimizing decoupling design |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810651403.0A CN109039895B (en) | 2018-06-22 | 2018-06-22 | OpReduce system-based search system and method for optimizing decoupling design |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109039895A true CN109039895A (en) | 2018-12-18 |
| CN109039895B CN109039895B (en) | 2020-09-29 |
Family
ID=64610041
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810651403.0A Active CN109039895B (en) | 2018-06-22 | 2018-06-22 | OpReduce system-based search system and method for optimizing decoupling design |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109039895B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110620686A (en) * | 2019-09-05 | 2019-12-27 | 西安交通大学 | Routing node selection method based on complex communication network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217497A (en) * | 2008-01-18 | 2008-07-09 | 北京邮电大学 | A path selecting method of wireless mesh network |
| EP2274879A1 (en) * | 2008-03-28 | 2011-01-19 | Telefonaktiebolaget LM Ericsson (publ) | End-to-end inter-domain routing |
| CN104270416A (en) * | 2014-09-12 | 2015-01-07 | 杭州华为数字技术有限公司 | Load balancing control method and management node |
| CN105530678A (en) * | 2015-12-14 | 2016-04-27 | 北京邮电大学 | Wireless return router selection method based on loads and time delay in ultra dense network |
-
2018
- 2018-06-22 CN CN201810651403.0A patent/CN109039895B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217497A (en) * | 2008-01-18 | 2008-07-09 | 北京邮电大学 | A path selecting method of wireless mesh network |
| EP2274879A1 (en) * | 2008-03-28 | 2011-01-19 | Telefonaktiebolaget LM Ericsson (publ) | End-to-end inter-domain routing |
| CN104270416A (en) * | 2014-09-12 | 2015-01-07 | 杭州华为数字技术有限公司 | Load balancing control method and management node |
| CN105530678A (en) * | 2015-12-14 | 2016-04-27 | 北京邮电大学 | Wireless return router selection method based on loads and time delay in ultra dense network |
Non-Patent Citations (1)
| Title |
|---|
| 查道贵，许彩芳: "基于改进量子进化算法的计算机网络最佳路由选择分析", 《宿州学院学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110620686A (en) * | 2019-09-05 | 2019-12-27 | 西安交通大学 | Routing node selection method based on complex communication network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109039895B (en) | 2020-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10069676B2 (en) | Storing network state at a network controller | |
| US8327021B2 (en) | Technique of determining connectivity solutions for network elements | |
| CN105072030B (en) | A kind of name data network route system and its cluster querying method based on content clustering | |
| CN103346967B (en) | A kind of data center network topology structure and method for routing thereof | |
| CN104426720B (en) | Network relay system and exchange apparatus | |
| EP3637700A1 (en) | Sdn network system, controller, and controlling method | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| CN108111410A (en) | Deadlock freedom routing in lossless multidimensional Cartesian Topology Structure with minimum number virtual buffering region | |
| CN108337170A (en) | Distributed resource lookup method and system | |
| CN106940696B (en) | Information query method and system for SDN multi-layer controller | |
| CN109039895A (en) | The search system and method for optimization Decoupling design based on OpReduce system | |
| EP2736201B1 (en) | Routing table management method and system | |
| JP6992168B2 (en) | Query extension system and query extension method | |
| CN102946357B (en) | Method and device for issuing multicast forwarding table items | |
| CN105282036A (en) | Routing node and route exchange method and system | |
| CN114301806B (en) | Virtual network connectivity detection method, device, equipment and storage medium | |
| CN101425918A (en) | Routing method based on tree network topology | |
| CN106210090A (en) | The method for searching network services of double-layer circular routing infrastructure based on P2P network | |
| WO2019056922A1 (en) | Fast rerouting-based vpws bypass protection switching method and system | |
| US11283523B2 (en) | Optical domain controller of a telecommunications network | |
| CN108366024A (en) | Message forwarding method and device | |
| US10505809B1 (en) | Object-based prefix and attribute distribution for network devices | |
| CN103503383B (en) | Communication system, router, switch hub and communication means | |
| Broström et al. | Multiobjective design of survivable IP networks | |
| US20060067337A1 (en) | Methods and devices for generating a hierarchical structure for the internet |
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 |