WO2022105625A1 - 报文转发的方法、装置、通信设备及可读存储介质 - Google Patents
报文转发的方法、装置、通信设备及可读存储介质 Download PDFInfo
- Publication number
- WO2022105625A1 WO2022105625A1 PCT/CN2021/129000 CN2021129000W WO2022105625A1 WO 2022105625 A1 WO2022105625 A1 WO 2022105625A1 CN 2021129000 W CN2021129000 W CN 2021129000W WO 2022105625 A1 WO2022105625 A1 WO 2022105625A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- sid
- current
- type
- list
- data packet
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000003860 storage Methods 0.000 title claims abstract description 22
- 238000004891 communication Methods 0.000 title claims abstract description 17
- 238000012545 processing Methods 0.000 claims description 20
- 238000003672 processing method Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 20
- 238000005516 engineering process Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 13
- 238000004590 computer program Methods 0.000 description 8
- 238000005538 encapsulation Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000010835 comparative analysis Methods 0.000 description 2
- 239000000796 flavoring agent Substances 0.000 description 2
- 235000019634 flavors Nutrition 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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/34—Source routing
-
- 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- 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
-
- 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/745—Address table lookup; Address filtering
Definitions
- the present disclosure relates to the field of communication technologies, and in particular, to a method, an apparatus, a communication device, and a readable storage medium for message forwarding.
- Segment Routing is a source routing technology. Based on the concept of Software Defined Network (SDN), it constitutes a path connection-oriented network architecture, supports the multi-level programmable requirements of future networks, and can meet the fifth The connection requirements in the application scenarios of ultra-large connections and slicing of the 5th generation (5G) communication technology.
- SR-Multi-Protocol Label Switching MPLS
- MPLS is an SR solution formed based on the current mainstream MPLS forwarding plane.
- SRv6 is an SR solution based on Internet Protocol Version 6 (Internet Protocol Version 6, IPv6) extensions. IPv6 technology has become the main technology of the new generation network. The long-term consideration of SRv6 based on IPv6 is the evolution trend of the future network. The research on the mechanism of SRv6 technology is a hot spot in the industry.
- the 128-bit (bit) segment identification (Segment ID, SID) of the standard SRv6 adopts the SID in the IPv6 address format. Compared with the SID in the MPLS label (Label) format, it has the routable attribute, which simplifies the creation of inter-domain paths and is implemented in the IPv6 network. Simplifies the ability to establish end-to-end paths.
- SRv6 SID supports programmability and can meet flexible network and service function processing. Combined with the collaborative support of centralized and distributed control planes, it can flexibly meet the needs of various services and network functions and meet the needs of network and service development. .
- SR encapsulates a series of instructions through the header node to guide the message through the network.
- an instruction is a 128-bit IPv6 address, as shown in Figure 1, which is the encapsulation format of the standard SRv6 extension header.
- the encapsulation length of the SRv6 extension header is: 40 bytes (Byte) (IPv6 header) + 8 Byte (Segment Routing Header (SRH)) + 16 ⁇ N Byte (Segment List (Segment List) )). Therefore, as the number of Sids specified by SRv6 increases, the additional overhead caused by SRv6 extension header encapsulation will be greater. In order to solve this problem, the function of shortening the SRv6 extension header needs to be implemented.
- SRv6 is an SR solution based on IPv6 extensions.
- the SRv6 solution is based on SRH, and its SID length is 128bit Segment ID. According to the 8-layer SID, it brings 128 bytes of overhead to the packets. For an application payload with an average length of 256 bytes, the overhead caused by SRv6 exceeds 1/3, and the bandwidth utilization rate drops below 67%. In the same scenario, the overhead of SR-MPLS is only 32 Bytes, and the bandwidth utilization rate is still 89%.
- Figure 2 The comparative analysis of the bearer efficiency of SRv6 and SR-MPLS when the number of SIDs ranges from 1 to 10 is shown in Figure 2 (only the overhead of SRH and SR-MPLS SIDs is simply compared):
- the increase in overhead results in a reduction in network utilization, and on the other hand, it brings greater support for deep packet load balancing, in-band telemetry (In-Band Telemetry), and Network Service Header (NSH). challenge.
- in-band Telemetry In-Band Telemetry
- NSH Network Service Header
- SRv6 In carrier applications, SRv6 needs to insert a field with a length of more than 128 Bytes into the packet on the network chip, which is equivalent to 32-layer MPLS-SR label depth, which exceeds the capability of the deployed network chip. If a loopback solution is used inside the chip solution, which will greatly reduce network performance and introduce higher latency and jitter. In redesigned network chips, supporting SRv6 requires further expansion of the internal processing bus bandwidth, which is a key factor in chip cost and power consumption.
- SRv6 requires the network chip to read the complete SRH at the intermediate node, and then extracts the segment to be processed according to the position indicated by the pointer and forwards it. Compared with MPLS-SR, which only needs to read the outermost label, the introduced complexity further increases the processing delay of the network chip.
- One objective of the embodiments of the present disclosure is to provide a method, apparatus, communication device, and readable storage medium for packet forwarding, so as to solve the problem of large overhead of SRv6 packets.
- a first aspect provides a packet processing method, executed by a first node, including:
- first information and second information of the first SID where the first information indicates the location of the container where the first SID is located in the SID list of the data packet, and the second information indicates that the first SID is located in the SID list of the data packet. the location in the container;
- the second SID is the next SID of the first SID in the SID list, and the second information is greater than or equal to 1 or equal to 0.
- the method further includes:
- copying the first SID and the second SID in the SID list to the destination address of the data packet, and sending the data packet includes:
- the type of the current SID is a global SID, and the type of the next SID is a local SID.
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, and the The first SID replaces the current SID, and the second SID replaces the next SID.
- the method further includes:
- the range of the global SID and the local SID of the first node is notified to other nodes through the IGP/BGP protocol.
- the destination address includes: the current SID and the next SID;
- Copying the first SID and the second SID in the SID list to the destination address of the data packet, and sending the data packet includes:
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, the first SID replaces the current SID, and the second SID does not replace the next SID;
- the type of the current SID is a global SID, and the type of the next SID is a global SID; or, the type of the current SID is a local SID, and the type of the next SID is a local SID; or, the The type of the current SID is the local SID, and the type of the next SID is the global SID.
- a device for processing a message including:
- an acquisition module configured to acquire first information and second information of the first segment identifying SID, the first information indicating the position of the container where the first SID is located in the SID list of the data packet, and the second information indicating the location of the first SID in the container;
- a first processing module configured to obtain the position of the first SID in the SID list according to the first information and the second information
- a sending module for copying the first SID and the second SID in the SID list to the current SID and the next SID in the destination address of the data packet, and sending the data packet;
- the second SID is the next SID of the first SID in the SID list, and the second information is greater than or equal to 1 or equal to 0.
- the device further includes:
- a second processing module configured to copy the first SID in the SID list to the current SID in the destination address of the data packet if the second information is equal to 1, and copy the first SID in the next SID Fill in the preset fields.
- the sending module is further used for:
- the type of the current SID is a global SID, and the type of the next SID is a local SID.
- the sending module is further configured to: judge whether the type of the current SID is a global SID, and whether the type of the next SID is a local SID; if the type of the current SID is a global SID, the next SID is The type of a SID is a local SID, then the first SID and the second SID in the SID list are copied to the destination address of the data packet, the first SID replaces the current SID, and the second SID Replace the next SID.
- the device further includes:
- the configuration module is used to uniformly configure the scope of global SID and local SID with other nodes;
- the range of the global SID and the local SID of the first node is notified to other nodes through the IGP/BGP protocol.
- the destination address includes: the current SID and the next SID;
- the sending module 1403 is further configured to: copy the first SID and the second SID in the SID list to the destination address of the data packet, the first SID replaces the current SID, and the second SID do not replace said next SID;
- the type of the current SID is a global SID, and the type of the next SID is a global SID; or, the type of the current SID is a local SID, and the type of the next SID is a local SID; or, the The type of the current SID is the local SID, and the type of the next SID is the global SID.
- a communication device comprising: a processor, a memory, and a program stored on the memory and executable on the processor, the program being executed by the processor to implement the first aspect the steps of the method.
- a readable storage medium is provided, and a program is stored on the readable storage medium, and when the program is executed by a processor, steps including the method of the first aspect are implemented.
- the SRv6 packet overhead can be effectively reduced, and the complexity of the network chip can be reduced.
- Figure 1 is a schematic diagram of the encapsulation format of a standard SRv6 extension header
- Figure 2 is a comparative analysis diagram of SR carrying efficiency with different SID numbers when the payload length is 256B;
- Figure 3 is a schematic diagram of the connection between the SR-MPLS network domain and the SRv6 network domain when the payload length is 256B;
- Figure 4 is a schematic diagram of the format supporting the short SRv6 SID
- Figure 5 is a schematic diagram of the 32-bits G-SID Container format
- Fig. 6 is the schematic diagram of SRv6 SID and G-SID mixed coding
- FIG. 7 is a flowchart of a method for forwarding a message in an embodiment of the present disclosure
- FIG. 8 is one of the schematic diagrams of the encapsulation format of a standard SRv6 extension header according to an embodiment of the present disclosure
- FIG. 9 is the second schematic diagram of the encapsulation format of the standard SRv6 extension header according to an embodiment of the present disclosure.
- FIG. 10 is one of the schematic diagrams of the destination address according to an embodiment of the present disclosure.
- FIG. 11 is the second schematic diagram of the destination address according to the embodiment of the disclosure.
- FIG. 12 is a third schematic diagram of a destination address according to an embodiment of the present disclosure.
- FIG. 13 is a fourth schematic diagram of a destination address according to an embodiment of the present disclosure.
- FIG. 14 is a schematic diagram of an apparatus for forwarding messages in an embodiment of the present disclosure.
- FIG. 15 is a schematic diagram of a medium communication device according to an embodiment of the disclosure.
- the SID format is regular, and the standard SRv6 SID format can be optimized by making full use of the rules of the SID format.
- a typical 32bit SRv6 short G-SID format is defined in this paper.
- the G-SID is composed of the node address (Node ID), function address (Function ID) and optional parameters (Argument, Args) in the standard 128bit SID.
- the standard 128-bit SID format is called the complete SID, and its definition follows the standard SRv6 SID; the 32-bit SID is a shortened G-SID, which is the changed part of the complete SID.
- the format is shown in Figure 4.
- G-SID 16bits
- G-SID 16bits
- G-SID N+F(Function)+A(Args) (optional);
- the G-SID plus the common prefix/address block can form a complete SRv6 SID.
- Common Prefix is 96bits
- G-SID is 32bits
- Common Prefix is 64bits
- G-SID is 32bits
- the remaining lower 32 bits are 0.
- G-SID Container which is a 128-bit value.
- a G-SID Container can contain:
- G-SIDs Multiple shortened SRv6 SIDs (G-SIDs), such as 4 G-SIDs of 32bits or 8 G-SIDs of 16bits.
- G-SID Container When multiple SIDs are mixed, 128bit alignment needs to be guaranteed. When the G-SID cannot be filled with 128 bits, Padding needs to be filled. Taking 32bits G-SID as an example, the possible format of G-SID Container is shown in Figure 5.
- this SRH is called X-SRH. It is an implementation of a new type of SRv6, called X-SRv6. The following content introduces the solution details of the data plane X-SRv6.
- SRv6 In order to support the mixing of multiple SIDs in one SRH, especially the G-SID and the standard SRv6 SID, a certain extension of the existing SRH is required.
- the control plane of SRv6 also needs to be extended to some extent.
- the data plane of X-SRv6 is first introduced here, and the extension scheme of its control plane is introduced later.
- An X-SRv6 path may consist of SRv6 subpaths and SRv6 shortened subpaths.
- SRv6 subpaths are encoded by SRv6 SIDs.
- the SRv6 short label sub-path starts with a 128-bit SRv6 SID that supports short labels, and consists of multiple short label SIDs (G-SIDs) that follow.
- G-SIDs short label SIDs
- words such as “exemplary” or “such as” are used to mean serving as an example, illustration, or illustration. Any embodiments or designs described in the embodiments of the present disclosure as “exemplary” or “such as” should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as “exemplary” or “such as” is intended to present the related concepts in a specific manner.
- the techniques described herein are not limited to 5th generation (5G) and subsequent evolved communication systems, and are not limited to Long Term Evolution (LTE)/LTE-Advanced (LTE-A) ) system, and can also be used in various wireless communication systems, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA) ), Orthogonal Frequency Division Multiple Access (OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA) and other systems.
- CDMA Code Division Multiple Access
- TDMA Time Division Multiple Access
- FDMA Frequency Division Multiple Access
- OFDMA Orthogonal Frequency Division Multiple Access
- SC-FDMA Single-carrier Frequency-Division Multiple Access
- a CDMA system may implement radio technologies such as CDMA2000, Universal Terrestrial Radio Access (UTRA).
- UTRA includes Wideband Code Division Multiple Access (WCDMA) and other CDMA variants.
- a TDMA system may implement a radio technology such as the Global System for Mobile Communication (GSM).
- OFDMA system can realize such as Ultra Mobile Broadband (UMB), Evolved UTRA (Evolution-UTRA, E-UTRA), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Fast Orthogonal Frequency Division multiplexing technology (Flash-OFDM) and other radio technologies.
- UMB Ultra Mobile Broadband
- Evolution-UTRA Evolved UTRA
- E-UTRA IEEE 802.11
- WiMAX IEEE 802.16
- Flash-OFDM Flash-OFDM
- UTRA and E-UTRA are part of the Universal Mobile Telecommunications System (UMTS).
- LTE and higher LTE are new UMTS releases that use E-UTRA.
- UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from an organization named "3rd Generation Partnership Project” (3GPP).
- CDMA2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2" (3GPP2).
- the techniques described herein may be used for both the systems and radio technologies mentioned above, as well as for other systems and radio technologies.
- an embodiment of the present disclosure provides a packet processing method, which is executed by a first node, and the specific steps include: step 701 , step 702 , and step 703 .
- Step 701 Obtain first information and second information of a first SID, where the first information indicates the position of the container where the first SID is located in the SID list of a data packet, and the second information indicates the first SID. the location of the SID in said container;
- Step 702 Obtain the position of the first SID in the SID list according to the first information and the second information;
- Step 703 Copy the first SID and the second SID in the SID list to the current SID and the next SID in the destination address of the data packet, and send the data packet;
- the second SID is the next SID of the first SID in the SID list, and the second information is greater than or equal to 1 or equal to 0.
- the method further includes: if the second information is equal to 1, copying the first SID in the SID list to the current SID in the destination address of the data packet, and Preset fields are populated in the next SID.
- the copying the first SID and the second SID in the SID list to the destination address of the data packet, and sending the data packet includes:
- the type of the current SID is a global SID, and the type of the next SID is a local SID.
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, the first SID replaces the current SID, and the second SID replaces the the next SID, including:
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, and the The first SID replaces the current SID, and the second SID replaces the next SID.
- the method further includes:
- the range of the global SID and the local SID of the first node is notified to other nodes through the IGP/BGP protocol.
- the destination address includes: the current SID and the next SID;
- Copying the first SID and the second SID in the SID list to the destination address of the data packet, and sending the data packet includes:
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, the first SID replaces the current SID, and the second SID does not replace the next SID;
- the type of the current SID is a global SID, and the type of the next SID is a global SID; or, the type of the current SID is a local SID, and the type of the next SID is a local SID; or, the The type of the current SID is the local SID, and the type of the next SID is the global SID.
- the SRv6 packet overhead can be effectively reduced, and the complexity of the network chip can be reduced.
- a domain is added to the IPv6 destination address, and the domain is located at any position after the G-SID, for example, it can be followed by the G-SID, or it can be the last few digits of the destination address.
- This field is G-SID Index (hereinafter referred to as SI), which identifies the position index of the G-SID in the container indicated by the current SL.
- the field can be of a specified length.
- the minimum length of this field is related to the number of G-SIDs that can be accommodated in a container.
- the length of the G-SID is 32, and 4 G-SIDs can be placed in a container, and the SI requires at least 2 bits.
- SI is used to indicate the position of the G-SID in each 128bit G-SID container. If the G-SID uses 32bit compressed SID, the SI value is 0-3; if the G-SID uses 16bit compressed SID, the SI value 0-7.
- the compressed SIDs are divided into two categories, one category identifies the global SID, such as the END SID, whose value is taken from the global SID set (GIB); the other category is the local SID, such as Specifies the END.X SID of the link or the END.DT SID of the VPN context, whose value is taken from the local SID set (LIB).
- GEB global SID set
- LIB local SID set
- the first G-SID belongs to GIB
- the second G-SID belongs to LIB
- the operation of two G-SIDs on the same node can be completed through one table lookup
- the two connected G-SIDs that replace DA belong to GIB, and NEXT G-SIDs belong to invalid replacement
- the two connected G-SIDs that replace the DA belong to the LIB, and the NEXT G-SIDs belong to the invalid replacement
- Option 1 No pre-judgment before copying G-SID, as long as the SI meets the requirements, copy (copy) the two connected G-SIDs.
- the NEXT G-SID is invalid.
- DA the NEXT G-SID becomes the current G-SID and continues to be used.
- Option 2 Pre-judgment before copying G-SID, only when the current G-SID belongs to GIB and the NEXT G-SID belongs to LIB, replace the two connected G-SIDs to DA.
- Each network node uniformly defines the range of GIB and LIB, such as 16-bit compressed SID, 0x0000-0xDFFF belongs to GIB, 0xE000-0xFFFF belongs to LIB: the forwarding plane of each node can be directly judged
- Each network node defines the range of GIB and LIB, and announces through the IGP/BGP protocol on the control plane: the control plane of each node can determine whether the G-SID belongs to the GIB or LIB range, but the forwarding plane cannot perform pre-judgment without this information.
- an embodiment of the present disclosure provides an apparatus for processing a packet, and the apparatus 1400 includes:
- the obtaining module 1401 is used to obtain the first information and second information of the first segment identifying the SID, the first information indicating the position of the container where the first SID is located in the SID list of the data packet, and the second information indicating the location of the first SID in the container;
- a first processing module 1402 configured to obtain the position of the first SID in the SID list according to the first information and the second information;
- the second SID is the next SID of the first SID in the SID list, and the second information is greater than or equal to 1 or equal to 0.
- the apparatus 1400 further includes:
- a second processing module configured to copy the first SID in the SID list to the current SID in the destination address of the data packet if the second information is equal to 1, and copy the first SID in the next SID Fill in the preset fields.
- the sending module 1403 is further configured to: copy the first SID and the second SID in the SID list to the destination address of the data packet, and the first SID replaces the current SID, The second SID replaces the next SID, wherein the type of the current SID is the global SID, and the type of the next SID is the local SID.
- the sending module 1403 is further configured to: determine whether the type of the current SID is a global SID, and whether the type of the next SID is a local SID;
- the first SID and the second SID in the SID list are copied to the destination address of the data packet, and the The first SID replaces the current SID, and the second SID replaces the next SID.
- the apparatus 1400 further includes: a configuration module, configured to uniformly configure the scope of the global SID and the local SID with other nodes; or, configure the scope of the global SID and the local SID of the first node; The range of the global SID and the local SID of the first node is notified to other nodes through the IGP/BGP protocol.
- a configuration module configured to uniformly configure the scope of the global SID and the local SID with other nodes; or, configure the scope of the global SID and the local SID of the first node; The range of the global SID and the local SID of the first node is notified to other nodes through the IGP/BGP protocol.
- the destination address includes: the current SID and the next SID; the sending module 1403 is further configured to: copy the first SID and the second SID in the SID list to the destination address of the data packet wherein, the first SID replaces the current SID, and the second SID does not replace the next SID; wherein, the type of the current SID is a global SID, and the type of the next SID is a global SID; or , the type of the current SID is a local SID, and the type of the next SID is a local SID; or, the type of the current SID is a local SID, and the type of the next SID is a global SID.
- the apparatus provided by this embodiment of the present disclosure can execute the above-mentioned method embodiment shown in FIG. 7 , and the implementation principle and technical effect thereof are similar, and details are not described herein again in this embodiment.
- Embodiments of the present disclosure also provide a communication device.
- the communication device 1500 includes: an antenna 1501 , a radio frequency device 1502 , and a baseband device 1503 .
- the antenna 1501 is connected to the radio frequency device 1502 .
- the radio frequency device 1502 receives information through the antenna 1501, and sends the received information to the baseband device 1503 for processing.
- the baseband device 1503 processes the information to be sent and sends it to the radio frequency device 1502
- the radio frequency device 1502 processes the received information and sends it out through the antenna 1501 .
- the above radio frequency apparatus 1502 may be located in the baseband apparatus 1503 , and the method performed by the communication device in the above embodiments may be implemented in the baseband apparatus 1503 , and the baseband apparatus 1503 includes a processor 1504 and a memory 1505 .
- the baseband device 1503 may include, for example, at least one baseband board on which multiple chips are arranged, as shown in FIG. 15 , one of the chips is, for example, the processor 1504 , which is connected to the memory 1505 to call the program in the memory 1505 to execute The communication devices shown in the above method embodiments operate.
- the baseband device 1503 may further include a network interface 1506 for exchanging information with the radio frequency device 1502, the interface being, for example, Common Public Radio Interface (CPRI).
- CPRI Common Public Radio Interface
- the communication device in the embodiment of the present disclosure further includes: an instruction or program stored in the memory 1505 and executable on the processor 1504, and the processor 1504 invokes the instruction or program in the memory 1505 to execute each module shown in FIG. 14 to execute method, and achieve the same technical effect, in order to avoid repetition, it is not repeated here.
- An embodiment of the present disclosure further provides a readable storage medium, where a program or an instruction is stored on the readable storage medium, and when the program or instruction is executed by a processor, each process of the method embodiment shown in FIG. To achieve the same technical effect, in order to avoid repetition, details are not repeated here.
- the processor is the processor in the terminal described in the foregoing embodiment.
- the readable storage medium includes a computer-readable storage medium, such as a computer read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.
- the steps of the method or algorithm described in conjunction with the disclosure of the present disclosure may be implemented in a hardware manner, or may be implemented in a manner of executing software instructions on a processor.
- Software instructions can be composed of corresponding software modules, and software modules can be stored in RAM, flash memory, ROM, Erasable Programmable Read-Only Memory (EPROM, Erasable Programmable Read-Only Memory), Electrically Erasable Programmable Read-Only Memory (Electrically Erasable Programmable Read Only Memory, EEPROM), registers, hard disks, removable hard disks, CD-ROMs, or any other form of storage medium known in the art.
- An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium.
- the storage medium can also be an integral part of the processor.
- the processor and the storage medium may be carried in an Application Specific Integrated Circuit (ASIC).
- ASIC Application Specific Integrated Circuit
- the ASIC may be carried in the core network interface device.
- the processor and the storage medium may also exist in the core network interface device as discrete components.
- the functions described in this disclosure may be implemented in hardware, software, firmware, or any combination thereof.
- the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
- Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
- a storage medium can be any available medium that can be accessed by a general purpose or special purpose computer.
- embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, embodiments of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present disclosure may take the form of a computer program product implemented on one or more computer-usable storage media having computer-usable program code embodied therein, including but not limited to disk storage, CD-ROM, optical storage, and the like.
- Embodiments of the present disclosure are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present disclosure. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.
- These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions
- the apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims (14)
- 一种报文处理的方法,由第一节点执行,所述方法包括:获取第一段标识SID的第一信息和第二信息,所述第一信息指示所述第一SID所在的容器在数据包的SID列表中的位置,所述第二信息指示所述第一SID在所述容器中的位置;根据所述第一信息和第二信息,得到所述第一SID在SID列表中的位置;将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中的当前SID和下一个SID,发送所述数据包;其中,所述第二SID为所述SID列表中第一SID的下一个SID,所述第二信息大于等于1或等于0。
- 根据权利要求1所述的方法,其中,所述方法还包括:如果所述第二信息等于1,则将所述SID列表中的所述第一SID复制到数据包的目的地址中的所述当前SID,并在所述下一个SID中填充预设字段。
- 根据权利要求1所述的方法,其中,所述将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,发送所述数据包,包括:将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID替换所述下一个SID,其中,所述当前SID的类型为全局SID,所述下一个SID的类型为本地SID。
- 根据权利要求3所述的方法,其中,将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID替换所述下一个SID,包括:判断所述当前SID的类型是否为全局SID,所述下一个SID的类型是否为本地SID;如果所述当前SID的类型为全局SID,所述下一个SID的类型为本地SID,则将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID替换所述下一个SID。
- 根据权利要求4所述的方法,其中,所述方法还包括:与其他节点统一配置全局SID和本地SID的范围;或者,配置所述第一节点的全局SID和本地SID的范围;将所述第一节点的全局SID和本地SID的范围通过IGP/BGP协议通知给其他节点。
- 根据权利要求1所述的方法,其中,所述目的地址包括:当前SID和下一个SID;所述将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,发送所述数据包,包括:将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID不替换所述下一个SID;其中,所述当前SID的类型为全局SID,所述下一个SID的类型为全局SID;或者,所述当前SID的类型为本地SID,所述下一个SID的类型为本地SID;或者,所述当前SID的类型为本地SID,所述下一个SID的类型为全局SID。
- 一种报文处理的装置,包括:获取模块,用于获取第一段标识SID的第一信息和第二信息,所述第一信息指示所述第一SID所在的容器在数据包的SID列表中的位置,所述第二信息指示所述第一SID在所述容器中的位置;第一处理模块,用于根据所述第一信息和第二信息,得到所述第一SID在SID列表中的位置;发送模块,用于将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中的当前SID和下一个SID,发送所述数据包;其中,所述第二SID为所述SID列表中第一SID的下一个SID,所述第二信息大于等于1或等于0。
- 根据权利要求7所述的装置,其中,所述装置还包括:第二处理模块,用于如果所述第二信息等于1,则将所述SID列表中的所述第一SID复制到数据包的目的地址中的所述当前SID,并在所述下一个SID中填充预设字段。
- 根据权利要求7所述的装置,其中,所述发送模块进一步用于:将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID替换所述下一个SID,其中,所述当前SID的类型为全局SID,所述下一个SID的类型为本地SID。
- 根据权利要求9所述的装置,其中,所述发送模块进一步用于:判断所述当前SID的类型是否为全局SID,所述下一个SID的类型是否为本地SID;如果所述当前SID的类型为全局SID,所述下一个SID的类型为本地SID,则将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID替换所述下一个SID。
- 根据权利要求9所述的装置,其中,所述装置设置在第一节点中,所述装置还包括:配置模块,用于与其他节点统一配置全局SID和本地SID的范围;或者,配置所述第一节点的全局SID和本地SID的范围;将所述第一节点的全局SID和本地SID的范围通过IGP/BGP协议通知给其他节点。
- 根据权利要求7所述的装置,其中,所述目的地址包括:当前SID和下一个SID;所述发送模块1403进一步用于:将所述SID列表中的所述第一SID和第二SID复制到数据包的目的地址中,所述第一SID替换所述当前SID,所述第二SID不替换所述下一个SID;其中,所述当前SID的类型为全局SID,所述下一个SID的类型为全局SID;或者,所述当前SID的类型为本地SID,所述下一个SID的类型为本地SID;或者,所述当前SID的类型为本地SID,所述下一个SID的类型为全局SID。
- 一种通信设备,包括:处理器、存储器及存储在所述存储器上并可在所述处理器上运行的程序,其中,所述程序被所述处理器执行时实现如权利要求1至6中任一项所述的方法的步骤。
- 一种可读存储介质,所述可读存储介质上存储有程序,其中,所述 程序被处理器执行时实现包括如权利要求1至6中任一项所述的方法的步骤。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP21893772.0A EP4250608A4 (en) | 2020-11-23 | 2021-11-05 | PACKET FORWARDING METHOD AND APPARATUS, COMMUNICATIONS DEVICE AND READABLE STORAGE MEDIUM |
US18/254,008 US20240048478A1 (en) | 2020-11-23 | 2021-11-05 | Message forwarding method and apparatus, communication device, and readable storage medium |
AU2021384675A AU2021384675B2 (en) | 2020-11-23 | 2021-11-05 | Message Forwarding Method and Apparatus, Communication Device, and Readable Storage Medium |
CA3202724A CA3202724A1 (en) | 2020-11-23 | 2021-11-05 | Message forwarding method and apparatus, communication device, and readable storage medium |
JP2023531074A JP7547635B2 (ja) | 2020-11-23 | 2021-11-05 | メッセージ転送方法、装置、通信機器及び可読記憶媒体 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011321949.3 | 2020-11-23 | ||
CN202011321949.3A CN114531386B (zh) | 2020-11-23 | 2020-11-23 | 报文转发的方法、装置、设备及可读存储介质 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022105625A1 true WO2022105625A1 (zh) | 2022-05-27 |
Family
ID=81619868
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2021/129000 WO2022105625A1 (zh) | 2020-11-23 | 2021-11-05 | 报文转发的方法、装置、通信设备及可读存储介质 |
Country Status (7)
Country | Link |
---|---|
US (1) | US20240048478A1 (zh) |
EP (1) | EP4250608A4 (zh) |
JP (1) | JP7547635B2 (zh) |
CN (1) | CN114531386B (zh) |
AU (1) | AU2021384675B2 (zh) |
CA (1) | CA3202724A1 (zh) |
WO (1) | WO2022105625A1 (zh) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111541613A (zh) * | 2020-04-27 | 2020-08-14 | 鹏城实验室 | 一种基于SRv6的数据处理方法及相关设备 |
CN112583745A (zh) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | 一种在sr网络中转发报文的方法、设备和系统 |
CN113556284A (zh) * | 2020-04-24 | 2021-10-26 | 中国移动通信有限公司研究院 | 数据包处理的方法及设备 |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5822308B2 (ja) * | 2012-11-29 | 2015-11-24 | Necプラットフォームズ株式会社 | パケット転送方法、パケット転送装置およびパケット転送プログラム |
JP6085263B2 (ja) | 2014-02-25 | 2017-02-22 | 日本電信電話株式会社 | 中継ノード及び経路制御方法 |
US10263881B2 (en) * | 2016-05-26 | 2019-04-16 | Cisco Technology, Inc. | Enforcing strict shortest path forwarding using strict segment identifiers |
US10506083B2 (en) * | 2017-06-27 | 2019-12-10 | Cisco Technology, Inc. | Segment routing gateway storing segment routing encapsulating header used in encapsulating and forwarding of returned native packet |
CN110661706B (zh) | 2018-06-30 | 2021-02-12 | 华为技术有限公司 | 一种传输路径故障的处理方法、装置及系统 |
WO2020048493A1 (en) * | 2018-09-05 | 2020-03-12 | Huawei Technologies Co., Ltd. | Segment routing in mpls network |
CN111510386B (zh) * | 2019-01-30 | 2023-06-20 | 华为技术有限公司 | 用于处理报文的方法和装置 |
CN113645136B (zh) * | 2019-03-11 | 2022-12-06 | 华为技术有限公司 | 网络中报文转发的方法、网络节点、网络系统 |
CN111917640B (zh) * | 2019-05-09 | 2023-06-06 | 华为技术有限公司 | SRv6网络生成段列表、报文转发的方法、设备和系统 |
US11412071B2 (en) * | 2019-05-13 | 2022-08-09 | Juniper Networks, Inc. | Compressed routing header information for networks |
CN111628995B (zh) * | 2020-05-26 | 2023-06-16 | 新华三信息安全技术有限公司 | 基于SRv6的SID压缩方法、装置、设备及存储介质 |
CN111935014B (zh) * | 2020-10-19 | 2020-12-29 | 网络通信与安全紫金山实验室 | 基于SRv6网络的报文转发方法、装置、存储介质及电子设备 |
-
2020
- 2020-11-23 CN CN202011321949.3A patent/CN114531386B/zh active Active
-
2021
- 2021-11-05 AU AU2021384675A patent/AU2021384675B2/en active Active
- 2021-11-05 CA CA3202724A patent/CA3202724A1/en active Pending
- 2021-11-05 US US18/254,008 patent/US20240048478A1/en active Pending
- 2021-11-05 JP JP2023531074A patent/JP7547635B2/ja active Active
- 2021-11-05 WO PCT/CN2021/129000 patent/WO2022105625A1/zh active Application Filing
- 2021-11-05 EP EP21893772.0A patent/EP4250608A4/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112583745A (zh) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | 一种在sr网络中转发报文的方法、设备和系统 |
CN113556284A (zh) * | 2020-04-24 | 2021-10-26 | 中国移动通信有限公司研究院 | 数据包处理的方法及设备 |
CN111541613A (zh) * | 2020-04-27 | 2020-08-14 | 鹏城实验室 | 一种基于SRv6的数据处理方法及相关设备 |
Non-Patent Citations (3)
Title |
---|
See also references of EP4250608A4 * |
Z LI , C LI , S PENG , Z WANG , B LIU , HUAWEI TECHNOLOGIES: "Compressed SRv6 Network Programming draft-li-spring-compressed-srv6-np-00", INTERNET DRAFT, 22 July 2019 (2019-07-22), pages 1 - 15, XP015134411 * |
Z. LI C. LI HUAWEI TECHNOLOGIES W. CHENG CHINA MOBILE C. XIE C. LI CHINA TELECOM H. TIAN F. ZHAO CAICT: "Generalized Segment Routing Header; draft-lc-6man-generalized-srh-01.txt", GENERALIZED SEGMENT ROUTING HEADER; DRAFT-LC-6MAN-GENERALIZED-SRH-01.TX, no. 1, 13 August 2020 (2020-08-13), pages 1 - 21, XP015141281 * |
Also Published As
Publication number | Publication date |
---|---|
EP4250608A4 (en) | 2024-05-29 |
CA3202724A1 (en) | 2022-05-27 |
JP7547635B2 (ja) | 2024-09-09 |
CN114531386A (zh) | 2022-05-24 |
AU2021384675B2 (en) | 2024-06-13 |
JP2023550512A (ja) | 2023-12-01 |
EP4250608A1 (en) | 2023-09-27 |
AU2021384675A1 (en) | 2023-07-06 |
CN114531386B (zh) | 2023-05-09 |
US20240048478A1 (en) | 2024-02-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11201820B2 (en) | Segment routing in MPLS network | |
US11510131B2 (en) | Configuration method, data transmission method, and apparatus | |
WO2021155759A1 (zh) | 分段标识的处理方法及设备 | |
JP6619815B2 (ja) | アクセス制御装置、システム、及び方法 | |
CN112368980B (zh) | 用于将一个或多个在网业务添加到mpls网络中的方法 | |
US8797947B2 (en) | Packet forwarding in telecommunication network | |
WO2021213507A1 (zh) | 数据包处理的方法及设备 | |
BR112019015657B1 (pt) | Método para executar qualidade de serviço (qos) reflexiva em sistema de comunicação sem fio e um dispositivo para o mesmo | |
WO2018126692A1 (zh) | 数据传输的控制方法和设备 | |
WO2021151381A1 (zh) | 分段标识的处理方法及设备 | |
JP2022500915A (ja) | 通信方法、デバイス、及びシステム | |
CN114128227B (zh) | 在支持SRv6的数据面上传输MTNC-ID以实现5G传输 | |
US20240073128A1 (en) | Message encapsulation and de-encapsulation method and device, storage medium, and electronic device | |
CN114365540B (zh) | 通信方法、设备及系统 | |
KR20220160648A (ko) | 인터넷 프로토콜 버전 IPv6 기반 무선 네트워크 통신 방법 및 통신 디바이스 | |
WO2022105625A1 (zh) | 报文转发的方法、装置、通信设备及可读存储介质 | |
EP3739846B1 (en) | Communication method and apparatus | |
RU2461131C2 (ru) | Сервер, система передачи и реализуемый ими способ переноса инкапсуляции по gre-туннелю | |
EP4246917A1 (en) | Message transmission method, method for acquiring correspondence, and apparatus and system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref document number: 3202724 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2023531074 Country of ref document: JP Ref document number: 18254008 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 202327037830 Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2021893772 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2021893772 Country of ref document: EP Effective date: 20230623 |
|
ENP | Entry into the national phase |
Ref document number: 2021384675 Country of ref document: AU Date of ref document: 20211105 Kind code of ref document: A |