CN114978978A - Computing resource scheduling method and device, electronic equipment and medium - Google Patents

Computing resource scheduling method and device, electronic equipment and medium Download PDF

Info

Publication number
CN114978978A
CN114978978A CN202210636320.0A CN202210636320A CN114978978A CN 114978978 A CN114978978 A CN 114978978A CN 202210636320 A CN202210636320 A CN 202210636320A CN 114978978 A CN114978978 A CN 114978978A
Authority
CN
China
Prior art keywords
bgp vpn
routing information
bgp
service
forwarding path
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.)
Pending
Application number
CN202210636320.0A
Other languages
Chinese (zh)
Inventor
吴楠
聂世忠
李云鹤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202210636320.0A priority Critical patent/CN114978978A/en
Publication of CN114978978A publication Critical patent/CN114978978A/en
Pending legal-status Critical Current

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/54—Organization of routing tables
    • 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/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • 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/26—Route discovery packet

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The method comprises the steps that first PE equipment receives first BGP VPN routing information sent by second PE equipment which has BGP VPN neighbor relation with the first PE equipment in an MPLS L3VPN network, and the first BGP VPN routing information comprises computing resources of a first service node connected with the second PE equipment. And generating a routing table entry according to the first BGP VPN routing information, and adding the generated routing table entry to the routing table. When a service message is received, multiple forwarding paths of the service message in the MPLS L3VPN network are determined based on the routing table, an entry mark forwarding path is selected from the multiple forwarding paths based on the calculation resources corresponding to each forwarding path, and the service message is forwarded through the target forwarding path. And reasonable scheduling can be performed on the calculation resources.

Description

Computing resource scheduling method and device, electronic equipment and medium
Technical Field
The present disclosure relates to the field of network communication technologies, and in particular, to a method, an apparatus, an electronic device, and a medium for computing resource scheduling.
Background
A Multi Protocol Label Switching (MPLS) three-Layer Virtual Private Network (L3 VPN) is an L3VPN technology based on a Provider Edge (PE) device, which uses a Border Gateway Protocol (BGP) to publish a VPN route on a Provider backbone Network and uses an MPLS Protocol to forward a VPN packet on the Provider backbone Network.
At present, when a PE device in an MPLS L3VPN network receives a service packet, a forwarding path may be selected for the service packet based on the learned routing information and the destination address of the service packet, so that the service packet is forwarded through the selected forwarding path. In the case where there are multiple forwarding paths to the destination address, one forwarding path may be selected based on a policy such as load balancing.
However, the actually selected forwarding paths may have insufficient computational resources, and the unselected forwarding paths may have sufficient computational resources, so that the computational resources of the MPLS L3VPN network are not reasonably scheduled, and the processing efficiency of the service packet is low.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a method, an apparatus, an electronic device, and a medium for scheduling computational power resources of an MPLS L3VPN network, so as to reasonably schedule computational power resources and improve processing efficiency of service packets. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present disclosure provides a computing resource scheduling method, where the method is applied to a first service provider network edge PE device in a multi-protocol label switching three-layer virtual private network MPLS L3VPN network, and the method includes:
receiving first BGP VPN routing information sent by a second PE device which has a border gateway protocol virtual private network (BGP VPN) neighbor relation with the second PE device in the MPLS L3VPN network, wherein the first BGP VPN routing information comprises computing resources of a first service node connected with the second PE device;
generating a routing table entry according to the first BGP VPN routing information, and adding the generated routing table entry to a routing table;
when a service message is received, determining a plurality of forwarding paths of the service message in the MPLS L3VPN network based on the routing table;
selecting an entry mark forwarding path from the multiple forwarding paths based on the computational power resource corresponding to each forwarding path;
and forwarding the service message through the target forwarding path.
In one possible implementation, the method further includes:
and when a second service node connected with the first PE device is on-line, sending second BGP VPN routing information to the second PE device, wherein the second BGP VPN routing information comprises computing resources of the second service node.
In one possible implementation, the second BGP VPN routing information includes a multi-protocol network layer reachability information MP _ REACH _ NLRI attribute field, and the MP _ REACH _ NLRI attribute field includes computing resources of the second service node.
In one possible implementation, after sending the second BGP VPN routing information to the second PE device, the method further includes:
when the second service node connected with the first PE device is offline, sending a BGP VPN route revocation message to the second PE device, wherein the BGP VPN route revocation message comprises computing resources of the second service node, so that the second PE device deletes a routing table entry generated based on the second BGP VPN route information.
In a possible implementation manner, the selecting an entry label forwarding path from the multiple forwarding paths based on the computational power resource corresponding to each forwarding path includes:
and selecting a target forwarding path with the most calculation force resources from the plurality of forwarding paths based on the calculation force resources corresponding to each forwarding path.
In a second aspect, an embodiment of the present disclosure provides a computing resource scheduling apparatus, where the apparatus is applied to a first service provider network edge PE device in a multi-protocol label switching three-layer virtual private network MPLS L3VPN network, and the apparatus includes:
a receiving module, configured to receive first BGP VPN routing information sent by a second PE device in the MPLS L3VPN network and having a border gateway protocol virtual private network BGP VPN neighbor relationship with itself, where the first BGP VPN routing information includes computational resources of a first service node connected to the second PE device;
a generating module, configured to generate a routing table entry according to the first BGP VPN routing information, and add the generated routing table entry to a routing table;
a determining module, configured to determine, when a service packet is received, multiple forwarding paths of the service packet in the MPLS L3VPN network based on the routing table;
the selection module is used for selecting an entry mark forwarding path from the multiple forwarding paths based on the calculation force resource corresponding to each forwarding path;
and the forwarding module is used for forwarding the service message through the target forwarding path.
In one possible implementation, the apparatus further includes:
a sending module, configured to send, to a second PE device, second BGP VPN routing information when a second service node connected to the first PE device comes online, where the second BGP VPN routing information includes computational power resources of the second service node.
In one possible implementation, the second BGP VPN routing information includes a multi-protocol network layer reachability information MP _ REACH _ NLRI attribute field, and the MP _ REACH _ NLRI attribute field includes computing resources of the second service node.
In a possible implementation manner, the sending module is further configured to send, when the second service node connected to the first PE device goes offline, a BGP VPN route revocation message to the second PE device, where the BGP VPN route revocation message includes computing resources of the second service node, so that the second PE device deletes a routing entry generated based on the second BGP VPN route information.
In a possible implementation manner, the selecting module is specifically configured to select, based on the computation resource corresponding to each forwarding path, a target forwarding path with the highest computation resource from the multiple forwarding paths.
In a third aspect, an embodiment of the present disclosure further provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete mutual communication through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing any one of the steps of the computational resource scheduling method when executing the program stored in the memory.
In a fourth aspect, the disclosed embodiments further provide a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements the computational resource scheduling method described in the first aspect.
In a fifth aspect, embodiments of the present disclosure further provide a computer program product containing instructions, which when run on a computer, cause the computer to perform the computational resource scheduling method described in the first aspect.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other embodiments can be obtained by those skilled in the art according to the drawings.
Fig. 1 is a flowchart of a computing resource scheduling method according to an embodiment of the present disclosure;
fig. 2 is an exemplary diagram of an extended MP _ REACH _ NLRI field provided by an embodiment of the present disclosure;
fig. 3 is an exemplary schematic diagram of BGP VPN routing information transfer in an MPLS L3VPN network according to an embodiment of the present disclosure;
fig. 4 is an exemplary schematic diagram of a forwarding path selection method provided in the embodiment of the present disclosure;
FIG. 5 is an exemplary interaction flow diagram of a computing resource scheduling method provided by an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of a computing resource scheduling apparatus according to an embodiment of the present disclosure;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments that can be derived from the disclosure by one of ordinary skill in the art based on the embodiments in the disclosure are intended to be within the scope of the disclosure.
The embodiment of the present disclosure provides a computing resource scheduling method, which is applied to a first PE device in an MPLS L3VPN network, and as shown in fig. 1, the method includes:
s101, receiving first BGP VPN routing information sent by a second PE device which has a Border Gateway Protocol (BGP) VPN neighbor relation with the first PE device in the MPLS L3VPN network.
The first BGP VPN routing information comprises computing resources of a first service node connected with the second PE device.
The computing resources may include at least one of Central Processing Unit (CPU) computing power, Graphics Processing Unit (GPU) computing power, Data Processing Unit (DUP) computing power, and memory information, and may also include other types of computing resources, which is not limited in this disclosure.
Because the first PE device and the second PE device have established a BGP VPN neighbor relationship, the first PE device and the second PE device may perform a route advertisement with respect to each other, and when a first service node is online in the second PE device, the second PE device may notify the first PE device of a computational power resource of the first service node through the first BGP VPN route information.
In addition, after the second PE device learns the BGP VPN routing information advertised by the other PE devices, if the learned BGP VPN routing information belongs to the same VPN as the first PE device, the second PE device also advertises the BGP VPN routing information learned by itself to the first PE device.
In the embodiment of the present disclosure, there may be a plurality of PE devices in the MPLS L3VPN network that have a BGP VPN neighbor relationship with the first PE device, and after receiving the first BGP VPN routing information, the first PE device may further send the first BGP VPN routing information to other PE devices that have a BGP VPN neighbor relationship with the first PE device.
The first PE device may receive a Border Gateway Protocol update (BGP update) message sent by the second PE device, where the BGP update message carries first BGP VPN routing information.
S102, generating a routing table entry according to the first BGP VPN routing information, and adding the generated routing table entry to the routing table.
The first PE device may store the generated routing table entry in a routing table of the VPN instance, and since the first BGP VPN routing information includes computational resources, the routing table entry generated based on the first BGP VPN routing information also includes computational resources.
S103, when the service message is received, determining a plurality of forwarding paths of the service message in the MPLS L3VPN network based on the routing table.
Optionally, after receiving the service packet, the first PE device may select, based on a destination address of the service packet, multiple forwarding paths that can reach the destination address.
And S104, selecting an entry mark forwarding path from the multiple forwarding paths based on the calculation force resource corresponding to each forwarding path.
And S105, forwarding the service message through the target forwarding path.
By adopting the embodiment of the disclosure, the first PE device may generate the routing table entry according to the received first BGP VPN routing information, and store the routing table entry into the routing table, where the generated routing table entry also includes the computing resource because the first BGP VPN routing information includes the computing resource. And when the first PE equipment receives the service message, a plurality of forwarding paths can be determined according to the routing table, and a target forwarding path is determined according to the computational power resource corresponding to each forwarding path, and the computational power resource in the MPLS L3VPN network can be reasonably scheduled due to the fact that the computational power resource is referred to in the process of selecting the target forwarding path, so that the situation that a forwarding path with low computational power resource is selected for the service message is avoided, and the processing efficiency of the service message is improved.
In addition, in the computational power network in the related art, a controller is usually used to uniformly manage each node in the computational power network, that is, each node reports computational power resources to the controller, and the controller performs uniform computational power resource scheduling. In a large MPLS L3VPN network, information synchronization and scheduling are required to be automatically carried out among PE equipment based on network information, and a centralized management mode of a controller cannot support the information and synchronization among the PE equipment, so that the traditional computational resource scheduling method cannot be applied to the MPLS L3VPN network. In the embodiment of the disclosure, the computational power resource is carried in the BGP VPN routing information, so that the PE device can select a forwarding path for the service packet based on the computational power resource, thereby implementing computational power resource scheduling for the MPLS L3VPN network.
In some embodiments, the S104, selecting an entry label forwarding path from the multiple forwarding paths based on the computation resource corresponding to each forwarding path, may be implemented as:
and selecting a target forwarding path with the most calculation force resources from the multiple forwarding paths based on the calculation force resources corresponding to each forwarding path.
After the first PE device determines multiple forwarding paths matching the destination address of the service packet according to the routing table, the first PE device may select a target forwarding path with the most computation resources from the multiple forwarding paths based on the computation resources stored in the routing table.
In this embodiment of the present disclosure, the target forwarding path with the most computation resources may be selected according to actual needs, for example, when the service packet received by the first PE device needs a larger CPU computation resource to process, at this time, the CPU computation resources in the computation resources corresponding to the multiple forwarding paths may be compared, and the forwarding path with the most CPU computation resource may be selected from the multiple forwarding paths as the target forwarding path.
For another example, when the service packet received by the first PE device needs a larger GPU computational power resource for processing, the GPU computational power resource in the computational power resources corresponding to the multiple forwarding paths may be compared at this time, and the forwarding path with the largest GPU computational power resource is selected from the multiple forwarding paths as the target forwarding path.
By adopting the embodiment of the disclosure, the computational power resources of the plurality of forwarding paths are compared, and the forwarding path with the most computational power resources is taken as the target forwarding path, so that the service message can be processed by the service node with the most computational power resources corresponding to the plurality of forwarding paths, the processing efficiency of the service message is improved, and the computational power resources can be reasonably distributed.
In some embodiments, the first PE device may further perform path selection based on a preset path selection rule, and if two or more equivalent forwarding paths are selected, select a path with the most computational resources from the equivalent forwarding paths as the target path. The preset path selection rule may be any BGP routing rule in the related art, for example, a longest mask matching rule or a shortest path length rule.
By adopting the method, the target forwarding path suitable for the service message can be selected by combining the computing power resource and other preset path selection rules, and the service quality can be improved.
In another embodiment of the present disclosure, the first PE device may also be connected to a service node, and when a second service node connected to the first PE device is online, the first PE device may send second BGP VPN routing information to the second PE device, where the second BGP VPN routing information includes computational power resources of the second service node. Namely, when routing information is announced between PE devices which are neighbors of BGP VPN, the PE devices can carry computing resources of self-connected service nodes, so that each PE device can select paths based on the computing resources, and reasonable scheduling of the computing resources is realized.
The first PE device may send a BGP update message to the second PE device, where the BGP update message includes second BGP VPN routing information.
Correspondingly, when a second service node connected to the first PE device goes offline, a BGP VPN route withdrawal message may be sent to the second PE device, where the BGP VPN route withdrawal message includes computational resources of the second service node, so that the second PE device deletes a routing entry generated based on the second BGP VPN route information.
In the second service node connected to the first PE device, there may be a case where the service node is unavailable or the computational power of the service node is transferred to another service node, and at this time, the second service node cannot provide a corresponding service, that is, the second service node goes offline.
The BGP VPN route revocation message may be a BGP update message, and the first PE device may carry the second BGP VPN route information in the BGP update message, and then send the BGP update message to the second PE device.
By adopting the embodiment of the disclosure, when the second service node is offline, the second PE device can delete the routing table entry generated by the second BGP VPN routing information in the routing table in time by sending the BGP VPN route revocation message, thereby preventing the second PE device from erroneously sending the service packet of the client to the offline second service node, and improving the forwarding accuracy of the service packet.
In another embodiment of the present disclosure, the second BGP VPN routing information includes a Multiprotocol Reachable (MP _ REACH _ NLRI) attribute field, and the MP _ REACH _ NLRI attribute field includes a computation resource of the second service node.
In the embodiment of the present disclosure, a multi-protocol border gateway protocol (MP-BGP) may be specifically used to transmit BGP VPN routing information, that is, the first BGP VPN routing information and the second BGP VPN routing information may both be transmitted through MP-BGP. Specifically, an MP _ REACH _ NLRI field included in MP-BGP may be extended, and the extended MP _ REACH _ NLRI field carries computational power resource information.
The MP-BGP attribute is a group of fields for describing BGP prefix characteristic attribute, and the common attribute in the MP-BGP attribute comprises the following steps:
ORIGIN (ORIGIN);
AS _ PATH (AS PATH);
NEXT _ HOP;
MULTI _ EXIT _ DISC (MULTI-EXIT discrimination);
LOCAL _ PREF (LOCAL priority);
ATOMIC _ AGGREGATE (ATOMIC polymerization);
AGGREGATOR (AGGREGATOR);
COMMUNITY (COMMUNITY);
ORIGINATOR _ ID (ORIGINATOR identification);
CLUSTER _ LIST (Cluster List);
MP _ REACH _ NLRI (Multiprotocol readable NLRI, Multiprotocol network layer reachability information)
MP _ unread _ NLRI (Multiprotocol unaachable NLRI, Multiprotocol network layer unreachability information).
The format of the MP _ REACH _ NLRI field is shown in fig. 2, the left part in fig. 2 is a field originally included in the MP _ REACH _ NLRI field, and the right part in fig. 2 is a field content of the custom extension in the embodiment of the present disclosure, and is used for carrying computing resource information.
The MP _ REACH _ NLRI field specifically includes: address Family Identifier, Subsequent Address Family Identifier, Length of Next Hop Network Address, Network Address of Next Hop Network Address, Reserved, and Network Layer availability Information (hereinafter abbreviated NLRI).
Wherein, the NLRI field includes: prefix Length, Label Stack, Route Distinguisher, NLRI IP Prefix. In addition, the computational power resource field is also extended in the NLRI in the embodiment of the present disclosure, that is, the NLRI field further includes a CPU-resource (CPU resource) field, a GPU-resource (GPU resource) field, a DPU-resource (DPU resource) field, and a Memory-resource (Memory resource) field. The CPU resource field is used for bearing CPU computing power resources, the GPU resource field is used for bearing GPU computing power resources, the DPU resource field is used for bearing DPU computing power resources, and the memory resource field is used for bearing memory resources.
It should be noted that the content of the extended computation resource field in the embodiment of the present disclosure may be set according to actual needs, and only the computation resource fields such as CPU resources, GPU resources, DPU resources, and memory resources are extended in the NLRI field in fig. 2 as an example for description, and in actual application, the NLRI field may be extended based on the computation resources that need to be scheduled actually, so that the NLRI field carries the computation resources that need to be scheduled.
By adopting the embodiment of the disclosure, the MP _ REACH _ NLRI field is expanded, and further, the first PE device can carry the computing power resource in the process of notifying BGP VPN routing information to the second PE device, so that a message for sending the computing power resource is not required to be additionally created, and the message structure is not required to be changed, so that the computing power information is transmitted in an MPLS tunnel between the PEs under the condition that an intermediate link between the two PEs is not sensed, the end-to-end transmission of the computing power resource is realized, the intermediate link is not required to identify and process the computing power resource, and the network resource is saved.
Fig. 3 is a schematic diagram of an exemplary BGP VPN routing information transfer in an MPLS L3VPN network according to the embodiment of the present disclosure, and fig. 3 only illustrates that an MPLS network includes four PE devices, PE1, PE2, PE3, and PE4, and adjacent PE devices have established a BGP VPN neighbor relationship and belong to the same VPN.
Each PE device has a computing power resource pool, which is exemplarily shown in fig. 3 for PE1, PE2, and PE3, and the computing power resources of the service nodes on the PE device constitute the computing power resource pool of the PE device.
And each PE device may maintain a calculation power resource table and a calculation power resource routing table for the calculation power resources of the service node to which it is connected, and for the calculation power resources learned from other PE devices.
Specifically, taking PE1 as an example, if PE1 has service node 1 online, PE1 may add the computing power resource of service node 1 to the computing power resource table, and store the routing information including the computing power resource of the service node in the computing power resource routing table. And PE1 may send BGP VPN routing information to PE2 and PE4, where the BGP VPN routing information includes computational power resources of service node 1, and further PE2 and PE4 may generate a routing table entry according to the BGP VPN routing information, and add the generated routing table entry to a computational power resource routing table maintained by themselves.
Each PE device may send BGP VPN routing information that is generated and received by each PE device to an adjacent PE device. For example, PE3 may send, to PE4, BGP VPN routing information and its own BGP VPN routing information received from PE2, and in the foregoing process, each PE node may generate a routing table entry according to the received BGP VPN routing information and store the routing table entry in the computation resource routing table.
Furthermore, when each PE device receives a service packet, a forwarding path may be selected for the service packet based on a computational resource routing table maintained by the PE device, as shown in fig. 4, fig. 4 is an exemplary schematic diagram of a forwarding path selection method provided in this disclosure. Fig. 4 only illustrates three PE devices including PE1, PE2, and PE3 as an example, where the service nodes connected by PE1 and PE2 are all service nodes of service a, PE3 is connected to a client, and when the client sends a service packet requesting access to service a to PE3, PE3 determines two forwarding paths to service a according to the computation resource routing table, and selects a forwarding path with more computation resources from the two forwarding paths based on the computation resources as a target forwarding path. Therefore, routing and message forwarding are performed based on the calculation resources, the calculation resources of the MPLS L3VPN network are fully utilized, the shortage of the calculation resources of the forwarding path selected for the service message can be avoided, and the processing efficiency of the service message can be improved.
As shown in fig. 5, fig. 5 is an exemplary interaction flowchart of a computing resource scheduling method provided in the embodiment of the present disclosure, which is described by taking PE1 and PE2 as an example, and includes the following steps:
s501, PE1 and PE2 establish a BGP VPN neighbor relation.
And S502, reporting the computing power resource by the service node.
When the service node comes online, the service node may report its own computing resources to PE 1.
S503, the client is online.
The embodiment of the present disclosure does not limit the execution sequence among the above S501, S502, and S503, and may execute the above steps in sequence or in parallel.
S504 and PE1 generate a calculation power route according to the received calculation power resource and transmit the calculation power route to PE 2.
The computational route is the first BGP VPN routing information in the above embodiment.
S505, PE2 generates VPN route according to IP address of client, and transmits VPN route to PE 1.
The embodiment of the present disclosure does not limit the execution sequence between S504 and S505, and may be executed according to a sequential order or in parallel.
S506, PE2 accesses the service node according to the computational power route.
When the PE2 receives a service packet from a client, a target forwarding path may be determined according to a destination address in the service packet and the size of a computation resource corresponding to each computation route, where the target forwarding path is a path of PE2-PE 1-service node in fig. 5 as an example.
And S507, the service node is offline, and the computational power routing is cancelled.
When a service node connected by PE1 is unavailable or computationally migratory, PE1 may send a computationally efficient route withdrawal message to the PE2 device to withdraw computationally efficient route.
By adopting the embodiment of the disclosure, the BGP VPN neighbor relation between the PE1 and the PE2 is established, and then the calculation power route is announced through the BGP VPN neighbor relation, when the PE2 selects the forwarding path, the calculation power resource corresponding to the calculation power route is used as one of the bases for determining the target forwarding path, so that the calculation power resource of the determined target forwarding path is sufficient, and the rational utilization of the calculation power resource is realized.
Corresponding to the foregoing method embodiment, an embodiment of the present disclosure further provides a computing resource scheduling apparatus, where the apparatus is applied to a first service provider network edge PE device in an MPLS L3VPN network of a three-layer virtual private network based on multiprotocol label switching, as shown in fig. 6, and the apparatus includes:
a receiving module 601, configured to receive first BGP VPN routing information sent by a second PE device in an MPLS L3VPN network and having a border gateway protocol virtual private network BGP VPN neighbor relationship with itself, where the first BGP VPN routing information includes computational resources of a first service node connected to the second PE device;
a generating module 602, configured to generate a routing table entry according to the first BGP VPN routing information, and add the generated routing table entry to the routing table;
a determining module 603, configured to determine, when a service packet is received, multiple forwarding paths of the service packet in the MPLS L3VPN network based on the routing table;
a selecting module 604, configured to select an entry label forwarding path from the multiple forwarding paths based on the computation resource corresponding to each forwarding path;
a forwarding module 605, configured to forward the service packet through the target forwarding path.
Optionally, the apparatus further comprises:
and the sending module is used for sending second BGP VPN routing information to the second PE equipment when a second service node connected with the first PE equipment is online, wherein the second BGP VPN routing information comprises computing resources of the second service node.
Optionally, the second BGP VPN routing information includes a multi-protocol network layer reachability information MP _ REACH _ NLRI attribute field, and the MP _ REACH _ NLRI attribute field includes computational resources of the second service node.
Optionally, the sending module is further configured to send, when a second service node connected to the first PE device goes offline, a BGP VPN route revocation message to the second PE device, where the BGP VPN route revocation message includes computational resources of the second service node, so that the second PE device deletes a routing entry generated based on the second BGP VPN route information.
Optionally, the selecting module 604 is specifically configured to select, based on the computation resource corresponding to each forwarding path, a target forwarding path with the most computation resources from the multiple forwarding paths.
The disclosed embodiment also provides an electronic device, as shown in fig. 7, including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, where the processor 701, the communication interface 702, and the memory 703 complete mutual communication through the communication bus 704,
a memory 703 for storing a computer program;
the processor 701 is configured to implement the method steps in the above-described method embodiments when executing the program stored in the memory 703.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In yet another embodiment provided by the present disclosure, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the above computational resource scheduling methods.
In yet another embodiment provided by the present disclosure, there is also provided a computer program product containing instructions that, when run on a computer, cause the computer to perform any of the computational resource scheduling methods of the above embodiments.
In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions described in accordance with the embodiments of the disclosure are, in whole or in part, generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present disclosure, and is not intended to limit the scope of the present disclosure. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure are included in the scope of protection of the present disclosure.

Claims (12)

1. A computing resource scheduling method applied to a first service provider network edge (PE) device in a multi-protocol label switching three-layer virtual private network (MPLS L3VPN) network, the method comprising:
receiving first BGP VPN routing information sent by a second PE device which has a border gateway protocol virtual private network (BGP VPN) neighbor relation with the second PE device in the MPLS L3VPN network, wherein the first BGP VPN routing information comprises computing resources of a first service node connected with the second PE device;
generating a routing table entry according to the first BGP VPN routing information, and adding the generated routing table entry to a routing table;
when a service message is received, determining a plurality of forwarding paths of the service message in the MPLS L3VPN network based on the routing table;
selecting an entry mark forwarding path from the multiple forwarding paths based on the computational power resource corresponding to each forwarding path;
and forwarding the service message through the target forwarding path.
2. The method of claim 1, further comprising:
and when a second service node connected with the first PE device is on-line, sending second BGP VPN routing information to the second PE device, wherein the second BGP VPN routing information comprises computing resources of the second service node.
3. The method of claim 2, wherein the second BGP VPN routing information comprises a multiprotocol network layer reachability information MP REACH NLRI attribute field, the MP REACH NLRI attribute field comprising computational resources of the second serving node.
4. The method of claim 2 or 3, wherein after sending the second BGP VPN routing information to the second PE device, the method further comprises:
and when the second service node connected with the first PE device is offline, sending a BGP VPN route canceling message to the second PE device, wherein the BGP VPN route canceling message comprises computing resources of the second service node, so that the second PE device deletes a routing table entry generated based on the second BGP VPN route information.
5. The method of claim 1, wherein selecting an entry label forwarding path from the plurality of forwarding paths based on the computation power resource corresponding to each forwarding path comprises:
and selecting a target forwarding path with the most calculation force resources from the plurality of forwarding paths based on the calculation force resources corresponding to each forwarding path.
6. A computational resource scheduling apparatus applied to a first service provider network edge PE device in a multi-protocol label switching three-layer virtual private network MPLS L3VPN network, the apparatus comprising:
a receiving module, configured to receive first BGP VPN routing information sent by a second PE device in the MPLS L3VPN network and having a border gateway protocol virtual private network BGP VPN neighbor relationship with itself, where the first BGP VPN routing information includes computational resources of a first service node connected to the second PE device;
a generating module, configured to generate a routing table entry according to the first BGP VPN routing information, and add the generated routing table entry to a routing table;
a determining module, configured to determine, when a service packet is received, multiple forwarding paths of the service packet in the MPLS L3VPN network based on the routing table;
the selection module is used for selecting an entry mark forwarding path from the multiple forwarding paths based on the calculation force resource corresponding to each forwarding path;
and the forwarding module is used for forwarding the service message through the target forwarding path.
7. The apparatus of claim 6, further comprising:
a sending module, configured to send, to a second PE device, second BGP VPN routing information when a second service node connected to the first PE device comes online, where the second BGP VPN routing information includes computational power resources of the second service node.
8. The apparatus of claim 7, wherein the second BGP VPN routing information comprises a multiprotocol network layer reachability information (MP _ REACH _ NLRI) attribute field, the MP _ REACH _ NLRI attribute field comprising computational resources of the second serving node.
9. The apparatus according to claim 7 or 8,
the sending module is further configured to send, when the second service node connected to the first PE device goes offline, a BGP VPN route revocation message to the second PE device, where the BGP VPN route revocation message includes computing resources of the second service node, so that the second PE device deletes a routing entry generated based on the second BGP VPN route information.
10. The apparatus of claim 6,
the selection module is specifically configured to select, based on the computational power resource corresponding to each forwarding path, a target forwarding path with the most computational power resources from the multiple forwarding paths.
11. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any one of claims 1 to 5 when executing a program stored in the memory.
12. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 1-5.
CN202210636320.0A 2022-06-07 2022-06-07 Computing resource scheduling method and device, electronic equipment and medium Pending CN114978978A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210636320.0A CN114978978A (en) 2022-06-07 2022-06-07 Computing resource scheduling method and device, electronic equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210636320.0A CN114978978A (en) 2022-06-07 2022-06-07 Computing resource scheduling method and device, electronic equipment and medium

Publications (1)

Publication Number Publication Date
CN114978978A true CN114978978A (en) 2022-08-30

Family

ID=82959433

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210636320.0A Pending CN114978978A (en) 2022-06-07 2022-06-07 Computing resource scheduling method and device, electronic equipment and medium

Country Status (1)

Country Link
CN (1) CN114978978A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115412482A (en) * 2022-11-01 2022-11-29 北京邮电大学 Calculation force routing method and device, electronic equipment and storage medium
CN115550456A (en) * 2022-09-13 2022-12-30 中国联合网络通信集团有限公司 Service scheduling method and device
CN115914402A (en) * 2022-11-09 2023-04-04 中国联合网络通信集团有限公司 Method, device and equipment for determining calculation resource node and storage medium
CN116208625A (en) * 2023-05-06 2023-06-02 浪潮通信技术有限公司 Information synchronization method, device, electronic equipment and computer readable storage medium
CN116346938A (en) * 2023-05-25 2023-06-27 新华三技术有限公司 Calculation power access method and device, electronic equipment and storage medium
WO2024098731A1 (en) * 2022-11-09 2024-05-16 中兴通讯股份有限公司 Computing power resource announcement method, computing power traffic processing method, communication device, and medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491716A (en) * 2019-09-12 2021-03-12 华为技术有限公司 Calculation force routing method and device
CN113079218A (en) * 2021-04-09 2021-07-06 网络通信与安全紫金山实验室 Service-oriented computing power network system, working method and storage medium
WO2022037363A1 (en) * 2020-08-17 2022-02-24 华为技术有限公司 Computing bearer application method and apparatus
CN114095579A (en) * 2020-08-04 2022-02-25 中国移动通信有限公司研究院 Computing power processing network system, service processing method and equipment
CN114285858A (en) * 2021-12-14 2022-04-05 中国联合网络通信集团有限公司 Computing power sensing method and device and storage medium
CN114531395A (en) * 2020-11-23 2022-05-24 华为技术有限公司 Method, equipment and system for notifying processing capability of network equipment

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491716A (en) * 2019-09-12 2021-03-12 华为技术有限公司 Calculation force routing method and device
CN114095579A (en) * 2020-08-04 2022-02-25 中国移动通信有限公司研究院 Computing power processing network system, service processing method and equipment
WO2022037363A1 (en) * 2020-08-17 2022-02-24 华为技术有限公司 Computing bearer application method and apparatus
CN114531395A (en) * 2020-11-23 2022-05-24 华为技术有限公司 Method, equipment and system for notifying processing capability of network equipment
CN113079218A (en) * 2021-04-09 2021-07-06 网络通信与安全紫金山实验室 Service-oriented computing power network system, working method and storage medium
CN114285858A (en) * 2021-12-14 2022-04-05 中国联合网络通信集团有限公司 Computing power sensing method and device and storage medium

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115550456A (en) * 2022-09-13 2022-12-30 中国联合网络通信集团有限公司 Service scheduling method and device
CN115412482A (en) * 2022-11-01 2022-11-29 北京邮电大学 Calculation force routing method and device, electronic equipment and storage medium
CN115914402A (en) * 2022-11-09 2023-04-04 中国联合网络通信集团有限公司 Method, device and equipment for determining calculation resource node and storage medium
CN115914402B (en) * 2022-11-09 2024-03-19 中国联合网络通信集团有限公司 Method, device, equipment and storage medium for determining computing power resource node
WO2024098731A1 (en) * 2022-11-09 2024-05-16 中兴通讯股份有限公司 Computing power resource announcement method, computing power traffic processing method, communication device, and medium
CN116208625A (en) * 2023-05-06 2023-06-02 浪潮通信技术有限公司 Information synchronization method, device, electronic equipment and computer readable storage medium
CN116346938A (en) * 2023-05-25 2023-06-27 新华三技术有限公司 Calculation power access method and device, electronic equipment and storage medium
CN116346938B (en) * 2023-05-25 2023-08-18 新华三技术有限公司 Calculation power access method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
CN114978978A (en) Computing resource scheduling method and device, electronic equipment and medium
WO2020001393A1 (en) Method and network node for sending network performance parameter and calculating network performance
WO2021169258A1 (en) Message forwarding method, routing information publishing method, apparatus and system
CN106713137B (en) VPN method, device and system based on segmented routing and SDN technology
US20220272032A1 (en) Malleable routing for data packets
US8009591B2 (en) Automatic overlapping areas that flood routing information
WO2020135395A1 (en) Notification method and device for prefix identifier of cross-interior gateway protocol
US20070183334A1 (en) Techniques for decreasing queries to discover routes in an interior gateway protocol
US10237164B2 (en) Inter-provider network architecture
CN112868214B (en) Coordinated load transfer OAM records within packets
US9832121B1 (en) Next hop instruction associations for forwarding unit programming within a network device
US10904130B2 (en) Method for scalable computer network partitioning
WO2021143279A1 (en) Method and device for segment routing service processing, routing equipment, and storage medium
US11811648B2 (en) Distributed sub-controller permission for control of data-traffic flow within software-defined networking (SDN) mesh network
WO2022042505A1 (en) Methods and devices for forwarding messages and issuing forwarding instruction information and notification messages
US11431619B2 (en) Hierarchical ECMP control plane for dense topologies
US20190334814A1 (en) Path establishment method and device, and network node
CN109831378B (en) Message timeout response method and device
JP2006270781A (en) Resource management apparatus, resource management system and method
JP4408756B2 (en) Route calculation system
WO2022089169A1 (en) Method and apparatus for sending computing routing information, device, and storage medium
CN113872843B (en) Route generation method, route processing method and device
WO2021169297A1 (en) Method, device and system for transmitting node identity
US9544225B2 (en) Method for end point identification in computer networks
CN116530067A (en) Edge computing data and service discovery using interior gateway protocol (interior gateway protocol, IGP)

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