WO2023040650A1 - 一种报文周期的确定方法及其相关装置 - Google Patents

一种报文周期的确定方法及其相关装置 Download PDF

Info

Publication number
WO2023040650A1
WO2023040650A1 PCT/CN2022/115735 CN2022115735W WO2023040650A1 WO 2023040650 A1 WO2023040650 A1 WO 2023040650A1 CN 2022115735 W CN2022115735 W CN 2022115735W WO 2023040650 A1 WO2023040650 A1 WO 2023040650A1
Authority
WO
WIPO (PCT)
Prior art keywords
period
node
cycle
mapping relationship
offset value
Prior art date
Application number
PCT/CN2022/115735
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 华为技术有限公司
Publication of WO2023040650A1 publication Critical patent/WO2023040650A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Queue scheduling implementing delay-aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders

Definitions

  • the present application relates to the communication field, and in particular to a method for determining a message period and related devices.
  • the deterministic network is currently a hot spot in the industry.
  • the demand for the deterministic network comes from scenarios such as the industrial Internet, smart factories, and cloudification, as well as from augmented reality (augmented reality, AR) or virtual reality (virtual reality, VR) real-time interaction,
  • augmented reality augmented reality
  • VR virtual reality
  • a deterministic network refers to a network that can guarantee service quality assurance indicators such as deterministic bandwidth, delay, jitter, packet loss rate, etc. Deterministic periodic forwarding of the text to ensure the determinism of the end-to-end delay.
  • Network devices in the current deterministic network divide time into periods of equal length, arrange and send packets according to the periods, and ensure the determinism of the end-to-end delay of the packets.
  • the adjacent nodes are connected by multiple lines, the data transmission will be affected, and the possibility of data confusion is relatively high.
  • the first aspect of the present application provides a method for processing a paging message, which specifically includes:
  • the embodiment of the present application provides a method for determining a message period and a related device thereof, which are applied to an Internet Protocol (Internet Protocol, IP) network, and can reduce resource confusion and reduce the possibility of data confusion.
  • Internet Protocol Internet Protocol, IP
  • the first aspect of the embodiment of the present application provides a method for determining the message period, including:
  • the first node determines a period offset value according to the first period mapping relationship and the second period mapping relationship.
  • the first periodic mapping relationship is the periodic mapping relationship generated by the message sent by the second node received by the first node at the first moment
  • the second periodic mapping relationship is the periodic mapping relationship generated by the message sent by the second node received by the first node at the second moment.
  • the second node is the upstream node of the first node
  • the second moment is before the first moment, that is, the first periodic mapping relationship is generated after the second periodic mapping relationship.
  • the cycle mapping relationship is the corresponding relationship between the first cycle and the second cycle, where the first cycle is the cycle carried by the message sent by the second node, and the second cycle is the predicted cycle carried by the first node to send the message carrying the first cycle. The period in which the moment of the text is located.
  • the first node determines the sending period of the target message according to the first period mapping relationship and the period offset value, and the sending period is the period in which the first node plans to send the target message.
  • the first node determines the period offset value according to the first period mapping relationship and the second period mapping relationship, and determines the sending period of the target message according to the first period mapping relationship and the period offset value, ensuring that the first A node sends the target message within the period in which corresponding resources are reserved for the target message, avoiding occupying resources of other messages, reducing resource confusion and the possibility of data confusion.
  • the first node determines the period offset value according to the first period mapping relationship and the second period mapping relationship between the first node and the second node.
  • the second node is the upstream node of the first node, where the first node will periodically learn and generate the periodic mapping relationship between the first node and the second node according to the preset timing mechanism, for example, the first node every half hour , One hour or two hours to learn the periodic mapping relationship, the specific setting is determined according to the actual situation, and there is no limitation here.
  • the period mapping relationship refers to the corresponding relationship between the first period and the second period, where the first period refers to the period when the second node sends the message, and the second node will mark the period in the message Therefore, the first period can also be understood as the period carried by the message sent by the second node, and then the first period after the period at which the first node receives the message carrying the first period is the prediction
  • the cycle at which the first node sends the message carrying the first cycle is the cycle at which the predicted moment when the first node sends the message carrying the first cycle is the second cycle.
  • the first periodic mapping relationship is the periodic mapping relationship generated by the first node after learning based on the message sent by the second node received at the first moment
  • the second periodic mapping relationship is based on the first node receiving at the second moment.
  • the periodic mapping relationship generated by the message sent by the second node is received, wherein the second moment is earlier than the first moment, that is, the first periodic mapping relationship is generated after the second periodic mapping relationship.
  • the second period corresponding to the second period mapping relationship is the period in which resources are reserved for messages
  • the period offset value is the corresponding second period distance reserved by the first node under the first period mapping relationship. The number of cycles that the cycles need to be offset.
  • the first node After obtaining the determined period offset value, the first node will then offset the target message according to the period offset value on the basis of the first period mapping relationship, and the period after the offset is determined as the sending period of the target message. That is, the period in which the first node plans to send the target message within a certain period.
  • the first node periodically learns the periodic mapping relationship according to the timing mechanism, and the first periodic mapping relationship generated after the second periodic mapping relationship, the first node according to the first periodic mapping relationship and the second periodic mapping relationship Determine the period offset value, and then determine the sending period of the target message according to the first period mapping relationship and the period offset value, so as to ensure that after the period mapping relationship is changed, the first node is still in the period in which the corresponding resource is reserved.
  • Sending the target message avoids occupying resources of other messages, reduces resource confusion, and reduces the possibility of data confusion.
  • the first node when the sending cycle and/or the adjacent cycle is in an active state such as a sending state or a receiving state, the first node discards the target message, wherein the adjacent cycle is the same as
  • the sending cycle is consecutively adjacent to n cycles, n is a preset value and n is a positive integer.
  • the first node when the sending cycle of the target message and/or the adjacent cycle are active, the first node will discard the target message, avoiding receiving the data volume of two cycles in the same cycle, reducing the Periodic data overflow problem also reduces the possibility of data confusion.
  • the first node when updating the periodic mapping relationship between the first node and the second node from the second periodic mapping relationship to the first periodic mapping relationship, the first node may be in the sending state Or the cycle of the receiving state, and n consecutive adjacent cycles are all defined as the cycle of the active state, n is a preset value and n is greater than or equal to 1. Therefore, when the sending period and/or the adjacent period of the target message are in the active state, the first node will discard the target message, wherein the active state is the sending state or the receiving state, and the adjacent period is continuously adjacent to the sending period n cycles.
  • the cycle of the active state is specified, and when the sending cycle of the target message and/or the adjacent cycle are in the active state, the first node will discard the target message, avoiding receiving the target message in the same cycle.
  • the amount of data in two cycles reduces the problem of cycle data overflow and the possibility of data confusion.
  • the first node executes sending the target message into the sending cycle corresponding The operation of the queue, and then send in the queue of the sending cycle.
  • the first node when the sending period of the target message and/or the adjacent period are not in an active state, the first node performs the operation of sending the target message into the queue corresponding to the sending period, which can ensure that the target message is sent in the
  • the sending in the sending cycle is sent in the cycle in which the corresponding resources are reserved, which avoids resource confusion.
  • the sending cycle is not active, indicating that there is no other data in the sending cycle, so it can ensure that only the target message is received in the sending cycle. The problem of periodic data overflow is avoided, and the possibility of data confusion is further reduced.
  • the second period determined by the first node based on the first period mapping relationship is the third period
  • the second period determined by the first node based on the second period mapping relationship is the fourth period
  • the first node uses the difference between the third period and the fourth period as the period offset value.
  • the fourth period is a period in which resources corresponding to messages carrying the first period are reserved, and the first node uses the difference between the third period and the fourth period as the period offset value, which is intuitive determines the cycle offset value between the third cycle of the message carrying the first cycle received by the first node and the cycle in which corresponding resources are reserved.
  • the period offset value is the number of periods that need to be offset from the period corresponding to the second period of the first node under the first period mapping relationship to the period in which the corresponding resources are reserved, and the second The second period determined by a node after predicting under the first period mapping relationship is used as the third period, then the difference between the first period and the third period is the first offset value, and the first node in the second period The second period determined after prediction under the mapping relationship is used as the fourth period, and the difference between the first period and the fourth period is the second offset value, so the first node uses the first offset value and the second offset value The difference between the offset values is used as the cycle offset value.
  • the first node obtains the first offset value and the second offset value through the first cycle mapping relationship and the second cycle mapping relationship, and the first node obtains the first offset value and the second offset value based on the first offset value and the second offset value
  • the values respectively represent the first cycle mapping relationship and the second cycle mapping relationship, and then use the difference between the first offset value and the second offset value as the cycle offset value to determine the cycle offset value more quickly and efficiently, and improve work efficiency.
  • the first node determines the period offset value according to the first period mapping relationship, the second period mapping relationship and the macro period, where the macro period is determined by H (H is greater than or equal to 1)
  • the macro period corresponding to each message represents the minimum repetition duration of resources reserved for the message.
  • the corresponding resources reserved by the first node for the message are reserved according to the repeated arrangement of the macro cycle. And within a macrocycle, resources may be reserved for the message in one cycle or multiple cycles.
  • the first node determines the period offset value according to the first period mapping relationship, the second period mapping relationship and the macro period, which can ensure that the period offset value is greater than or equal to 0, and avoid the period offset value being negative
  • the sending period of the target message is the possibility of being sent or active, which improves the flexibility of the solution and ensures that the target message is sent within the period of reserved resources, thereby avoiding resource confusion.
  • the first node determines the period offset value in the following manner:
  • Z is the period offset value
  • ⁇ is the second offset value
  • ⁇ ' is the first offset value
  • H is the value of the macro period
  • mod represents the remainder, that is, Z is the first offset value and the second offset value The remainder after dividing the difference between the shifted value and the value of the macro period.
  • the first offset value is the difference between the first period and the third period.
  • the third period is the second period determined by the first node based on the first period mapping relationship.
  • the second offset value is the first period The difference between the fourth period and the fourth period, where the fourth period is the second period determined by the first node based on the second period mapping relationship.
  • the first node uses the difference between the first offset value and the second offset value and the value of the macro period as the period offset value, which can ensure that the target packet is Sending in the next cycle of reserved resources in the third cycle avoids sending the target message into the previous cycle of the third cycle when the difference between the first offset value and the second offset value is negative.
  • the cycle of sending or sending reserved resources reduces the problem of message loss or periodic data overflow, thereby reducing the possibility of resource confusion.
  • the first node determines the period offset value in the following manner:
  • Z is the period offset value
  • ⁇ is the second offset value
  • ⁇ ′ is the first offset value
  • H is the value of the macro period.
  • the first node determines the sending period of the target message according to the first period mapping relationship and the period offset value .
  • the first node determines the sending period of the target message according to the first cycle mapping relationship and the cycle offset value, which reduces the possibility of data confusion At the same time, it saves the occupation of network resources.
  • the first node determines that the macrocycle corresponding to the target message is at least 2 according to the preset identifier carried in the target message.
  • the first node determines that the macro period corresponding to the target message is at least 2 through the preset identifier carried by the target message, so as to determine that the sending period of the message with a macro period of at least 2 improves the first Node efficiency.
  • the first node further receives a target message sent by the second node and carries a target period, where the target period is a period at which the second node sends the target message.
  • the first node determines the sending period of the target message according to the first period mapping relationship, the target period carried in the target message, and the period offset value.
  • the first node after receiving the target message, determines the sending period of the target message according to the first cycle mapping relationship, the target cycle carried in the target message, and the cycle offset value, which improves the reliability of the scheme .
  • the first node uses the sum of the first offset value, the target period, and the period offset value as the target packet sending period.
  • connection lines between the first node and the second node there are multiple connection lines between the first node and the second node, wherein the first periodic mapping relationship corresponds to the first connection line between the first node and the second node, The second periodic mapping relationship corresponds to a second connection line between the first node and the second node, and the first connection line is different from the second connection line.
  • the first cycle mapping relationship corresponds to the first connection line
  • the second cycle mapping relationship corresponds to the second connection line, which means that the change of the connection line between the first node and the second node will cause the period
  • the change of the mapping relationship clarifies the application scenario of a solution and has the selectivity of the application scenario.
  • the value of the macroperiod is preconfigured in the first node, or the value of the macroperiod is carried in a message sent by the second node, and the message further includes a target message.
  • the macrocycle can be pre-configured in the first node, reducing the occupation of network resources and saving network resources; or carried by the message sent by the second node, the message includes the target message, which can be Obtain the corresponding macrocycle directly from the message, which improves work efficiency.
  • the second aspect of the embodiments of the present application provides a communication device, where the communication device has a function of implementing the method of the first aspect or any possible implementation manner of the first aspect.
  • This function may be implemented by hardware, or may be implemented by executing corresponding software on the hardware.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the communication device in the second aspect of the embodiment of the present application executes the method described in the first aspect of the embodiment of the present application or any possible implementation manner of the first aspect.
  • the third aspect of the embodiment of the present application provides another communication device, which may include a processor, the processor is coupled to the memory, where the memory is used to store instructions, and the processor is used to execute the instructions in the memory so that the communication device executes the embodiment of the present application
  • the fourth aspect of the embodiment of the present application provides another communication device, including a processor, configured to execute the computer program (or computer-executable instruction) stored in the memory, when the computer program (or computer-executable instruction) is executed, so that The communication device executes the first aspect and the method in each possible implementation of the first aspect.
  • processor and memory are integrated;
  • the above-mentioned memory is located outside the communication device.
  • the communication device also includes a communication interface, which is used for the communication device to communicate with other devices, such as sending or receiving data and/or signals.
  • the communication interface may be a transceiver, circuit, bus, module or other types of communication interface.
  • the fifth aspect of the embodiment of the present application provides a computer-readable storage medium, including computer-readable instructions.
  • the computer-readable instructions are run on a computer, the first aspect of the application embodiment or any possible implementation manner of the first aspect The described method is carried out.
  • the sixth aspect of the embodiment of the present application provides a computer program product, including computer-readable instructions.
  • the computer-readable instructions are run on a computer, the first aspect of the embodiment of the present application or any possible implementation manner of the first aspect can be implemented. The described method is executed.
  • the seventh aspect of the embodiment of the present application provides a chip, the chip includes at least one processor and at least one interface circuit, the interface circuit is coupled to the processor, and the at least one interface circuit is used to perform the function of sending and receiving, and send instructions to At least one processor, at least one processor is used to run computer programs or instructions, which has the function of realizing the method of the above-mentioned first aspect or any possible implementation manner of the first aspect, and this function can be realized by hardware or by software Realization can also be achieved through a combination of hardware and software, where the hardware or software includes one or more modules corresponding to the above functions.
  • the embodiment of the present application further provides a communication system, including the communication device provided by the second aspect, the third aspect, the fourth aspect, and various possible implementations of the foregoing aspects.
  • Fig. 1 is a schematic diagram of a periodic mapping relationship between adjacent nodes in a deterministic network
  • Fig. 2 is a schematic diagram of learning cycle mapping relationship
  • Fig. 3 is a schematic diagram of connecting line switching
  • Fig. 4 is a schematic diagram of the mapping relationship corresponding to the switching period of the connection line
  • Fig. 5 is another schematic diagram of the mapping relationship corresponding to the switching period of the connection line
  • FIG. 6 is a schematic diagram of an application scenario of an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a method for determining a message period in an embodiment of the present application.
  • FIG. 8 is a schematic diagram of determining a period offset value according to an embodiment of the present application.
  • FIG. 9 is a schematic diagram of period mapping entries in the embodiment of the present application.
  • FIG. 10 is another schematic diagram of period mapping entries in the embodiment of the present application.
  • FIG. 11 is another schematic diagram of determining a period offset value according to an embodiment of the present application.
  • FIG. 12 is a schematic diagram of a macrocycle configuration in an embodiment of the present application.
  • FIG. 13 is a schematic diagram of a message carrying macrocycle according to an embodiment of the present application.
  • FIG. 14 is a schematic diagram of a message carrying a preset identifier according to an embodiment of the present application.
  • FIG. 15 is a schematic structural diagram of a communication device according to an embodiment of the present application.
  • FIG. 16 is another schematic structural diagram of a communication device according to an embodiment of the present application.
  • the embodiment of the present application provides a paging message processing method.
  • the control device can calculate the ability of the access network device to issue paging messages by obtaining the queue remaining information of the paging queue of the access network device, so as to determine what When to transparently transmit paging messages to the access network equipment and at what rate, so that the number of paging messages in the paging queue can be controlled, and the paging queue will not overflow at all times, thus solving the problem of sending to the access network.
  • the problem that the paging message of the network device may be discarded directly.
  • the embodiment of the present application provides a method for determining a packet period and a related device thereof, which are applied in an IP network, and can reduce resource confusion and the possibility of data confusion.
  • the technical key of deterministic network lies in the realization of deterministic delay, jitter, packet loss rate, bandwidth and reliability.
  • the deterministic network introduces the idea of periodic forwarding on the basis of the traditional network, and controls the forwarding timing of each packet at each hop by performing deterministic periodic forwarding according to the periodic mapping relationship to reduce microbursts and eliminate the long tail effect.
  • the determinism of end-to-end latency is achieved.
  • Figure 1 is a schematic diagram of the periodic mapping relationship between adjacent nodes in a deterministic network. Assume that the message sent by the sending node A is forwarded by node B and finally received by node C, that is, the message
  • the transmission path of the text is A ⁇ B ⁇ C.
  • the output interfaces of the nodes A and B involved in this path are divided into cycles of length T according to the time axis to send the messages periodically, that is, the messages are sent to the queue corresponding to the cycle
  • Each cycle has a corresponding preset number (the number can be in the form of T1, T2, T3 or 1, 2, 3, etc. In actual situations, it can be set according to the specific situation, and it will not be done here.
  • T1-T7 as shown in FIG. 1 are respectively 7 cycle division situations indicated by nodes A and B.
  • periodic forwarding means Each period divided by the output interface of each node corresponds to a queue.
  • the queue index is the period carried in the message. The queue is only opened within the period range and closed for the rest of the time.
  • the messages that need to be sent within this period are based on the mapped Periodically enter the queue for sending), for example, the message received by node B and sent by node A in the queue of T1 period, the message will carry the T1 period, so after receiving the message, node B will send the message from the T1 period After shifting three cycles, send to node C in the queue of T4 cycle, and the message of the subsequent cycle also follows this cycle mapping relationship.
  • node A sends a message in the queue of T2 cycle, according to the cycle mapping relationship
  • node B will Periodic queue for sending
  • node A sends messages in the queue of T3 period
  • node B will send messages in the queue of T6 period according to the period mapping relationship, and so on.
  • FIG. 2 is a schematic diagram of the learning cycle mapping relationship.
  • Node A sends a message at the end of the X cycle, and when the message is transmitted through the connection line between node A and node B, node B will On the basis of the transmission delay p of the connection line, that is, the message is received at a certain point in the Y cycle. To ensure that the message is completely sent, Node B will send the message in the next complete cycle after the time the message is received. message.
  • the downstream node among adjacent nodes will periodically learn the periodic mapping relationship with the upstream node (such as node A shown in Figure 2) according to the preset timing mechanism.
  • the generated periodic mapping relationship is different from the previous one, and a new periodic mapping relationship is adopted.
  • the timing mechanism set in the downstream node can be set to re-learn the periodic mapping relationship with the upstream node every 10 minutes, half an hour or one hour. In an actual situation, the specific timing mechanism is subject to the setting of the actual situation, which is not limited here.
  • adjacent nodes may be connected through any connection method such as dual transmission and selective reception, multi-line connection, optical transport network (OTN) or other underlying transmission networks. Therefore, when the current connection line that is currently transmitting fails, it will switch to another connection line to continue transmission to ensure normal communication between adjacent nodes.
  • OTN optical transport network
  • Figure 3 is a schematic diagram of connection line switching. Node R1 and node R2 are connected through OTN. When the original connection line A fails, it will be switched to the new connection line B to continue transmission.
  • FIG. 4 is a schematic diagram of the mapping relationship between the switching period of the connection line.
  • the R1 node is the upstream node of the R2 node.
  • the message sent by the R1 node in the T1 period will be sent by the R2 node in the T4 period.
  • the message sent by the R1 node in the T1 period will be sent by the R2 node.
  • the node sends in the T5 cycle, and the corresponding situation in the subsequent cycles can be deduced by analogy.
  • the resources corresponding to each message are divided and reserved according to the predetermined period.
  • the period for the R2 node to reserve resources for the message of the T1 period is In the T4 cycle, after the connection line is switched, the packets of the T1 cycle are sent on the R2 node in the T5 cycle according to the new cycle mapping relationship, and the resources reserved in the T5 cycle are for other messages, so other packets will be occupied.
  • the resource of the message resulting in resource confusion.
  • this cycle 2 may be cycle 2 in an active state such as sending a message or receiving a message into the queue (as shown in Figure 5, the cycle 2 with a slash in the dashed box) or other cycle 2 (as shown in Figure 5, the blank period 2 outside the virtual frame), if when entering the active period 2, this period 2 receives the message sent by the R1 node under the original connection line in period 2 and the new connection
  • the message sent by node R1 under the line in cycle 1 exceeds the data range that can be carried in cycle 2, causing cycle data overflow. Therefore, in the case of multi-line connection, data transmission will be affected, and the possibility of data confusion is relatively high.
  • the embodiment of the present application provides a method for determining the period of a message and related devices, which are used for a node in an IP network according to the first period mapping relationship between the node and the upstream node of the node and The second period mapping relationship generated before the first period mapping relationship determines the period offset value, and determines the sending period of the target message sent by the upstream node at the node according to the first period mapping relationship and the period offset value, so that Ensure that the target message is sent within the period of reserved resources, avoiding the resource occupation of other messages, reducing resource confusion, and reducing the possibility of data confusion.
  • the embodiment of the present application can be applied to an IP network.
  • messages are transmitted through a path composed of nodes.
  • the actual form of the nodes can be products such as routers, switches, or hubs, or other devices that can achieve the same function or purpose. or products, which are not limited here.
  • Figure 6 is a schematic diagram of the application scenario of the embodiment of the present application.
  • the ingress gateway node in the IP network is the upstream node of the first intermediate forwarding node.
  • the periodic mapping relationship between points, the second periodic mapping relationship is the periodic mapping relationship between the first intermediate forwarding node and the ingress gateway node generated by the first intermediate forwarding node at a certain moment, when the first intermediate forwarding node is in the second
  • the first intermediate forwarding node will determine the periodic offset value according to the first periodic mapping relationship and the second periodic mapping relationship, and then the ingress gateway node will send
  • the first intermediate forwarding node sends the target message
  • the first intermediate forwarding node that receives the target message will determine the sending cycle of the target message according to the first cycle mapping relationship and the cycle offset value, and then process the target message according to the sending cycle packets to reduce resource usage.
  • the embodiment of the present application ensures the determinism of the end-to-end delay of the message, and also plans to send the target message in the period when corresponding resources are reserved, so as to reduce resource occupation and reduce the possibility of data confusion.
  • FIG. 7 is a schematic diagram of a method for determining the message period in the embodiment of the present application, which specifically includes:
  • the first node determines a period offset value according to the first period mapping relationship and the second period mapping relationship.
  • the first node determines the period offset value according to the first period mapping relationship and the second period mapping relationship between the first node and the second node.
  • the second node is the upstream node of the first node, the first periodic mapping relationship is generated by the first node based on the message sent by the second node received at the first moment, and the second periodic mapping relationship is generated by the first node based on The message received at the second moment and sent by the second node is generated, wherein the second moment is earlier than the first moment.
  • the first node as a downstream node periodically learns the periodic mapping relationship with the second node under a preset timing mechanism.
  • the timing mechanism and the learning method of the periodic mapping relationship are similar to those described in the above-mentioned periodic mapping relationship between adjacent nodes in the deterministic network, and details are not repeated here.
  • the period mapping relationship is a correspondence between the first period and the second period, wherein the first period is the period at which the second node sends a message, and optionally, the second node marks the first period in In the message, the first period can also be understood as the period carried by the message sent by the second node; the second period is the period at which the first node is predicted to send the message carrying the first period, optional Specifically, the second period is a period after the period at which the first node receives the message carrying the message.
  • connection between the first node and the second node may be through any connection method such as dual transmission and selective reception, multi-line connection, OTN or other underlying transmission networks.
  • the connection may also be other connection modes that meet the failure of the current connection line and can be switched to another connection line to continue data transmission between the first node and the second node.
  • the first cycle mapping relationship is a cycle mapping relationship generated after the connection line between the first node and the second node is switched from the second connection line to the first connection line, wherein the first cycle mapping relationship corresponds to the first node and the second node
  • the first connection line between the second periodic mapping relationship corresponds to the second connection line between the first node and the second node.
  • the first node determines the cycle offset value according to the first cycle mapping relationship and the second cycle mapping relationship, or the first node determines the cycle offset value according to the first cycle mapping relationship, the second cycle mapping relationship and the macro cycle a cycle offset value, and store the cycle offset value.
  • the first node determines the period offset value according to the first period mapping relationship and the second period mapping relationship.
  • the first node takes the second cycle corresponding to the first cycle based on the first cycle mapping relationship as the third cycle, and also uses the second cycle corresponding to the first cycle based on the second cycle mapping relationship as the fourth cycle, and then the first node takes the second cycle
  • the difference between the third cycle and the fourth cycle is used as the cycle offset value.
  • FIG. 8 is a schematic diagram of determining the period offset value in the embodiment of the present application.
  • the first period carried by the message sent by the second node on the second connection line is the X period.
  • the first node determines that the fourth period corresponding to the X period is the bY period, that is, the first The message carrying the X period received by the node is planned to be sent in the bY period; after the switchover, the second node sends the message carrying the first period of the X period on the first connection line, under the mapping relationship of the first period
  • the first node determines that the third period corresponding to the X period is the gY period, because the oblique bY period is a period in which resources are reserved for messages of the X period, and the gY period is a period in which resources are reserved for other messages.
  • the fourth period is the period in which resources corresponding to the messages carrying the first period are reserved, and the first node uses the difference between the third period and the fourth period as the period offset value, which intuitively determines that the first node receives The cycle offset value between the third cycle of the received packet carrying the first cycle and the cycle in which corresponding resources are reserved.
  • the first node uses a difference between the first offset value and the second offset value as the period offset value.
  • the first node uses the difference between the first offset value and the second offset value as the period offset value, and can quickly obtain the period required for sending the target packet into the reserved resource under the first period mapping relationship.
  • the number of cycles offset on the basis of three cycles improves work efficiency.
  • the first node may update the first period mapping relationship to a predetermined period mapping entry, and the period mapping entry records the period mapping between the first node and the upstream node relation.
  • FIG. 9 is a schematic diagram of period mapping entries in this embodiment of the present application.
  • the period mapping entry reflects the period mapping relationship between the first node and the upstream node by recording the upstream node label of the first node and the corresponding offset value of the period mapping relationship between the first node and the upstream node.
  • the second node is the R1 node shown in FIG. 9, the second offset value corresponding to the second cycle mapping relationship recorded in the cycle mapping entry is ⁇ .
  • the second offset value may be updated to the first offset value ⁇ ' corresponding to the first period mapping relationship.
  • the updated period mapping entry please refer to another schematic diagram of the period mapping entry in FIG. 10 .
  • the first node determines the period offset value according to the first period mapping relationship, the second period mapping relationship and the macro period.
  • the first node uses the second cycle corresponding to the first cycle based on the first cycle mapping relationship as the third cycle, and also uses the second cycle corresponding to the first cycle based on the second cycle mapping relationship as the fourth cycle, and the first The node uses the difference between the first cycle and the third cycle as the first offset value, and uses the difference between the first cycle and the fourth cycle as the second offset value. Then the first node performs a remainder operation on the difference between the first offset value and the second offset value and the macro period as the period offset value.
  • the period offset value can be determined according to the following formula:
  • Z is the period offset value
  • ⁇ is the second offset value
  • ⁇ ' is the first offset value
  • H is the value of the macro period
  • H is a positive integer
  • mod represents the remainder, that is, Z is the first offset value The remainder after dividing the difference between the second offset value and the value of the macro period.
  • the macro period refers to the duration consisting of H consecutive periods, and the macro period corresponding to each message includes a period in which resources corresponding to the message are reserved, and is arranged repeatedly according to the macro period.
  • FIG. 11 is another schematic diagram of determining the cycle offset value in the embodiment of the present application.
  • the value of the macroperiod can be configured locally on the first node, or can be carried in a message sent by the second node. Either way can be used in actual situations, and the details are not limited here. Specific instructions are given below:
  • the macrocycle is configured locally on the first node.
  • FIG. 12 is a schematic diagram of the macrocycle configuration of the embodiment of the present application.
  • the identifier of the message and the macrocycle of the corresponding message are recorded in an entry, for example, the message whose message identifier is Flow1
  • the macro period corresponding to the message is 7, and the macro period corresponding to the message marked as Flow2 is 5.
  • the macro period of the message is defined according to the specific setting situation, which is not limited here.
  • the macro period corresponding to the message is directly configured locally on the first node, which reduces the occupation of network transmission resources.
  • the macro period is carried in a packet sent by the second node.
  • Figure 13 is a schematic diagram of a message carrying a macrocycle according to the embodiment of the present application.
  • X carried in the message is a cycle number
  • H is a macrocycle.
  • the period offset value determined by the macro period is directly obtained in the message, which improves the work efficiency.
  • the first node can offset the message carrying the X cycle on the basis of the gY cycle to the bY cycle of the corresponding resource reserved in the second macro cycle after the gY cycle.
  • the first node determines the sending period of the target packet according to the first period mapping relationship and the period offset value.
  • the first node determines the sending period of the target message according to the first period mapping relationship and the period offset value, and the sending period is the period at which the target message is planned to be sent.
  • the first node after the first node updates the mapping relationship table item according to the first mapping relationship, after receiving the message sent by the second node, that is, the target message, the first node determines the received target message sending cycle.
  • the target message carries the identifier of the cycle at which the second node sends the target message, that is, the target cycle.
  • the first node uses the sum of the first offset value, the period offset value, and the target period as the sending period.
  • the second node is the R1 node shown in Figure 10
  • the target period carried by the target message is X
  • the first node can directly use the second node in the period mapping entry
  • the first node directly determines the sending period for the received target messages, and ensures that all target messages are actively shifted to the period in which corresponding resources are reserved, so as to avoid preempting resources reserved for other messages.
  • the first node determines the sending period of the target message only when the macro period corresponding to the target message is at least 2.
  • the first node only determines the sending period for the target message with a macro period of at least 2, which further improves the efficiency of data transmission, because the target message with a macro period of 1 means the target message with a macro period of 1 on the first node Resources are reserved in each cycle, so the target message does not need to be offset on the basis of the mapping relationship of the first cycle to ensure that the target message can be sent within the cycle of reserved resources.
  • the first node can determine that the macrocycle corresponding to the target message is at least 2 through the preset identifier carried in the target message, or the first node can also determine the target by directly determining the macrocycle corresponding to the target message.
  • the macro period corresponding to the message is at least 2.
  • the first node determines that the macrocycle corresponding to the target message is at least 2 according to the preset identifier carried in the target message.
  • the target message sent by the second node also carries a preset identifier in addition to the periodic identifier.
  • FIG. 14 is a schematic diagram of a message carrying a preset identifier according to an embodiment of the present application, where X is the period when the first node receives the target message, and F is a preset identifier, which can be It is a bit, and setting this bit to 0 or 1 means that the macro period of the target message is 1, or that the macro period of the target message is greater than or equal to 2; the identification can also use a byte to represent the macro period Greater than or equal to 2, the value of this byte can be set according to the actual situation, which is not limited here.
  • the preset identifier F can also be a field.
  • the message carries the field F it means that the macro period of the target message is greater than or equal to 2
  • the message does not carry the field F it means that the macro period of the target message is equal to 1.
  • the first node confirms that the target message carries the preset identifier F the first node determines that the target message is sent after the first node determines that the macro period of the target message is greater than or equal to 2 according to the preset identifier cycle.
  • the target message can also carry the preset identifier and the macro cycle at the same time, which is convenient for the first node to determine the cycle offset value and at the same time quickly determine the message that needs to determine the target cycle, which improves the work efficiency and corresponds to the macro cycle.
  • the period and the carrying method of the preset logo should be set according to the actual situation, and there is no specific limitation here.
  • the first node directly determines that the macrocycle corresponding to the target message is at least 2 through the preset identifier carried in the target message, which improves work efficiency.
  • the first node determines whether the macroperiod corresponding to the target message is at least 2 by determining whether the macroperiod corresponding to the target message is at least 2.
  • the macroperiod can be configured locally on the first node, or can be carried in the target message.
  • the specific form has been described in detail in step 701 above, and will not be repeated here.
  • the first node may determine the macroperiod corresponding to the target message according to locally configured information or the macroperiod carried in the target message, and determine whether the macroperiod is at least 2, and when the macroperiod of the target message is at least 2, Only the first node confirms the sending period of the target message.
  • the first node determines whether the macro-period of the target message is at least 2 by determining whether the macro-period is at least 2, which reduces the occupation of network resources and saves network resources.
  • the first node processes the target packet according to the sending period.
  • the first node After the first node determines the sending period of the target message, the first node processes the target message according to the status of the sending period.
  • the state includes an active state and an inactive state.
  • the active state means that the current cycle is in the sending state or receiving state; the inactive state means that the current cycle is not in the sending state or receiving state.
  • the first node when the sending cycle and/or the adjacent cycle is active, discards the target message.
  • the cycle in the active state and n adjacent cycles are combined into an active cycle, and when the sending cycle belongs to the active cycle, the first node discards the target message, where n is a positive integer.
  • the value of n can be set according to specific situations, and is not specifically limited here.
  • the cycle in the dashed box is the current active cycle, which includes the bY cycle of reserved resources, if the first node determines that the sending cycle of the target message is the active cycle During bY period, the first node discards the target packet.
  • the first node when the sending period of the target message or an adjacent period is in an inactive state, that is, when the sending period of the target message is not an active period, the first node sends the target message in the sending period.
  • the sending period of the target message is the first bY period after the gY period shown in FIG. 11 above, and the bY period is not an active period, then the first node sends the target message in the bY period.
  • the first node may execute the operation of entering the target message into the queue corresponding to the sending period.
  • the sending of the target message If the period is the first bY period after the gY period and is not an active period, the first node executes the operation of putting the target message into the queue corresponding to the sending period, and then waits for subsequent instructions.
  • the first node When the sending cycle and/or the adjacent cycle are in the active state, the first node discards the target message, and when the sending cycle and/or the adjacent cycle are in the inactive state, the first node sends the target message into the corresponding sending cycle
  • the queue can avoid the periodic data overflow problem caused by exceeding the data range that can be carried by the sending cycle, thereby reducing the possibility of data confusion.
  • the second node in the embodiment of the present application may also be a downstream node of other nodes.
  • the second node may also The first node in the embodiment determines the cycle offset value through various methods in the above method embodiments, and then determines the sending cycle of the target message.
  • the first node determines the period offset value according to the first period mapping relationship and the second period mapping relationship, and then the first node determines the sending of the target message according to the first period mapping relationship and the period offset value cycle, and when the sending cycle or the adjacent cycle is active, the first node discards the target message, avoiding the sending of periodic data problems as much as possible, and when the sending cycle or the adjacent cycle is not active, the first node will The target message is sent to the queue corresponding to the sending period to ensure that the target message received by the first node can be sent within the period in which the corresponding resources are reserved, avoiding resource occupation and minimizing the possibility of data confusion .
  • both the first node and the second node may include a hardware structure and/or a software module, and be implemented in the form of a hardware structure, a software module, or a hardware structure plus a software module the above functions. Whether one of the above-mentioned functions is executed in the form of a hardware structure, a software module, or a hardware structure plus a software module depends on the specific application and design constraints of the technical solution.
  • FIG. 15 is a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the communication device 1500 can be a first node or a second node, or a routing device in a network device, such as a router, a switch, and a hub At least one of the devices, or a device that can be used with terminal devices and network devices.
  • the communication device 1500 may include a module or unit corresponding to the method/operation/step/action performed by the first node or the second node in the above method embodiment, and the unit may be a hardware circuit , also can be software, also can be that hardware circuit combines software to realize.
  • the communications apparatus 1500 may include: a first determining unit 1501 and a second determining unit 1502 .
  • the first determining unit 1501 may be configured to perform the step of determining the period offset value as in the above method embodiment
  • the second determining unit 1502 may be configured to perform the step of determining the sending period of the target packet as in the above method embodiment.
  • the communication device may further include a discarding unit 1503, a sending unit 1504, and a receiving unit 1505.
  • the discarding unit 1503 may be used to send or receive a message when the sending period and/or adjacent period of the target message When the target message is in an active state such as an active state, the target message is discarded, and the adjacent cycle is n consecutive adjacent cycles of the sending cycle, n ⁇ 1;
  • the sending unit 1504 can be used when the sending cycle of the target message and/or the adjacent cycle is not When in the active state, the target message is sent in the sending period;
  • the receiving unit 1505 can be configured to receive the target message sent by the second node, and the target message carries the target period.
  • the first determining unit 1501 determines the period offset value according to the first period mapping relationship and the second period mapping relationship, and then the receiving unit 1505 receives the target message sent by the second node, and then the second determining unit 1502
  • the sending period of the target message is determined according to the first cycle mapping relationship and the cycle offset value.
  • the sending unit 1504 sends the target message in the sending cycle, which can ensure that the sending target
  • the period of the message is the period in which the resources of the target message are reserved, which reduces the occupation of resources, but when the sending period and/or the adjacent period are not active, the discarding unit 1503 discards the target message, reducing the period data
  • the overflow problem minimizes the possibility of data confusion.
  • the first determining unit 1501, the second determining unit 1502, the discarding unit 1503, the sending unit 1504, or the receiving unit 1505 may perform one-to-one correspondence in various possible implementation manners in the above method embodiments. method/operation/step/action.
  • the first determining unit 1501 may be configured to use the difference between the third period and the fourth period in the above method embodiment as the period offset value.
  • the first determining unit 1501 may be configured to use a difference between the first offset value and the second offset value in the above method embodiment as the period offset value.
  • the first determining unit 1501 may be configured to determine the period offset value according to the first period mapping relationship, the second period mapping relationship and the macro period in the above method embodiments.
  • the second determining unit 1502 may be configured to determine the sending period of the target message according to the first period mapping relationship and the period offset value when the macro period corresponding to the target message is at least 2.
  • the above-mentioned second determining unit 1502 may also be configured to determine that the macrocycle corresponding to the target message is at least 2 by using a preset identifier carried in the target message.
  • the above-mentioned second determining unit 1502 may also be configured to determine the sending period of the target message according to the first period mapping relationship, the target period and the period offset value.
  • the sending period of the target message is determined according to the first period mapping relationship, the target period carried in the target message, and the period offset value, which improves the reliability of the solution.
  • the second determining unit 1502 is specifically configured to use a sum of the first offset value, the target period, and the period offset value as the sending period.
  • the first cycle mapping relationship corresponds to the first connection line between the first node and the second node
  • the second cycle mapping relationship corresponds to the second connection line between the first node and the second node
  • the first connection line is different from the second connection line.
  • the sending unit 1504 may also be configured to send a message carrying a macro period and/or a preset identifier, where the message includes a target message.
  • Figure 15 corresponds to the information interaction and execution process among the modules/units in the first node described in the embodiment, and the method embodiment corresponding to Figure 7 in this application is based on the same idea, and the specific content can be Refer to the descriptions in the foregoing method embodiments of the present application, and details are not repeated here.
  • each functional module or unit in each embodiment of the present application may be integrated into one processor, or physically exist separately, or two or more modules or units may be integrated into one module or unit.
  • the above-mentioned integrated modules or units can be implemented in the form of hardware or in the form of software function modules.
  • FIG. 16 is another schematic structural diagram of the communication device of the embodiment of the present application.
  • the communication device 1600 can be deployed with the communication device described in the embodiment corresponding to FIG.
  • the module is used to implement the functions of the communication device in the embodiment corresponding to Figure 15.
  • the communication device 1600 is implemented by one or more servers.
  • the communication device 1600 may have relatively large differences due to different configurations or performances, and may include a Or more than one central processing unit (central processing units, CPU) 1622 (for example, one or more central processing units) and memory 1632, one or more storage media 1630 (for example one or more mass storage devices).
  • the memory 1632 and the storage medium 1630 may be temporary storage or persistent storage.
  • the program stored in the storage medium 1630 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations on the communication device 1600 . Further, the central processing unit 1622 may be configured to communicate with the storage medium 1630 , and execute a series of instruction operations in the storage medium 1630 on the communication device 1600 .
  • the communication device 1600 may also include one or more power sources 1626 , one or more wired or wireless network interfaces 1650 , and/or, one or more input and output interfaces 1658 .
  • the central processing unit 1622 is configured to execute the method in the embodiment corresponding to FIG. 7 .
  • the central processing unit 1622 may be configured to: determine the period offset value according to the first period mapping relationship and the second period mapping relationship.
  • the first periodic mapping relationship is the periodic mapping relationship generated by the message sent by the second node received by the communication device 1600 at the first moment
  • the second periodic mapping relationship is the periodic mapping relationship generated by the second node received by the communication device 1600 at the second moment.
  • the period mapping relationship generated by the message sent by two nodes, the second node is the upstream node of the communication device 1600, and the second moment is before the first moment, that is, the first period mapping relationship is generated after the second period mapping relationship.
  • the cycle mapping relationship is the corresponding relationship between the first cycle and the second cycle, wherein the first cycle is the cycle carried by the message sent by the second node, and the second cycle is the predicted communication device 1600 sending the message carrying the first cycle.
  • central processing unit 1622 can also be used to execute any step in the method embodiment corresponding to FIG. 7 in this application. Let me repeat.
  • the embodiment of the present application also provides a computer-readable storage medium, including computer-readable instructions, which, when the computer-readable instructions are run on the computer, cause the computer to execute any one of the implementation manners shown in the foregoing method embodiments.
  • An embodiment of the present application also provides a computer program product, the computer program product includes a computer program or an instruction, and when the computer program or instruction is run on a computer, the computer is made to execute any one of the implementation manners shown in the foregoing method embodiments.
  • the present application also provides a chip or a chip system, and the chip may include a processor.
  • the chip may also include memory (or storage module) and/or transceiver (or communication module), or, the chip is coupled with memory (or storage module) and/or transceiver (or communication module), wherein the transceiver ( or communication module) can be used to support the chip for wired and/or wireless communication, the memory (or storage module) can be used to store a program or a set of instructions, and the processor calls the program or the set of instructions can be used to implement the above method embodiments, An operation performed by a terminal or a network device in any possible implementation manner of the method embodiment.
  • the system-on-a-chip may include the above-mentioned chips, and may also include the above-mentioned chips and other discrete devices, such as memory (or storage module) and/or transceiver (or communication module).
  • the present application also provides a communication system, which may include the above first node and second node.
  • the communication system may be used to implement the operations performed by the first node or the second node in the foregoing method embodiment and any possible implementation manner of the method embodiment.
  • the device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, and the components shown as units may or may not be A physical unit can be located in one place, or it can be distributed to multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • the connection relationship between the modules indicates that they have communication connections, which can be specifically implemented as one or more communication buses or signal lines.
  • the essence of the technical solution of this application or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product is stored in a readable storage medium, such as a floppy disk of a computer , U disk, mobile hard disk, read only memory (read only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk, etc., including several instructions to make a computer device (which can be a personal A computer, a training device, or a network device, etc.) executes the methods described in various embodiments of the present application.
  • a computer device which can be a personal A computer, a training device, or a network device, etc.
  • all or part of them may be implemented by software, hardware, firmware or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transferred from a website, computer, training device, or data
  • the center transmits to another website site, computer, training device or data center via wired (eg coaxial cable, optical fiber, digital subscriber line) or wireless (eg infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be stored by a computer, or a data storage device such as a training device or a data center integrated with one or more available media.
  • the available medium may be a magnetic medium, (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, a solid state drive (solid state drive) , SSD)) etc.

Landscapes

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

Abstract

本申请实施例公开了一种报文周期的确定方法及其相关装置，应用于网际协议网络中。该方法包括：在第一节点与第二节点之间的第一周期映射关系是在第一节点与第二节点之间的第二周期映射关系之后生成的情况下，第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，然后再根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，这样确定的发送周期是第一节点为目标报文预留了对应资源的周期。本申请在第一周期映射关系的基础上再将目标报文按照周期偏移值偏移到发送周期，能保证第一节点计划发送目标报文的周期即发送周期是预留了对应资源的周期，避免了占用其他报文的资源，减少了资源混乱的问题，同时降低了数据混乱的可能性。

Description

一种报文周期的确定方法及其相关装置
本申请要求于2021年09月16日提交中国专利局、申请号为202111087385.6、申请名称为“一种报文周期的确定方法及其相关装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，尤其涉及一种报文周期的确定方法及其相关装置。
背景技术
确定性网络是当前的业界热点，确定性网络的需求来自于工业互联网、智能工厂和云化等场景，也来自于增强现实(augmented reality，AR)或虚拟现实(virtual reality，VR)实时交互、远程手术、触觉互联网等远程实时业务，确定性网络是指能保证业务的确定性带宽、时延、抖动、丢包率等服务质量保障指标的网络，且确定性网络能通过周期映射关系对报文进行确定性周期转发来保证端到端时延的确定性。
当前的确定性网络中的网络设备将时间划分为等长的周期，将报文按照周期进行排列和发送，确保报文端到端时延的确定性。但是依靠当前的技术支持，在相邻节点间是由多线路连接的情况下会对数据传输造成影响，产生数据混乱的可能性较大。
发明内容
本申请第一方面提供了一种寻呼消息的处理方法，具体包括：
本申请实施例提供了一种报文周期的确定方法及其相关装置，应用于网际协议(internet protocol，IP)网络中，能够减少资源错乱，降低数据混乱的可能性。
本申请实施例第一方面提供了一种报文周期的确定方法，包括：
第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值。该第一周期映射关系是第一节点在第一时刻接收到的由第二节点发送的报文生成的周期映射关系，该第二周期映射关系是第一节点在第二时刻接收到的由第二节点发送的报文生成的周期映射关系，该第二节点是第一节点的上游节点，且第二时刻位于第一时刻之前，即第一周期映射关系在第二周期映射关系之后生成。周期映射关系是第一周期与第二周期之间的对应关系，其中第一周期是由第二节点发送的报文携带的周期，第二周期是预测的第一节点发送携带第一周期的报文的时刻所处于的周期。
然后第一节点会根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，该发送周期为第一节点计划对目标报文进行发送的周期。
在本申请实施例中，第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，并且根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，确保第一节点在为目标报文预留了对应资源的周期内发送目标报文，避免占用其他报文的资源，减少了资源混乱，降低数据混乱的可能性。
在第一方面的一种可能的实现方式中，第一节点根据第一节点与第二节点之间的第一周期映射关系以及第二周期映射关系确定周期偏移值。该第二节点是第一节点的上游节点，其中第一节点会根据预设的定时机制周期性学习并生成第一节点与第二节点之间的周期映射关系，例如第一节点每隔半小时、一小时或两小时学习一次周期映射关系，具体设置根据实际情况确定，具体此处不做限定。该周期映射关系是指第一周期与第二周期之间的对应关系，其中第一周期是指第二节点发送报文的时刻所处于的周期，而第二节点会将该周期标记在报文中，因此第一周期也可以理解是由第二节点发送的报文携带的周期，然后第一节点接收到的携带第一周期的报文的时刻所处于的周期后的第一个周期是预测的第一节点发送携带第一周期的报文的周期，所以预测的第一节点发送携带第一周期的报文的时刻所处于的周期是第二周期。其中第一周期映射关系是第一节点基于在第一时刻接收到的由第二节点发送的报文学习后生成的周期映射关系，而第二周期映射关系是第一节点基于在第二时刻接收到的由第二节点发送的报文生成的周期映射关系，其中第二时刻早于第一时刻，即第一周期映射关系在第二周期映射关系之后生成。因为第二周期映射关系下对应的第二周期是为报文预留了资源的周期，所以周期偏移值是第一节点在第一周期映射关系下对应的第二周期距离预留了对应资源的周期需要偏移的周期数量。
得到确定的周期偏移值之后，第一节点会在第一周期映射关系的基础上再将目标报文按照周期偏移值进行偏移，偏移后的周期确定为目标报文的发送周期，也就是第一节点计划在某个周期内发送目标报文的那个周期。
本申请实施例中，第一节点根据定时机制周期性地学习周期映射关系，在第二周期映射关系后生成的第一周期映射关系，第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，然后再根据第一周期映射关系以及周期偏移值去确定目标报文的发送周期，确保了周期映射关系发送变化后第一节点仍然在预留了对应资源的周期内进行发送目标报文，避免占用其他报文的资源，减少了资源错乱，降低了数据混乱的可能性。
在第一方面的一种可能的实现方式中，当发送周期和/或所述邻近周期处于发送状态或接收状态等活跃状态时，第一节点会将该目标报文丢弃，其中邻近周期是与发送周期连续相邻的n个周期，n是预设的值且n为正整数。
本申请实施例中，在目标报文的发送周期和/或邻近周期处于活跃状态时，第一节点会将该目标报文丢弃，避免了同一个周期内接收两个周期的数据量，减少了周期数据溢出问题，也降低了数据混乱的可能性。
在第一方面的一种可能的实现方式中，在将第一节点与第二节点之间的周期映射关系从第二周期映射关系更新为第一周期映射关系时，第一节点可能处于发送状态或接收状态的周期，以及连续相邻的n个周期均被定义成活跃状态的周期，n是预设的值且n大于或等于1。因此当目标报文的发送周期和/或邻近周期处于活跃状态时，第一节点会将该目标报文丢弃，其中，活跃状态为发送状态或接收状态，邻近周期是与发送周期连续相邻的n个周期。
本申请实施例中，具体说明了活跃状态的周期，并且在目标报文的发送周期和/或邻近周期处于活跃状态时，第一节点会将该目标报文丢弃，避免了同一个周期内接收两个周期 的数据量，减少了周期数据溢出问题，也降低了数据混乱的可能性。
在第一方面的一种可能的实现方式中，当目标报文的发送周期和/或邻近周期不处于发送状态或接收状态等活跃状态时，第一节点执行将目标报文送入发送周期对应的队列的操作，然后在该发送周期的队列中进行发送。
本申请实施例中，在目标报文的发送周期和/或邻近周期不处于活跃状态时，第一节点执行将目标报文送入发送周期对应的队列的操作，这样能确保将目标报文在发送周期内发送是在预留了对应资源的周期内发送，避免了资源错乱，同时发送周期不处于活跃状态，表明该发送周期内没有其他的数据，因此能确保发送周期只接收目标报文，避免了周期数据溢出的问题，更进一步的降低了数据混乱的可能性。
在第一方面的一种可能的实现方式中，第一节点基于第一周期映射关系确定的第二周期为第三周期，第一节点基于第二周期映射关系确定的第二周期为第四周期，然后第一节点将第三周期与第四周期之间的差值作为周期偏移值。
在本申请实施例中，其中第四周期是预留了携带第一周期的报文对应资源的周期，第一节点将第三周期与第四周期之间的差值作为周期偏移值，直观的确定了第一节点接收到的携带第一周期的报文的第三周期与预留了对应资源的周期之间的周期偏移值。
在第一方面的一种可能的实现方式中，周期偏移值是第一节点在第一周期映射关系下对应的第二周期距离预留了对应资源的周期需要偏移的周期数量，将第一节点在第一周期映射关系下进行预测后确定的第二周期作为第三周期，则第一周期与第三周期之间的差值为第一偏移值，将第一节点在第二周期映射关系下进行预测后确定的第二周期作为第四周期，则第一周期与第四周期之间的差值为第二偏移值，因此第一节点将第一偏移值与第二偏移值之间的差值作为周期偏移值。
在本申请实施例中，第一节点通过第一周期映射关系以及第二周期映射关系得到第一偏移值以及第二偏移值，且第一节点基于第一偏移值以及第二偏移值分别表示第一周期映射关系以及第二周期映射关系，然后将第一偏移值与第二偏移值之间的差值作为周期偏移值，更快速高效的确定周期偏移值，提升了工作效率。
在第一方面的一种可能的实现方式中，第一节点根据第一周期映射关系、第二周期映射关系以及宏周期确定周期偏移值，其中宏周期是由H(H大于或等于1)个连续周期组成的，每个报文对应的宏周期代表了为该报文预留资源的最小重复时长，第一节点为报文预留对应资源是按照宏周期进行重复排列进行预留的，且宏周期内可能是一个周期或多个周期为该报文预留资源。
在本申请实施例中，第一节点根据第一周期映射关系、第二周期映射关系以及宏周期确定周期偏移值，能确保周期偏移值大于或等于0，避免了周期偏移值为负数时，目标报文的发送周期是已经发送或活跃状态的可能性，提升了方案的灵活性，也确保了目标报文在预留资源的周期内进行发送，进而避免了资源混乱。
在第一方面的一种可能的实现方式中，第一节点按照如下方式确定周期偏移值：
Z＝(Δ-Δ')mod H；
其中的Z为周期偏移值，Δ为第二偏移值，Δ'为第一偏移值以及H为宏周期的值，mod 代表求余，即Z为第一偏移值与第二偏移值的差值与宏周期的值做除法运算后的余数。
其中的第一偏移值是第一周期与第三周期之间的差值，该第三周期是第一节点基于第一周期映射关系确定的第二周期，第二偏移值是第一周期与第四周期之间的差值，第四周期为第一节点基于第二周期映射关系确定的第二周期。
在本申请实施例中，第一节点将第一偏移值与第二偏移值的差值与宏周期的值通过求余运算得到的值作为周期偏移值，能确保将目标报文在第三周期的下一个预留资源的周期内进行发送，避免了当第一偏移值与第二偏移值的差值为负数时，将目标报文送入第三周期的前一个可能已发送或正在发送的预留资源的周期，减少了报文丢失或周期数据溢出的问题，进而减少了资源错乱的可能性。
在第一方面的一种可能的方式中，第一节点按照如下方式确定周期偏移值：
Z＝(Δ-Δ')mod H+H；
其中的Z为周期偏移值，Δ为第二偏移值，Δ'为第一偏移值以及H为宏周期的值。除此之外还可以按照Z＝(Δ-Δ')mod H+k*H确定周期偏移值，其中k为预设的系数，可以根据实际情况自行设置自然数，如1、2、3、4等。
在本申请实施例中，第一节点将按照公式Z＝(Δ-Δ')mod H+H得到的值作为周期偏移值，在该周期偏移值上得到的目标报文的发送周期，能更大可能的避免将该目标报文丢弃，减少数据丢失，节约网络资源。
在第一方面的一种可能的实现方式中，当目标报文对应的宏周期至少为2时，此时第一节点才根据第一周期映射关系以及周期偏移值确定目标报文的发送周期。
本申请实施例中，当目标报文对应的宏周期至少为2时，第一节点才根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，减少了数据混乱的可能性的同时节省了对网络资源的占用。
在第一方面的一种可能的实现方式中，第一节点通过目标报文携带的预设标识确定目标报文对应的宏周期至少为2。
在本申请实施例中，第一节点通过目标报文携带的预设标识确定目标报文对应的宏周期至少为2，以此来确定宏周期至少为2的报文的发送周期提升了第一节点的工作效率。
在第一方面的一种可能的实现方式中，第一节点还接收由第二节点发送的携带目标周期的目标报文，该目标周期是第二节点发送目标报文的时刻所处于的周期。
然后第一节点根据第一周期映射关系、目标报文携带的目标周期以及周期偏移值确定目标报文的发送周期。
在本申请实施例中，第一节点接收到目标报文后，根据第一周期映射关系、目标报文携带的目标周期以及周期偏移值确定目标报文的发送周期，提升了方案的可靠性。
在第一方面的一种可能的方式中，第一节点将第一偏移值、目标周期以及周期偏移值之间的和作为目标报文的发送周期。
在本申请实施例中，给出了一种第一节点确定目标报文的发送周期的具体实现方式，具备可选择性。
在第一方面的一种可能的方式中，第一节点与第二节点之间的连接线路有多条，其中 第一周期映射关系对应第一节点与第二节点之间的第一连接线路，第二周期映射关系对应第一节点与第二节点之间的第二连接线路，该第一连接线路与第二连接线路不同。
在本申请实施例中，第一周期映射关系与第一连接线路对应，第二周期映射关系与第二连接线路对应，表示了第一节点与第二节点之间的连接线路的变化会导致周期映射关系的变化，明确了一种方案的应用场景，具备应用场景的选择性。
在第一方面的一种可能的方式中，宏周期的值预先配置在第一节点中，或者宏周期的值由第二节点发送的报文携带，并且该报文还包括目标报文。
在本申请实施例中，宏周期能预先配置在第一节点中，减少对网络资源的占用，节约了网络资源；或者由第二节点发送的报文携带，该报文包括目标报文，可直接从报文中获取对应的宏周期，提升了工作效率。
本申请实施例第二方面提供一种通信装置，该通信装置具有实现上述第一方面或第一方面任意一种可能实现方式的方法的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
本申请实施例第二方面的通信装置执行本申请实施例第一方面或第一方面任一种可能实现方式所描述的方法。
本申请实施例第三方面提供另一种通信装置，可以包括处理器，该处理器与存储器耦合，其中存储器用于存储指令，处理器用于执行存储器中的指令使得该通信装置执行本申请实施例第一方面或第一方面任意一种可能实现方式的方法。
本申请实施例第四方面提供另一种通信装置，包括处理器，用于执行存储器中存储的计算机程序(或计算机可执行指令)，当计算机程序(或计算机可执行指令)被执行时，使得该通信装置执行如第一方面及第一方面各个可能的实现中的方法。
在一种可能的实现中，处理器和存储器集成在一起；
在另一种可能的实现中，上述存储器位于该通信装置之外。
该通信装置还包括通信接口，该通信接口用于该通信装置与其他设备进行通信，例如数据和/或信号的发送或接收。示例性的，通信接口可以是收发器、电路、总线、模块或其它类型的通信接口。
本申请实施例第五方面提供一种计算机可读存储介质，包括计算机可读指令，当计算机可读指令在计算机上运行时，使得申请实施例第一方面或第一方面任一种可能实现方式所描述的方法被执行。
本申请实施例第六方面提供一种计算机程序产品，包括计算机可读指令，当计算机可读指令在计算机上运行时，使得本申请实施例第一方面或第一方面任一种可能实现方式所描述的方法被执行。
本申请实施例第七方面提供了一种芯片，该芯片包括至少一个处理器和至少一个接口电路，该接口电路和该处理器耦合，至少一个接口电路用于执行收发功能，并将指令发送给至少一个处理器，至少一个处理器用于运行计算机程序或指令，其具有实现如上述第一方面或第一方面任意一种可能实现方式的方法的功能，该功能可以通过硬件实现，也可以通过软件实现，还可以通过硬件和软件组合实现，该硬件或软件包括一个或多个与上述功 能相对应的模块。
第八方面，本申请实施例还提供一种通信系统，包括第二方面、第三方面、第四方面及前述各方面的各种可能的实现提供的通信装置。
附图说明
图1为一种确定性网络中相邻节点间的周期映射关系的示意图；
图2为学习周期映射关系的一个示意图；
图3为连接线路倒换的一个示意图；
图4为连接线路的倒换对应周期映射关系的一个示意图；
图5为连接线路的倒换对应周期映射关系的另一个示意图；
图6为本申请实施例应用场景的一个示意图；
图7为本申请实施例报文周期的确定方法的一个示意图；
图8为本申请实施例确定周期偏移值的一个示意图；
图9为本申请实施例中周期映射表项的一个示意图；
图10为本申请实施例中周期映射表项的另一个示意图；
图11为本申请实施例确定周期偏移值的另一个示意图；
图12为本申请实施例宏周期配置的一个示意图；
图13为本申请实施例报文携带宏周期的一个示意图；
图14为本申请实施例报文携带预设标识的一个示意图；
图15为本申请实施例通信装置的一个结构示意图；
图16为本申请实施例通信装置的另一个结构示意图。
具体实施方式
本申请实施例提供了一种寻呼消息的处理方法，控制设备可以通过获取接入网设备的寻呼队列的队列余量信息来计算接入网设备下发寻呼消息的能力，从而决定什么时候给接入网设备透传寻呼消息及以什么样的速率透传，这样就可以控制寻呼队列中寻呼消息的数量，始终保持寻呼队列不会溢出，从而解决了发送到接入网设备的寻呼消息可能被直接丢弃的问题。
在介绍本实施例之前，首先介绍在本申请实施例中可能出现的概念。应理解的是，相关的概念解释可能会因为本申请实施例的具体情况有所限制，但并不代表本申请仅能局限于该具体情况，在不同实施例的具体情况可能也会存在差异，具体此处不做限定。
本申请实施例提供了一种报文周期的确定方法及其相关装置，应用于IP网络中，能够减少资源错乱，降低数据混乱的可能性。
本申请的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的术语在适当情况下可以互换，这仅仅是描述本申请的实施例中对相同属性的对象在描述时所采用的区分 方式。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，以便包含一系列单元的过程、方法、系统、产品或设备不必限于那些单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它单元。
在介绍本申请实施例之前，先对目前常见的确定性网络中相邻节点间的周期映射关系进行简单的介绍，以便于后续理解本申请实施例。
目前，确定性网络的技术关键在于实现确定性时延、抖动、丢包率、带宽和可靠性等。确定性网络在传统网络的基础上引入周期转发的思想，通过根据周期映射关系进行确定性周期转发的方法来控制每个报文在每跳的转发时机来减少微突发，消除长尾效应，最终实现端到端时延的确定性。
下面请参阅图1，图1为一种确定性网络中相邻节点间的周期映射关系的示意图，假设由发送端节点A发出的报文，经由节点B转发，最终由节点C接收，即报文的传输路径为A→B→C，该路径涉及的节点A以及B的输出接口按照时间轴划分为长度T的周期对报文进行按周期发送，也就是将报文送入对应周期的队列中进行发送，其中每个周期都有对应的预设的编号(编号可以是T1、T2、T3或者1、2、3等形式，实际情况中可以根据具体情况做设定，具体此处不做限定)，报文被发送时节点A以及B会将发送报文的时刻所处于的周期即周期的编号标记在报文中，长度T可以是10微秒，或20微秒，或者1毫秒，实际情况中还可以是根据具体情况设定的合理值，具体此处不做限定。如图1所示的T1-T7为节点A以及B示意的各自7个周期划分情形。由于节点A是节点B的上游节点，因此节点B会基于从节点A处接收到的报文确定一个周期映射关系Y＝X+Δ，其中X代表节点A发送报文的携带的周期，Y代表计划在节点B发送携带了周期X的报文的周期，Δ表示的是偏移值，即报文从X周期偏移到Y周期需要的偏移的周期数，图1中节点B与节点A之间的Δ＝3，即周期映射关系Y＝X+3就是对于接收到的节点A在X周期发送的报文，节点B会在X+3周期对该报文进行周期转发(周期转发表示每个节点的输出接口划分的每一个周期对应一个队列，队列索引为报文中携带的周期，队列只在周期范围内打开，其余时间关闭，需要在这个周期内发送的报文根据映射后的周期入队进行发送)，例如节点B接收到的由节点A在T1周期的队列发送的报文，该报文会携带T1周期，因此节点B接收到该报文后将该报文从T1周期偏移三个周期后在T4周期的队列向节点C进行发送，后续周期的报文也遵循这个周期映射关系，例如节点A在T2周期的队列发送报文，根据周期映射关系节点B会在T5周期的队列进行发送，节点A在T3周期的队列发送报文，根据周期映射关系节点B会在T6周期的队列进行发送等。
其中节点B与节点A之间的周期映射关系是通过节点B接收节点A发送的报文进行学习并确定的。下面请参阅图2，图2为学习周期映射关系的一个示意图，节点A在X周期的末尾时刻发送一个报文，经过节点A与节点B之间的连接线路对报文的传输，节点B会在连接线路的传输时延p的基础上也就是Y周期的某个时刻接收到该报文，为确保完整发送报文，节点B会在该报文接收时刻之后的下一个完整周期内发送该报文。如图2所示，节点A与节点B之间的周期映射关系中的Δ＝Y+1-X，也就是节点A的X周期的报文在周期映射关系下在节点B为Y+1周期内进行发送。
相邻节点中的下游节点(例如图2所示的节点B)会根据预设的定时机制周期性的学习与上游节点(例如图2所示的节点A)之间的周期映射关系，若新生成的周期映射关系与之前的不同，则采用新的周期映射关系，其中下游节点中设置的定时机制可以是设置每10分钟、半小时或一小时重新学习与上游节点之间的周期映射关系，在实际情况中，具体定时机制以实际情况设定为准，具体此处不做限定。
而且在当前的实际网络中，相邻节点之间可能是通过双发选收、多线路连接方式、光传送网(optical transport network，OTN)或通过其他底层的传输网络等任一种连接方式进行连接，因此在当前正在进行传输工作的连接线路出现故障时，会倒换为另一条连接线路继续传输，以保证相邻节点间通信正常。请参阅图3，图3为连接线路倒换的一个示意图，节点R1与节点R2之间是通过OTN进行连接的，当原始连接线路A发送故障时，会倒换为新连接线路B继续传输。
而不同的连接线路的传输时延p可能是不一样的，所以连接线路的倒换也会造成周期映射关系的变化。请参阅图4，图4为连接线路的倒换对应周期映射关系的一个示意图，R1节点是R2节点的上游节点，连接线路倒换前，R2节点作为下游节点学习到R1节点与R2节点之间的初始周期映射关系为Y＝X+3，但是连接线路倒换后，R1节点与R2节点之间新的周期映射关系为Y＝X+4，即在如图3所示的R1节点与R2节点之间由原始连接线路A进行连接的情况下，R1节点在T1周期发送的报文会被R2节点在T4周期进行发送，倒换到新连接线路B之后，R1节点在T1周期发送的报文会被R2节点在T5周期进行发送，后续周期的对应情况依此类推。
但是每个报文对应的资源是按照预定的周期进行划分预留的，如图4所示，R1节点在T1周期发送的报文，R2节点为该T1周期的报文预留资源的周期是T4周期，连接线路倒换后，T1周期的报文在R2节点按照新的周期映射关系在T5周期进行报文的发送，而T5周期中预留的资源是给其他报文的，因此会占用其他报文的资源，产生资源混乱。
并且倒换连接线路还可能造成周期数据溢出问题，请参阅图5，图5为连接线路的倒换对应周期映射关系的另一个示意图。假设倒换前R1节点与R2节点之间的周期映射关系为Y＝X即Δ＝0，R1节点在原始连接线路下的周期1以及周期2发送的报文，对应进入R2节点的周期1以及周期2的队列内进行发送。但在连接线路倒换后，在倒换时刻R1节点与R2节点之间采用新的周期映射关系Y＝X+1，在新连接线路下R1节点在周期1发送的报文会进入R2节点的周期2的队列内等待发送，该周期2可能是处于正在发送报文或接收报文入队列等活跃状态的周期2(如图5所示中虚框中带斜杠的周期2)或者其他的周期2(如图5所示中虚框外空白的周期2)，如果当进入的是活跃状态的周期2时，该周期2接收了原始连接线路下的R1节点在周期2发送的报文以及新连接线路下R1节点在周期1发送的报文，超出了该周期2能承载的数据范围，造成周期数据溢出问题。因此多线路连接情况下会对数据传输造成影响，产生数据混乱可能性较大。
为解决上述问题，本申请实施例提供了一种报文周期的确定方法及其相关装置，用于在IP网络中的节点根据该节点与该节点的上游节点之间的第一周期映射关系以及在第一周期映射关系之前生成的第二周期映射关系确定周期偏移值，并根据第一周期映射关系以及 周期偏移值确定该上游节点发送的目标报文在该节点的发送周期，以此保证在预留资源的周期内发送目标报文，避免了占用其他报文的资源，减少了资源错乱，减少了数据混乱的可能性。
本申请实施例可以应用于IP网络中，IP网络中通过节点组成的路径传输报文，其中节点的实际形态可以是路由器、交换机或集线器等产品，还可以是其他能达到同样功能或目的的装置或产品，具体此处不做限定。为了更直观的理解本申请实施例在IP网络中的应用，下面对应用场景进行简单的举例描述。请参阅图6，图6为本申请实施例应用场景的一个示意图，IP网络中的入网关节点是第一中间转发节点的上游节点，第一中间转发节点会根据定时机制周期性学习与入网关节点之间的周期映射关系，第二周期映射关系为第一中间转发节点在某个时刻生成的第一中间转发节点与入网关节点之间的周期映射关系，在第一中间转发节点在第二周期映射关系之后生成第一周期映射关系的情况下，第一中间转发节点会根据第一周期映射关系以及第二周期映射关系确定周期偏移值，然后入网关节点在第一周期映射关系下向第一中间转发节点发送目标报文，然后接收到该目标报文的第一中间转发节点会根据第一周期映射关系以及周期偏移值确定该目标报文的发送周期，然后根据发送周期处理目标报文，以减少资源占用。在图6中的第一中间转发节点到第M中间转发节点之间的任意一个中间转发节点与其上游节点之间的周期映射关系发生变化后，均可如前述第一中间转发节点一样的方法确定接收到的目标报文的发送周期。本申请实施例确保了报文端到端时延的确定性，还计划在预留对应资源的周期发送目标报文，减少资源占用，降低数据混乱的可能性。
对本申请实施例的应用场景进行了简单描述之后，下面结合附图，对本申请实施例的报文周期的确定方法进行描述。本领域普通技术人员可知，随着技术的发展和新场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。具体请参阅图7，图7为本申请实施例报文周期的确定方法的一个示意图，具体包括：
701、第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值。
第一节点根据第一节点与第二节点之间的第一周期映射关系以及第二周期映射关系确定周期偏移值。其中第二节点是第一节点的上游节点，第一周期映射关系是第一节点基于在第一时刻接收到的由第二节点发送的报文生成的，第二周期映射关系是第一节点基于在第二时刻接收到的由第二节点发送的报文生成的，其中第二时刻早于第一时刻。
一种可能的实现中，作为下游节点的第一节点在预设的定时机制下周期性地学习与第二节点之间的周期映射关系。其中，定时机制以及周期映射关系的学习方式与上述的确定性网络中相邻节点间的周期映射关系中描述的类似，具体此处不在赘述。该周期映射关系是第一周期与第二周期之间的对应关系，其中第一周期为第二节点发送报文的时刻所处于的周期，可选地，第二节点将该第一周期标记在报文中，第一周期也可以理解是由第二节点发送的报文携带的周期；第二周期是预测的第一节点发送携带了第一周期的报文的时刻所处于的周期，可选地，第二周期为第一节点接收到携带了报文的时刻所处于的周期的后一个周期。
需要说明的是，在本申请的一些实施方式中，第一节点与第二节点之间可能是通过双 发选收、多线路连接方式、OTN或通过其他底层的传输网络等任一种连接方式进行连接，也有可能是其他的满足当前连接线路故障，能倒换到另一条连接线路继续进行第一节点与第二节点之间的数据传输的连接方式。第一周期映射关系是第一节点与第二节点之间的连接线路从第二连接线路倒换为第一连接线路后生成的周期映射关系，其中第一周期映射关系对应第一节点与第二节点之间的第一连接线路，第二周期映射关系对应第一节点与第二节点之间的第二连接线路。
在本申请的一些实施方式中，第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，或者第一节点根据第一周期映射关系、第二周期映射关系以及宏周期确定周期偏移值，并将该周期偏移值进行存储。
方式1、第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值。
第一节点将第一周期基于第一周期映射关系对应的第二周期作为第三周期，还将第一周期基于第二周期映射关系对应的第二周期作为第四周期，然后第一节点将第三周期与第四周期之间的差值作为周期偏移值。
下面结合附图说明第一节点将第三周期与第四周期之间的差值作为周期偏移值，具体请参阅图8，图8为本申请实施例确定周期偏移值的一个示意图，在发生倒换前第二节点在第二连接线路上发送的报文携带的第一周期为X周期，在第二周期映射关系下第一节点确定X周期对应的第四周期为bY周期，即第一节点接收到的携带X周期的报文计划会在bY周期进行发送；倒换后第二节点在第一连接线路上发送的携带的第一周期为X周期的报文，在第一周期映射关系下第一节点确定X周期对应的第三周期为gY周期，因为其中斜纹bY周期是为X周期的报文预留了资源的周期，gY周期是为其他报文预留资源的周期，为了不占用其他报文的资源，因此需要将X周期的报文从根据第一周期映射关系对应的gY周期偏移到bY周期，因此可以由Z＝(bY-gY)得到周期偏移值，其中Z表示周期偏移值，所以第一节点可由第三周期与第四周期之间的差值作为周期偏移值。
其中第四周期是预留了携带第一周期的报文对应资源的周期，第一节点将第三周期与第四周期之间的差值作为周期偏移值，直观的确定了第一节点接收到的携带第一周期的报文的第三周期与预留了对应资源的周期之间的周期偏移值。
一种可能的实现中，第一节点将第一偏移值与第二偏移值之间的差值作为周期偏移值。第一节点将第一周期与第三周期之间的差值作为第一偏移值，可以得到对应图8中的第一偏移值Δ'＝gY-X，且将第一周期与第四周期之间的差值作为第二偏移值，得到对应图8中的第二偏移值Δ＝bY-X，然后第一节点将第一偏移值与第二偏移值之间的差值作为周期偏移值，可选地，周期偏移值可如公式Z＝(Δ-Δ')所示确定，其中Z表示周期偏移值，Δ'表示第一偏移值，Δ表示第二偏移值。
第一节点将第一偏移值与第二偏移值的差值作为周期偏移值，能快速地得到在第一周期映射关系下将目标报文送入预留资源的周期时需要在第三周期的基础上偏移的周期数，提升了工作效率。
在本申请实施例的一些实施方式中，第一节点可以将第一周期映射关系更新到预定的周期映射表项中，该周期映射表项中记录了第一节点与上游节点之间的周期映射关系。示 例性的，请参阅图9，图9为本申请实施例中周期映射表项的一个示意图。周期映射表项是通过记录第一节点的上游节点标签，以及对应的第一节点与上游节点之间的周期映射关系的偏移值来体现第一节点与上游节点之间的周期映射关系。当第二节点是图9所示的R1节点时，周期映射表项中记录的第二周期映射关系对应的第二偏移值为Δ，在第一节点学习并生成第一周期映射关系后，可以将第二偏移值更新为第一周期映射关系对应的第一偏移值Δ'。更新后的周期映射表项具体请参阅图10中周期映射表项的另一个示意图。第一节点在将第一周期映射关系更新到周期映射表项中后，第一节点后续接收到的报文为目标报文，该目标报文会在第一周期映射关系下进行发送。
方式2、第一节点根据第一周期映射关系、第二周期映射关系以及宏周期确定周期偏移值。
第一节点在第一周期映射关系、第二周期映射关系以及宏周期的基础上，可以通过公式Z＝(Δ-Δ')mod H或Z＝((Δ-Δ')mod H)+H确定周期偏移值，下面分别进行说明：
方式2.1、第一节点将第一周期基于第一周期映射关系对应的第二周期作为第三周期，还将第一周期基于第二周期映射关系对应的第二周期作为第四周期，并且第一节点将第一周期与第三周期之间的差值作为第一偏移值，将第一周期与第四周期之间的差值作为第二偏移值。然后第一节点将第一偏移值与第二偏移值之间的差值与宏周期做求余运算得到的值为周期偏移值。具体可按照如下公式进行确定周期偏移值：
Z＝(Δ-Δ')mod H；
其中Z为周期偏移值，Δ为第二偏移值，Δ'为第一偏移值以及H为宏周期的值，H为正整数，mod代表求余，即Z为第一偏移值与第二偏移值的差值与宏周期的值做除法运算后的余数。其中宏周期是指由H个连续相连的周期组成的时长，每个报文对应的宏周期内包含预留了该报文对应资源的周期，并且按照宏周期进行重复排列。
请参阅图11，图11为本申请实施例确定周期偏移值的另一个示意图，第一节点对应的发送时刻bY周期是为由第二节点在X周期发送的报文预留了资源的周期，且每7个连续周期内包含了bY周期，并依次重复7个连续周期进行资源预留的排列，因此携带了该X周期的报文对应的宏周期H＝7。
并且从图11所示中可知，当第一节点与第二节点之间的连接线路为第二连接线路时，按照第二周期映射关系，X周期对应的第四周期为bY周期，但是当连接线路倒换为第一连接线路后，按照第一周期映射关系X周期对应的第三周期为gY周期，此时的(bY-gY)＝-1，表示需要将携带X周期的报文在gY周期的基础上前移一个周期到bY周期，但是此时不能保证gY周期前的bY周期是否已经被占用，因此将携带X周期的报文在gY周期的基础上往后移到gY周期后的第一个bY周期内，因为携带了X周期的报文对应的宏周期的H＝7，由此可以通过公式Z＝(bY-gY)mod H得到周期偏移值为6，即在gY周期的基础上后移6个周期就是预留了对应资源的bY周期。
由前述图11所示中可知，第一节点可以确定第一偏移值Δ'＝gY-X，第二偏移值Δ＝bY-X，再根据第一节点通过公式Z＝(bY-gY)mod H的基础上可以得到，第一节点通过公式Z＝(Δ-Δ')mod H得到周期偏移值为6。
由上述图11可见，第一节点可以通过Z＝(Δ-Δ')mod H确定周期偏移值，在另一种可能的实现中，也可以通过公式Z＝(bY-gY)mod H确定周期偏移值。
通过公式Z＝(Δ-Δ')mod H或Z＝(bY-gY)mod H确定的周期偏移值确保了能将报文在第三周期的基础上往后偏移到预留了对应资源的周期内，进一步的避免了资源占用，减少了造成数据混乱的可能性。
还需要说明的是，宏周期的值可以配置在第一节点的本地中，也可以由第二节点发送的报文携带，实际情况中可以采用任一种方式，具体此处不做限定。下面进行具体说明：
一种可能的实现中，宏周期配置在第一节点的本地中。示例性的，请参阅图12，图12为本申请实施例宏周期配置的一个示意图，在一个表项中记载了报文的标识以及对应报文的宏周期，例如报文标识为Flow1的报文对应的宏周期为7，报文标识为Flow2的报文对应的宏周期为5，实际情况中报文的宏周期根据具体设定情况定义，具体此处不做限定。将报文对应的宏周期直接配置在第一节点本地，减少了对网络传输资源的占用。
另一种可能的实现中，宏周期由第二节点发送的报文携带。示例性的，请参阅图13，图13为本申请实施例报文携带宏周期的一个示意图，报文中携带的X为周期号，H为宏周期，第一节点可从携带第一周期的报文中直接获取宏周期确定周期偏移值，提升了工作效率。
方式2.2、第一节点按照在公式Z＝(Δ-Δ')mod H的基础上得到的公式Z＝((Δ-Δ')mod H)+H确定周期偏移值。
从图11可知，第一节点可以将携带X周期的报文在gY周期的基础上偏移到gY周期后的第二个宏周期内预留对应资源的bY周期，如此在gY周期后的第一个bY周期为活跃状态时，将携带X周期的报文偏移到gY周期后的第二个bY周期内，可以进一步避免周期数据溢出的问题，由此可以通过公式Z＝((Δ-Δ')mod H)+H确定周期偏移值。而在另一种可能的实现中，第一节点还可以按照公式Z＝(bY-gY)mod H的基础上得到的公式Z＝(bY-gY)mod H+H确定周期偏移值。
通过如上所述的Z＝((Δ-Δ')mod H)+H或Z＝(bY-gY)mod H+H确定周期偏移值，进一步的减少周期数据溢出的可能性，进而减少了数据混乱的可能性。
另外还需要说明的是，一种可能的实现中，第一节点还可以按照公式Z＝((Δ-Δ')mod H)+k*H或Z＝(bY-gY)mod H+k*H确定周期偏移值，k为预设的常数系数，预设的值可以是0、1、2、3等自然数，具体此处不做限定。
702、第一节点根据第一周期映射关系以及周期偏移值确定目标报文的发送周期。
第一节点根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，该发送周期是计划将该目标报文发送的时刻所处于的周期。
一种可能的实现中，在第一节点根据第一映射关系更新映射关系表项后，接收到由第二节点发送的报文即目标报文后，第一节点确定接收到的目标报文的发送周期。
目标报文中携带第二节点发送该目标报文的时刻所处的周期的标识，即目标周期。第一节点将第一偏移值、周期偏移值以及目标周期的和作为发送周期。
示例性的，假设第二节点是图10所示的R1节点，且目标报文携带的目标周期为X， 那么定义发送周期为Y，那么第一节点可以直接根据周期映射表项中第二节点对应的第一偏移值Δ'以及保周期偏移值Z确定发送周期，即Y＝X+Z+Δ'。
可选的，第一节点可以在接收到目标报文的时候将携带的周期X更新为X+Z，然后再根据第一偏移值得到发送周期，即Y＝(X+Z)+Δ'。在实际情况中也可以是其他类似的形式进行确定，具体此处不做限定。
第一节点对接收到的目标报文直接确定发送周期，确保将所有的目标报文都主动进行偏移到预留了对应资源的周期，避免抢占为其他报文预留的资源。
另一种可能的实现中，当目标报文对应的宏周期至少为2时，第一节点才确定目标报文的发送周期。第一节点采用如上述Y＝X+Z+Δ'确定目标报文的发送周期。
第一节点只对宏周期至少为2的目标报文确定发送周期，进一步提升了数据传输的效率，因为宏周期为1的目标报文，表示第一节点上该宏周期为1的目标报文在每个周期都预留了资源，因此该目标报文不需要在第一周期映射关系的基础上再进行偏移也能确保该目标报文可以在预留了资源的周期内进行发送。
需要说明的是，第一节点可以通过目标报文中携带的预设标识确定目标报文对应的宏周期至少为2，或者第一节点也可以通过直接确定目标报文对应的宏周期来确定目标报文对应的宏周期至少为2。下面分别进行说明：
一种可能的实现中，第一节点通过目标报文中携带的预设标识确定目标报文对应的宏周期至少为2。
第二节点发送的目标报文，除了携带了周期标识，还会携带一个预设标识。示例性的，请参阅图14，图14为本申请实施例报文携带预设标识的一个示意图，其中X为第一节点接收到目标报文携带的周期，F为预设标识，该标识可以是一个比特位，将该比特置0或置1分别代表该目标报文的宏周期为1，或者代表该目标报文的宏周期大于或等于2；该标识也可以用一个字节代表宏周期大于或等于2，该字节的值可以根据实际情况进行设置，具体此处不做限定。可选的，预设标识F还可以是一个字段，当报文携带字段F表示该目标报文的宏周期大于或等于2，当报文没携带该字段F表示该目标报文的宏周期等于1。该当第一节点确认了该目标报文携带了预设标识F时，第一节点根据预设标识确定该目标报文的宏周期大于或等于2后，第一节点才确定该目标报文的发送周期。
可选的，目标报文还可以同时携带预设标识和宏周期，这样便于第一节点确定周期偏移值的同时，也能快速的确定需要确定目标周期的报文，提升了工作效率，对应宏周期以及预设标识的携带方式应该根据实际情况进行设定，具体此处不做限定。
第一节点直接通过目标报文携带的预设标识来确定该目标报文对应的宏周期至少为2，提升了工作效率。
另一种可能的实现中，第一节点通过确定目标报文对应宏周期来确定目标报文对应的宏周期是否至少为2。
可选的，宏周期可以配置在第一节点本地，或者可以携带在目标报文中，具体形式在上述步骤701中已经进行详细描述，此处不再赘述。第一节点可以根据本地配置的信息或目标报文中携带的宏周期确定该目标报文对应的宏周期，并判断该宏周期是否至少为2， 当目标报文的宏周期至少为2时，第一节点才确认该目标报文的发送周期。
第一节点通过确定目标报文的宏周期再来判断该宏周期是否至少为2的方式，减少了网络资源的占用，节约了网络资源。
703、第一节点根据发送周期处理目标报文。
第一节点确定目标报文的发送周期后，第一节点根据发送周期的状态处理目标报文。该状态包括活跃状态和非活跃状态。活跃状态指当前周期正处于发送状态或者接收状态；非活跃状态指当前周期不处于发送状态或者接收状态。
一种可能的实现中，当发送周期和/或邻近周期处于活跃状态时，第一节点将目标报文丢弃。
可选的，将处于活跃状态的周期与相邻的n个周期组成为活跃周期，当发送周期属于活跃周期时，第一节点将目标报文丢弃，其中n是正整数。在实际情况中，n的值可以根据具体情况进行设定，具体此处不做限定。举例来说，如上述图11中所示，虚线方框中的周期为当前的活跃周期，其中包含了预留资源的bY周期，若第一节点确定目标报文的发送周期为活跃周期中的bY周期时，则第一节点将目标报文丢弃。
一种可能的实现中，当发送周期和/或邻近周期处于活跃状态时，第一节点还可以通过公式Z＝((Δ-Δ')mod H)+H或Z＝(bY-gY)mod H+k*H重新确定该目标报文的发送周期，并且之后的目标报文的发送周期也由该公式进行确定。这样能减少数据丢包，更大可能的减少数据混乱的可能性。
另一种可能的实现中，当目标报文的发送周期或邻近周期处于非活跃状态时，也就是目标报文的发送周期不属于活跃周期时，第一节点在发送周期发送目标报文。例如目标报文的发送周期为上述图11中所示的gY周期后的第一个bY周期，且该bY周期不属于活跃周期，则第一节点在该bY周期发送目标报文。
可选的，当目标报文的发送周期或邻近周期处于非活跃状态时，第一节点可以将目标报文执行入发送周期对应的队列的操作，根据上述图11的示例，目标报文的发送周期为gY周期后的第一个bY周期且不属于活跃周期，则第一节点执行将目标报文入发送周期对应的队列的操作，然后等待后续的指令。
当发送周期和/或邻近周期处于活跃状态时，第一节点将目标报文丢弃，以及当发送周期和/或邻近周期处于非活跃状态时，第一节点才将目标报文送入发送周期对应的队列，都可以避免超出该发送周期能承载的数据范围引发的周期数据溢出问题，进而减小数据混乱的可能性。
另外需要说明的是，本申请实施例中的第二节点也可以是其他节点的下游节点，当该第二节点与上游节点之间的周期映射关系发生变化后，第二节点也可以如上述方法实施例中的第一节点通过上述方法实施例中的各种方式确定周期偏移值，再确定目标报文的发送周期。
在本申请实施例中，第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，然后第一节点再根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，且当发送周期或邻近周期处于活跃状态时，第一节点将目标报文丢弃，尽可能的避免 周期数据问题的发送，且当发送周期或邻近周期不处于活跃状态时，第一节点将目标报文送入发送周期对应的队列，以确保第一节点接收到的目标报文能在预留了对应资源的周期内进行发送，避免了资源占用，最大程度的减少了数据混乱的可能性。
为了实现上述本申请实施例提供的方法中的各功能，第一节点、第二节点均可以包括硬件结构和/或软件模块，以硬件结构、软件模块、或硬件结构加软件模块的形式来实现上述各功能。上述各功能中的某个功能以硬件结构、软件模块、还是硬件结构加软件模块的方式来执行，取决于技术方案的特定应用和设计约束条件。
如图15所示，本申请实施例还提供了一种通信装置1500。具体请参阅图15，图15为本申请实施例通信装置的一个结构示意图，该通信装置1500可以是第一节点或第二节点，也可以是网络设备中的路由装置，例如路由器、交换机以及集线器中至少一种设备，或者是能够和终端设备、网络设备匹配使用的装置。一种可能的实现中，该通信装置1500可以包括执行上述方法实施例中第一节点或第二节点执行的方法/操作/步骤/动作所一一对应的模块或单元，该单元可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。一种可能的实现中，该通信装置1500可以包括：第一确定单元1501、第二确定单元1502。第一确定单元1501可以用于执行如上述方法实施例中确定周期偏移值的步骤，第二确定单元1502可以用于执行如上述方法实施例中确定目标报文的发送周期的步骤。
另一种可能的实现中，该通信装置还可以包括丢弃单元1503、发送单元1504以及接收单元1505，丢弃单元1503，可以用于当目标报文的发送周期和/或邻近周期处于发送状态或接收状态等活跃状态时，将目标报文丢弃，该邻近周期为发送周期连续相邻的n个周期，n≥1；发送单元1504，可以用于当目标报文的发送周期和/或邻近周期不处于活跃状态时，将目标报文在发送周期进行发送；接收单元1505，可以用于接收由第二节点发送的目标报文，该目标报文中携带目标周期。
在本申请实施例中，第一确定单元1501根据第一周期映射关系以及第二周期映射关系确定周期偏移值，然后接收单元1505接收第二节点发送的目标报文，接着第二确定单元1502根据第一周期映射关系以及周期偏移值确定目标报文的发送周期，当发送周期和/或邻近周期不处于活跃状态时，发送单元1504将目标报文在发送周期进行发送，能确保发送目标报文的周期是预留了目标报文的资源的周期，减少了资源的占用，但是当发送周期和/或邻近周期不处于活跃状态时，丢弃单元1503将目标报文丢弃，减少了周期数据溢出问题，最大程度的降低了数据混乱的可能性。
在其他可能的设计中，上述第一确定单元1501、第二确定单元1502、丢弃单元1503、发送单元1504或接收单元1505可以一一对应的执行上述方法实施例中各种可能的实现方式中的方法/操作/步骤/动作。
在一种可能的设计中，上述第一确定单元1501，可以用于将上述方法实施例中的第三周期与第四周期之间的差值作为周期偏移值。
在一种可能的设计中，上述第一确定单元1501，可以用于将上述方法实施例中的第一偏移值与第二偏移值之间的差值作为周期偏移值。
在一种可能的设计中，所述第一确定单元1501，可以用于根据上述方法实施例中的第 一周期映射关系、第二周期映射关系以及宏周期确定周期偏移值。
在一种可能的设计中，上述第一确定单元1501，还可以用于按照上述方法实施例中的任一公式Z＝(Δ-Δ')mod H、Z＝(bY-gY)mod H、Z＝((Δ-Δ')mod H)+H、Z＝(bY-gY)mod H+H、Z＝((Δ-Δ')mod H)+k*H或Z＝(bY-gY)mod H+k*H确定周期偏移值：
在一种可能的设计中，上述第二确定单元1502，可以用于当目标报文对应的宏周期至少为2时，根据第一周期映射关系以及周期偏移值确定目标报文的发送周期。
在一种可能的设计中，上述第二确定单元1502，还可以用于通过目标报文携带的预设标识确定目标报文对应的宏周期至少为2。
在一种可能的设计中，上述第二确定单元1502，还可以用于根据第一周期映射关系、目标周期以及周期偏移值确定目标报文的发送周期。
在本申请上述实施方式中，根据第一周期映射关系、目标报文携带的目标周期以及周期偏移值确定目标报文的发送周期，提升了方案的可靠性。
在一种可能的设计中，所述第二确定单元1502，具体用于将第一偏移值、目标周期以及周期偏移值之间的和作为发送周期。
在本申请上述实施方式中，给出了一种确定目标报文的发送周期的具体实现方式，具备可选择性。
在一种可能的设计中，第一周期映射关系对应第一节点与第二节点之间的第一连接线路，第二周期映射关系对应第一节点与第二节点之间的第二连接线路，第一连接线路与第二连接线路不同。
在一种可能的设计中，上述发送单元1504，还可以用于发送携带了宏周期和/或预设标识的报文，该报文包括了目标报文。
本申请上述的各种设计的通信装置的有益效果请参考上述图7中方法实施例中一一对应的各种实现方式的有益效果，具体此处不在赘述。
需要说明的是，图15对应实施例所述的第一节点中各模块/单元之间的信息交互、执行过程等内容，与本申请中图7对应的方法实施例基于同一构思，具体内容可参见本申请前述所示的方法实施例中的叙述，此处不再赘述。
另外，在本申请各个实施例中的各功能模块或单元可以集成在一个处理器中，也可以是单独物理存在，也可以两个或两个以上模块或单元集成在一个模块或单元中。上述集成的模块或单元既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。
接下来介绍本申请实施例提供的另一种通信装置，请参阅图16，图16为本申请实施例通信装置的另一个结构示意图，通信装置1600上可以部署有图15对应实施例中所描述的模块，用于实现图15对应实施例中通信装置的功能，具体的，通信装置1600由一个或多个服务器实现，通信装置1600可因配置或性能不同而产生比较大的差异，可以包括一个或一个以上中央处理器(central processing units，CPU)1622(例如，一个或一个以上中央处理器)和存储器1632，一个或一个以上的存储介质1630(例如一个或一个以上海量存储设备)。其中，存储器1632和存储介质1630可以是短暂存储或持久存储。存储在存储介质1630的程序可以包括一个或一个以上模块(图示没标出)，每个模块可以包括对通信 装置1600中的一系列指令操作。更进一步地，中央处理器1622可以设置为与存储介质1630通信，在通信装置1600上执行存储介质1630中的一系列指令操作。
通信装置1600还可以包括一个或一个以上电源1626，一个或一个以上有线或无线网络接口1650，和/或，一个或一个以上输入输出接口1658。
本申请实施例中，中央处理器1622，用于执行图7对应实施例中的方法。例如，中央处理器1622可以用于：根据第一周期映射关系以及第二周期映射关系确定周期偏移值。该第一周期映射关系是通信装置1600在第一时刻接收到的由第二节点发送的报文生成的周期映射关系，该第二周期映射关系是通信装置1600在第二时刻接收到的由第二节点发送的报文生成的周期映射关系，该第二节点是通信装置1600的上游节点，且第二时刻位于第一时刻之前，即第一周期映射关系在第二周期映射关系之后生成。周期映射关系是第一周期与第二周期之间的对应关系，其中第一周期是由第二节点发送的报文携带的周期，第二周期是预测的通信装置1600发送携带第一周期的报文的时刻所处于的周期。然后再根据第一周期映射关系以及周期偏移值确定目标报文的发送周期。
需要说明的是，中央处理器1622还可以用于执行与本申请中图7对应的方法实施例中任意一个步骤，具体内容可参见本申请前述所示的方法实施例中的叙述，此处不再赘述。
本申请实施例还提供一种计算机可读存储介质，包括计算机可读指令，当计算机可读指令在计算机上运行时，使得计算机执行如前述方法实施例所示任一项实现方式。
本申请实施例还提供的一种计算机程序产品，计算机程序产品包括计算机程序或指令，当计算机程序或指令在计算机上运行时，使得计算机执行如前述方法实施例所示任一项实现方式。
本申请还提供一种芯片或芯片系统，该芯片可包括处理器。该芯片还可包括存储器(或存储模块)和/或收发器(或通信模块)，或者，该芯片与存储器(或存储模块)和/或收发器(或通信模块)耦合，其中，收发器(或通信模块)可用于支持该芯片进行有线和/或无线通信，存储器(或存储模块)可用于存储程序或一组指令，该处理器调用该程序或该组指令可用于实现上述方法实施例、方法实施例的任意一种可能的实现方式中由终端或者网络设备执行的操作。该芯片系统可包括以上芯片，也可以包含上述芯片和其他分立器件，如存储器(或存储模块)和/或收发器(或通信模块)。
本申请还提供一种通信系统，该通信系统可包括以上第一节点和第二节点。该通信系统可用于实现上述方法实施例以及方法实施例的任意一种可能的实现方式中由第一节点或者第二节点执行的操作。
另外需说明的是，以上所描述的装置实施例仅仅是示意性的，其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。另外，本申请提供的装置实施例附图中，模块之间的连接关系表示它们之间具有通信连接，具体可以实现为一条或多条通信总线或信号线。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到本申请可借助软 件加必需的通用硬件的方式来实现，当然也可以通过专用硬件包括专用集成电路、专用CPU、专用存储器、专用元器件等来实现。一般情况下，凡由计算机程序完成的功能都可以很容易地用相应的硬件来实现，而且，用来实现同一功能的具体硬件结构也可以是多种多样的，例如模拟电路、数字电路或专用电路等。但是，对本申请而言更多情况下软件程序实现是更佳的实施方式。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在可读取的存储介质中，如计算机的软盘、U盘、移动硬盘、只读存储器(read only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，训练设备，或者网络设备等)执行本申请各个实施例所述的方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。
所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、训练设备或数据中心通过有线(例如同轴电缆、光纤、数字用户线)或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、训练设备或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存储的任何可用介质或者是包含一个或多个可用介质集成的训练设备、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(digital video disc，DVD))、或者半导体介质(例如，固态硬盘(solid state drive，SSD))等。

Claims (27)

  1. 一种报文周期的确定方法，其特征在于，包括：
    第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值，所述第一周期映射关系为所述第一节点基于第一时刻接收到的由第二节点发送的报文生成的周期映射关系，所述第二周期映射关系为所述第一节点基于第二时刻接收到的由所述第二节点发送的报文生成的周期映射关系，所述第二时刻位于所述第一时刻之前，所述周期映射关系为第一周期与第二周期之间的对应关系，所述第一周期为所述第二节点发送的报文携带的周期，所述第二周期为预测的所述第一节点发送携带所述第一周期的报文的时刻所处于的周期，所述第二节点为所述第一节点的上游节点；
    所述第一节点根据所述第一周期映射关系以及所述周期偏移值确定目标报文的发送周期，所述发送周期为所述第一节点计划将所述目标报文进行发送的周期。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    当所述发送周期和/或邻近周期处于活跃状态时，所述第一节点将所述目标报文丢弃，所述活跃状态为发送状态或接收状态，所述邻近周期为所述发送周期连续相邻的n个周期，n为正整数。
  3. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    当所述发送周期和/或邻近周期不处于活跃状态时，所述第一节点在所述发送周期发送所述目标报文，所述活跃状态为发送状态或接收状态，所述邻近周期为所述发送周期连续相邻的n个周期，n为正整数。
  4. 根据权利要求1-3中任一项所述的方法，其特征在于，所述第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值包括：
    所述第一节点将第三周期与第四周期之间的差值作为所述周期偏移值，所述第三周期为基于所述第一周期映射关系确定的第二周期，所述第四周期为基于所述第二周期映射关系确定的第二周期。
  5. 根据权利要求1-3中任一项所述的方法，其特征在于，所述第一节点根据第一周期映射关系以及第二周期映射关系确定周期偏移值包括：
    所述第一节点根据所述第一周期映射关系、所述第二周期映射关系以及宏周期确定所述周期偏移值，所述宏周期为包含了预留资源的周期的H个连续周期，H大于或等于1。
  6. 根据权利要求5所述的方法，其特征在于，所述第一节点根据所述第一周期映射关系、所述第二周期映射关系以及宏周期确定所述周期偏移值包括：
    所述第一节点按照如下方式确定所述周期偏移值：
    Z＝(Δ-Δ')mod H；
    所述Z为所述周期偏移值；
    所述Δ为第二偏移值；
    所述Δ'为第一偏移值；
    所述H为所述宏周期的值；
    所述第一偏移值为所述第一周期与第三周期之间的差值，所述第二偏移值为所述第一 周期与第四周期之间的差值，所述第三周期为基于所述第一周期映射关系确定的第二周期，所述第四周期为基于所述第二周期映射关系确定的第二周期。
  7. 根据权利要求5或6所述的方法，其特征在于，所述第一节点根据所述第一周期映射关系以及所述周期偏移值确定目标报文的发送周期包括：
    当所述目标报文对应的所述宏周期至少为2时，所述第一节点根据所述第一周期映射关系以及所述周期偏移值确定所述目标报文的所述发送周期。
  8. 根据权利要求7所述的方法，其特征在于，所述第一节点确定目标报文的发送周期之前，所述方法还包括：
    所述第一节点通过所述目标报文携带的预设标识确定所述目标报文对应的所述宏周期至少为2。
  9. 根据权利要求1-8中任一项所述的方法，其特征在于，所述方法还包括：
    所述第一节点接收由所述第二节点发送的所述目标报文，所述目标报文中携带目标周期，所述目标周期为所述第二节点发送所述目标报文的时刻所处于的周期；
    所述第一节点根据所述第一周期映射关系以及所述周期偏移值确定目标报文的发送周期包括：
    所述第一节点根据所述第一周期映射关系、所述目标周期以及所述周期偏移值确定所述目标报文的所述发送周期。
  10. 根据权利要求9所述的方法，其特征在于，所述第一节点根据所述第一周期映射关系、所述目标周期以及所述周期偏移值确定所述目标报文的所述发送周期包括：
    所述第一节点将所述第一偏移值、所述目标周期以及所述周期偏移值的和作为所述发送周期。
  11. 根据权利要求1-10中任一项所述的方法，其特征在于，
    所述第一周期映射关系对应所述第一节点与所述第二节点之间的第一连接线路，所述第二周期映射关系对应所述第一节点与所述第二节点之间的第二连接线路，所述第一连接线路与所述第二连接线路不同。
  12. 根据权利要求1-11中任一项所述的方法，其特征在于，
    所述宏周期预先配置在所述第一节点中；
    或，
    所述宏周期由所述第二节点发送的报文携带，所述报文包括所述目标报文。
  13. 一种通信装置，其特征在于，包括：
    第一确定单元，用于根据第一周期映射关系以及第二周期映射关系确定周期偏移值，所述第一周期映射关系为所述第一节点基于第一时刻接收到的由第二节点发送的报文生成的周期映射关系，所述第二周期映射关系为所述第一节点基于第二时刻接收到的由所述第二节点发送的报文生成的周期映射关系，所述第二时刻位于所述第一时刻之前，所述周期映射关系为第一周期与第二周期之间的对应关系，所述第一周期为所述第二节点发送的报文携带的周期，所述第二周期为预测的所述第一节点发送携带所述第一周期的报文的时刻所处于的周期，所述第二节点为所述第一节点的上游节点；
    第二确定单元，用于根据所述第一周期映射关系以及所述周期偏移值确定目标报文的发送周期，所述发送周期为所述第一节点计划将所述目标报文进行发送的周期。
  14. 根据权利要求13所述的通信装置，其特征在于，所述通信装置还包括：
    丢弃单元，用于当所述发送周期和/或邻近周期处于活跃状态时，将所述目标报文丢弃，所述活跃状态为发送状态或接收状态，所述邻近周期为所述发送周期连续相邻的n个周期，n为正整数。
  15. 根据权利要求13所述的通信装置，其特征在于，所述通信装置还包括：
    发送单元，用于当所述发送周期和/或邻近周期不处于活跃状态时，在所述发送周期发送所述目标报文，所述活跃状态为发送状态或接收状态，所述邻近周期为所述发送周期连续相邻的n个周期，n为正整数。
  16. 根据权利要求13-15中任一项所述的通信装置，其特征在于，
    所述第一确定单元，具体用于将第三周期与第四周期之间的差值作为所述周期偏移值，所述第三周期为基于所述第一周期映射关系确定的第二周期，所述第四周期为基于所述第二周期映射关系确定的第二周期。
  17. 根据权利要求13-15中任一项所述的通信装置，其特征在于，所述第一确定单元，具体用于根据所述第一周期映射关系、所述第二周期映射关系以及宏周期确定所述周期偏移值，所述宏周期为包含了预留资源的周期的H个连续周期，H大于或等于1。
  18. 根据权利要求17所述的通信装置，其特征在于，所述第一确定单元具体用于按照如下方式确定所述周期偏移值：
    Z＝(Δ-Δ')mod H；
    所述Z为所述周期偏移值；
    所述Δ为第二偏移值；
    所述Δ'为第一偏移值；
    所述H为所述宏周期的值；
    所述第一偏移值为所述第一周期与第三周期之间的差值，所述第二偏移值为所述第一周期与第四周期之间的差值，所述第三周期为基于所述第一周期映射关系确定的第二周期，所述第四周期为基于所述第二周期映射关系确定的第二周期。
  19. 根据权利要求17或18中任一项所述的通信装置，其特征在于，所述第二确定单元具体用于当所述目标报文对应的所述宏周期至少为2时，根据所述第一周期映射关系以及所述周期偏移值确定所述目标报文的所述发送周期。
  20. 根据权利要求19所述的通信装置，其特征在于，所述第二确定单元还用于通过所述目标报文携带的预设标识确定所述目标报文对应的所述宏周期至少为2。
  21. 根据权利要求13-20中任一项所述的通信装置，其特征在于，所述通信装置还包括：
    接收单元，用于接收由所述第二节点发送的所述目标报文，所述目标报文中携带目标周期，所述目标周期为所述第二节点发送所述目标报文的时刻所处于的周期；
    所述第二确定单元，具体用于根据所述第一周期映射关系、所述目标周期以及所述周 期偏移值确定所述目标报文的所述发送周期。
  22. 根据权利要求21所述的通信装置，其特征在于，所述第二确定单元具体用于将所述第一偏移值、所述目标周期以及所述周期偏移值的和作为所述发送周期。
  23. 根据权利要求13-22中任一项所述的通信装置，其特征在于，
    所述第一周期映射关系对应所述通信装置与所述第二节点之间的第一连接线路，所述第二周期映射关系对应所述通信装置与所述第二节点之间的第二连接线路，所述第一连接线路与所述第二连接线路不同。
  24. 根据权利要求13-23中任一项所述的通信装置，其特征在于，
    所述宏周期预先配置在所述通信装置中；
    或，
    所述宏周期由所述第二节点发送的报文携带，所述报文包括所述目标报文。
  25. 一种通信装置，其特征在于，包括：处理器，所述处理器与存储器耦合，所述存储器存储指令，所述处理器用于执行所述指令，使得所述通信装置执行权利要求1至12中任意一项所述的方法。
  26. 一种计算机可读存储介质，包括计算机可读指令，其特征在于，当所述计算机可读指令在计算机上运行时，使得如权利要求1-12中任一项所述的方法被执行。
  27. 一种计算机程序产品，包括计算机可读指令，其特征在于，当所述计算机可读指令在计算机上运行时，使得如权利要求1-12中任一项所述的方法被执行。
PCT/CN2022/115735 2021-09-16 2022-08-30 一种报文周期的确定方法及其相关装置 WO2023040650A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111087385.6 2021-09-16
CN202111087385.6A CN115834508A (zh) 2021-09-16 2021-09-16 一种报文周期的确定方法及其相关装置

Publications (1)

Publication Number Publication Date
WO2023040650A1 true WO2023040650A1 (zh) 2023-03-23

Family

ID=85515040

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/115735 WO2023040650A1 (zh) 2021-09-16 2022-08-30 一种报文周期的确定方法及其相关装置

Country Status (2)

Country Link
CN (1) CN115834508A (zh)
WO (1) WO2023040650A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080279554A1 (en) * 2007-05-09 2008-11-13 Tohru Kazawa Optical line terminal capable of active bandwidth allocation for passive optical network system
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备
CN112804151A (zh) * 2021-01-21 2021-05-14 烽火通信科技股份有限公司 一种数据处理的方法、装置以及电子设备
CN112825510A (zh) * 2019-11-21 2021-05-21 华为技术有限公司 一种更新映射关系的方法以及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080279554A1 (en) * 2007-05-09 2008-11-13 Tohru Kazawa Optical line terminal capable of active bandwidth allocation for passive optical network system
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备
CN112825510A (zh) * 2019-11-21 2021-05-21 华为技术有限公司 一种更新映射关系的方法以及装置
CN112804151A (zh) * 2021-01-21 2021-05-14 烽火通信科技股份有限公司 一种数据处理的方法、装置以及电子设备

Also Published As

Publication number Publication date
CN115834508A (zh) 2023-03-21

Similar Documents

Publication Publication Date Title
US20230388239A1 (en) Packet sending method, network node, and system
CN110545241B (zh) 一种报文处理方法和装置
EP2721770B1 (en) Integrated circuit device and method of performing cut-through forwarding of packet data
WO2019214561A1 (zh) 一种报文发送的方法、网络节点和系统
US7852857B2 (en) Coupler for a ring topology network and an ethernet-based network
EP3734917B1 (en) Downlink message sending method and apparatus and downlink message forwarding method and apparatus
CN113300956A (zh) 处理用于时间敏感网络中的数据流的路由路径的装置及方法
JP2007181210A (ja) 可変長データパケットの異種ネットワークスイッチングシステム及びその方法、並びにシグナルリングインターフェースを用いたアドレステーブル構成方法
CN110870285A (zh) 在具有部分实时需求的数据网络中高性能数据传输的方法和执行该方法的装置
EP4152703A1 (en) Network control method and device
CN113366805A (zh) 报文调度方法、调度器、网络设备和网络系统
CN111585862A (zh) 一种EtherCAT与TSN网络互通的实现方法及装置
US20200213240A1 (en) Method Of Synchronization Of Data Packet Transmission
CN112688812B (zh) 应用于电力数据传输的可靠性感知时间敏感网络路由方法
Park et al. Worst-case analysis of ethernet AVB in automotive system
WO2023040650A1 (zh) 一种报文周期的确定方法及其相关装置
US11271772B2 (en) Method for transmitting data and system comprising communicating entity
JP2016503615A (ja) リアルタイムメッセージの送信方法およびリアルタイムメッセージを送信するためのコンピュータネットワーク
CN114301852A (zh) 报文传输控制、生成、传输方法及配置方法、设备、介质
JP2006519531A (ja) データネットワークにおける情報伝達
WO2023207628A1 (zh) 一种报文传输方法以及报文转发设备
KR100433761B1 (ko) 전이중 패스트 이더넷 방식과 토큰 링 매체 제어 방식을링형의 통신망에 적용하여 설계하는 방법
WO2024055897A1 (zh) 报文处理方法、传递方法、通信设备、系统、介质及产品
WO2023273788A1 (zh) 一种数据处理方法以及相关装置
JP7346670B1 (ja) マルチリンクデバイスによるデータ送信を制御するための方法、装置、デバイス及びコンピュータプログラム

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE