WO2023273842A1 - 报文转发方法、装置、存储介质和电子设备 - Google Patents

报文转发方法、装置、存储介质和电子设备 Download PDF

Info

Publication number
WO2023273842A1
WO2023273842A1 PCT/CN2022/098232 CN2022098232W WO2023273842A1 WO 2023273842 A1 WO2023273842 A1 WO 2023273842A1 CN 2022098232 W CN2022098232 W CN 2022098232W WO 2023273842 A1 WO2023273842 A1 WO 2023273842A1
Authority
WO
WIPO (PCT)
Prior art keywords
label
message
forwarded
target
time slice
Prior art date
Application number
PCT/CN2022/098232
Other languages
English (en)
French (fr)
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 中兴通讯股份有限公司
Priority to BR112023026035A priority Critical patent/BR112023026035A2/pt
Priority to EP22831662.6A priority patent/EP4351222A1/en
Publication of WO2023273842A1 publication Critical patent/WO2023273842A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851—Systems using a satellite or space-based relay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/18578—Satellite systems for providing broadband data service to individual earth stations

Definitions

  • Embodiments of the present disclosure relate to the communication field, and in particular, relate to a message forwarding method, device, storage medium, and electronic equipment.
  • Embodiments of the present disclosure provide a message forwarding method, device, storage medium and electronic equipment, so as to at least solve the problem of message forwarding failure in the related art.
  • a message forwarding method including: in the case of obtaining the message to be forwarded, searching for the message to be forwarded from the current label forwarding table corresponding to the current time slice or the current topology If the above-mentioned incoming label is not found in the above-mentioned current label forwarding table, search for the above-mentioned incoming label from the target time slice or the target label forwarding table corresponding to the target topology; In the case of a label, forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the above target label forwarding table.
  • a device for forwarding a message including: a first search unit configured to forward a message from the current time slice or the current label corresponding to the current topology when the message to be forwarded is obtained; Find the incoming label of the message to be forwarded during publishing; the second search unit is set to search for the incoming label from the target label forwarding table corresponding to the target time slice or target topology when the incoming label is not found in the current label forwarding table ; The forwarding unit is configured to forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table when the incoming label is found from the target time slice.
  • a computer-readable storage medium in which a computer program is stored in the above-mentioned computer-readable storage medium, wherein the above-mentioned computer program is configured to execute any one of the above-mentioned method embodiments when running in the steps.
  • 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 any one of the above method embodiments in the steps.
  • the target time slice look up the incoming label of the packet to be forwarded in the target label forwarding table of the target topology, and complete the forwarding of the packet without directly discarding the incoming packet. Therefore, the problem of packet forwarding failure can be solved and the efficiency of packet forwarding can be improved. Effect.
  • FIG. 1 is a hardware environment diagram of a message forwarding method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of a message forwarding method according to an embodiment of the present disclosure
  • Fig. 3 is a schematic diagram of labels according to a message forwarding method according to an embodiment of the present disclosure
  • FIG. 4 is a flowchart of a message forwarding method according to an embodiment of the present disclosure
  • FIG. 5 is a flowchart of a message forwarding method according to an embodiment of the present disclosure.
  • FIG. 6 is a mapping diagram of a message forwarding method according to an embodiment of the present disclosure.
  • FIG. 7 is a topology diagram of a message forwarding method according to an embodiment of the present disclosure.
  • FIG. 8 is a topology diagram of a message forwarding method according to an embodiment of the present disclosure.
  • FIG. 9 is a topology diagram of a message forwarding method according to an embodiment of the present disclosure.
  • FIG. 10 is a topology diagram of a message forwarding method according to an embodiment of the present disclosure.
  • Fig. 11 is a structural block diagram of a message forwarding device according to an embodiment of the present disclosure.
  • FIG. 1 is a block diagram of a hardware structure of a mobile terminal according to a message forwarding method according to an embodiment of the present disclosure.
  • the mobile terminal may include one or more (only one is shown in Figure 1) processors 102 (processors 102 may include but not limited to processing devices such as microprocessor MCU or programmable logic device FPGA, etc.) and a memory 104 for storing data, wherein the above-mentioned mobile terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • processors 102 may include but not limited to processing devices such as microprocessor MCU or programmable logic device FPGA, etc.
  • a memory 104 for storing data
  • the above-mentioned mobile terminal may also include a transmission device 106 and an input and output device 108 for communication functions.
  • the structure shown in FIG. 1 is only for illustration, and it does not limit the structure of the above mobile terminal.
  • the mobile terminal may also include more or fewer components than those shown in FIG.
  • the memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the message forwarding method in the embodiment of the present disclosure, and the processor 102 executes the computer program stored in the memory 104 by running the computer program Various functional applications and data processing are to realize the above-mentioned method.
  • the 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 a memory that is remotely located relative to the processor 102, and these remote memories may be connected to the mobile terminal through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the transmission device 106 is used to receive or transmit data via a network.
  • the specific example of the above network may include a wireless network provided by the communication provider of the mobile terminal.
  • the transmission device 106 includes a 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, referred to as RF) module, which is used to communicate with the Internet in a wireless manner.
  • RF Radio Frequency
  • FIG. 2 is a flowchart of a message forwarding method according to an embodiment of the present disclosure. As shown in FIG. 2 , the process includes the following steps:
  • Step S202 in the case of obtaining the message to be forwarded, look up the incoming label of the message to be forwarded from the current label forwarding table corresponding to the current time slice or the current topology;
  • Step S204 in the case that no incoming tag is found in the current tag forwarding table, search for the incoming tag from the target tag forwarding table corresponding to the target time slice or target topology;
  • Step S206 if the incoming label is found from the target time slice, forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table.
  • the incoming label of the packet to be forwarded can be searched from the current label forwarding table corresponding to the current time slice or the current topology. label, the packet to be forwarded can be forwarded according to the outgoing label corresponding to the incoming label in the current label forwarding table. And if the incoming label of the packet to be forwarded cannot be found in the current label forwarding table, it means that the time slot has changed, and the incoming label can be found in other time slots, that is, the target time slice or the target label forwarding table corresponding to the target topology , forward the packet to be forwarded through the outgoing label corresponding to the incoming label. This avoids the situation that packets are discarded due to time slot changes.
  • the method before obtaining the message to be forwarded, the method further includes:
  • the label forwarding path corresponding to each time slice is obtained.
  • the corresponding topological path can be calculated, and the label forwarding path corresponding to each time slice can be obtained according to the topological path, and the topological paths calculated for different time slices may be the same or different.
  • the previous node and the next node of each node are determined according to the topology path, and the label forwarding path is determined.
  • searching for the incoming label of the packet to be forwarded from the current label forwarding table corresponding to the current time slice includes:
  • the target label of the message to be forwarded determine whether the message to be forwarded is an ordinary message or a satellite message
  • the incoming label is searched from the current label forwarding table.
  • a target label may be added to the message to be forwarded, and the target label indicates whether the message to be forwarded is an ordinary message or a satellite message. If the target label identifies the message to be forwarded as a satellite message, search for the incoming label of the message to be forwarded.
  • the target identifier can be a different character string, identifying whether the message to be forwarded is a normal message or a satellite message.
  • the method before parsing the target label of the packet to be forwarded, the method further includes:
  • the first message is obtained by analyzing the message to be forwarded, it is determined that the message to be forwarded includes the target label, wherein the first message can be but not limited to be located before the target label, and the first message can be but not limited to be 15 ;
  • the packet to be forwarded does not include the target label.
  • a first message may be used to identify whether the message to be forwarded includes the target label.
  • the first tag may be a tag whose recognition takes a long time or which consumes less resources. By identifying the first label, it can be quickly identified whether the target label is included in the message to be forwarded. If the target label is not included, it means that the message to be forwarded is not an ordinary message or a satellite message, and the message to be forwarded is not forwarded.
  • searching for the incoming label from the target label forwarding table corresponding to the target time slice includes:
  • the above M is the number of time slices in one cycle. For example, there are 5 time slices in a period, and each time slice corresponds to a label forwarding table. If the incoming label of the message to be forwarded is not found in a certain time slice, wait for M-1 time periods, and then the label forwarding tables of other time slices have been determined. At this point, you can look up the incoming tags from there.
  • the air-space-ground integrated network architecture is one of the core directions of 6G, and is listed as one of the seven key network requirements by the International Telecommunication Union (ITU).
  • the 6G air-space-ground integrated network architecture will be based on the terrestrial cellular mobile network, combined with the wide coverage, flexible deployment, and efficient broadcasting characteristics of broadband satellite communications, and achieve full coverage of sea, land, and air through the deep integration of various heterogeneous networks. Markets such as marine, airborne, transnational, and space-ground integration bring new opportunities.
  • the air-space-ground integrated network is formed by the interconnection of space-based information network, ground Internet and mobile communication network.
  • the space-based information network consists of a series of high-, medium-, and low-orbit satellites, and uses inter-satellite data links between satellites to realize inter-satellite communication.
  • the application can be applied in the air-space-ground integrated network, especially on the router/switch of the low-orbit satellite constellation with the inter-satellite link.
  • the controller will calculate the topology path in each time slice, and generate the label forwarding path in each topology (MPLS, SR-MPLS).
  • This application defines a new type of satellite label, which adds a time slice attribute (or topology attribute) to the ordinary label format. Through the time slice identification ID/topology identification ID in the label, it can be known that the label flow is from Which time slice/topology is sent. As shown in Figure 2, there are 5 domains in the satellite tag:
  • Topology number 8bits, which identifies the number of the discrete topology and is also the number of the time slice.
  • the 8bit here is a suggested value, which can be customized according to the scale of the time slice;
  • Label value 12bits, which identifies the label number in the current topology.
  • EXP 3bits, can support QoS.
  • MPLS The bottom mark of the stack.
  • MPLS supports multi-layer labels, that is, label embedding. When the S value is 1, it indicates the bottom label.
  • TTL 8bits, used to indicate the maximum number of network segments allowed to pass before the IP packet is discarded by the router.
  • a satellite When a satellite receives a tag message, it needs to distinguish whether the tag (target tag) in the message is a normal tag or a satellite tag. Therefore, a special tag (the first tag) needs to be added in front of the satellite tag.
  • the tag value can be 15;
  • the format of this label is the same as that of ordinary labels, and it is used to indicate that the satellite knows that it is a special satellite label when processing the label message.
  • Figure 3 is a schematic diagram.
  • the controller will map between the label forwarding tables in each time slice (corresponding to the discrete topology), that is, the label 2001 of the T2 time slice and the labels of the T1, T3,,, Tn time slices are mapped one-to-one , as shown in Figure 6 is a mapping table of T2 time slices and T1 time slices.
  • 02:2000 represents the incoming label assigned by the satellite packet forwarding device in the T2 time slice.
  • the previous method is to directly search the label forwarding table of the current time slice, that is, the T2 time slice, and discard it if it cannot be found, or search An incorrect outgoing label will cause the message to be sent to the wrong satellite network node, which will eventually lead to uncontrollable security problems.
  • check the time slice attribute of the label header to determine whether the time when the message departs from the source node belongs to the current time slice. If yes, directly search the label forwarding table of the current time slice, if not, check the topology mapping table of the T2 time slice, and find the corresponding outgoing label for subsequent forwarding.
  • the message data starts from the satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite;
  • the satellite R2 After the satellite R2 receives the label message, it first checks the top label of the stack and finds that it is 15, then it knows that the subsequent label is a satellite label. After stripping off the 15th label, it searches for the next satellite label and finds that it belongs to the T1 time slice;
  • Satellite D receives the message and finds that the message is destined for itself, and the forwarding ends.
  • the message data starts from the satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite;
  • Satellite D receives the message and finds that the destination of the message is itself, and the forwarding ends.
  • the data message starts from the satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite;
  • the satellite R2 After the satellite R2 receives the label message, it first checks the top label of the stack and finds that it is 15, then it knows that the subsequent label is a satellite label, and searches for the next satellite label and finds that it is T1;
  • Satellite D receives the message and finds that the message is destined for itself, and the forwarding ends.
  • the modified SR-MPLS label forwarding process is illustrated by taking the inconsistent time slice after the packet arrives as an example.
  • a network topology switch occurs during the hop-by-hop forwarding of packets from the source node to the destination node. As shown in Figure 10.
  • the message data starts from the satellite router R1 and is sent to the destination address satellite D. Before the message is sent, the label forwarding table and label mapping table on the satellite have been calculated on the controller and uploaded to the satellite;
  • the satellite R2 After the satellite R2 receives the label message, it first checks the label on the top of the stack and finds that it is 15, then it knows that the subsequent label is a satellite label, and searches for the next satellite label and finds that it is T1;
  • R3 After receiving it, R3 repeats the operation (4), pops up the label 02: 2020, and sends it to the destination satellite D;
  • Satellite D receives the message, pops up labels 15 and 02: 2030, and finds that the message is destined for itself, and the forwarding ends.
  • the method according to the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is Better implementation.
  • the technical solution of the present disclosure can be embodied in the form of a software product in essence or the part that contributes to the prior art, and the computer software product is stored in a storage medium (such as ROM/RAM, disk, CD) contains several instructions to make a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) execute the methods of various embodiments of the present disclosure.
  • This embodiment also provides a message forwarding device, which is used to implement the above embodiments and preferred implementation modes, and what has already been described will not be repeated.
  • the term "module” may be a combination of software and/or hardware that realizes a predetermined function.
  • the devices described in the following embodiments are preferably implemented in software, implementations in hardware, or a combination of software and hardware are also possible and contemplated.
  • Fig. 11 is a structural block diagram of a message forwarding device according to an embodiment of the present disclosure. As shown in Fig. 11, the device includes:
  • the first search unit 1102 is configured to search for the incoming label of the message to be forwarded from the current label forwarding table corresponding to the current time slice or the current topology when the message to be forwarded is obtained;
  • the second search unit 1104 is configured to search for the incoming label from the target label forwarding table corresponding to the target time slice or target topology when the incoming label is not found in the current label forwarding table;
  • the forwarding unit 1106 is configured to forward the message to be forwarded according to the outgoing label corresponding to the incoming label in the target label forwarding table when the incoming label is found from the target time slice.
  • the above-mentioned modules can be realized by software or hardware. For the latter, it can be realized by the following methods, but not limited to this: the above-mentioned modules are all located in the same processor; or, the above-mentioned modules can be combined in any combination The forms of are located in different processors.
  • Embodiments of the present disclosure also provide a computer-readable storage medium, in which a computer program is stored, 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 not limited to: U disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM) , mobile hard disk, magnetic disk or optical disk and other media that can store computer programs.
  • ROM read-only memory
  • RAM random access memory
  • mobile hard disk magnetic disk or optical disk and other media that can store computer programs.
  • Embodiments of the present disclosure also provide 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 electronic device may further include a transmission device and an input and output device, wherein the transmission device is connected to the processor, and the input and output device is connected to the processor.
  • each module or each step of the above-mentioned disclosure can be realized by a general-purpose computing device, and they can be concentrated on a single computing device, or distributed in a network composed of multiple computing devices In fact, they can be implemented in program code executable by a computing device, and thus, they can be stored in a storage device to be executed by a computing device, and in some cases, can be executed in an order different from that shown here. Or described steps, or they are fabricated into individual integrated circuit modules, or multiple modules or steps among them are fabricated into a single integrated circuit module for implementation. As such, the present disclosure is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本公开实施例提供了一种报文转发方法、装置、存储介质和电子设备。其中，该方法包括：在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签；在当前标签转发表中未查找到入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找入标签；在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。通过本公开，解决了报文转发失败的问题，进而达到了提高报文转发效率的效果。

Description

报文转发方法、装置、存储介质和电子设备
相关申请的交叉引用
本公开基于2021年06月30日提交的发明名称为“报文转发方法、装置、存储介质和电子设备”的中国专利申请CN202110742303.0，并且要求该专利申请的优先权，通过引用将其所公开的内容全部并入本公开。
技术领域
本公开实施例涉及通信领域，具体而言，涉及一种报文转发方法、装置、存储介质和电子设备。
背景技术
现有技术中，在卫星路由转发的过程中，由于拓扑的变化会比较频繁。因此，一个节点在一个时间段接收到的报文，在报文到达下一个节点时，时隙已经调整为下一时间段，因此，在下一个节点上可能找不到对应的标签，无法进行转发，报文被丢弃。
发明内容
本公开实施例提供了一种报文转发方法、装置、存储介质和电子设备，以至少解决相关技术中报文转发失败的问题。
根据本公开的一个实施例，提供了一种报文转发方法，包括：在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找上述待转发报文的入标签；在上述当前标签转发表中未查找到上述入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找上述入标签；在从上述目标时间片查找到上述入标签的情况下，按照上述目标标签转发表中与上述入标签对应的出标签转发上述待转发报文。
根据本公开的另一个实施例，提供了一种报文转发装置，包括：第一查找单元，设置为在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签；第二查找单元，设置为在当前标签转发表中未查找到入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找入标签；转发单元，设置为在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。
根据本公开的又一个实施例，还提供了一种计算机可读存储介质，上述计算机可读存储介质中存储有计算机程序，其中，上述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本公开的又一个实施例，还提供了一种电子装置，包括存储器和处理器，上述存储器中存储有计算机程序，上述处理器被设置为运行上述计算机程序以执行上述任一项方法实施例中的步骤。
通过本公开，由于在获取到待转发报文的情况下，如果从当前时间片或当前拓扑对应的当前标签转发表中查找不到待转发报文的入标签的情况下，会从目标时间片或目标拓扑的目标标签转发表中查找待转发报文的入标签，并完成报文的转发，不会直接丢弃入报文，因此，可以解决报文转发失败的问题，达到提高报文转发效率的效果。
附图说明
图1是根据本公开实施例的报文转发方法的硬件环境图；
图2是根据本公开实施例的报文转发方法的流程图；
图3是根据本公开实施例的报文转发方法的标签示意图；
图4是根据本公开实施例的报文转发方法的流程图；
图5是根据本公开实施例的报文转发方法的流程图；
图6是根据本公开实施例的报文转发方法的映射图；
图7是根据本公开实施例的报文转发方法的拓扑图；
图8是根据本公开实施例的报文转发方法的拓扑图；
图9是根据本公开实施例的报文转发方法的拓扑图；
图10是根据本公开实施例的报文转发方法的拓扑图；
图11是根据本公开实施例的报文转发装置的结构框图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开的实施例。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例中所提供的方法实施例可以在移动终端、计算机终端或者类似的运算装置中执行。以运行在移动终端上为例，图1是本公开实施例的一种报文转发方法的移动终端的硬件结构框图。如图1所示，移动终端可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)和用于存储数据的存储器104，其中，上述移动终端还可以包括用于通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述移动终端的结构造成限定。例如，移动终端还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可用于存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的报文转发方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输装置106用于经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端的通信供应商提供的无线网络。在一个实例中，传输装置106包括一个网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输装置106可以为射频(Radio Frequency，简称为RF)模块，其用于通过无线方式与互联网进行通讯。
在本实施例中提供了一种报文转发方法，图2是根据本公开实施例的报文转发方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转 发表中查找待转发报文的入标签；
步骤S204，在当前标签转发表中未查找到入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找入标签；
步骤S206，在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。
可选地，在本实施例中，在获取到待转发报文的情况下，可以先从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签，如果查找到入标签，则可以根据当前标签转发表中入标签对应的出标签来转发待转发报文。而如果在当前标签转发表中查不到待转发报文的入标签，说明时隙发生了变化，则可以从其他时隙也就是目标时间片或目标拓扑对应的目标标签转发表中查找入标签，通过入标签对应的出标签转发待转发报文。避免了因为时隙变化报文被丢弃的情况。
作为一种可选的示例，在获取待转发报文之前，方法还包括：
计算每一个时间片各自对应的拓扑路径，其中，每一个时间片之间具备映射关系，每一个时间片对应一个拓扑路径；
根据拓扑路径得到与每一个时间片对应的标签转发路径。
本实施例中，对于每一个时间片，都可以计算对应的拓扑路径，根据拓扑路径来得到每一个时间片对应的标签转发路径，不同的时间片计算出的拓扑路径可能相同也可能不同。根据拓扑路径确定出每一个节点的上一个节点和下一个节点，确定出标签转发路径。
作为一种可选的示例，在获取到待转发报文的情况下，从当前时间片对应的当前标签转发表中查找待转发报文的入标签包括：
解析待转发报文的目标标签；
根据待转发报文的目标标签，确定待转发报文为普通报文或卫星报文；
在待转发报文为卫星报文的情况下，从当前标签转发表中查找入标签。
可选地，在本实施例中，可以在待转发报文中添加目标标签，通过目标标签标志待转发报文为普通报文还是卫星报文。如果目标标签标识待转发报文为卫星报文，则查找待转发报文的入标签。目标标识可以为不同的字符串，标识待转发报文为普通报文还是卫星报文。
作为一种可选的示例，在解析待转发报文的目标标签之前，方法还包括：
在解析待转发报文得到第一报文的情况下，确定待转发报文包括目标标签，其中，第一报文可以但不限于位于目标标签之前，且第一报文可以但不限于为15；
在解析待转发报文未得到第一报文的情况下，确定待转发报文未包括目标标签。
可选地，本实施例中，可以通过一个第一报文来标识待转发报文中是否包括目标标签。第一标签可以为识别消耗时长或者识别消耗资源少的标签。通过识别第一标签，可以快速的识别得到待转发报文中是否包括目标标签。如果不包括目标标签，则说明待转发报文不是普通报文或者卫星报文，则不转发待转发报文。
作为一种可选的示例，在当前标签转发表中未查找到入标签的情况下，从目标时间片对应的目标标签转发表中查找入标签包括：
在未查找到目标时间片的情况下，等待M-1个时间段，其中，每一个时间段为一个时间片，M为一个周期中的时间片的数量；
在等待M-1个时间段之后，查找目标时间片；
在查找到目标时间片的情况下，从目标标签转发表中查找入标签；
在未查找到目标时间片的情况下，终止转发待转发报文。
本实施例中，上述M为一个周期中时间片的数量。例如，一个周期有5个时间片，每一个时间片都对应有标签转发表。如果某一个时间片下未查找到待转发报文的入标签，则等待M-1个时间段，则其他时间片的标签转发表都已经确定。此时，可以从中查找入标签。
本申请涉及到空天地一体网络架构。空天地一体网络架构是6G的核心方向之一，被国际电信联盟ITU(International Telecommunication Union)列为七大关键网络需求之一。6G的空天地一体网络架构将以地面蜂窝移动网络为基础，结合宽带卫星通信的广覆盖、灵活部署、高效广播的特点，通过多种异构网络的深度融合来实现海陆空全覆盖，将为海洋、机载、跨国、天地融合等市场带来新的机遇。空天地一体化网络由天基信息网、地面互联网和移动通信网互联互通而成。
天基信息网由一系列高、中、低轨卫星所组成，利用卫星之间的星间数据链路实现星间通讯。本申请可以应用在空天地一体化网络中，特别是在存在星间链路的低轨道卫星星座的路由器/交换机上。在本申请中，基于时间片算法(每一个时隙为一个时间片)的离散拓扑划分好之后，控制器会对每个时间片内的拓扑路径进行计算，生成每个拓扑内的标签转发路径(MPLS、SR-MPLS)。本申请定义了一类新的卫星标签，即在普通的标签格式上加入了时间片属性(或者叫拓扑属性)，通过标签内的时间片标识ID/拓扑标识ID，可以知道该标签流是从哪个时间片/拓扑里发送出来的。如图2所示，卫星标签共有5个域：
拓扑号：8bits，标识离散拓扑的编号，也是时间片的编号。这里的8bit是建议值，可以根据时间片规模进行定制；
标签值：12bits，标识当前拓扑内的标签编号。
EXP：3bits，可以支持服务质量Qos。
S：栈底标识。MPLS支持多层标签，即标签嵌套。S值为1时表明为最底层标签。
TTL：8bits，用于指示IP包被路由器丢弃之前允许通过的最大网段数量。
卫星会收到标签报文时，需要区分出是报文中的标签(目标标签)是普通标签还是卫星标签，因此需要在卫星标签前面加一个特殊标签(第一标签)，比如标签值可以为15；这个标签和普通标签的格式没有区别，用以指示卫星处理标签报文时，知道是特殊的卫星标签。如图3为示意图。
图4、5为本实施例的流程图。
控制器会对每个时间片(对应于离散拓扑)中的标签转发表两两之间进行映射，即T2时间片的标签2001和T1、T3、、、Tn时间片的标签进行一对一映射，如图6是T2时间片和T1时间片的映射表。其中02：2000代表的是T2时间片中卫星分组转发设备所分配的入标签。当T1时间片中从源节点出发的携带01：510标签的报文到达该卫星后，以往的做法是直接查找当前时间片即T2时间片的标签转发表，发现查找不到则丢弃，或者查找到一个不正确的出标签，导致报文传送到错误的的卫星网络节点，最终导致不可控的安全问题。本申请中，查看标签头部的时间片属性来确定报文从源节点出发的时间是否属于当前时间片。如果是，则直接查找当前时间片的标签转发表，如果不是，则查看T2时间片的拓扑映射表，找到相应的出标签进行后续的转发。如果未找到相应的出标签信息，本申请还提出了一种保持策略，即根据事先制定好的保持时间策略，比如时间周期M，M＝N个卫星周期或者N个卫星时间片(M>＝0，N>＝0)，此时根据报文的时间片ID1，在映射表里查找是否存在该时间片，找到对应额时间片ID2，如果ID2<＝M，则等待M-1个周期，此时卫星已经运转到第M个周期，根据报文的时间片ID1可以找到出现的时间片ID2了。如果找不到对应的时间片中的ID2，则转发终止。
以报文到达后同属于一个时间片为例来说明卫星上的MPLS标签转发流程。在报文转发的全过程中没有发生网络拓扑切换。如图7所示。
(1)报文数据从卫星路由器R1出发，发往目的地址卫星D，在报文发送前，卫星上的标签转发表和标签映射表都已经在控制器上计算好上传到卫星上了；
(2)因此当业务流量导入到卫星R1后，查找目的地是D卫星后，则在报文上打上改造后的标签01：510(卫星R1此时的时间片是T1)，同时在标签栈顶加上特殊指示的卫星标签15，发往下一跳卫星R2；
(3)卫星R2收到标签报文后，首先查看栈顶标签，发现是15，则知道后续的标签是卫星标签，剥离15号标签后，查找下一个卫星标签，发现属于T1时间片；
(4)查找R2上的标签转发表，找到对应的出标签是01：520，交换标签之后再打上15特殊标签，继续发往下一跳卫星节点R3；
(5)R3收到后重复(4)操作，交换成标签01：540，打上15特殊标签，发往目的地卫星D；
(6)D卫星收到报文，发现报文目的地是自己，转发结束。
以报文到达后时间片不一致为例来说明改造后的MPLS标签转发流程。在从源节点到目的节点逐跳转发报文的过程中发生了网络拓扑切换。如图8所示。
(1)报文数据从卫星路由器R1出发，发往目的地址卫星D，在报文发送前，卫星上的标签转发表和标签映射表都已经在控制器上计算好上传到卫星上了；
(2)因此当业务流量导入到卫星R1后，查找目的地是D卫星后，则在报文上打上改造后的标签01：510(卫星R1此时的时间片是T1)，同时在标签栈顶加上特殊指示的卫星标签15，发往下一跳卫星R2；
(3)报文到达卫星R2时，首先查看栈顶标签，发现是15，则知道后续的标签是卫星标签，剥离15号标签后，查找下一个卫星标签发现是T1，此时R2的时间片切换到T2。则需要去查找映射表，而不是查找R2在T2时间片的标签转发表；查找到01：510对应着T2时间片的02：2001，交换标签后再打上15特殊标签，继续往下一跳R5发送；
(4)卫星R5收到报文后，重复(3)的动作；发往下一跳卫星D；
(5)卫星D收到报文，发现报文目的地是自己，转发结束。
针对SR-MPLS标签类型的示例。如图9所示，
(1)数据报文从卫星路由器R1出发，发往目的地址卫星D，在报文发送前，卫星上的标签转发表和标签映射表都已经在控制器上计算好上传到卫星上了；
(2)因此当业务流量导入到卫星R1后，查找目的地是D卫星后，发现可以走路径列表(15，01：1010，01：1020，01：1030)，在IP报文头前打上标签列表后，发往下一跳卫星R2；
(3)卫星R2收到标签报文后，首先查看栈顶标签，发现是15，则知道后续的标签是卫星标签，查找下一个卫星标签发现是T1；
(4)查找R2上的标签转发表，找到对应的出接口和下一跳，弹出标签之后继续发往下一跳卫星节点R3；
(5)R3收到后重复(4)操作，弹出标签01：1020，发往目的地卫星D；
(6)D卫星收到报文，发现报文目的地是自己，转发结束。
以报文到达后时间片不一致为例来说明改造后的SR-MPLS标签转发流程。在从源节点到目的节点逐跳转发报文过程中发生了网络拓扑切换。如图10所示。
(1)报文数据从卫星路由器R1出发，发往目的地址卫星D，在报文发送前，卫星上的标签转发表和标签映射表都已经在控制器上计算好上传到卫星上了；
(2)因此当业务流量导入到卫星R1，查找目的地是D卫星后，发现可以走路径列表(15，01：1010，01：1020，01：1030)，在IP报文头前打上标签列表后，发往下一跳卫星R2；
(3)卫星R2收到标签报文后，首先查看栈顶标签，发现是15，则知道后续的标签是卫星标签，查找下一个卫星标签发现是T1；；
(4)此时R2的时间片已切换到T2。查找报文标签中的时间片ID，发现是T1时间片，此时需要去查找映射表，而不是查找R2在T2时间片的标签转发表；查找到01：1010对应着T2时间片的(15，02：2020，02：2030)，此时需要做标签交换动作，交换标签后继续往下一跳R5发送；
(5)R3收到后重复(4)操作，弹出标签02：2020，发往目的地卫星D；
(6)D卫星收到报文，弹出标签15和02：2030，发现报文目的地是自己，转发结束。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前 者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例的方法。
在本实施例中还提供了一种报文转发装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图11是根据本公开实施例的报文转发装置的结构框图，如图11所示，该装置包括：
第一查找单元1102，设置为在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签；
第二查找单元1104，设置为在当前标签转发表中未查找到入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找入标签；
转发单元1106，设置为在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。
本实施例的其他示例请参见上述示例，在此不再赘述。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
本公开的实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算 装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (12)

  1. 一种报文转发方法，包括：
    在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签；
    在当前标签转发表中未查找到入标签的情况下，从目标时间片或目标拓扑对应的目标标签转发表中查找入标签；
    在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。
  2. 根据权利要求1的方法，其中，在获取待转发报文之前，方法还包括：
    计算每一个时间片各自对应的拓扑路径，其中，每一个时间片之间具备映射关系，每一个时间片对应一个拓扑路径；
    根据拓扑路径得到与每一个时间片对应的标签转发路径。
  3. 根据权利要求1的方法，其中，在获取到待转发报文的情况下，从当前时间片对应的当前标签转发表中查找待转发报文的入标签包括：
    解析待转发报文的目标标签；
    根据待转发报文的目标标签，确定待转发报文为普通报文或卫星报文；
    在待转发报文为卫星报文的情况下，从当前标签转发表中查找入标签。
  4. 根据权利要求3的方法，其中，在解析待转发报文的目标标签之前，方法还包括：
    在解析待转发报文得到第一报文的情况下，确定待转发报文包括目标标签；
    在解析待转发报文未得到第一报文的情况下，确定待转发报文未包括目标标签。
  5. 根据权利要求1的方法，其中，在当前标签转发表中未查找到入标签的情况下，从目标时间片对应的目标标签转发表中查找入标签包括：
    在未查找到目标时间片的情况下，等待M-1个时间段，其中，每一个时间段为一个时间片，M为一个周期中的时间片的数量；
    在等待M-1个时间段之后，查找目标时间片；
    在查找到目标时间片的情况下，从目标标签转发表中查找入标签；
    在未查找到目标时间片的情况下，终止转发待转发报文。
  6. 一种报文转发装置，包括：
    第一查找单元，设置为在获取到待转发报文的情况下，从当前时间片或当前拓扑对应的当前标签转发表中查找待转发报文的入标签；
    第二查找单元，设置为在当前标签转发表中未查找到入标签的情况下，从目标时间片或 目标拓扑对应的目标标签转发表中查找入标签；
    转发单元，设置为在从目标时间片查找到入标签的情况下，按照目标标签转发表中与入标签对应的出标签转发待转发报文。
  7. 根据权利要求6的装置，其中，装置还包括：
    计算单元，设置为在获取待转发报文之前，计算每一个时间片各自对应的拓扑路径，其中，每一个时间片之间具备映射关系，每一个时间片对应一个拓扑路径；
    确定单元，设置为根据拓扑路径得到与每一个时间片对应的标签转发路径。
  8. 根据权利要求6的装置，其中，第一查找单元包括：
    解析模块，设置为解析待转发报文的目标标签；
    第一确定模块，设置为根据待转发报文的目标标签，确定待转发报文为普通报文或卫星报文；
    查找模块，设置为在待转发报文为卫星报文的情况下，从当前标签转发表中查找入标签。
  9. 根据权利要求8的装置，其中，第一查找单元还包括：
    第二确定模块，设置为在解析待转发报文的目标标签之前，在解析待转发报文得到第一报文的情况下，确定待转发报文包括目标标签；
    第三确定模块，设置为在解析待转发报文未得到第一报文的情况下，确定待转发报文未包括目标标签。
  10. 根据权利要求6的装置，其中，第二查找单元包括：
    处理模块，设置为在未查找到目标时间片的情况下，等待M-1个时间段，其中，每一个时间段为一个时间片，M为一个周期中的时间片的数量；在等待M-1个时间段之后，查找目标时间片；在查找到目标时间片的情况下，从目标标签转发表中查找入标签；在未查找到目标时间片的情况下，终止转发待转发报文。
  11. 一种计算机可读存储介质，计算机可读存储介质中存储有计算机程序，其中，计算机程序被处理器执行时实现权利要求1至5任一项中的方法的步骤。
  12. 一种电子装置，包括存储器、处理器以及存储在存储器上并可在处理器上运行的计算机程序，处理器执行计算机程序时实现权利要求1至5任一项中的方法的步骤。
PCT/CN2022/098232 2021-06-30 2022-06-10 报文转发方法、装置、存储介质和电子设备 WO2023273842A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
BR112023026035A BR112023026035A2 (pt) 2021-06-30 2022-06-10 Método e aparelho de encaminhamento de pacotes, meio de armazenamento e dispositivo eletrônico
EP22831662.6A EP4351222A1 (en) 2021-06-30 2022-06-10 Message forwarding method and apparatus, and storage medium and electronic device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110742303.0 2021-06-30
CN202110742303.0A CN115551042A (zh) 2021-06-30 2021-06-30 报文转发方法、装置、存储介质和电子设备

Publications (1)

Publication Number Publication Date
WO2023273842A1 true WO2023273842A1 (zh) 2023-01-05

Family

ID=84690034

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/098232 WO2023273842A1 (zh) 2021-06-30 2022-06-10 报文转发方法、装置、存储介质和电子设备

Country Status (4)

Country Link
EP (1) EP4351222A1 (zh)
CN (1) CN115551042A (zh)
BR (1) BR112023026035A2 (zh)
WO (1) WO2023273842A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6473421B1 (en) * 1999-03-29 2002-10-29 Cisco Technology, Inc. Hierarchical label switching across multiple OSPF areas
CN103825818A (zh) * 2014-02-14 2014-05-28 杭州华三通信技术有限公司 一种多拓扑网络转发方法和装置
CN105471734A (zh) * 2015-12-24 2016-04-06 哈尔滨工业大学 一种基于时隙的leo/meo双层卫星dtn网络分布式路由的优化方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6473421B1 (en) * 1999-03-29 2002-10-29 Cisco Technology, Inc. Hierarchical label switching across multiple OSPF areas
CN103825818A (zh) * 2014-02-14 2014-05-28 杭州华三通信技术有限公司 一种多拓扑网络转发方法和装置
CN105471734A (zh) * 2015-12-24 2016-04-06 哈尔滨工业大学 一种基于时隙的leo/meo双层卫星dtn网络分布式路由的优化方法

Also Published As

Publication number Publication date
CN115551042A (zh) 2022-12-30
EP4351222A1 (en) 2024-04-10
BR112023026035A2 (pt) 2024-03-05

Similar Documents

Publication Publication Date Title
CN109561021B (zh) 一种报文转发的方法及网络设备
CN110266594B (zh) 跨网络切片的分段路由转发方法及装置
CN110401599B (zh) 数据包的处理方法及装置、存储介质、电子装置
US11689452B2 (en) Method for forwarding service data, network device, and network system
CN106059924B (zh) 一种管理信息的方法，装置及系统
CN100559770C (zh) 加快边界网关协议收敛的方法和装置
CN107483345B (zh) 业务处理方法、设备及系统
WO2022062506A1 (zh) 一种数据处理方法、装置、存储介质及电子装置
US11405307B2 (en) Information transfer method and device
EP2708001A1 (en) Label switched routing to connect low power network domains
US20230370298A1 (en) Message header processing method and apparatus, storage medium and electronic device
CN102273177A (zh) 邻居发现协议调解
CN113014486A (zh) 一种bier报文转发方法、装置、设备和存储介质
WO2023273842A1 (zh) 报文转发方法、装置、存储介质和电子设备
EP4191966A1 (en) Method and device for processing data message, storage medium, and electronic device
US20240163208A1 (en) Packet processing method and apparatus, and storage medium and electronic apparatus
CN112491706B (zh) 数据报文的处理方法及装置、存储介质、电子装置
CN108206746B (zh) 一种网络传输控制方法及相关设备
WO2023093227A1 (zh) 信息的收集方法、装置、存储介质及电子装置
CN118301060A (zh) 组播数据报文的处理方法及装置
CN117640512A (zh) 通信方法及装置
CN117640526A (zh) 一种网络拥塞处理方法、装置、存储介质及电子装置
CN117354397A (zh) 报文处理方法、装置、bier网络及存储介质
CN115250262A (zh) 消息发送方法及装置、消息接收方法及装置、存储介质
CN117527668A (zh) 数据传输方法、装置、网络设备及存储介质

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: 22831662

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 18568987

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2022831662

Country of ref document: EP

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112023026035

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 2022831662

Country of ref document: EP

Effective date: 20231215

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 112023026035

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20231211