WO2020073685A1 - Procédé, appareil et système de détermination de trajet d'acheminement, dispositif informatique et support d'informations - Google Patents

Procédé, appareil et système de détermination de trajet d'acheminement, dispositif informatique et support d'informations Download PDF

Info

Publication number
WO2020073685A1
WO2020073685A1 PCT/CN2019/092617 CN2019092617W WO2020073685A1 WO 2020073685 A1 WO2020073685 A1 WO 2020073685A1 CN 2019092617 W CN2019092617 W CN 2019092617W WO 2020073685 A1 WO2020073685 A1 WO 2020073685A1
Authority
WO
WIPO (PCT)
Prior art keywords
flow
node
flow label
destination address
address
Prior art date
Application number
PCT/CN2019/092617
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 WO2020073685A1 publication Critical patent/WO2020073685A1/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/74—Address processing for routing
    • H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0677—Localisation of faults

Definitions

  • the present application relates to the field of data processing technology, and in particular, to a forwarding path determination method, device, computer equipment, and storage medium.
  • data packets in the network mainly select the best path through hops, metric, cost, or comprehensive comparison.
  • Path forwarding strategies such as RIP (Routing Information Protocol), IGRP (Interior Gateway Routing Protocol, internal gateway routing protocol) and other protocols are based on the number of hops to select the best path, IS-IS and other protocols
  • the path forwarding strategy is to select the best path through the metric value.
  • the path forwarding strategy corresponding to the protocols such as EIGRP (Enhanced Interior Gateway Routing Protocol, enhanced internal gateway routing protocol) and OSPF (Open Shortest Path First) is To select the best path through generational value, there are some protocols such as BGP (Border Gateway Protocol, Border Gateway Protocol), TE and other protocols corresponding to the path forwarding strategy is a comprehensive comparison to select the best path.
  • Internal gateway protocols such as RIP, OSPF, IS-IS, IGRP, EIGRP
  • the algorithm for selecting the best path has shortcomings, such as the number of hops ignores bandwidth and delay The value, delay, bandwidth and backup path are ignored.
  • the BGP protocol has strong control capabilities in the calculation of the optimal path but lacks dynamic path calculation capabilities.
  • TE has strong path control capabilities and intelligent routing capabilities but has high complexity and weak path control capabilities.
  • Embodiments of the present application provide a forwarding path determination method, device, computer equipment, and storage medium, which enable data traffic to be forwarded according to a path where a designated key node is located, which is convenient for efficient fault location and troubleshooting.
  • an embodiment of the present application provides a method for determining a forwarding path.
  • the method includes:
  • an embodiment of the present application provides an apparatus for determining a forwarding path.
  • the apparatus includes a unit corresponding to executing the method described in the first aspect.
  • an embodiment of the present application provides a computer device, the computer device includes a memory, and a processor connected to the memory;
  • the memory is used to store a computer program, and the processor is used to run the computer program stored in the memory to perform the method described in the first aspect.
  • an embodiment of the present application provides a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, implements the method described in the first aspect.
  • FIG. 1 is a schematic flowchart of a forwarding path determination method provided by an embodiment of the present application
  • FIG. 2 is a schematic flowchart of a forwarding path determination method provided by another embodiment of the present application.
  • FIG. 3 is a schematic sub-flow diagram of a method for determining a forwarding path provided by another embodiment of the present application.
  • FIG. 4 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • FIG. 5 is a schematic block diagram of a forwarding path determination apparatus provided by an embodiment of the present application.
  • FIG. 6 is a schematic block diagram of an apparatus for determining a forwarding path according to another embodiment of the present application.
  • FIG. 7 is a schematic block diagram of a forwarding unit provided by another embodiment of the present application.
  • FIG. 8 is a schematic block diagram of a computer device provided by an embodiment of the present application.
  • the forwarding path determination method in the embodiment of the present application may be applied to a network that needs to control data traffic, such as the Internet or a local area network.
  • a network that needs to control data traffic such as the Internet or a local area network.
  • the following uses the data center Internet as an example.
  • the data center interconnection network may be the data center interconnection network where banks and large enterprises are located.
  • the data center interconnection network includes multiple data centers, distributed in different cities, and these data centers need to communicate with each other.
  • the data center interconnection network also includes multiple routers.
  • the forwarding path determination method is applied to routers in the data center interconnection network to forward data traffic from the source address to the destination address.
  • addresses in this application such as source address and destination address, are all IP addresses.
  • each router can also independently implement each step of the forwarding path determination method, that is, each router has a function of implementing each step of the forwarding path determination method.
  • FIG. 1 is a schematic flowchart of a forwarding path determination method provided by an embodiment of the present application. As shown in FIG. 1, the method includes S101-S104.
  • the router After receiving the data traffic, the router obtains the key nodes that the data traffic needs to pass through to reach the destination address and the flow labels corresponding to the key nodes before forwarding the data traffic.
  • a node refers to a router, and each router corresponds to a node.
  • the key node can also be understood as the necessary node that needs to pass through to reach the destination address.
  • each router stores a configuration file, and the configuration file stores the flow mark corresponding to the key node that the data traffic needs to pass through to reach the destination address. Set the flow mark corresponding to the key node that the data traffic needs to pass to reach the destination address in the configuration file in advance.
  • S102 Encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet.
  • the IPv4 format data packet corresponding to the data traffic is encapsulated into an IPv6 format data packet through tunneling technology.
  • Tunneling technology refers to a mechanism that encapsulates IPv6 packets as data in IPv4 packets when necessary, so that IPv6 packets can be transmitted on existing IPv4 infrastructure (mainly IPv4 routers). That is, IPv4 is used as a tunnel carrier, and the entire IPv6 data packet is encapsulated in the IPv4 data packet, so that the encapsulated data packet can still be forwarded in the network. If node A wants to send IPv6 packets to node B, but there is a sea of IPv4 between them, first, both ends need to be configured to establish a tunnel.
  • node A when node A sends an IPv6 packet to node B, node A as the beginning of the tunnel encapsulates the IPv6 packet in an IPv4 packet that uses node B's IPv4 address as the destination address and the source address is its own IPv4 address, and It is sent out, and the sent data packet reaches the Node B through IPv4 forwarding just like a normal IPv4 data packet. After receiving this data packet, Node B releases the IPv4 encapsulation, and takes out the IPv6 data packet to be processed by its own IPv6 protocol stack.
  • IPv6 packet There is a Flow field in the IPv6 packet, which occupies fixed bits, such as 20 bits, and this field is the flow label field.
  • the domain can also be understood as a field, that is, there is a flow label field in the IPv6 data packet.
  • the Flow field in the IPv6 packet can be used to identify various forms of flow. Since the Flow field can be customized, this field is used to identify the flow label corresponding to the key node. In this way, the combination of IPv4 and IPv6 is compatible with mainstream IPv4 applications and IPv6 flow label customization.
  • the flow label corresponding to the key node is written into the flow label field, rather than the IP address corresponding to the key node is written into the flow label field, because the size of the flow label field Limited, if you write an IP address, the IP address that the flow label field can hold is limited; if you write a flow tag, you can record multiple flow tags.
  • the flow marks corresponding to the key nodes are written in the order of the key nodes that need to pass through to reach the destination address.
  • An implementation scenario of writing the flow label corresponding to the key node into the flow label field of the IPv6 format data packet is: on the interface displaying the data flow information, receiving a data flow selected by the user, and receiving the data from the user Flow setting / input key node, according to the flow mark corresponding to the pre-saved key node, write the flow mark corresponding to the set / input key node to the flow label field of the IPv6 format packet, set / The key nodes entered are saved in the configuration file. In some other implementation scenarios, it is also possible to directly read the data set in the configuration file without manual participation and complete automatically.
  • the correspondence relationship between the flow label and the node address will be set in advance, such as what is the node address corresponding to a certain flow label, and the node address is represented by an IP address.
  • the correspondence between the flow label and the node address is stored in each router.
  • a flow label corresponds to a node address, for example, the flow labels corresponding to Wuhan, Shanghai, and Beijing correspond to an IP address in Wuhan, Shanghai, and Beijing, respectively.
  • These node addresses exist in the data center interconnection network, and are hardware device addresses in the data center interconnection network, such as router IP addresses.
  • the IPv6 format data packet is first forwarded to the node address corresponding to Wuhan, and then forwarded from the node address corresponding to Wuhan to the node address corresponding to Shanghai, and then Forwarded from the node address corresponding to Shanghai to the node address corresponding to Beijing, and finally forwarded to the destination address.
  • there may be many routers between the router that forwards the data traffic and the router corresponding to the key node and there may be many routers between every two key nodes, such as between Wuhan and Shanghai There may be many routers.
  • the path forwarding strategy between the router that forwards the data traffic and the key node is forwarded according to the existing path forwarding strategy, and the path forwarding strategy between every two key nodes is also forwarded according to the existing path forwarding strategy.
  • the path forwarding strategy is a forwarding strategy corresponding to different protocols, such as RIP and OSPF.
  • FIG. 2 is a schematic flowchart of a forwarding path determination method provided by another embodiment of the present application. As shown in FIG. 2, the method includes S201-S206. In this embodiment, the differences from the embodiment in FIG. 1 are mainly explained. For the description of the same steps as in FIG. 1, please refer to the description in the embodiment in FIG. 1, which will not be repeated here.
  • the preset type may be a preset priority. If the router receives data traffic, obtain the priority of the data traffic. In some embodiments, the preset type may also be other specific types set in advance, such as a user-defined type. If the router receives data traffic, the type data of the data traffic is obtained. Among them, the preset priority and the preset specific type are saved in the configuration file.
  • the preset type is a preset priority
  • it is determined whether the type of data traffic is the preset type that is, whether the priority of the data traffic is the preset priority. If the preset type is another specific type preset by the user, then it is determined whether the type of data traffic is the preset type, that is, whether the type of the data traffic is other specific types preset. To determine whether the type of the data traffic is a preset type is to filter some data traffic, and only further processes the preset type of data traffic.
  • step S203 is executed, it can be understood that the data traffic of the preset type is simply forwarded in the order corresponding to the designated key node, and the preset data traffic type and path The corresponding association relationship of the forwarding strategy selects the corresponding path forwarding strategy for forwarding. If the type of data traffic is not the preset type, it is forwarded according to the ordinary data packet.
  • step S201 it is not necessary to determine whether the data traffic type is a preset type, that is, after step S201 is executed, then the key nodes that need to pass through the data traffic to reach the destination address and the flows corresponding to the key nodes are obtained in step S203 mark. It can be understood that all data traffic is designated as key nodes, and all data traffic is forwarded in the order corresponding to the designated key nodes, but it will also be associated with the path forwarding strategy according to the preset data traffic type. The relationship selects the corresponding path forwarding strategy for forwarding.
  • the type of the data traffic is a preset type, obtain a key node that the data traffic needs to pass through to reach the destination address and a flow mark corresponding to the key node.
  • the flow mark corresponding to the key node is stored in the configuration file.
  • the flow mark of the key node corresponding to the preset type of data traffic is stored in the configuration file.
  • the configuration file has two functions: identifying a predetermined type of data traffic, and obtaining a flow mark corresponding to a key node corresponding to the predetermined type of data traffic.
  • S204 Encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet.
  • Each node stores the correspondence relationship between the data traffic type and the path forwarding strategy, where the nodes include key nodes.
  • different path forwarding strategies can be used for different types of data traffic.
  • the corresponding relationship between the data traffic type and the path forwarding strategy in each router can be the same or different.
  • the data traffic type is A
  • the path forwarding strategy is AA
  • the path forwarding strategy is BB.
  • the preset type of data traffic is forwarded according to the path where the designated key node is located, which is convenient for efficient fault location and troubleshooting, and the traffic analysis and reasonable prediction of the preset type of data traffic.
  • different types of data traffic are forwarded according to different path forwarding strategies, and a variety of different types of data traffic are forwarded more targeted to achieve personalized traffic forwarding to meet the needs of different users.
  • step S206 includes the following steps S301-S307.
  • next hop destination address does not really refer to the address of the next router that the data traffic needs to pass through, but the address of the router corresponding to the set key node.
  • the determined path forwarding strategy refers to the path forwarding strategy from the current router to the next router (not the router corresponding to the next hop destination address). It should be noted that there may be multiple routers, multiple forwarding paths, and multiple different path forwarding strategies between the current router and the router corresponding to the destination address of the next hop. In some other embodiments, no matter how many routers exist between the current router and the router corresponding to the destination address of the next hop, the data traffic is forwarded according to the same path forwarding strategy (determined path forwarding strategy) . In this case, it can be understood that all routers between the current router and the router corresponding to the destination address of the next hop are set to the same path forwarding strategy for the data traffic.
  • the purpose of deleting the flow label is to simplify the processing and facilitate the processing of the destination address of the next hop.
  • step S304 Determine whether the value in the flow label field is empty. If the value in the flow label field is not empty, return to step S301. If the value in the flow label field is empty, step S305 is executed.
  • the flow label field if there is a flow label in the flow label field, it means that the data packet corresponding to the data flow has not reached the destination. Since the flow label corresponding to the destination address of the next hop has been deleted, the first flow label in the flow label field is obtained, and the destination address corresponding to the first flow label is used as the destination address of the next hop. And determine the path forwarding strategy to be used to the destination address of the next hop. If the value in the flow label field is blank, it means that the data traffic has reached the destination, such as Beijing, but may not have reached the destination address, that is, the destination address in the IPV4 data packet.
  • step S305 Determine whether the current router address is the same as the destination address. If the current router address is the same as the destination address, step S306 is performed; if the current router address is not the same as the destination address, step S307 is performed. If the current router address is the same as the destination address, it means that the data traffic has reached the destination address. If the current router address is different from the destination address, it means that the data traffic has reached the destination (a destination can include multiple IP addresses, and multiple IP addresses include a destination address), but not yet Reach the destination address.
  • S307 Determine the path forwarding strategy corresponding to the IPv6 format data packet according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy, and according to the determined path forwarding strategy, convert the data in the IPv6 format The packet is sent to the destination address.
  • FIG. 4 it is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • an initial user (source address) in Shenzhen sends a data traffic
  • router A in Shenzhen receives the data traffic and finds that the data traffic needs to be sent to a destination user in Beijing.
  • the address corresponding to the destination user Is the destination address.
  • the key nodes that need to pass through include router B in Wuhan, router C in Shanghai, and router D in Beijing.
  • the key nodes corresponding to the preset types of data traffic, the flow labels corresponding to the key nodes, and the correspondence between the flow labels corresponding to the key nodes and the node addresses are stored Correspondence relationship between preset data traffic types and path forwarding strategies.
  • the IPv4 format data packet (including the destination address) corresponding to the data traffic is encapsulated into an IPv6 format data packet, and the flow label corresponding to the key node is written into the flow label field of the IPv6 format data packet.
  • Obtain the first flow label in the flow label field in the IPv6 format packet that is, the flow label corresponding to Router B.
  • the IPv6 format data packet is forwarded to the router B according to the corresponding path forwarding strategy.
  • Router B deletes the flow label corresponding to Router B from the flow label field.
  • Router B finds that the destination address is not its own, so it obtains the first flow label in the data packet, that is, the corresponding flow label of Router C. According to the correspondence between the flow label and the node address in the flow label field, the saved preset The corresponding relationship between the data traffic type and the path forwarding strategy forwards the IPv6 format data packet to Router C according to the corresponding path forwarding strategy.
  • Router D After receiving the IPv6 format packet, Router D finds that the destination address is not its own, and the value in the flow label field is empty, then Router D will change the IPv6 according to the corresponding relationship between the saved preset data traffic type and the path forwarding strategy.
  • the formatted data packet is forwarded to the destination user according to the corresponding path forwarding strategy. The destination user finds that the destination address is consistent with its own address, and then receives the data traffic.
  • each router can be implemented independently in Router A, Router B, Router C, and Router D, that is, each router can implement the sum of the functions described in the above four routers.
  • FIG. 4 is only an example, to facilitate understanding of the solution in the embodiment of the present application, in other embodiments, FIG. 4 may further include more networks and routers.
  • the key node may also be a terminal device, and the terminal device may implement a function of forwarding data traffic, and also save corresponding data.
  • the terminal equipment includes a user terminal, a server, and so on.
  • FIG. 5 is a schematic block diagram of a forwarding path determination apparatus provided by an embodiment of the present application.
  • the device includes a unit corresponding to the method for determining the forwarding path. It should be noted that since each router can implement the sum of the functions described in the above method embodiments, the device can be separately configured in a router or a terminal device, and the terminal device can implement the data traffic forwarding function Terminal Equipment. At the same time, for the convenience of understanding, the following device embodiments are still described according to the step flow. Specifically, as shown in FIG. 5, the device 50 includes a flow label acquisition unit 501, an encapsulation unit 502, a flow label writing unit 503 and a forwarding unit 504.
  • the flow label obtaining unit 501 is configured to obtain, if data traffic is received, a key node that the data traffic needs to pass through to reach the destination address and a flow label corresponding to the key node.
  • the encapsulating unit 502 is configured to encapsulate the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet. Specifically, the encapsulating unit 502 encapsulates the IPv4 format data packet corresponding to the data traffic into an IPv6 format data packet through a tunnel technology.
  • the forwarding unit 504 is configured to forward the data packet in the IPv6 format to the node corresponding to each key node according to the correspondence relationship between the flow label and the node address in the flow label field, in the order in which the flow label is written The address is finally forwarded to the destination address.
  • the device 60 includes a type acquisition unit 601, a type judgment unit 602, a flow label acquisition unit 603, a packaging unit 604, a flow label writing unit 605, and a forwarding unit 606.
  • the difference from the embodiment of FIG. 5 lies in: the type acquisition unit 601, the type judgment unit 602, and the forwarding unit 606.
  • the type acquisition unit 601, type judgment unit 602, and forwarding unit 606 will be described below. For other units, please refer to the description in the embodiment of FIG. 5, which will not be repeated here.
  • the type obtaining unit 601 is configured to obtain the type of the data flow if data flow is received.
  • the type determining unit 602 is configured to determine whether the type of the data traffic is a preset type. If the type of the data traffic is a preset type, then the flow mark acquisition unit 603 is triggered.
  • the flow label obtaining unit 603 is used to obtain the key nodes that the data traffic needs to pass through to reach the destination address and the flow labels corresponding to the key nodes.
  • the forwarding unit 606 is specifically configured to, according to the correspondence relationship between the flow label and the node address in the flow label domain, the corresponding relationship between the saved preset data traffic type and the path forwarding strategy, in order of writing the flow label
  • the data packet in the IPv6 format is forwarded to the node address corresponding to each key node according to the corresponding path forwarding strategy, and finally forwarded to the destination address.
  • the forwarding unit 606 includes a forwarding strategy determination unit 701, a forwarding next hop unit 702, a deletion unit 703, a value judgment unit 704, an address judgment unit 705, an arrival determination unit 706, and a forwarding purpose Address unit 707.
  • the forwarding strategy determination unit 701 is used to obtain the first flow label in the flow label field, and according to the correspondence between the flow label and the node address, use the node address corresponding to the first flow label as the destination address of the next hop And determine the path forwarding strategy to be used for forwarding the data packet in the IPv6 format to the destination address of the next hop according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy.
  • the forwarding next hop unit 702 is configured to forward the data packet in the IPv6 format from the current router to the destination address of the next hop according to the determined path forwarding strategy.
  • the deleting unit 703 is configured to delete the flow label corresponding to the destination address of the next hop from the flow label field after the IPv6 format data packet reaches the destination address of the next hop.
  • the value judgment unit 704 is used to judge whether the value in the flow label field is empty. If the value in the flow label field is not empty, a forwarding strategy determination unit 701 and a forwarding next hop unit 702 are triggered.
  • the address determining unit 705 is configured to determine whether the current router address is the same as the destination address if the value in the flow label field is empty.
  • the arrival determination unit 706 is configured to determine that the destination address has been reached if the current router address is the same as the destination address.
  • the forwarding destination address unit 707 is used to determine the correspondence of the IPv6 format data packet according to the correspondence relationship between the saved preset data traffic type and the path forwarding strategy if the current router address is different from the destination address A path forwarding strategy, and according to the determined path forwarding strategy, send the data packet in the IPv6 format to the destination address.
  • the above device can be implemented in the form of a computer program, and the computer program can be run on a computer device as shown in FIG. 8.
  • FIG. 8 is a schematic block diagram of a computer device provided by an embodiment of the present application.
  • the device is a router or terminal.
  • the device 80 includes a processor 802, a memory, and a network interface 803 connected through a system bus 801, where the memory may include a non-volatile storage medium 804 and an internal memory 805.
  • the non-volatile storage medium 804 may store an operating system 8041 and a computer program 8042.
  • the computer program 8042 stored in the non-volatile storage medium is executed by the processor 802, the foregoing forwarding path determination method can be implemented.
  • the processor 802 is used to provide computing and control capabilities and support the operation of the entire device 80.
  • the internal memory 805 provides an environment for the operation of the computer program in the non-volatile storage medium.
  • the processor 802 can execute the foregoing forwarding path determination method.
  • the network interface 803 is used for network communication. Those skilled in the art may understand that the structure shown in FIG.
  • the specific device 80 may Include more or less components than shown in the figure, or combine certain components, or have a different arrangement of components.
  • the processor 802 is used to run a computer program stored in a memory to implement any embodiment of the foregoing forwarding path determination method.
  • the so-called processor 802 may be a central processing unit (Central Processing Unit, CPU), and the processor may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP) , Application Specific Integrated Circuit (Application Program Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the computer program may be stored in a storage medium, and the storage medium may be a computer-readable storage medium.
  • the computer program is executed by at least one processor in the computer system to implement the process steps of the above method embodiments.
  • the present application also provides a storage medium.
  • the storage medium may be a computer-readable storage medium, and the computer-readable storage medium includes a non-volatile computer-readable storage medium.
  • the storage medium stores a computer program that, when executed by the processor, implements any embodiment of the foregoing forwarding path determination method.
  • the storage medium may be various computer-readable storage media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a magnetic disk, or an optical disk.
  • program codes such as a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a magnetic disk, or an optical disk.
  • the disclosed device, device, and method may be implemented in other ways.
  • the device embodiments described above are only schematic, and the division of the units is only a division of logical functions, and there may be other divisions in actual implementation.
  • the specific working processes of the devices, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments, which are not repeated here.

Landscapes

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

Abstract

La présente invention concerne, selon des modes de réalisation, un procédé et un appareil de détermination de trajet d'acheminement, un dispositif informatique et un support d'informations. Le procédé consiste : si un flux de données est reçu, à obtenir un nœud clé par l'intermédiaire duquel le flux de données atteint une adresse de destination et une étiquette de flux correspondant au nœud clé ; à encapsuler des paquets d'un format IPv4 correspondant au flux de données en paquets d'un format IPv6 ; à écrire l'étiquette de flux correspondant au nœud clé dans un champ d'étiquette de flux des paquets du format IPv6 ; en fonction de la relation correspondante entre l'étiquette de flux dans le champ d'étiquette de flux et une adresse de nœud, à transférer les paquets du format IPv6 à l'adresse de nœud correspondant à chaque nœud clé en fonction de l'ordre d'écriture des étiquettes de flux, et enfin à transmettre à l'adresse de destination.
PCT/CN2019/092617 2018-10-11 2019-06-25 Procédé, appareil et système de détermination de trajet d'acheminement, dispositif informatique et support d'informations WO2020073685A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811185377.3 2018-10-11
CN201811185377.3A CN109039919B (zh) 2018-10-11 2018-10-11 转发路径确定方法、装置、系统、计算机设备及存储介质

Publications (1)

Publication Number Publication Date
WO2020073685A1 true WO2020073685A1 (fr) 2020-04-16

Family

ID=64616338

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/092617 WO2020073685A1 (fr) 2018-10-11 2019-06-25 Procédé, appareil et système de détermination de trajet d'acheminement, dispositif informatique et support d'informations

Country Status (2)

Country Link
CN (1) CN109039919B (fr)
WO (1) WO2020073685A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114244743A (zh) * 2021-12-10 2022-03-25 北京天融信网络安全技术有限公司 一种资源池的数据包传输方法、装置、设备及介质
CN114338516A (zh) * 2021-12-28 2022-04-12 中国电信股份有限公司 一种流量转发、策略确定方法及装置
CN115462049A (zh) * 2020-05-18 2022-12-09 阿里巴巴集团控股有限公司 大规模数据网络中心的转发路径规划方法
CN116614315A (zh) * 2023-07-19 2023-08-18 国家计算机网络与信息安全管理中心江西分中心 一种实现应用云安全托管的IPv6安全防护方法

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109039919B (zh) * 2018-10-11 2021-09-21 平安科技（深圳）有限公司 转发路径确定方法、装置、系统、计算机设备及存储介质
CN113055268A (zh) * 2019-12-26 2021-06-29 中国移动通信集团有限公司 隧道流量负载均衡的方法、装置、设备及介质
CN113746654B (zh) * 2020-05-29 2024-01-12 中国移动通信集团河北有限公司 一种IPv6地址管理和流量分析的方法和装置
CN114363236B (zh) * 2021-12-20 2023-10-20 鹏城实验室 一种基于显式路径的流量控制方法及相关设备

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050147051A1 (en) * 2004-01-07 2005-07-07 Cisco Technology, Inc. Detection of forwarding problems for external prefixes
CN1707978A (zh) * 2004-06-11 2005-12-14 华为技术有限公司 获得智能光网络中松散路由的约束路径的方法和装置
CN101682541A (zh) * 2007-04-13 2010-03-24 Hart通信基金会 使用有向图在网络上路由包
CN101714953A (zh) * 2009-12-15 2010-05-26 中兴通讯股份有限公司 获取流量工程标签转发路径的方法和装置
CN102638388A (zh) * 2011-02-09 2012-08-15 华为技术有限公司 流标签的协商方法、相关装置以及系统
CN105357332A (zh) * 2015-10-30 2016-02-24 北京数码视讯科技股份有限公司 一种网络地址转换方法及装置
CN109039919A (zh) * 2018-10-11 2018-12-18 平安科技（深圳）有限公司 转发路径确定方法、装置、系统、计算机设备及存储介质

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1283071C (zh) * 2003-02-20 2006-11-01 华为技术有限公司 网络中指定路由的方法
CN101247308B (zh) * 2007-02-13 2011-04-27 上海亿人通信终端有限公司 基于网络处理器实现IPv6穿越IPv4的隧道报文处理方法
CN101119376B (zh) * 2007-09-14 2010-06-16 杭州华三通信技术有限公司 防止IPv6报文攻击的方法及网络设备
US8989029B2 (en) * 2011-06-10 2015-03-24 Comcast Cable Communications, Llc Quality of service in packet networks
CN102882790A (zh) * 2012-10-12 2013-01-16 北京锐安科技有限公司 一种IPv6实时数据流处理方法
US9716653B2 (en) * 2014-11-18 2017-07-25 Hauwei Technologies Co., Ltd. System and method for flow-based addressing in a mobile environment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050147051A1 (en) * 2004-01-07 2005-07-07 Cisco Technology, Inc. Detection of forwarding problems for external prefixes
CN1707978A (zh) * 2004-06-11 2005-12-14 华为技术有限公司 获得智能光网络中松散路由的约束路径的方法和装置
CN101682541A (zh) * 2007-04-13 2010-03-24 Hart通信基金会 使用有向图在网络上路由包
CN101714953A (zh) * 2009-12-15 2010-05-26 中兴通讯股份有限公司 获取流量工程标签转发路径的方法和装置
CN102638388A (zh) * 2011-02-09 2012-08-15 华为技术有限公司 流标签的协商方法、相关装置以及系统
CN105357332A (zh) * 2015-10-30 2016-02-24 北京数码视讯科技股份有限公司 一种网络地址转换方法及装置
CN109039919A (zh) * 2018-10-11 2018-12-18 平安科技（深圳）有限公司 转发路径确定方法、装置、系统、计算机设备及存储介质

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115462049A (zh) * 2020-05-18 2022-12-09 阿里巴巴集团控股有限公司 大规模数据网络中心的转发路径规划方法
CN115462049B (zh) * 2020-05-18 2024-03-08 阿里巴巴（中国）有限公司 大规模数据网络中心的转发路径规划方法
CN114244743A (zh) * 2021-12-10 2022-03-25 北京天融信网络安全技术有限公司 一种资源池的数据包传输方法、装置、设备及介质
CN114244743B (zh) * 2021-12-10 2022-10-21 北京天融信网络安全技术有限公司 一种资源池的数据包传输方法、装置、设备及介质
CN114338516A (zh) * 2021-12-28 2022-04-12 中国电信股份有限公司 一种流量转发、策略确定方法及装置
CN114338516B (zh) * 2021-12-28 2023-09-29 中国电信股份有限公司 一种流量转发、策略确定方法及装置
CN116614315A (zh) * 2023-07-19 2023-08-18 国家计算机网络与信息安全管理中心江西分中心 一种实现应用云安全托管的IPv6安全防护方法
CN116614315B (zh) * 2023-07-19 2023-10-27 国家计算机网络与信息安全管理中心江西分中心 一种实现应用云安全托管的IPv6安全防护方法

Also Published As

Publication number Publication date
CN109039919B (zh) 2021-09-21
CN109039919A (zh) 2018-12-18

Similar Documents

Publication Publication Date Title
WO2020073685A1 (fr) Procédé, appareil et système de détermination de trajet d'acheminement, dispositif informatique et support d'informations
US11876883B2 (en) Packet processing method, network node, and system
US20200169432A1 (en) Bridging of non-capable subnetworks in bit indexed explicit replication
WO2021063232A1 (fr) Procédé, appareil et système d'établissement d'élément de table d'acheminement bier
CN109218178B (zh) 一种报文处理方法及网络设备
EP3879759A1 (fr) Dépannage de chemin de données optimisé à l'aide d'un moteur de politique de trace
WO2020182156A1 (fr) Procédé de transfert de message dans un réseau, nœud de réseau et système de réseau
RU2493677C2 (ru) Способ и маршрутизатор для выполнения зеркального копирования
US9019814B1 (en) Fast failover in multi-homed ethernet virtual private networks
US7944854B2 (en) IP security within multi-topology routing
CN108809759A (zh) 检测链路状态的方法、装置和路由器
US8165038B2 (en) Network physical connection inference for IP tunnels
US20230300070A1 (en) Packet Sending Method, Device, and System
US11349749B2 (en) Node protection for bum traffic for multi-homed node failure
WO2021088433A1 (fr) Procédé, dispositif et système de traitement de message
CN112134776B (zh) 生成组播转发表项的方法和接入网关
WO2022083563A1 (fr) Procédé de détection de liaison, appareil de détection de liaison, dispositif terminal et support de stockage
CN105471747A (zh) 一种智能路由器选路方法和装置
CN107294856A (zh) 确定拓扑变化的方法、设备及系统
WO2022007550A1 (fr) Procédé d'équilibrage de charge, appareil, dispositif réseau et système
US8923303B2 (en) Method, system and installation for forwarding data transmission frames
US20120170581A1 (en) Policy homomorphic network extension
US11811901B2 (en) Platform agnostic abstraction for forwarding equivalence classes with hierarchy
CN109347734A (zh) 一种报文发送方法、装置、网络设备和计算机可读介质
WO2018024189A1 (fr) Procédé et appareil de détection de retour de boucle

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19870767

Country of ref document: EP

Kind code of ref document: A1

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 12/07/2021 )

122 Ep: pct application non-entry in european phase

Ref document number: 19870767

Country of ref document: EP

Kind code of ref document: A1