CN110636007A - Route arranging method, route arranger and system for edge computing network - Google Patents
Route arranging method, route arranger and system for edge computing network Download PDFInfo
- Publication number
- CN110636007A CN110636007A CN201910859768.7A CN201910859768A CN110636007A CN 110636007 A CN110636007 A CN 110636007A CN 201910859768 A CN201910859768 A CN 201910859768A CN 110636007 A CN110636007 A CN 110636007A
- Authority
- CN
- China
- Prior art keywords
- node
- routes
- routing
- route
- edge computing
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0075—Wavelength grouping or hierarchical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0086—Network resource allocation, dimensioning or optimisation
Abstract
The invention discloses a route arranging method, a route arranger and a system of an edge computing network, wherein the method comprises the following steps: receiving a service connection opening request reported by an edge computing node; inquiring whether existing routes corresponding to the source node and the destination node exist in a working routing table; if the corresponding route exists in the working routing table, performing service connection according to the route and the stored bandwidth information; if the working routing table does not have a corresponding route, inquiring whether the pre-routing table exists or not and judging whether the routing information meets the bandwidth requirement of the service request or not; and if the corresponding route exists in the pre-routing table and the initial bandwidth information meets the bandwidth requirement of the service request, updating the information in the pre-routing table, and sending the corresponding route and the bandwidth of the service request. The routing arrangement method, the routing arranger and the system of the edge computing network can realize the quick establishment of edge computing service and the efficient utilization of optical network resources.
Description
Technical Field
The present invention relates to an edge computing network, and more particularly, to a route arranging method, a route arranger and a route arranging system for an edge computing network.
Background
Edge computing refers to providing nearest-end service nearby by adopting an open platform integrating network, computing, storage and application core capabilities on one side close to an object or a data source. The core is to provide computing power at the network edge, generate faster network service response and meet the basic requirements of the industry on real-time business, application intelligence, safety, privacy protection and the like. The edge computation is between the physical entity and the industrial connection, or on top of the physical entity. And the cloud computing still can access the historical data of the edge computing.
The edge computing node is usually located at the edge of an access network or a metropolitan area network, and is interconnected with the cloud data center through an optical transmission network. Due to the limited processing capacity, a large number of distributed edge nodes cannot provide all services completely and independently, and need to cooperate with other edges or cloud data centers through an optical transport network, and an optical network connecting the edge nodes and the cloud data centers needs to provide a large number of routes for edge computing services with fine bandwidth granularity and small transmission delay to support the cooperative interaction requirements of the distributed edge nodes and the cloud centers.
Edge computing is a multi-application multi-service system, and each service has different performance requirements on the distributed optical network route according to the service characteristics.
Based on this, the inventors of the present application find that the support of the optical network to the edge computing service with low latency and high efficiency becomes an urgent problem to be solved, especially the interaction latency and resource utilization optimization problem of the edge computing service and the optical network routing.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The invention aims to provide a route arranging method, a route arranging device and a route arranging system for an edge computing network, which can improve the utilization rate of edge computing services and optical network route resources.
In order to achieve the above object, the present invention provides a routing method for an edge computing network, where the edge computing network includes a plurality of edge computing nodes, the routing method includes: receiving a service connection opening request reported by an edge computing node, wherein the service connection opening request comprises a source node and a destination node of service connection and the bandwidth of the service request; inquiring whether existing routes corresponding to the source node and the destination node exist in a working routing table, wherein the working routing table stores a set of routes which are established service connection and bandwidth information corresponding to the routes; if existing routes corresponding to the source node and the destination node exist in the working routing table, performing service connection according to the routes and the stored bandwidth information; if the working routing table does not have existing routes corresponding to the source node and the destination node, inquiring whether the routes corresponding to the source node and the destination node exist in a pre-routing table or not, and judging whether the routes meet the bandwidth requirement of a service request or not, wherein the pre-routing table stores the pre-established routes and initial bandwidth information corresponding to the routes; if the pre-routing table has routes corresponding to the source node and the destination node and the initial bandwidth information meets the bandwidth requirement of the service request, replacing the initial bandwidth information corresponding to the route with the bandwidth of the service request, updating the information in the pre-routing table, and migrating the routes corresponding to the source node and the destination node from the pre-routing table to the working routing table; and sending the routes corresponding to the source node and the destination node and the bandwidth of the service request to an OpenFlow controller.
In a preferred embodiment, the target node is: the cloud computing center node, after receiving the service connection fulfillment request reported by the edge computing node, and before querying whether existing routes corresponding to the source node and the destination node exist in the working routing table, further includes: and calculating a route to the cloud computing center for each edge computing node to generate a pre-routing table.
In a preferred embodiment, the calculating a route to the cloud computing center for each edge computing node, and generating the pre-routing table includes: setting initial bandwidth information and time delay requirements needed by all edge computing nodes; calculating a sharing coefficient of a link i, j according to the bandwidth of the service request, the total bandwidth of the link i, j and the total number of routes from a source node to a destination node in the network, wherein the link i, j is a link between an edge calculation node i and the edge calculation node j; circularly counting the sharing coefficients of all links, and establishing a network resource parameter table, wherein the network resource parameter table stores edge computing nodes, initial bandwidth information and time delay requirements corresponding to the edge computing nodes, and the sharing coefficients of the links corresponding to the edge computing nodes; and in all links, calculating routes with the residual bandwidth and the time delay meeting the requirements by adopting a D algorithm according to the sharing coefficient, and storing the routes into a pre-routing table, wherein the routes comprise a plurality of links from the source node to the destination node.
In a preferred embodiment, the updating the information in the pre-routing table includes: calculating the number of routes passing through the link i, j again; if the number of routes passing through the link i, j is increased compared with the last calculation, updating the sharing coefficient of the link i, j, and storing the updated sharing coefficient of the link i, j and the residual bandwidth in a network resource parameter table; repeating the steps until the updating of all links is completed; and in all links, calculating the routes with the residual bandwidth and the time delay meeting the requirements by adopting a D algorithm according to the sharing coefficients, and updating the pre-routing table.
In a preferred embodiment, the updating the sharing coefficient of the link i, j includes: calculating the sharing coefficient of the link i, j again according to the calculated number of the routes passing through the link i, j and the total number of the routes from the source node to the destination node in the network; and multiplying the recalculated sharing coefficient of the link i, j by a coefficient (1+1/N) to obtain the updated sharing coefficient of the link i, j.
In a preferred embodiment, the calculating the sharing coefficient of the link i, j according to the number of routes passing through the link i, j and the total number of routes from the source node to the destination node in the network includes: calculating the sharing coefficient theta (ij) of the link i, j according to a formula I:
wherein Link (i, j) is a Link between an edge computing node i and an edge computing node j, Bi,jThe total bandwidth of the Link (i, j), Rl is the set of links passed by the route L, Bl is the bandwidth occupied by the route L, and L is the total number of routes in the network.
In order to achieve the above object, the present invention further provides a route orchestrator of an edge computing network, configured to execute the above route orchestration method of the edge computing network.
In order to achieve the above object, the present invention further provides a routing arrangement system of an edge computing network, including the above routing orchestrator, further including: and the controller of the OpenFlow is used for generating an OpenFlow flow table according to the routing information sent by the routing composer from the source node to the destination node and the bandwidth of the service request.
In a preferred embodiment, the method further comprises: an optical switch node; the OpenFlow controller is further configured to send an OpenFlow flow table to a corresponding optical switch node; the optical switch node is used for configuring wavelength resources according to the flow table and replying a confirmation message to the OpenFlow controller; and the edge computing node performs service interaction and data transmission with the cloud computing center node according to the configured wavelength resources.
In a preferred embodiment, after completing service interaction and data transmission, the edge computing node sends a service connection end request to the OpenFlow controller; the OpenFlow controller forwards the request to the routing orchestrator; the route orchestrator transfers the route corresponding to the service connection from the working route table to the pre-route table, and updates the route bandwidth parameter to the initial bandwidth information; and the OpenFlow controller sends a flow table instruction to the optical switch node and releases optical link resources.
Compared with the prior art, according to the method for combining the pre-routing table and the working routing table, the routing calculation and the resource dynamic allocation are carried out between all edge computing nodes and cloud computing nodes from the perspective of the overall network, the dynamic planning and the strategy optimization of the routing control and the resource allocation of the whole network can be realized, and the rapid establishment of the edge computing service and the efficient utilization of the optical network resources are further realized.
Drawings
Fig. 1 is a flowchart of a routing method of an edge computing network according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a route composer of an edge computing network according to an embodiment of the present invention.
Detailed Description
The following detailed description of the present invention is provided in conjunction with the accompanying drawings, but it should be understood that the scope of the present invention is not limited to the specific embodiments.
Throughout the specification and claims, unless explicitly stated otherwise, the word "comprise", or variations such as "comprises" or "comprising", will be understood to imply the inclusion of a stated element or component but not the exclusion of any other element or component.
Example 1
As shown in fig. 1, which is a flowchart of a routing method for an edge computing network according to a preferred embodiment of the present invention, the edge computing network includes a plurality of edge computing nodes, and the routing method includes: steps S1-S6.
In step S1, a service connection provisioning request reported by an edge computing node is received, where the service connection provisioning request includes a source node and a destination node of a service connection and a bandwidth of the service request; wherein the target node is: and (4) cloud computing center nodes.
In step S2, it is queried whether there is an existing route corresponding to the source node and the destination node in a working routing table, where the working routing table stores a set of routes for which a service connection has been established and bandwidth information corresponding to the routes, and the routes are path information from the source node to the destination node.
Specifically, a link refers to an optical fiber directly connected between two adjacent nodes, and a route is an end-to-end connection formed by a series of links; the number of routes is several routes through the link.
In step S3, if there is an existing route corresponding to the source node and the destination node in the working routing table, service connection is performed according to the route and the stored bandwidth information.
In step S4, if there is no existing route in the working routing table, it is queried whether there is a route corresponding to the source node and the destination node in the pre-routing table, and whether the route meets the bandwidth requirement of the service request is determined, where the pre-routing table stores a pre-established route and initial bandwidth information corresponding to the route.
In step S5, if there are routes corresponding to the source node and the destination node in the pre-routing table and the initial bandwidth information satisfies the bandwidth requirement of the service request, the initial bandwidth information corresponding to the route is replaced with the bandwidth of the service request, the information in the pre-routing table is updated, and the routes corresponding to the source node and the destination node are migrated from the pre-routing table to the working routing table.
In step S6, the routes corresponding to the source node and the destination node and the bandwidth of the service request are sent to the OpenFlow controller.
Therefore, in this embodiment, by using a method of combining the "pre-routing table" and the "working routing table", routing computation and resource dynamic allocation are performed between all the "edge computing nodes — cloud computing nodes" from the perspective of the network global, so that dynamic planning and policy optimization of routing control and resource allocation of the whole network can be realized, and further, fast establishment of edge computing services and efficient utilization of optical network resources are realized.
In one implementation, after step S1 and before step S2, the method may further include: step S0.
In step S0, a route to the cloud computing center is calculated for each edge computing node, and a pre-routing table is generated.
Specifically, steps S01-S04 may be included.
In step S01, initial bandwidth information and latency requirements required by all edge compute nodes are set.
In step S02, a sharing coefficient of a link i, j is calculated according to the bandwidth of the service request, the total bandwidth of the link i, j, and the total number of routes from the source node to the destination node in the network, where the link i, j is a link between the edge calculation node i and the edge calculation node j.
Specifically, the sharing coefficient θ (ij) of the link i, j is calculated according to a formula one, where the formula one is:
wherein Link (i, j) is a Link between an edge computing node i and an edge computing node j, Bi,jThe total bandwidth of the Link (i, j), Rl is the set of links passed by the route L, Bl is the bandwidth occupied by the route L, and L is the total number of routes in the network.
In step S03, the sharing coefficients of all links are counted circularly, and a network resource parameter table is established, where the network resource parameter table stores an edge computing node, initial bandwidth information and a delay requirement corresponding to the edge computing node, and the sharing coefficients of the links corresponding to the edge computing node.
In step S04, in all links, a route with a remaining bandwidth and a delay meeting the requirement is calculated by using a D algorithm according to the sharing coefficient and stored in a pre-routing table, where the route includes a plurality of links from the source node to the destination node, and the remaining bandwidth of the link is a difference between a total bandwidth of the link and a bandwidth of the service request corresponding to the link bandwidth.
Specifically, the D algorithm is Dijkstra (Dijkstra) algorithm.
Therefore, the rapid connection establishment of the edge computing service is realized by pre-computing the whole route and then dynamically adjusting the network bandwidth allocation method according to the actual service requirement.
The updating of the information in the pre-routing table in step S5 includes: step S51-step S55.
In step S51, the number of routes passing through link i, j is calculated again.
In step S52, if the number of routes passing through the link i, j is increased compared to the last calculation, the sharing coefficient of the link i, j is updated, and the updated sharing coefficient of the link i, j and the remaining bandwidth are stored in the network resource parameter table.
Specifically, updating the sharing coefficient of the link i, j includes: according to the recalculated number of the routes passing through the links i and j and the total number of the routes from the source node to the destination node in the network, recalculating the sharing coefficient of the links i and j; and multiplying the recalculated sharing coefficient of the link i, j by a coefficient (1+1/N) to obtain the updated sharing coefficient of the link i, j.
In step S53, if the number of routes passing through the link i, j is not increased from the last calculation, the sharing coefficient of the link i, j is calculated again as the updated sharing coefficient of the link i, j.
Step S54, repeating the above steps until the updating of all links is completed;
and step S55, calculating the routes with the residual bandwidth and the time delay meeting the requirements by adopting a D algorithm according to the sharing coefficients in all the updated links, and updating the pre-routing table.
Therefore, if the number of the routes passing through the links i and j is calculated again and is larger than the number of the routes in the last time, the sharing coefficient of the calculated links i and j is multiplied by the coefficient (1+1/N) to serve as the updated sharing coefficient of the links i, the link weight with the high sharing coefficient is used for obtaining the reward value, the link weight with the low link sharing degree is used for obtaining the penalty value, network resources are shared as much as possible through the link priority selection with the high sharing coefficient, and the resource utilization rate is improved.
Example 2
As shown in fig. 2, which is a schematic structural diagram of a route orchestrator of an edge computing network according to a preferred embodiment of the present invention, this embodiment further provides a route orchestrator of an edge computing network, which is used to execute the route orchestration method of the edge computing network in embodiment 1, and details in this embodiment are not repeated.
The route orchestrator mainly includes: the system comprises a route calculation module 1, a pre-routing module 2, a working routing module 3 and a northbound interface module 4. The pre-routing module 2 stores a pre-routing table, and the working routing module 3 stores a working routing table.
The route calculation module 1 is configured to receive a service connection fulfillment request reported by an edge calculation node, where the service connection fulfillment request includes a source node and a destination node of a service connection and a bandwidth of the service request; wherein the target node is: and (4) cloud computing center nodes.
The route calculation module 1 queries whether existing routes corresponding to the source node and the destination node exist in a working route table in the working route module 3, wherein a set of routes which have established service connection and bandwidth information corresponding to the routes are stored in the working route table, and the routes are path information from the source node to the destination node. And if the existing routes corresponding to the source node and the destination node exist in the working routing table, performing service connection according to the routes and the stored bandwidth information. If the working routing table does not have existing routes corresponding to the source node and the destination node, inquiring whether the routes corresponding to the source node and the destination node exist in a pre-routing table in a pre-routing module 2, and judging whether the routes meet the bandwidth requirement of the service request, wherein the pre-routing table stores the pre-established routes and initial bandwidth information corresponding to the routes. If the routes corresponding to the source node and the destination node exist in the pre-routing table and the initial bandwidth information meets the bandwidth requirement of the service request, replacing the initial bandwidth information corresponding to the route with the bandwidth of the service request, updating the information in the pre-routing table, and migrating the routes corresponding to the source node and the destination node from the pre-routing table to the working routing table.
And the route calculation module sends the route corresponding to the source node and the destination node 1 and the bandwidth of the service request to the OpenFlow controller through the northbound interface module.
The route orchestrator may further comprise a network topology assistance map module 5, the network topology assistance map module 5 being configured to store a network resource parameter table.
Therefore, in this embodiment, by using a method combining the "pre-routing table" and the "working routing table", routing computation and resource dynamic allocation are performed between all the "edge computing nodes — cloud computing nodes" from the perspective of the global network, so that dynamic planning and policy optimization of routing control and resource allocation of the whole network can be realized, and further, fast establishment of edge computing services and efficient utilization of optical network resources are realized.
Example 3
The present embodiment further provides a routing arrangement system of an edge computing network, including the routing editor in embodiment 2, further including: controller, optical switch node of OpenFlow.
And the controller of the OpenFlow is used for generating an OpenFlow flow table according to the routing information sent by the routing composer from the source node to the destination node and the bandwidth of the service request. The OpenFlow controller is further configured to send the OpenFlow flow table to the corresponding optical switch node.
And the optical switch node is used for configuring the wavelength resource according to the flow table and replying an acknowledgement message to the OpenFlow controller.
And the edge computing node performs service interaction and data transmission with the cloud computing center node according to the configured wavelength resource. After finishing service interaction and data transmission, the edge computing node sends a service connection ending request to the OpenFlow controller;
the OpenFlow controller forwards the request to the routing orchestrator; the route orchestrator transfers the route corresponding to the service connection from the working route table to the pre-route table, and updates the route bandwidth parameter to the initial bandwidth information; and the OpenFlow controller sends a flow table instruction to the optical switch node and releases optical link resources.
Therefore, the embodiment performs dynamic planning and policy optimization of the routing control and resource allocation of the whole network through a global routing arrangement mechanism of the network, and realizes the rapid establishment of the edge computing service and the efficient utilization of the optical network resources.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing descriptions of specific exemplary embodiments of the present invention have been presented for purposes of illustration and description. It is not intended to limit the invention to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. The exemplary embodiments were chosen and described in order to explain certain principles of the invention and its practical application to enable one skilled in the art to make and use various exemplary embodiments of the invention and various alternatives and modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims and their equivalents.
Claims (10)
1. A routing arrangement method of an edge computing network, the edge computing network comprising a plurality of edge computing nodes, the routing arrangement method comprising:
receiving a service connection opening request reported by an edge computing node, wherein the service connection opening request comprises a source node and a destination node of service connection and the bandwidth of the service request;
inquiring whether existing routes corresponding to the source node and the destination node exist in a working routing table, wherein the working routing table stores a set of routes with established service connection and bandwidth information corresponding to the routes;
if existing routes corresponding to the source node and the destination node exist in the working routing table, performing service connection according to the routes and the stored bandwidth information;
if the working routing table does not have existing routes corresponding to the source node and the destination node, inquiring whether the routes corresponding to the source node and the destination node exist in a pre-routing table or not, and judging whether the routes meet the bandwidth requirement of a service request or not, wherein the pre-routing table stores the pre-established routes and initial bandwidth information corresponding to the routes;
if the pre-routing table has routes corresponding to the source node and the destination node and the initial bandwidth information meets the bandwidth requirement of the service request, replacing the initial bandwidth information corresponding to the route with the bandwidth of the service request, updating the information in the pre-routing table, and migrating the routes corresponding to the source node and the destination node from the pre-routing table to the working routing table;
and sending the routes corresponding to the source node and the destination node and the bandwidth of the service request to an OpenFlow controller.
2. The routing orchestration method according to claim 1, wherein the target node is: the cloud computing center node, after receiving the service connection fulfillment request reported by the edge computing node, and before querying whether existing routes corresponding to the source node and the destination node exist in the working routing table, further includes:
and calculating a route to the cloud computing center for each edge computing node, and generating a pre-routing table.
3. The routing orchestration method according to claim 2, wherein the computing a route to the cloud computing center for each edge computing node, and wherein generating the pre-routing table comprises:
setting initial bandwidth information and time delay requirements needed by all edge computing nodes;
calculating a sharing coefficient of a link i, j according to the bandwidth of the service request, the total bandwidth of the link i, j and the total number of routes from a source node to a destination node in the network, wherein the link i, j is a link between an edge calculation node i and the edge calculation node j;
circularly counting the sharing coefficients of all links, and establishing a network resource parameter table, wherein the network resource parameter table stores edge computing nodes, initial bandwidth information and time delay requirements corresponding to the edge computing nodes, and the sharing coefficients of the links corresponding to the edge computing nodes;
and in all links, calculating routes with the residual bandwidth and the time delay meeting the requirements by adopting a D algorithm according to the sharing coefficient, and storing the routes into a pre-routing table, wherein the routes comprise a plurality of links from the source node to the destination node.
4. The routing orchestration method according to claim 3, wherein the updating information in the pre-routing table comprises:
calculating the number of routes passing through the link i, j again;
if the number of routes passing through the link i, j is increased compared with the last calculation, updating the sharing coefficient of the link i, j, and storing the updated sharing coefficient of the link i, j and the residual bandwidth in a network resource parameter table;
repeating the steps until the updating of all links is completed;
and in all links, calculating the routes with the residual bandwidth and the time delay meeting the requirements by adopting a D algorithm according to the sharing coefficients, and updating the pre-routing table.
5. The routing orchestration method according to claim 4, wherein the updating the sharing coefficients of links i, j comprises:
according to the recalculated number of the routes passing through the links i and j and the total number of the routes from the source node to the destination node in the network, recalculating the sharing coefficient of the links i and j;
and multiplying the recalculated sharing coefficient of the link i, j by a coefficient (1+1/N) to obtain the updated sharing coefficient of the link i, j.
6. The routing arrangement method of claim 3, wherein calculating the sharing coefficient of the link i, j according to the number of routes passing through the link i, j and the total number of routes from the source node to the destination node in the network comprises:
calculating the sharing coefficient theta (ij) of the link i, j according to a formula I:
wherein Link (i, j) is a Link between an edge computing node i and an edge computing node j, Bi,jThe total bandwidth of the Link (i, j), Rl is the set of links passed by the route L, Bl is the bandwidth occupied by the route L, and L is the total number of routes in the network.
7. A route orchestrator of an edge computing network, for performing the method of route orchestration of the edge computing network according to any one of claims 1-6.
8. A routing orchestration system for an edge computing network, comprising the routing orchestrator of claim 7, further comprising:
and the controller of the OpenFlow is used for generating an OpenFlow flow table according to the routing information sent by the routing composer from the source node to the destination node and the bandwidth of the service request.
9. The routing orchestration system of claim 8, further comprising: an optical switch node;
the OpenFlow controller is further configured to send an OpenFlow flow table to a corresponding optical switch node;
the optical switch node is used for configuring wavelength resources according to the flow table and replying a confirmation message to the OpenFlow controller;
and the edge computing node performs service interaction and data transmission with the cloud computing center node according to the configured wavelength resources.
10. The routing orchestration system of claim 9,
after finishing service interaction and data transmission, the edge computing node sends a service connection ending request to the OpenFlow controller;
the OpenFlow controller forwards the request to the routing orchestrator;
the route orchestrator transfers the route corresponding to the service connection from the working route table to the pre-route table, and updates the route bandwidth parameter to the initial bandwidth information;
and the OpenFlow controller sends a flow table instruction to the optical switch node and releases optical link resources.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910859768.7A CN110636007B (en) | 2019-09-11 | 2019-09-11 | Route arranging method, route arranger and system for edge computing network |
| PCT/CN2020/108982 WO2021047346A1 (en) | 2019-09-11 | 2020-08-13 | Route orchestration method for edge computing network, and route orchestrator and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910859768.7A CN110636007B (en) | 2019-09-11 | 2019-09-11 | Route arranging method, route arranger and system for edge computing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110636007A true CN110636007A (en) | 2019-12-31 |
| CN110636007B CN110636007B (en) | 2021-05-18 |
Family
ID=68971568
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910859768.7A Active CN110636007B (en) | 2019-09-11 | 2019-09-11 | Route arranging method, route arranger and system for edge computing network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110636007B (en) |
| WO (1) | WO2021047346A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021047346A1 (en) * | 2019-09-11 | 2021-03-18 | 北京智芯微电子科技有限公司 | Route orchestration method for edge computing network, and route orchestrator and system |
| CN113364692A (en) * | 2021-06-02 | 2021-09-07 | 烽火通信科技股份有限公司 | Route memory optimization method and route memory optimization device in biplane mode |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098772B (en) * | 2021-03-25 | 2022-11-22 | 中国联合网络通信集团有限公司 | Method and device for determining data transmission path |
| CN115426413B (en) * | 2021-05-14 | 2024-03-12 | 贵州白山云科技股份有限公司 | Edge node scheduling method, device, medium and equipment based on 5G |
| CN114567591B (en) * | 2022-03-01 | 2024-03-08 | 广东电网有限责任公司 | Power service route optimization method, device, terminal equipment and medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105471748A (en) * | 2015-12-29 | 2016-04-06 | 北京神州绿盟信息安全科技股份有限公司 | Application shunting method and device |
| CN106789707A (en) * | 2016-11-28 | 2017-05-31 | 北京邮电大学 | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device |
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
| CN109088779A (en) * | 2018-10-18 | 2018-12-25 | 国家无线电监测中心成都监测站 | Device service test method and radio testing systems |
| CN109218099A (en) * | 2018-09-20 | 2019-01-15 | 犀思云（苏州）云计算有限公司 | A kind of cloud exchange network platform based on SDN/NFV |
| US10205663B1 (en) * | 2014-12-23 | 2019-02-12 | Amazon Technologies, Inc. | Managing host computing devices |
| CN109462652A (en) * | 2018-11-21 | 2019-03-12 | 杭州电子科技大学 | Terminating gateway load allocation method in smart home system based on hash algorithm |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120226799A1 (en) * | 2011-03-03 | 2012-09-06 | Cisco Technology, Inc. | Capabilities Based Routing of Virtual Data Center Service Request |
| WO2018006079A1 (en) * | 2016-06-30 | 2018-01-04 | Parallel Wireless, Inc. | Intelligent ran flow management and distributed policy enforcement |
| US11336572B2 (en) * | 2017-05-12 | 2022-05-17 | Nicira, Inc. | Dynamic chain of service functions for processing network traffic in a virtual computing environment |
| CN110167054A (en) * | 2019-05-20 | 2019-08-23 | 天津理工大学 | A kind of QoS CR- LDP method towards the optimization of edge calculations node energy |
| CN110636007B (en) * | 2019-09-11 | 2021-05-18 | 北京智芯微电子科技有限公司 | Route arranging method, route arranger and system for edge computing network |
-
2019
- 2019-09-11 CN CN201910859768.7A patent/CN110636007B/en active Active
-
2020
- 2020-08-13 WO PCT/CN2020/108982 patent/WO2021047346A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10205663B1 (en) * | 2014-12-23 | 2019-02-12 | Amazon Technologies, Inc. | Managing host computing devices |
| CN105471748A (en) * | 2015-12-29 | 2016-04-06 | 北京神州绿盟信息安全科技股份有限公司 | Application shunting method and device |
| CN106789707A (en) * | 2016-11-28 | 2017-05-31 | 北京邮电大学 | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device |
| CN108173761A (en) * | 2017-12-22 | 2018-06-15 | 南京邮电大学 | A kind of method for optimizing resources of SDN and NFV fusions |
| CN109218099A (en) * | 2018-09-20 | 2019-01-15 | 犀思云（苏州）云计算有限公司 | A kind of cloud exchange network platform based on SDN/NFV |
| CN109088779A (en) * | 2018-10-18 | 2018-12-25 | 国家无线电监测中心成都监测站 | Device service test method and radio testing systems |
| CN109462652A (en) * | 2018-11-21 | 2019-03-12 | 杭州电子科技大学 | Terminating gateway load allocation method in smart home system based on hash algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 王伟: ""面向边缘计算的光网络业务提供技术研究"", 《中国博士学位论文全文数据库（电子期刊）》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021047346A1 (en) * | 2019-09-11 | 2021-03-18 | 北京智芯微电子科技有限公司 | Route orchestration method for edge computing network, and route orchestrator and system |
| CN113364692A (en) * | 2021-06-02 | 2021-09-07 | 烽火通信科技股份有限公司 | Route memory optimization method and route memory optimization device in biplane mode |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110636007B (en) | 2021-05-18 |
| WO2021047346A1 (en) | 2021-03-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110636007B (en) | Route arranging method, route arranger and system for edge computing network | |
| US10834004B2 (en) | Path determination method and system for delay-optimized service function chaining | |
| US10547563B2 (en) | Efficient message forwarding for distributed resource orchestration | |
| EP3090517B1 (en) | Inter-domain sdn traffic engineering | |
| EP3041172A1 (en) | Network cost optimization | |
| US10069570B2 (en) | Multi-layer modem reclamation systems and methods | |
| US20160065449A1 (en) | Bandwidth-Weighted Equal Cost Multi-Path Routing | |
| US10404576B2 (en) | Constrained shortest path determination in a network | |
| EP3682597B1 (en) | Modeling access networks as trees in software-defined network controllers | |
| CN107111517A (en) | The virtual machine of business is had a high regard for optimize distribution and/or generate for reduction | |
| CN106817306B (en) | Method and device for determining target route | |
| US9820020B2 (en) | Grooming method and device for packet optical transport network | |
| WO2022012576A1 (en) | Path planning method and apparatus, path planning device, and storage medium | |
| CN104506435A (en) | SDN (Software Defined Network) controller and method for determining shortest path in SDN | |
| CN105634974A (en) | Route determining method and apparatus in software-defined networking | |
| CN106104503B (en) | Using unified API to for forwarding server and framework program to be used for the fine granularity network optimization | |
| CN108347377A (en) | Data forwarding method and device | |
| US20150188831A1 (en) | System and Method for Traffic Engineering Using Link Buffer Status | |
| US20170171085A1 (en) | Traffic Engineering System and Method for a Communications Network | |
| CN111800352A (en) | Service function chain deployment method and storage medium based on load balancing | |
| KR101608818B1 (en) | Network system and computer program for virtual service chaining | |
| CN115361332A (en) | Processing method and device for fault-tolerant routing, processor and electronic equipment | |
| CN107995109B (en) | Routing method and routing equipment | |
| WO2022042305A1 (en) | Optical transport network route calculation method, route calculation apparatus, and storage medium | |
| US9351056B2 (en) | Planning of optical connections in a WDM optical network |
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 |