WO2022083422A1 - Procédé et dispositif de soumission de trajets croisés de sr/srv6, support de stockage et dispositif électronique - Google Patents

Procédé et dispositif de soumission de trajets croisés de sr/srv6, support de stockage et dispositif électronique Download PDF

Info

Publication number
WO2022083422A1
WO2022083422A1 PCT/CN2021/121003 CN2021121003W WO2022083422A1 WO 2022083422 A1 WO2022083422 A1 WO 2022083422A1 CN 2021121003 W CN2021121003 W CN 2021121003W WO 2022083422 A1 WO2022083422 A1 WO 2022083422A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
cross
srv6
path calculation
calculation unit
Prior art date
Application number
PCT/CN2021/121003
Other languages
English (en)
Chinese (zh)
Inventor
陈然
温建中
朱春
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2022083422A1 publication Critical patent/WO2022083422A1/fr

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/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/16—Threshold monitoring
    • 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/302—Route determination based on requested QoS
    • 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/70—Routing based on monitoring results
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues

Definitions

  • the embodiments of the present disclosure relate to the field of communications, and in particular, to a method and device for delivering a cross-SR/SRv6 path, a storage medium, and an electronic device.
  • FlexE Flexible Ethernet
  • ASON ASON network
  • MTN Channel forwarding path proposed in G.mtn.
  • the class forwarding path is also implemented in a crossover manner.
  • the MTN network usually only needs to deploy the IGP protocol to create the SR tunnel path, and no label distribution protocol will be deployed. Therefore, a more concise and efficient way to implement the MTN Channel is needed. Creation of such cross paths.
  • the cross-connection needs to know the ingress port and ingress, it cannot deliver only the Adj-SID representation of the node's egress interface as the existing southbound interface delivers the SR-TE/TP path, so that the next hop node cannot obtain the ingress port. information, there is no way to realize the opening of the business.
  • Embodiments of the present disclosure provide a cross-SR/SRv6 path delivery method and device, a storage medium, and an electronic device to at least solve the problem in the related art that services cannot be opened due to not knowing the outgoing interface and incoming interface of a node.
  • a method for delivering a cross-SR/SRv6 path including: a path calculation unit negotiates with a path calculation client about the capability of supporting a cross-SR/SRv6 path; the path calculation unit calculates the cross-SR/SRv6 path. SRv6 path; the above-mentioned path calculation unit delivers the above-mentioned cross-SR/SRv6 path to the above-mentioned path calculation client.
  • an apparatus for delivering a cross-SR/SRv6 path including: a negotiation module, configured to negotiate with a path calculation client for the capability of supporting a cross-SR/SRv6 path; a calculation module, configured to calculate The above-mentioned cross-SR/SRv6 path; the delivery module is configured to deliver the above-mentioned cross-SR/SRv6 path to the above-mentioned path calculation client.
  • a computer-readable storage medium is also provided, where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute any one of the above method embodiments when running steps in .
  • an electronic device including a memory and a processor, the memory stores a computer program, and the processor is configured to run the computer program to execute any of the above method embodiments steps in .
  • FIG. 1 is a hardware structure diagram of a method for delivering a cross-SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 3 is a network topology diagram of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 4 is a flowchart of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram of the format of an extended cross-SR ERO of a cross-SR/SRv6 path delivery method according to an embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of the format of an extended cross-SRV6 ERO of a cross-SR/SRv6 path delivery method according to an embodiment of the present disclosure
  • FIG. 7 is a schematic diagram of delivery content of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 8 is a flowchart of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 9 is a flowchart of a method for delivering a cross-SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 10 is a flowchart of a method for delivering a cross-SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 11 is a flowchart of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure
  • FIG. 12 is a structural block diagram of an apparatus for delivering a cross-SR/SRv6 path according to an embodiment of the present disclosure.
  • FIG. 1 is a hardware structural block diagram of a mobile terminal according to a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure.
  • the mobile terminal may include one or more (only one is shown in FIG.
  • processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 configured to store data, wherein the above-mentioned mobile terminal may further include a transmission device 106 and an input/output device 108 configured as a communication function.
  • a processing device such as a microprocessor MCU or a programmable logic device FPGA
  • a memory 104 configured to store data
  • the above-mentioned mobile terminal may further include a transmission device 106 and an input/output device 108 configured as a communication function.
  • FIG. 1 is only a schematic diagram, which does not limit the structure of the above-mentioned mobile terminal.
  • the mobile terminal may also include more or fewer components than those shown in FIG. 1 , or have a different configuration than that shown in FIG. 1 .
  • the memory 104 may be configured to store computer programs, for example, software programs and modules of application software, such as computer programs corresponding to the cross-SR/SRv6 path delivery method in the embodiment of the present disclosure.
  • a computer program thereby executing various functional applications and data processing, implements the above-mentioned method.
  • Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory 104 may further include memory located remotely from the processor 102, and these remote memories may be connected to the mobile terminal through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • Transmission means 106 are arranged to receive or transmit data via a network.
  • the specific example of the above-mentioned network may include a wireless network provided by a communication provider of the mobile terminal.
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), which can be connected to other network devices through a base station so as to communicate with the Internet.
  • the transmission device 106 may be a radio frequency (Radio Frequency, RF for short) module, which is configured to communicate with the Internet in a wireless manner.
  • RF Radio Frequency
  • FIG. 2 is a flowchart of a method for delivering a cross SR/SRv6 path according to an embodiment of the present disclosure. As shown in FIG. 2 , the flow includes the following steps :
  • Step S202 the path calculation unit negotiates with the path calculation client for the capability of supporting cross-SR/SRv6 paths;
  • Step S204 the above-mentioned path calculation unit calculates the above-mentioned cross SR/SRv6 path
  • Step S206 the path calculation unit delivers the cross-SR/SRv6 path to the path calculation client.
  • the execution subject of the above steps may be a base station, a terminal, etc., but is not limited thereto.
  • the path calculation unit can calculate the cross-SR/SRv6 path, and finally deliver the cross-SR/SRv6 path.
  • negotiating the capability of supporting the cross SR/SRv6 path between the path calculation unit and the path calculation client includes: the path calculation unit and the path calculation client exchange the information of the cross SR/SRv6 path by sending the target object. capability, wherein the above-mentioned target object is an object under the defined new cross-SR/SRv6 path establishment type capability.
  • the calculation of the cross-SR/SRv6 path by the path calculation unit includes: calculating the cross-SR/SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.
  • calculating the cross SR/SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology includes: according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology bandwidth, and calculate the above-mentioned cross SR/SRv6 path according to the minimum hop count policy or the minimum delay policy.
  • the calculation of the cross-SR/SRv6 path by the path calculation unit includes: after the path calculation unit negotiates with the path calculation client about the capability of supporting the cross-SR/SRv6 path, the path calculation unit actively calculates the cross-SR/SRv6 path.
  • Cross SR/SRv6 paths are: after the path calculation unit negotiates with the path calculation client about the capability of supporting the cross-SR/SRv6 path, the path calculation unit actively calculates the cross-SR/SRv6 path.
  • the calculation of the cross-SR/SRv6 path by the path calculation unit includes: after the path calculation unit negotiates the capability of supporting the cross-SR/SRv6 path with the path calculation client, the path calculation unit receives the path Calculate the request sent by the client to calculate the above-mentioned cross SR/SRv6 path; the above-mentioned path calculation unit calculates the above-mentioned cross SR/SRv6 path in response to the above request.
  • the above-mentioned path calculating unit receiving the request for calculating the cross-SR/SRv6 path sent by the above-mentioned path calculating client includes: the above-mentioned path calculating unit receiving the request for calculating the cross-SR/SRv6 path sent by the above-mentioned path calculating client including establishing a cross-SR/SRv6 path A request for an RP object or an SRP object of type capability length type value.
  • the above-mentioned path calculation unit delivering the above-mentioned cross SR/SRv6 path to the above-mentioned path calculation client comprises: using a newly defined cross-SR ERO or using an extended SR ERO to issue the above-mentioned cross-SR/SRv6 path.
  • the delivery of the cross-SR/SRv6 path by the path calculation unit to the path calculation client includes: delivering an identification code of an egress port of the cross-SR/SRv6 path and an identifier of the cross-SR/SRv6 path ID of the ingress port.
  • the path calculation unit delivering the identification code of the egress port of the cross SR/SRv6 path and the identification code of the ingress port of the cross SR/SRv6 path to the path calculation client includes: in the path When the computing client is an ingress node, the path computing unit delivers the identification code of the egress port of the cross SR/SRv6 path; when the path computing client is an egress node, the path computing unit delivers the cross The identification code of the ingress port of the SR/SRv6 path; when the path calculation client is an intermediate node, the path calculation unit simultaneously delivers the identification code of the egress port of the cross-SR/SRv6 path and the cross-SR/SRv6 path ID of the ingress port.
  • the step of delivering the cross SR/SRv6 path by the path calculation unit to the path calculation client includes: the path calculation unit delivering the cross SR/SRv6 path to the path calculation client through the BGP protocol.
  • the node can implement the configuration of the cross relationship of the nodes involved on the forwarding path through the IGP protocol.
  • SPN Slicing Packet Network
  • IP RAN IP-based Radio Access Network
  • MTN Channel MTN Channel
  • the network topology is shown in Figure 3.
  • the controller calculates a cross path of A->B->C->D->Z with a bandwidth of 30 megabytes (M) ( occupying 3 time slots), and deliver the path to the ingress A node.
  • A-E and Z in FIG. 3 are nodes respectively, 101-108 are the identifiers of the nodes, and 18001-18016 and 18019-18024 are the port identification codes (Adj-SIDs) of the nodes.
  • FIG. 4 is a flowchart of a PCEP message of the PCEP protocol between the path calculation client PCC and the path calculation unit PCE according to Embodiment 1 of the present disclosure, as shown in FIG. 4 , including the following steps:
  • Step S402 the capability of supporting the cross-path is negotiated between the PCC and the PCE.
  • a new path establishment type capability TLV format is defined to identify that the path to be established is a cross path, and the PCC and PCE exchange the cross path capability by sending an open object carrying this path establishment type capability TLV.
  • Step S404 the path calculation client PCC requests the path calculation element PCE (path calculation unit) to calculate the cross path.
  • the PCC requests the PCE to establish a cross-path by carrying the RP or SRP object of the cross-path establishment type capability length type value TLV in the PCEP protocol in the request path message.
  • Step S406 the PCE calculates the path cross path according to the path request information, and the path calculation is successful, and the PCE delivers the calculated cross path to the PCC.
  • the cross path delivered from the PCE to the PCC is carried by extending the ERO of the PCEP protocol, defining a new cross SR ERO or extending the existing SR ERO, which is not limited here, but the information carried by the SR ERO includes: Adj- SID, you can select the Adj-SID of the outgoing port identification code, the Adj-SID of the incoming port or the Adj-SID of the incoming port at the same time as needed.
  • the format of the extended cross SR ERO is shown in Figure 5.
  • the format of the extended SRV6 ERO is shown in Figure 6.
  • the content delivered by the PCE to the PCC can be referred to in FIG. 7 .
  • the node identification SID and the Adj-SID of the outgoing/incoming port are included, while the head and tail nodes only include the outgoing or incoming one-way Adj-SID.
  • Step S802 the capability of supporting cross paths is negotiated between the PCC and the PCE.
  • a new path establishment type capability TLV is defined to identify that the path to be established is a cross-path, and the PCC and the PCE exchange cross-path capabilities by sending an open object carrying this path establishment type capability TLV.
  • Step S804 the controller adopts a certain path calculation strategy (minimum number of hops, minimum delay, etc.) to actively perform path calculation according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology;
  • a certain path calculation strategy minimum number of hops, minimum delay, etc.
  • Step S806 the path calculation is successful, and the PCE delivers the calculated cross path to the PCC.
  • the cross path delivered from the PCE to the PCC is carried by extending the ERO of the PCEP, defining a new cross SR ERO or extending the existing SR ERO, which is not limited here, but the information carried by the SR ERO includes: Adj-SID of the ingress and egress ports , you can select the Adj-SID of the outgoing port, the Adj-SID of the incoming port or the Adj-SID of the incoming port at the same time according to your needs.
  • the format of the extended cross SR ERO is shown in Figure 5.
  • the format of the extended SRV6 ERO is shown in Figure 6.
  • the node SID and the Adj-SID of the outbound/inbound port are included for the P node, while the head and tail nodes only include the outbound or inbound unidirectional Adj-SID.
  • Step S902 the PCC and the PCE negotiate the capability of supporting the cross-SRv6 path.
  • a new path establishment type capability TLV is defined to identify that the path to be established is a cross-path, and the PCC and the PCE exchange cross-path capabilities by sending an open object carrying this path establishment type capability TLV.
  • Step S904 the path calculation client PCC requests the path calculation element PCE to calculate the cross-SRv6 path.
  • the PCC requests the PCE for the need to establish a cross-path by carrying the RP or SRP object of the cross-SRv6 path establishment type capability length type value TLV in the request path message.
  • Step S906 the PCE calculates the path cross-SRv6 path according to the path request information. After the path calculation is successful, the PCE delivers the calculated cross-SRv6 path to the PCC.
  • the cross path delivered from the PCE to the PCC is carried by extending the ERO of the PCEP, defining a new cross SRv6 ERO or extending the existing SRv6 ERO, which is not limited here, but the information carried by the SRv6 ERO includes: End.X of the ingress and egress ports. SID, when delivering, you can select the Adj-SID of the outgoing port, the Adj-SID of the inbound port or the Adj-SID of the inbound port at the same time.
  • the format of the extended cross SR ERO is shown in Figure 5.
  • the format of the extended SRV6 ERO is shown in Figure 6.
  • the bits of the flags field of the SRv6 ERO can be extended to identify whether the SID is out or in.
  • Step S1002 the PCC and the PCE negotiate the capability of supporting the cross-SRv6 path.
  • Step S1004 the controller adopts a certain path calculation strategy (minimum number of hops, minimum delay, etc.) to actively perform path calculation according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology;
  • a certain path calculation strategy minimum number of hops, minimum delay, etc.
  • step S1006 the path calculation is successful, and the PCE delivers the calculated cross-SRv6 path to the PCC.
  • the cross path delivered from the PCE to the PCC is carried by extending the ERO of the PCEP, defining a new cross SRv6 ERO or extending the existing SRv6 ERO, which is not limited here, but the information carried by the SRv6 ERO includes: End.X of the ingress and egress ports. SID, when delivering, you can select the Adj-SID of the outgoing port, the Adj-SID of the inbound port or the Adj-SID of the inbound port at the same time.
  • the bits of the flags field of the SRv6 ERO can be extended to identify whether the SID is out or in.
  • the specific delivery path to the network device can also be performed through the BGP protocol.
  • step S1102 is executed, and the cross-path is delivered using the BGP protocol.
  • the BGP protocol needs to be extended to carry the information of the adjacent SIDs of the ingress and egress ports of the node.
  • the Adj-SID of the ingress and egress ports of the node needs to be carried, and for SRv6, the End.X SID of the ingress and egress ports of the node is carried.
  • the format of the extended crossover SR ERO is shown in Figure 5.
  • the format of the extended SRV6 ERO is shown in Figure 6.
  • the embodiment of the present application expands the SR cross service path delivered by the southbound interface protocol.
  • the PCC and the PCE negotiate the ability to support cross-SR/SRv6 paths.
  • the path calculation client PCC requests the path calculation element PCE to calculate the cross-SR/SRv6 path.
  • the PCE calculates the cross-SR/SRv6 path based on the path request information.
  • the PCE After the PCE calculates the cross SR/SRv6 path of the path according to the path request information, the PCE delivers the calculated cross SRv6 path to the PCC.
  • the PCE After calculating the cross SR/SRv6 path of the path according to the path request information, the PCE delivers the calculated cross SRv6 path to the network device through the BGP protocol.
  • a new path establishment type capability TLV is defined to identify that the path to be established is a cross-path, and the PCC and the PCE exchange cross-path capabilities by sending an open object carrying this path establishment type capability TLV.
  • the PCC requests the PCE for the need to establish a cross-path by carrying the RP or SRP object of the cross-path establishment type capability length type value TLV in the request path message.
  • the cross path delivered by the PCE to the PCC is carried by extending the ERO of the PCEP, and a new cross SR ERO is defined to carry the identification SID of the neighbor node of the ingress and egress ports.
  • the content to be delivered is selected according to the attributes of the actual node, the Adj-SID of the outgoing port under the incoming node, the Adj-SID of the incoming port for the outgoing node and the Adj-SID of the incoming port for the intermediate node at the same time.
  • This embodiment also provides an apparatus for delivering a cross SR/SRv6 path, the apparatus is used to implement the above-mentioned embodiments and preferred implementations, and what has been described will not be repeated.
  • the term "module” may be a combination of software and/or hardware that implements a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, implementations in hardware, or a combination of software and hardware, are also possible and contemplated.
  • FIG. 12 is a structural block diagram of an apparatus for delivering a cross-SR/SRv6 path according to an embodiment of the present disclosure. As shown in FIG. 12 , the apparatus includes:
  • the negotiation module 1202 is configured to negotiate the capability of supporting the cross-SR/SRv6 path with the path calculation client;
  • the calculation module 1204 is configured to calculate the above-mentioned cross SR/SRv6 path
  • the delivery module 1206 is configured to deliver the above-mentioned cross SR/SRv6 path to the above-mentioned path calculation client.
  • the negotiation module 1202 includes: a sending unit configured to exchange the capability of cross-SR/SRv6 paths by sending a target object, wherein the target object is a new defined cross-SR/SRv6 path establishment type capability object below.
  • the above calculation module 1204 includes: a first calculation unit configured to calculate the above-mentioned cross SR/SRv6 path according to the required bandwidth of the forwarding path and the remaining bandwidth of each link in the routing topology.
  • the above-mentioned first calculation unit includes: a calculation sub-unit, configured to calculate according to the minimum hop number strategy or the minimum delay strategy according to the bandwidth required by the forwarding path and the remaining bandwidth of each link in the routing topology.
  • the above-mentioned calculation module 1204 includes: a second calculation unit, configured to actively calculate the above-mentioned cross-SR/SRv6 path after the above-mentioned path calculation unit and the above-mentioned path calculation client negotiate the capability of supporting the cross-SR/SRv6 path path.
  • the above-mentioned calculation module 1204 includes: a receiving unit, configured to receive the calculation sent by the above-mentioned path calculation client after the above-mentioned path calculation unit negotiates with the above-mentioned path calculation client about the capability of supporting cross-SR/SRv6 paths the request for the above-mentioned cross-SR/SRv6 path; and a third computing unit, configured to calculate the above-mentioned cross-SR/SRv6 path in response to the above-mentioned request.
  • the above receiving unit includes: a receiving subunit configured to receive a request sent by the above path calculation client including a length type value RP object or an SRP object including cross SR/SRv6 path establishment type capability.
  • the above-mentioned issuing module 1206 includes: a first issuing unit, configured to issue the above-mentioned cross-SR/SRv6 path by using a newly defined cross-SR ERO or using an extended SR-ERO.
  • the above-mentioned issuing module 1206 includes: a second issuing unit, configured to issue the identification code of the egress port of the above-mentioned cross SR/SRv6 path and the identification code of the ingress port of the above-mentioned cross SR/SRv6 path .
  • the above-mentioned second issuing unit includes: a first issuing sub-unit, configured to deliver the outgoing port of the above-mentioned cross-SR/SRv6 path when the above-mentioned path calculation client is an ingress node identification code; the second issuing subunit is set to issue the identification code of the ingress port of the above-mentioned cross SR/SRv6 path when the above-mentioned path calculation client is an outgoing node; the third issuing subunit is set to When the path calculation client is an intermediate node, the identification code of the egress port of the cross SR/SRv6 path and the identification code of the ingress port of the cross SR/SRv6 path are simultaneously delivered.
  • the above-mentioned issuing module 1206 includes: a fifth issuing unit, configured to deliver the above-mentioned cross-SR/SRv6 path to the above-mentioned path calculation client through the BGP protocol.
  • the above modules can be implemented by software or hardware, and the latter can be implemented in the following ways, but not limited to this: the above modules are all located in the same processor; or, the above modules can be combined in any combination The forms are located in different processors.
  • Embodiments of the present disclosure also provide a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute the steps in any one of the above method embodiments when running.
  • the above-mentioned computer-readable storage medium may include, but is not limited to, a USB flash drive, a read-only memory (Read-Only Memory, referred to as ROM for short), and a random access memory (Random Access Memory, referred to as RAM for short) , mobile hard disk, magnetic disk or CD-ROM and other media that can store computer programs.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • An embodiment of the present disclosure also provides an electronic device, including a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
  • the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.
  • modules or steps of the present disclosure can be implemented by a general-purpose computing device, and they can be centralized on a single computing device or distributed in a network composed of multiple computing devices
  • they can be implemented in program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, can be performed in a different order than shown here.
  • the described steps, or they are respectively made into individual integrated circuit modules, or a plurality of modules or steps in them are made into a single integrated circuit module to realize.
  • the present disclosure is not limited to any particular combination of hardware and software.

Landscapes

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

Abstract

Les modes de réalisation de la présente divulgation utilisent un procédé et un appareil de soumission de trajets croisés de SR/SRv6, un support de stockage et un dispositif électronique. Le procédé consiste : à négocier, par un élément de calcul de trajets et avec un client de calcul de trajets, sur la capacité de prendre en charge un trajet croisé de SR/SRv6 ; à calculer, par l'élément de calcul de trajets, le trajet croisé de SR/SRv6 ; et à soumettre, par l'élément de calcul de trajets, le trajet croisé de SR/SRv6 au client de calcul de trajets.
PCT/CN2021/121003 2020-10-21 2021-09-27 Procédé et dispositif de soumission de trajets croisés de sr/srv6, support de stockage et dispositif électronique WO2022083422A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011135380.1A CN112491709A (zh) 2020-10-21 2020-10-21 交叉SR/SRv6路径下发方法和装置、存储介质及电子装置
CN202011135380.1 2020-10-21

Publications (1)

Publication Number Publication Date
WO2022083422A1 true WO2022083422A1 (fr) 2022-04-28

Family

ID=74926936

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/121003 WO2022083422A1 (fr) 2020-10-21 2021-09-27 Procédé et dispositif de soumission de trajets croisés de sr/srv6, support de stockage et dispositif électronique

Country Status (2)

Country Link
CN (1) CN112491709A (fr)
WO (1) WO2022083422A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491709A (zh) * 2020-10-21 2021-03-12 中兴通讯股份有限公司 交叉SR/SRv6路径下发方法和装置、存储介质及电子装置
CN113259241B (zh) * 2021-05-08 2022-04-26 烽火通信科技股份有限公司 一种提升SRv6转发效率的方法与电子设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729385A (zh) * 2008-10-31 2010-06-09 华为技术有限公司 一种路径计算及建立方法、装置和系统
CN101820556A (zh) * 2009-02-26 2010-09-01 华为技术有限公司 路由协议消息发布和路由计算的方法、装置和系统
US20190097922A1 (en) * 2017-09-22 2019-03-28 Ixia Computing label-switched data communication paths
CN110958168A (zh) * 2018-09-26 2020-04-03 中兴通讯股份有限公司 跨域双向隧道创建方法、通信方法及装置、存储介质
CN112491709A (zh) * 2020-10-21 2021-03-12 中兴通讯股份有限公司 交叉SR/SRv6路径下发方法和装置、存储介质及电子装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729385A (zh) * 2008-10-31 2010-06-09 华为技术有限公司 一种路径计算及建立方法、装置和系统
CN101820556A (zh) * 2009-02-26 2010-09-01 华为技术有限公司 路由协议消息发布和路由计算的方法、装置和系统
US20190097922A1 (en) * 2017-09-22 2019-03-28 Ixia Computing label-switched data communication paths
CN110958168A (zh) * 2018-09-26 2020-04-03 中兴通讯股份有限公司 跨域双向隧道创建方法、通信方法及装置、存储介质
CN112491709A (zh) * 2020-10-21 2021-03-12 中兴通讯股份有限公司 交叉SR/SRv6路径下发方法和装置、存储介质及电子装置

Also Published As

Publication number Publication date
CN112491709A (zh) 2021-03-12

Similar Documents

Publication Publication Date Title
Jasmine et al. DSQLR-A distributed scheduling and QoS localized routing scheme for wireless sensor network
EP2747355B1 (fr) Réseau d'agrégation avec commande centralisée
US9634928B2 (en) Mesh network of simple nodes with centralized control
EP3531617B1 (fr) Procédé et appareil de transmission de messages, noeud et support de stockage informatique
WO2022083422A1 (fr) Procédé et dispositif de soumission de trajets croisés de sr/srv6, support de stockage et dispositif électronique
US11290394B2 (en) Traffic control in hybrid networks containing both software defined networking domains and non-SDN IP domains
WO2015113297A1 (fr) Procede de transmission de donnees, et procede et dispositif de commande de transmission
US10631225B2 (en) Device within a wireless peer-to-peer network, wireless communication system and control method
US20110085546A1 (en) Method and devices for multicast distribution optimization
US9398553B2 (en) Technique for improving LDP-IGP synchronization
WO2018077304A1 (fr) Procédé, appareil et système de traitement d'informations de service
EP3989511A1 (fr) Prise en charge de multiples options de transport de protocole de passerelle frontière
US20180145929A1 (en) Path computation element protocol response and simple network management protocol confirmation for tunnel configuration
CN112585910B (zh) 在广域网中建立安全、低延迟、优化路径的方法和装置
CN111464440A (zh) 一种通信方法及装置
CN111464441A (zh) 一种通信方法及装置
WO2018077313A1 (fr) Procédé et dispositif de notification de capacité de connexion
CN115022240A (zh) 路径建立方法、装置、存储介质及电子装置
EP4277424A1 (fr) Procédé et appareil de calcul de chemin, support de stockage et dispositif électronique
CN106572050B (zh) 能力协商方法及装置
JP7331066B2 (ja) Ａｖｂストリームのモジュール式ルーティングの方法及び装置
WO2023207227A1 (fr) Procédé de traitement de message de publicité de routeur, appareil, support de stockage et appareil électronique
WO2012084626A1 (fr) Procédé pour des communications entre domaines
WO2023193511A1 (fr) Procédé de transfert de message, appareil, support de stockage et appareil électronique
KR101619511B1 (ko) 링크 계층 탐색 프로토콜을 이용하여 고유의 네트워크 대역을 설정하는 패킷 전송망, 및 이를 이용한 제어 평면 망 구축 방법

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 07/09/2023)

122 Ep: pct application non-entry in european phase

Ref document number: 21881840

Country of ref document: EP

Kind code of ref document: A1