CN109586984B - SDN-based distributed virtual network mapping method - Google Patents
SDN-based distributed virtual network mapping method Download PDFInfo
- Publication number
- CN109586984B CN109586984B CN201910019626.XA CN201910019626A CN109586984B CN 109586984 B CN109586984 B CN 109586984B CN 201910019626 A CN201910019626 A CN 201910019626A CN 109586984 B CN109586984 B CN 109586984B
- Authority
- CN
- China
- Prior art keywords
- virtual
- node
- physical
- link
- mapping
- 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
Images
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
- H04L41/04—Network management architectures or arrangements
-
- 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
- H04L41/12—Discovery or management of network topologies
-
- 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
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
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 distributed virtual network mapping method based on an SDN. The virtual network mapping is divided into virtual node mapping and virtual link mapping. Under the control of the SDN controller, the controller can collect and master all node and link information of the area network, and perform virtual node mapping according to the sizes of CPUs used by virtual nodes arranged in a descending order. And after the virtual node is successfully mapped, the information to be mapped is sent to the physical node, so that the physical node can perform distributed mapping of related links, and an optimal path is selected according to the link bandwidth and the link length by using a shortest path algorithm to perform virtual link mapping. Therefore, the link mapping can be carried out in a distributed mode under the condition that the latest condition of the nodes and the links is controlled globally and the occupied node resources are reduced, the mapping time is shortened, the safety of a physical network is enhanced, and the mapping efficiency is improved.
Description
Technical Field
The invention relates to the technical field of virtual network mapping, in particular to a regional network under the centralized control of a Software Defined Network (SDN) controller.
Background
The measurement criteria of virtual network mapping are the length of mapping time and the amount of transmission space used in the mapping process.
Virtual network mapping under the SDN controller enables regional information to be updated in real time due to the fact that the SDN controller conducts regional centralized monitoring management; in the aspect of mapping, the mapping matching of the nodes and the links can be performed inside the controller, and the matching success information is directly sent to the corresponding nodes and links. Therefore, the matching time can be reduced, and the occupation of redundant transmission space is also reduced. However, in the matching process, only sequential matching can be performed by the SDN controller, that is, one operation is performed first on a node and then on a link, which increases the time length for any one virtual network mapping to be successful, especially on a complex virtual network mapping.
And based on the distributed virtual network mapping, the node with the best CPU processing capacity is selected as a master control point, and then the virtual node and the virtual link mapping are directly carried out on the control area. Because the RIP protocol or the OSPF protocol is used in the domain, the total control node can distribute the virtual network mapping information to each node in the domain. Therefore, when node mapping and link mapping are carried out, a plurality of nodes can be carried out simultaneously, the distributed mapping effect is achieved, and the mapping time is greatly shortened. However, this form burdens the communication link with excessive communication space resources, and wastes a lot of space resources because of the need for timing communication between nodes to maintain accurate timing of the information tables.
Disclosure of Invention
The invention aims at the defects in two cases, and the design combines two schemes. Under the control of the SDN controller, the controller is used for carrying out area control and node mapping, and each node carries out link mapping in a distributed mode. This reduces both the virtual network mapping time and the use of space in the communication route.
The mapping time is increased by virtual network mapping under the centralized control of the SDN controller, and the communication space usage amount is increased by distributed virtual network mapping. In order to eliminate the single defects of a centralized mode and a distributed mode, the invention provides a SDN-based distributed virtual network mapping method. The information to which the present patent pertains includes, among other things, only listed items. The method comprises the following steps:
a distributed virtual network mapping method based on an SDN can effectively shorten virtual network mapping time and reduce space required by virtual network mapping, firstly, an SDN controller collects node resources and link resources in a control area, physical node resource tables and physical link resource tables which are arranged in a descending order according to the size of resource quantity are respectively established, and each physical node establishes a physical link resource sub-table consisting of link information directly connected with the physical node; after the physical resource table is established, the service provider SP starts to receive a network utilization request of a user; designing a virtual network by the SP according to the network using request of the user; fourthly, after the virtual network is designed, the SDN controller arranges the virtual node resources in the virtual network into a virtual node resource table in a descending order according to the CPU usage amount, arranges the virtual link resources in the virtual network into a virtual link resource table in a descending order according to the bandwidth usage amount, and stores the two tables in the SDN controller(ii) a Fifthly, in the SDN controller, mapping the designed virtual network, namely comparing all the entries in the virtual node resource table with the physical node resource table according to the sequence from large to small of the CPU resource amount, and finding out the physical node sequence (A) which is not selected by the virtual node in the virtual network and is sufficiently used by the CPU resource1、A2、....、An) Completing node mapping; sixthly, finding out physical node sequence (A)1、A2、....、An) Then, for the ith node AiSDN controller maps the first i-1 nodes (A) that have completed mapping1、A2、…、Ai-1) Physical node name of (A)1、A2、…、Ai-1) Corresponding virtual node name, and ith node AiThe virtual link resource sub-table of the corresponding virtual node is sent to node AiExcept for the first node A1Besides, the rest n-1 nodes need to carry out the operation; when node A is iniAfter receiving the physical node name, the virtual node name and the virtual link resource sub-table, respectively comparing all table entries in the virtual link resource sub-table with the physical link resource sub-table of the corresponding physical node according to the sequence from large to small to find a link with enough bandwidth, and selecting the physical link with the shortest line length as one part of the communication link according to the shortest path algorithm; and when all the virtual nodes and virtual links in the virtual network are mapped successfully, the virtual network is mapped successfully, a user is informed that information communication can be carried out, and all the table item information in the SDN network system is updated. The entries in the physical node resource table include node name, location, total amount of CPU resources, running state, and CPU resource residual amount.
The list item of the physical link resource table comprises a link name, a link position and a congestion degree; the physical link resource sub-table entries include link name, link position, total bandwidth, remaining bandwidth amount, and congestion degree.
The list items in the virtual node resource table include the name, position, CPU resource demand and the name of the virtual link directly connected with the virtual node.
The virtual link resource table and the virtual link resource sub-table have the virtual link name, the position, the virtual link resource demand and the name of the virtual node directly connected with the virtual link resource table.
The physical link resource sub-table is a part of the physical link resource table; the virtual link resource sub-table is a part of the virtual link resource table, and is virtual link information which is screened by the SND controller after the virtual node mapping is successful and is directly related to the virtual node.
The successful mapping of the virtual nodes refers to that the virtual nodes are matched with usable physical nodes which have enough CPU resources and are not selected by other virtual nodes; successful mapping of the virtual link refers to matching the virtual link to a usable physical link which has enough bandwidth resources, the shortest line distance and is not selected by other virtual links.
Advantageous effects
This patent proposes a method for virtual network mapping. By applying the method, the centralized management and control of physical network resources can be enhanced through the SDN controller, the mapping time of the virtual network can be reduced in the two-stage coordination mapping process, and the overall utilization efficiency of the physical network is greatly improved.
Drawings
FIG. 1 is a basic flow diagram;
figure 2 is a diagram of a local area network under control of an SDN controller;
FIG. 3 is a diagram of a physical network topology including 6 physical nodes and 7 physical links;
FIG. 4 is a virtual network topology diagram containing 3 virtual nodes and 3 virtual links;
FIG. 5 is a state diagram of a physical network after a first virtual node is successfully mapped;
FIG. 6 is a state diagram of a physical network after two virtual nodes and a virtual link have been successfully mapped;
fig. 7 is a state diagram of the physical network after the mapping of the entire virtual network is successful.
Detailed description of the invention
A Software Defined Network (SDN) separates a control plane from a data plane, and realizes regional centralized control, as shown in fig. 2. In the virtual network mapping process, the SDN controller mainly functions to receive virtual network topology information to be mapped, maintain physical network topology information of an area, and control mapping time and range of the virtual network topology.
Firstly, an SDN controller collects node resources and link resources in a control area, respectively establishes a physical node resource table and a physical link resource table which are arranged in a descending order according to the size of resource quantity, and each physical node establishes a physical link resource sub-table consisting of link information directly connected with the physical node;
the SDN controller and each physical node need to establish a resource table. As shown in fig. 3, the control area of the SDN controller includes 6 physical nodes and 7 physical links. And establishing a physical node resource table containing all nodes and a physical link resource table containing all links in the SDN controller.
| Node name | Total amount of CPU resources | Amount of CPU resource remaining | Operating state | Position of |
| C | 40 | 40 | Is normal | Connection B, |
| D | ||||
| 38 | 38 | Is normal | Connection C, E | |
| E | 30 | 30 | Is normal | Connection B, D, F |
| B | 26 | 26 | Is normal | Connection A, C, E |
| F | 22 | 22 | Is normal | Connection A, E |
| A | 20 | 20 | Is normal | Connection B, F |
Table 1 physical node resource table
| Link name | Link position | Degree of congestion |
| LBC | Connection B, C | Superior food |
| LDE | Connection D, E | Superior food |
| LCD | Connection C, D | Superior food |
| LBE | Connection B, E | Superior food |
| LEF | Connection E, F | Superior food |
| LAF | Connection A, F | Superior food |
| LAB | Connection A, B | Superior food |
Table 2 physical link resource table
Each node establishes a physical link resource sub-table of links directly connected to itself. The following is the node B physical link resource sub-table, which is also built according to the same mode.
Table 3 physical link resource sublist (node B)
After the physical resource table is established, the service provider SP starts to receive a network utilization request of a user;
after the physical network information is established, the network service provider SP starts to receive the network utilization requirements of the user. The method comprises the steps of firstly setting the size of a ready queue for receiving virtual network topology information by an SDN controller. As the number of users increases and the demand resources differ, the ready queue cannot be infinitely large. Therefore, when the user demand arrives, whether the available space of the ready queue is enough is checked. As shown in fig. 2, suppose user a wishes to send information to user b over the network, and needs to send the network usage requirements to the SP. The SP checks available space of the ready queue according to the amount of the demand of the user, and if the demand is not accommodated enough, the SP returns and feeds back corresponding information to the user; if the network resource can be accommodated, the network resource is added into a ready queue to wait for the allocation of the physical network resource.
Designing a virtual network by the SP according to the network using request of the user;
the SP designs a virtual network according to the network request of the user a, as shown in fig. 4.
After the virtual network is designed, arranging virtual node resources in the virtual network into a virtual node resource table in a descending order according to the CPU usage amount by the SDN controller, arranging virtual link resources in the virtual network into a virtual link resource table in a descending order according to the bandwidth usage amount, and storing the two tables in the SDN controller;
the SP designs the user requirements into a virtual network topology, as shown in fig. 4, abstracted into an undirected graph. According to the virtual network topological graph, a virtual node resource table containing all virtual nodes and a virtual link resource table containing all virtual links are established in the SDN controller.
Table 4 virtual node resource table
Table 5 virtual link resource table
It should be noted that the present invention only exemplifies the network utilization requirement of one user and the construction of the virtual network, and the network utilization requirements of other users and the construction of the virtual network are similar.
A time window is set in the ready virtual network request queue, ranging from large to small according to the profit/cost ratio, as shown in table 6. In the case of not setting the priority, the priority handling performance is high, so that the provider can improve the overall benefit. If the node or link resource is detected to be insufficient to provide the corresponding mapping requirement of the virtual network, the node or link resource is added to the waiting queue and then allocated to the next time window for mapping.
| User name | Expected revenue | Expected cost | Profit to cost ratio | Ratio ranking |
| admin | 500 | 700 | 71.43％ | 1 |
| Administrator | 250 | 550 | 45.45％ | 2 |
TABLE 6 user request profit/expense ratio Table
And starting a mapping process, wherein the virtual network mapping is divided into two stages of virtual node mapping and virtual link mapping. The patent adopts a two-phase coordination mapping mechanism.
Fifthly, in the SDN controller, mapping the designed virtual network, namely comparing all the entries in the virtual node resource table with the physical node resource table according to the sequence from large to small of the CPU resource amount, and finding out the physical node sequence (A) which is not selected by the virtual node in the virtual network and is sufficiently used by the CPU resource1、A2、....、An) Completing node mapping;
the virtual node information is arranged from large to small according to the CPU resource demand. Because the virtual node resources are read in the order of precedence when receiving the virtual topology information, a fast sequencing is used.
TABLE 7 virtual node resource List arranged from big to small according to CPU demand
And the SDN controller performs virtual node mapping in a descending order according to the CPU usage amount. The mapping is performed by first selecting the virtual node with the largest CPU usage, such as the virtual node c in Table 7. According to the CPU resource surplus in a physical node resource table in the SDN controller, selecting a physical node with the largest CPU surplus as a mapping target of a virtual node, wherein the physical node C is preferred in the example. After comparison, it is found that the remaining amount of CPU resources of the physical node C is enough for the virtual node C to use, so that the virtual mapping of the virtual node C is successful at this time, as shown in fig. 5.
After success, the SDN controller updates the information of the physical node resource table, as shown in the following table.
| Node name | Total amount of CPU resources | Amount of CPU resource remaining | Operating state | Position of |
| |
38 | 38 | Is normal | Connection C, |
| E | ||||
| 30 | 30 | Is normal | Connection B, D, | |
| C | ||||
| 40 | 27 | Is normal | Connection B, | |
| B | ||||
| 26 | 26 | Is normal | Connection A, C, | |
| F | ||||
| 22 | 22 | Is normal | Connection A, | |
| A | ||||
| 20 | 20 | Is normal | Connection B, F |
Table 8 physical node resource table after successful mapping of virtual node c
Sixthly, finding out physical node sequence (A)1、A2、....、An) Then, for the ith node AiSDN controller maps the first i-1 nodes (A) that have completed mapping1、A2、…、Ai-1) Physical node name of (A)1、A2、…、Ai-1) Corresponding virtual node name, and ith node AiThe virtual link resource sub-table of the corresponding virtual node is sent to node AiIn addition to the firstA node A1Besides, the rest n-1 nodes need to carry out the operation;
after the physical node A is successfully mappediAfter (i ═ 1, 2, 3.., n), the first node a is divided1In addition, the SDN controller will map the previously mapped i-1 physical nodes (A)1、A2、…、Ai-1) Name of (a), and i-1 physical nodes (A)1、A2、…、Ai-1) Name of the corresponding virtual node, and the ith physical node AiThe virtual link resource sub-table of the corresponding virtual node is sent to the physical node Ai. In an example, after the virtual node a is mapped successfully, the SDN controller issues a successfully mapped physical node name C, a successfully mapped virtual node name C, and a virtual link resource sub-table corresponding to the virtual node a to the selected physical node D, where the sub-table is as follows.
Table 9 virtual link resource sub-table associated with virtual node a
When node A is iniAfter receiving the physical node name, the virtual node name and the virtual link resource sub-table, respectively comparing all table entries in the virtual link resource sub-table with the physical link resource sub-table of the corresponding physical node according to the sequence from large to small to find a link with enough bandwidth, and selecting the physical link with the shortest line length as one part of the communication link according to the shortest path algorithm;
at this time, the physical node D that has been selected performs virtual link mapping directly connected to the corresponding virtual node a.
| Link name | Total amount of bandwidth | Amount of bandwidth remaining | Link position | Degree of |
| L | ||||
| CD | 32 | 32 | Connection C, D | |
| L | ||||
| DE | 35 | 35 | Connection D, E | Superior food |
Table 10 physical link resource sub-table for physical node D
| Link name | Total amount of bandwidth | Amount of bandwidth remaining | Link position | Degree of |
| L | ||||
| BE | 30 | 30 | Connection B, E | |
| L | ||||
| DE | 35 | 35 | Connection D, E | |
| L | ||||
| EF | 30 | 30 | Connection E, F | Superior food |
Table 11 physical link resource sub-table of physical node E
The position judgment of the two virtual node names a and c results that the two virtual nodes are directly connected through a virtual link lac. The physical nodes corresponding to the two virtual nodes are D and C, and a physical link L directly connected with the physical node C is discovered through a physical link resource sublist of the physical node DCD. Although through physical link L is found by sequentially querying physical link resource sub-table 10, table 11, table 3 of physical node D, E, BDE、LBE、LBCPhysical node C may also be reached. However, in view of simplifying the problem, the corresponding physical link searched by the plurality of physical nodes does not conform to the shortest distance priority principle. Therefore, physical node D elects physical link LCDAs a virtual link lacOfObject, virtual link lacThe mapping is successful, and fig. 6 shows that the mapping is successful.
When the SDN controller performs mapping matching of the virtual node b, the physical node D which is successfully mapped receives the mapping of the virtual link sent by the SDN controller, and finds a proper physical link between the D and the C. Since the virtual node mapping of the SDN controller and the virtual link mapping of the physical node do not conflict in time and space, when the physical network and the virtual network are complex, the mapping of the virtual node and the virtual link may be performed in a distributed manner. This greatly shortens the mapping time of the virtual network.
And when all the virtual nodes and virtual links in the virtual network are mapped successfully, the virtual network is mapped successfully, a user is informed that information communication can be carried out, and all the table item information in the SDN network system is updated.
When all the virtual nodes in the entire virtual network find the corresponding physical nodes, all the virtual links find the corresponding physical links, and the topology structure formed by all the found physical nodes and physical links is the same as the topology of the virtual network, the virtual network is mapped successfully, as shown in fig. 7. At this time, the user can perform information communication.
TABLE 12 correspondence when virtual network mapping is successful
And finally, updating all table entry information in the SDN network system, wherein the table entry information comprises a physical node resource table and a physical link resource table in the SDN controller, and a physical link resource sub-table of each physical node.
Claims (7)
1. A SDN-based distributed virtual network mapping method can effectively shorten the virtual network mapping time and reduce the space required by virtual network mapping, and is characterized in that: firstly, an SDN controller collects node resources and link resources in a control area, and respectively establishes a physical node resource table and physical node resources which are arranged in a descending order according to the size of resource quantityEach physical node establishes a physical link resource sub-table consisting of link information directly connected with the physical node; after the physical resource table is established, the service provider SP starts to receive a network utilization request of a user; designing a virtual network by the SP according to the network using request of the user; after the virtual network is designed, arranging virtual node resources in the virtual network into a virtual node resource table in a descending order according to the CPU usage amount by the SDN controller, arranging virtual link resources in the virtual network into a virtual link resource table in a descending order according to the bandwidth usage amount, and storing the two tables in the SDN controller; fifthly, in the SDN controller, mapping the designed virtual network, namely comparing all the entries in the virtual node resource table with the physical node resource table according to the sequence from large to small of the CPU resource amount, and finding out the physical node sequence (A) which is not selected by the virtual node in the virtual network and is sufficiently used by the CPU resource1、A2、....、An) Completing node mapping; sixthly, finding out physical node sequence (A)1、A2、....、An) Then, for the ith node AiSDN controller maps the first i-1 nodes (A) that have completed mapping1、A2、…、Ai-1) Physical node name of (A)1、A2、…、Ai-1) Corresponding virtual node name, and ith node AiThe virtual link resource sub-table of the corresponding virtual node is sent to node AiExcept for the first node A1Besides, the rest n-1 nodes need to carry out the operation; when node A is iniAfter receiving the physical node name, the virtual node name and the virtual link resource sub-table, respectively comparing all table entries in the virtual link resource sub-table with the physical link resource sub-table of the corresponding physical node according to the sequence from large to small to find a link with enough bandwidth, and selecting the physical link with the shortest line length as one part of the communication link according to the shortest path algorithm; when all virtual nodes and virtual links in the virtual network are mapped successfully, the virtual network is mapped successfully, a user is informed that information communication can be carried out, and all virtual nodes and virtual links in an SDN network system are updatedAnd (4) table item information.
2. The SDN-based distributed virtual network mapping method of claim 1, wherein: the entries in the physical node resource table include numbers, CPU resource amounts, operating conditions and CPU resource surplus.
3. The SDN-based distributed virtual network mapping method of claim 1, wherein: the entries in the physical link resource table and the physical link resource sub-table include the total bandwidth, the remaining bandwidth, the length, and the number of the physical node directly connected with the physical link resource table.
4. The SDN-based distributed virtual network mapping method of claim 1, wherein: the list items in the virtual node resource table have the serial numbers, the CPU resource demand and the serial numbers of the virtual links directly connected with the virtual node resource table.
5. The SDN-based distributed virtual network mapping method of claim 1, wherein: the virtual link resource table and the virtual link resource sub-table have the list item with the number, the bandwidth resource demand and the number of the virtual node directly connected with the virtual link resource table.
6. The SDN-based distributed virtual network mapping method of claim 1, wherein: the physical link resource sub-table is a part of the physical link resource table; the virtual link resource sub-table is a part of the virtual link resource table, and is virtual link information directly related to a virtual node, which is screened by the SDN controller after the virtual node is mapped successfully.
7. The SDN-based distributed virtual network mapping method of claim 1, wherein: the successful mapping of the virtual nodes refers to that the virtual nodes are matched with usable physical nodes which have enough CPU resources and are not selected by other virtual nodes; successful mapping of the virtual link refers to matching the virtual link to a usable physical link which has enough bandwidth resources, the shortest line distance and is not selected by other virtual links.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910019626.XA CN109586984B (en) | 2019-01-09 | 2019-01-09 | SDN-based distributed virtual network mapping method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910019626.XA CN109586984B (en) | 2019-01-09 | 2019-01-09 | SDN-based distributed virtual network mapping method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109586984A CN109586984A (en) | 2019-04-05 |
| CN109586984B true CN109586984B (en) | 2022-02-08 |
Family
ID=65916315
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910019626.XA Active CN109586984B (en) | 2019-01-09 | 2019-01-09 | SDN-based distributed virtual network mapping method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109586984B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114745274A (en) * | 2022-04-15 | 2022-07-12 | 烽火通信科技股份有限公司 | Method and device for realizing virtual network mapping based on flexible grid optical network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108923958A (en) * | 2018-06-15 | 2018-11-30 | 西安电子科技大学 | Virtual network mapped system and method based on SDN |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105939244A (en) * | 2016-06-14 | 2016-09-14 | 北京邮电大学 | Collaborative virtual network mapping method |
| US10230661B2 (en) * | 2017-02-03 | 2019-03-12 | Fujitsu Limited | Distributed virtual network embedding |
-
2019
- 2019-01-09 CN CN201910019626.XA patent/CN109586984B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108923958A (en) * | 2018-06-15 | 2018-11-30 | 西安电子科技大学 | Virtual network mapped system and method based on SDN |
Non-Patent Citations (2)
| Title |
|---|
| A Distributed Virtual Network Mapping Algorithm;I. Houidi等;《2008 IEEE International Conference on Communications》;20080523;全文 * |
| 基于SDN网络虚拟化的映射技术;许晓健;《中国优秀硕士学位论文全文数据库（电子期刊）》;20180215;第1-6章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109586984A (en) | 2019-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108173761B (en) | SDN and NFV fused resource optimization method | |
| CN103797463A (en) | Method and apparatus for assignment of virtual resources within a cloud environment | |
| CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| JP6470426B2 (en) | Resource allocation device and resource allocation method | |
| CN101729412A (en) | Distributed level cluster method and system of geographic information service | |
| CN101631086A (en) | Routing list partitioning and placing method searched by parallel IP route | |
| CN110601994B (en) | Load balancing method for micro-service chain perception in cloud environment | |
| CN102035735A (en) | Device and method for providing forwarding and qos information | |
| WO2019072162A1 (en) | Virtual network mapping method, device and storage medium | |
| CN103338252A (en) | Distributed database concurrence storage virtual request mechanism | |
| CN110727738B (en) | Global routing system based on data fragmentation, electronic equipment and storage medium | |
| CN105530312A (en) | Network service path selection system and selection method | |
| CN101710864B (en) | Collocation method and device for multi-gateway Linux server | |
| CN109586984B (en) | SDN-based distributed virtual network mapping method | |
| CN101627580B (en) | Network component, method for the operation of such a network component, automation system comprising such a network component, method for transmitting data in an automation system by means of such a | |
| CN115065601A (en) | Virtual network mapping method for node link simultaneous mapping | |
| CN105472025A (en) | Load balancing method and device based on DNS (domain name system) | |
| CN117176638A (en) | Routing path determining method and related components | |
| CN101651572B (en) | Method and device for achieving topology search in network management system | |
| CN101605139B (en) | Method and device for establishing end-to-end service | |
| CN109450809B (en) | Data center scheduling system and method | |
| WO2015029321A1 (en) | Communication system, controller, communication method, and storage medium | |
| CN106789712B (en) | A kind of heuristic network load balancing method | |
| JP2008152792A (en) | Data transfer processor and data transfer system | |
| CN117729258B (en) | Edge service gateway system and method based on cloud edge cooperation |
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 |