CN115334007A - Communication method and device - Google Patents
Communication method and device Download PDFInfo
- Publication number
- CN115334007A CN115334007A CN202110462366.0A CN202110462366A CN115334007A CN 115334007 A CN115334007 A CN 115334007A CN 202110462366 A CN202110462366 A CN 202110462366A CN 115334007 A CN115334007 A CN 115334007A
- Authority
- CN
- China
- Prior art keywords
- node
- period
- time
- message
- data message
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000004891 communication Methods 0.000 title claims abstract description 164
- 238000000034 method Methods 0.000 title claims abstract description 161
- 238000012545 processing Methods 0.000 claims description 135
- 238000005259 measurement Methods 0.000 claims description 67
- 238000013507 mapping Methods 0.000 claims description 27
- 238000003860 storage Methods 0.000 claims description 26
- 230000008569 process Effects 0.000 claims description 23
- 238000004590 computer program Methods 0.000 claims description 15
- 238000010586 diagram Methods 0.000 description 31
- 230000015654 memory Effects 0.000 description 26
- 230000009471 action Effects 0.000 description 23
- 230000005540 biological transmission Effects 0.000 description 23
- 230000006870 function Effects 0.000 description 20
- 230000000737 periodic effect Effects 0.000 description 20
- 238000011144 upstream manufacturing Methods 0.000 description 18
- 230000008901 benefit Effects 0.000 description 9
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 5
- 238000007493 shaping process Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000004065 semiconductor Substances 0.000 description 3
- 241000156302 Porcine hemagglutinating encephalomyelitis virus Species 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 239000007943 implant Substances 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
- 238000003892 spreading Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000003826 tablet Substances 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
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/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
- H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
Abstract
The application provides a communication method and a communication device, relates to the technical field of communication, and is used for determining the period of sending a data message under the condition of not expanding the format of the data message. The method comprises the following steps: the method comprises the steps of receiving a first boundary message and a first data message, determining a first period of a second node which sends the first data message according to the first boundary message, and sending the first data message in the first period of the second node. Therefore, the node can directly determine the period for sending the first data message according to the first boundary message without expanding the format of the data message.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a communication method and apparatus.
Background
In the current deterministic network, in order to satisfy the end-to-end deterministic delay and deterministic jitter of a service, an upstream node and a downstream node need to divide a sending period by a fixed time length, and the periods divided by the upstream node and the downstream node correspond to each other. The upstream node sends data to the downstream node according to a period, and the downstream node needs to forward the data to other nodes in a corresponding period. In order to facilitate the downstream node to identify which cycle the upstream node transmits data, when the upstream node transmits a data packet to the downstream node, a cycle label needs to be added to the data packet, so that the downstream node determines the cycle for the downstream node to forward the data packet according to the cycle label and a set cycle offset constant.
The upstream node adds a periodic tag in the data packet, and needs to extend the format of the data packet, which results in that the scheme in the prior art cannot be applied to a scenario in which the format of the data packet is not extended.
Disclosure of Invention
The application provides a communication method and device, which are used for determining the period of sending a data message under the condition of not expanding the format of the data message.
In order to achieve the purpose, the following technical scheme is adopted in the application:
in a first aspect, a communication method is provided, including:
the second node receives a first boundary message and a first data message from the first node, wherein the first boundary message is used for indicating a boundary between the data message sent in the first period of the first node and the data message sent in the adjacent period of the first node; . The second node determines a first period of the second node corresponding to the first data message according to the first delimiting message, wherein the first data message is a data message sent to the second node by the first node in the first period of the first node. The second node transmits the first data packet in a first period of the second node.
Based on the above technical solution, an embodiment of the present application provides a communication method, where a first node sends a first delimiting message to a second node, and the second node determines, according to the first delimiting message, a period for the second node to send a first data message. Therefore, the first node indicates the period of sending the data message by the second node through the newly added delimitation message, and the period of sending the data message can be determined without modifying the format of the data message. Therefore, the communication method provided by the embodiment of the application can be applied to scenes without modifying the format of the data message.
In addition, the second node may determine a period in which the second node transmits the first data packet according to the time of receiving the first delimiting packet. Therefore, the second node can determine the period of sending the data message without analyzing the delimitation message and the data message. Therefore, the communication method provided by the embodiment of the application can be applied to a scene without analyzing the format of the data message, and can reduce the transmission delay of the data message.
With reference to the foregoing first aspect, in a possible implementation manner, the method further includes: the second node determines a first time point for acquiring the first delimiting message; the second node determines a second time point according to the first time point, wherein the second time point is used for representing the time point of the second node which is estimated to process the data message sent by the first node in the first period of the first node; and the second node determines that a period after the second time point is a first period of the second node.
Based on this, the second node estimates the latest time for completing the processing of the first data message according to the time for receiving the first delimiting message, and then determines the time for sending the first data message according to the latest time for completing the processing of the first data message.
With reference to the foregoing first aspect, in a possible implementation manner, the method further includes: the second node receives a second delimitation message; the second delimiting message is used for indicating the boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node; the second node determines a second period of the second node corresponding to the second data message according to the sequence number of the second delimiting message and the sequence number of the first delimiting message; the second data message is a data message sent by the first node in a second period of the first node, and the second period of the second node is a period after the first period of the second node; the second period of the first node is a period after the first period of the first node; the second node sends a second data packet in a second period of the second node.
Based on this, the second node may determine, according to the determined mapping relationship between the delimited packet and the transmission cycle, a mapping relationship between the sequence number of the delimited packet and the sequence number of the transmission cycle after that. Furthermore, the second node may determine, according to the mapping relationship, a sequence number of a sending period corresponding to a sequence number of the newly received delimiting packet. The second node can determine the sequence number of the period for sending the data message corresponding to the new delimiting message according to the received sequence number of the new delimiting message, so that the calculation amount of the second node is reduced, and the calculation speed for determining the sending period is improved.
With reference to the first aspect, in a possible implementation manner, the method further includes: the second node determines that the sequence number of the second cycle of the second node satisfies the following formula:
C’＝C+(M’-M)
wherein, C 'is the serial number of the second cycle of the second node, C is the serial number of the first cycle of the second node, M is the serial number of the first delimiting packet, and M' is the serial number of the second delimiting packet.
Based on this, the second node can determine the sequence number of the period for sending the data message corresponding to the new delimiting message directly according to the formula and the sequence number of the new delimiting message.
With reference to the first aspect, in a possible implementation manner, the method further includes: the second node determines that the sequence number of the second cycle of the second node satisfies the following formula:
C’＝M’+offset
wherein C 'is a sequence number of a second cycle of the second node, M' is a sequence number of the second delimiting packet, and offset satisfies the following formula:
offset＝C-M
wherein, C is the sequence number of the first cycle of the second node, and M is the sequence number of the first boundary packet.
Based on this, the second node can determine the sequence number of the period for sending the data message corresponding to the new delimiting message directly according to the formula and the sequence number of the new delimiting message.
With reference to the foregoing first aspect, in a possible implementation manner, the first delimiting packet satisfies any one of the following: the first delimiting message is a data message sent by the first node at the initial time of the first period of the first node; the first delimiting message is a data message sent by the first node at the end time of the first period of the first node; the first delimiting message is a data message sent by the first node in the middle time of the first period of the first node; the first delimiting message is a data message sent by the first node in a period other than the first period of the first node.
With reference to the first aspect, in a possible implementation manner, when the first delimiting packet is a data packet sent by the first node at the start time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +T+L max +δ
wherein, t 1 Is a second point in time, t 0 Is a first time point, T is the duration of a first period of the first node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
When the first delimiting packet is a data packet sent by the first node at the end time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +L max
when the first delimiting packet is a data packet sent by the first node in the middle time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ
h is the duration between the time when the first node sends the first delimiting message and the end time of the first period of the first node;
when the first delimiting packet is a data packet sent by the first node in a period other than the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ+N×T
the node sends a first data message to a second node, wherein N is the number of cycles at an interval between a cycle of sending the first delimiting message by the first node and a cycle of sending the first data message by the second node, and N is a positive integer.
Based on this, under the condition that the first node sends the first delimiting message at different time, the second node determines the second time point by adopting different methods, and provides a basis for the second node to determine the first period of the second node sending the first data message.
In a second aspect, a communication method is provided, including:
a first node sends a first boundary message to a second node, wherein the first boundary message is used for indicating a boundary between a data message sent in a first period of the first node and a data message sent in an adjacent period of the first node; the first node sends a first data message to the second node in a first period of the first node; the first delimiting message is used by the second node to determine the sending period of the first data message.
Based on the above technical solution, an embodiment of the present application provides a communication method, where a first node sends a first delimiting message and a first data message to a second node, respectively. This enables the second node to determine the time to send the first data packet based on the first delimiting packet.
With reference to the second aspect, in a possible implementation manner, the method further includes: the first node sends a first delimiting message to the second node at the starting time of a first period of the first node; or the first node sends a first delimiting message to the second node at the end time of the first period of the first node; or the first node sends a first delimiting message to the second node in the middle of the first period of the first node; or the first node sends the first bound message to the second node at a time outside the first period of the first node.
Based on this, the first node may send the first delimiting packet to the second node at different points in time.
With reference to the second aspect, in a possible implementation manner, the method further includes: the first node sends a second delimitation message to the second node; the second delimiting message is used for indicating the boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node; the first node sends a second data message to the second node in a second period of the first node; the second delimiting message is used for the second node to determine the sending period of the second data message, and the second period of the first node is a period after the first period of the first node.
Based on this, the first node may send the second delimiting message and the second data message to the second node, so that the second node determines, according to the second delimiting message, a time when the second node sends the second data message.
In a third aspect, a communication method is provided, including:
the second node receives the first data message; the second node acquires the receiving time of the first data message, and determines a first period of the second node sending the first data message according to the receiving time of the first data message; the second node transmits the first data packet in a first period of the second node.
Based on the foregoing technical solution, in another communication method provided in this embodiment of the present application, the second node determines, according to the time for receiving the first data packet, a period for the second node to send the first data packet. Therefore, the period for sending the data message can be determined without modifying the format of the data message. Therefore, the communication method provided by the embodiment of the application can be applied to a scene without modifying the format of the data message.
In addition, in the embodiment of the present application, the second node may determine the period for sending the data packet without analyzing the delimiting packet and the data packet. Therefore, the communication method provided by the embodiment of the application can be suitable for a scene without analyzing the format of the data message, and can reduce the transmission delay of the data message.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines the time interval to which the first data message belongs; and the second node determines the first period of the second node of the first data message according to the time interval to which the first data message belongs.
Based on this, the second node may determine a time interval corresponding to the time when the data reaches the second node, and determine a first period of the second node, where the second node sends the first data packet, according to the time interval.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines a third time point for receiving the measurement message, wherein the measurement message is a message sent by the first node in the first period of the first node; and the second node determines a plurality of time intervals and periods corresponding to the time intervals according to the third time point.
Based on this, the second node may determine a time interval corresponding to the subsequent data packet according to the time when the measurement packet reaches the second node.
With reference to the foregoing third aspect, in a possible implementation manner, the method further includes: the second node determines a fourth time point according to the third time point, wherein the fourth time point is used for representing the time point of the second node for pre-estimated processing of the data message sent by the first node in the first period of the first node; the second node determines a first time interval according to the third time point; the first time interval is (t) a ,t a + T- δ); the first time interval corresponds to the Ty period of the second node; wherein, t a Is a third time point, and T is the duration of the first period of the first node; the Ty cycle is a cycle after the fourth time point; the second node determines the kth time interval as t a +k*T-δ,t a And (k + 1) T- δ), wherein the kth time interval corresponds to the Ty + k-1 period of the second node, and k is an integer greater than 1.
Based on this, the second node may determine, according to the foregoing manner, a time interval corresponding to each data packet arriving at the second node and a corresponding transmission cycle of the second node.
With reference to the third aspect, in a possible implementation manner, the fourth time point satisfies the following formula:
t 3 ＝t 2 +T+L max +δ
wherein, t 3 Is the fourth hourIntermediate point, t 2 Is a third time point, T is the duration of the first period of the first node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
Based on this, the second node may determine a period after the time when all data transmitted by the first node in one period are processed as a period for transmitting the data, so that it may be ensured that the data transmitted by the second node in one period is also the data transmitted by the first node in one period.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines a first period of the second node of the first data message according to the time difference between the first data message and the third period of the second node; the third data message is a previous data message of the first data message received by the second node; the third period of the second node is a period in which the second node transmits the third data packet.
Based on this, the second node may determine that two data packets with an interval time greater than or equal to δ are packets in different periods, and two data packets with an interval time less than δ are packets in the same period.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node receives a third data message; the second node determines a fifth time point for receiving the third data message; the second node determines a sixth time point according to the fifth time point, wherein the sixth time point is used for representing the time point of the second node for pre-estimated processing of the data message sent by the first node in the third period of the second node; and the second node determines that a period after the sixth time point is a third period of the second node.
Based on this, the second node may determine, according to the time for receiving the first packet sent by the first node in a period, the period for sending the data packet in the period by the second node.
With reference to the third aspect, in one possible implementation manner, the sixth time point satisfies the following formula:
t 5 ＝t 4 +T+L max +δ
wherein, t 5 Is the sixth time point, t 4 Is a fifth time point, T is the duration of a third period of the second node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the third period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
Based on this, the second node may determine that a period after the time when all data transmitted by the first node in one period is processed is a period for transmitting the data, so that it may be ensured that the data transmitted by the second node in one period is also the data transmitted by the first node in one period.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines whether the time difference between the first data message and the third data message is smaller than a preset value; if so, the second node determines that the third period of the second node and the first period of the second node are the same period; if not, the second node determines a seventh time point for acquiring the first data message; the second node determines an eighth time point according to the seventh time point, wherein the eighth time point is used for representing the time point of the second node for pre-estimated processing of the data message sent by the first node in the first period of the second node; and the second node determines that the period after the eighth time point is the first period of the second node.
Based on this, the second node may determine that two data packets with an interval time greater than or equal to δ are packets in different periods, and two data packets with an interval time less than δ are packets in the same period.
With reference to the third aspect, in a possible implementation manner, the eighth time point satisfies the following formula:
t 7 ＝t 6 +T+L max +δ
wherein, t 7 At an eighth time point, t 6 Is a seventh time point, T is the duration of a third period of the second node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
Based on this, the second node may determine a period after the time when all data transmitted by the first node in one period are processed as a period for transmitting the data, so that it may be ensured that the data transmitted by the second node in one period is also the data transmitted by the first node in one period.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines a third period of the first node for sending the first data message according to the time for receiving the first data message; the second node determines the first period of the second node according to the third period of the first node.
Based on the above, the second node determines the period of the first node for sending the first data message according to the time for receiving the first data message, and further determines the first period of the second node for sending the first data message.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines a time interval for the first node to send the first data message according to the time for receiving the first data message, the time delay between the first node and the second node and the time delay jitter between the first node and the second node; and the second node determines a third period of the first node for sending the first data message according to the time interval for sending the first data message by the first node.
Based on this, in a deterministic network, the value of the delay before each node and the maximum value of the delay jitter are determined. Therefore, after the second node receives the first data packet, the second node may determine the time when the first node transmits the first data packet according to the time when the first data packet is received, the time delay between the first node and the second node, and the time delay jitter between the second node and the second node.
With reference to the third aspect, in a possible implementation manner, the method further includes: the second node determines the mapping relation between the period of the first node and the period of the second node; and the second node determines the first period of the second node corresponding to the third period of the first node according to the mapping relation and the third period of the first node.
Based on this, the second node may determine the period for the second node to send the first data packet according to the mapping relationship between the period of the first node and the period of the second node, and the period for the first node to send the first data packet.
With reference to the foregoing third aspect, in a possible implementation manner, the method further includes: the time interval for the first node to send the first data message satisfies the following conditions:
wherein, t x D, a time delay between the first node and the second node is a time when the second node receives the first data message, and delta is a maximum value of a time delay jitter between the first node and the second node.
Based on this, the second node may determine the time when the first node sends the first data packet according to the time interval.
In a fourth aspect, a communication method is provided, including:
the first node sends a measurement message in a first period of the first node; the first node sends a first data message in a preset time period in a first period of the first node.
With reference to the fourth aspect, in a possible implementation manner, the start time of the preset time period is the same as the start time of the first cycle of the first node; or the end time of the preset time period is the same as the end time of the first cycle of the first node.
With reference to the fourth aspect, in a possible implementation manner, the duration of the preset time period is a difference between the duration of the first period of the first node and 2 δ; δ is the maximum value of the delay jitter between the first node and the second node.
With reference to the fourth aspect, in a possible implementation manner, the first node sends the third data packet to the second node within a preset time period of a third cycle of the second node, where the third cycle of the second node is a cycle after the first cycle of the first node.
In a fifth aspect, a communication apparatus is provided, including: a communication unit and a processing unit.
The communication unit is used for receiving a first delimiting message and a first data message from a first node, wherein the first delimiting message is used for indicating a boundary between the data message sent in a first period of the first node and the data message sent in a period adjacent to the first period of the first node. And the processing unit is used for determining a first period of a second node corresponding to the first data message according to the first delimiting message, wherein the first data message is a data message sent by the first node to the second node in the first period of the first node. And the processing unit is further used for instructing the communication unit to send the first data message in the first period of the second node.
With reference to the fifth aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a first time point for acquiring a first boundary message; determining a second time point according to the first time point, wherein the second time point is used for representing the time point of the second node which is estimated to process the data message sent by the first node in the first period of the first node; and determining a period after the second time point as the first period of the second node.
With reference to the fifth aspect, in a possible implementation manner, the communication unit is further configured to: receiving a second delimiting message; the second delimiting message is used for indicating the boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node; the processing unit is further used for determining a second period of the second node corresponding to the second data message according to the sequence number of the second delimiting message and the sequence number of the first delimiting message; the second data message is a data message sent by the first node in the second period of the first node, and the second period of the second node is a period after the first period of the second node; the second period of the first node is a period after the first period of the first node; and the processing unit is further configured to instruct the communication unit to send the second data packet in the second period of the second node.
With reference to the fifth aspect, in a possible implementation manner, the sequence number of the second cycle of the second node satisfies the following formula:
C’＝C+(M’-M)
wherein, C 'is the serial number of the second cycle of the second node, C is the serial number of the first cycle of the second node, M is the serial number of the first delimiting packet, and M' is the serial number of the second delimiting packet.
With reference to the fifth aspect, in a possible implementation manner, the sequence number of the second cycle of the second node satisfies the following formula:
C’＝M’+offset
wherein, C 'is the sequence number of the second cycle of the second node, M' is the sequence number of the second delimiting packet, and offset satisfies the following formula:
offset＝C-M
wherein, C is the sequence number of the first cycle of the second node, and M is the sequence number of the first boundary packet.
With reference to the fifth aspect, in a possible implementation manner, the first delimiting packet satisfies any one of the following: the first delimiting message is a data message sent by the first node at the initial time of the first period of the first node; the first delimiting message is a data message sent by the first node at the end time of the first period of the first node; the first delimiting message is a data message sent by the first node in the middle time of the first period of the first node; the first delimiting message is a data message sent by the first node in a period other than the first period of the first node.
With reference to the fifth aspect, in a possible implementation manner, when the first delimiting packet is a data packet sent by the first node at the start time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +T+L max +δ
wherein, t 1 Is a second point in time, t 0 Is a first time point, T is the duration of a first period of the first node, L max The maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node;
when the first delimiting packet is a data packet sent by the first node at the end time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +L max
when the first delimiting packet is a data packet sent by the first node in the middle time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ
h is the duration between the time when the first node sends the first boundary message and the end time of the first period of the first node;
when the first delimiting packet is a data packet sent by the first node in a period other than the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ+N×T
the method comprises the steps that N is the number of periods of an interval between a period that a first node sends a first boundary message and a period that a second node sends a first data message, and N is a positive integer.
In a sixth aspect, a communication apparatus is provided, including: a communication unit and a processing unit. And the processing unit is used for indicating the communication unit to send a first boundary message to the second node, wherein the first boundary message is used for indicating a boundary between a data message sent in a first period of the first node and a data message sent in an adjacent period of the first node. The processing unit is further used for indicating the communication unit to send a first data message to the second node in a first period of the first node; the first delimiting message is used by the second node to determine the sending period of the first data message.
With reference to the sixth aspect, in a possible implementation manner, the processing unit is specifically configured to: instructing the communication unit to send a first delimiting message to a second node at the starting time of a first period of a first node; or, instructing the communication unit to send a first delimiting message to the second node at the end time of the first period of the first node; or, instructing the communication unit to send a first delimiting message to the second node in the middle of the first period of the first node; or, the communication unit is instructed to send the first delimiting message to the second node at a time other than the first period of the first node.
With reference to the sixth aspect, in a possible implementation manner, the processing unit is further configured to: instructing the communication unit to send a second delimiting message to the second node in a second period of the first node; the second delimiting message is used for indicating the boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node; instructing the communication unit to send a second data message to the second node in a second period of the first node; the second delimiting message is used for the second node to determine the sending period of the second data message.
In a seventh aspect, a communication apparatus is provided, including: a communication unit and a processing unit. The communication unit is used for receiving the first data message. And the processing unit is used for acquiring the receiving time of the first data message and determining the first period of the second node which sends the first data message according to the receiving time of the first data message. And the processing unit is further used for instructing the communication unit to send the first data message in the first period of the second node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a time interval to which the first data message belongs; and determining a first period of a second node of the first data message according to the time interval to which the first data message belongs.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is further configured to: determining a third time point for receiving a measurement message, wherein the measurement message is a message sent by the first node in the first period of the first node; and determining a plurality of time intervals and periods corresponding to the time intervals according to the third time point.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a fourth time point according to the third time point, wherein the fourth time point is used for representing the time point of the second node for processing the data message sent by the first node in the first period of the first node; determining a first time interval according to the third time point; the first time interval is (t) a ，t a + T- δ); the first time interval corresponds to the Ty period of the second node; wherein, t a Is a third time point, and T is the duration of the first period of the first node; the Ty cycle is a cycle after the fourth time point; determining the kth time interval as [ t ] a +k*T-δ,t a Plus (k + 1) × T- δ), the kth time interval corresponds to the Ty + k-1 period of the second node, and k is an integer greater than 1.
With reference to the seventh aspect, in a possible implementation manner, the fourth time point satisfies the following formula:
t 3 ＝t 2 +T+L max +δ
wherein, t 3 Is a fourth time point, t 2 Is a third time point, T is the duration of the first period of the first node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a first period of a second node of the first data message according to the time difference between the first data message and the third period of the second node; the third data message is a previous data message of the first data message received by the second node; the third period of the second node is a period in which the second node transmits the third data packet.
With reference to the seventh aspect, in a possible implementation manner, the communication unit is further configured to receive a third data packet; the processing unit is further configured to determine a fifth time point for receiving the third data packet; the processing unit is further configured to determine a sixth time point according to the fifth time point, where the sixth time point is used to represent a time point, which is estimated by the second node, of processing a data packet sent by the first node in a third period of the second node; and the processing unit is further configured to determine that a period after the sixth time point is a third period of the second node.
With reference to the seventh aspect, in a possible implementation manner, the sixth time point satisfies the following formula:
t 5 ＝t 4 +T+L max +δ
wherein, t 5 Is the sixth time point, t 4 At a fifth time point, T is the duration of a third period of the second node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the third period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining whether the time difference between the receiving of the first data message and the receiving of the third data message is smaller than a preset value; if so, determining that the third period of the second node and the first period of the second node are the same period; if not, determining a seventh time point for acquiring the first data message; determining an eighth time point according to the seventh time point, wherein the eighth time point is used for representing the time point of the second node for pre-estimated processing of the data message sent by the first node in the first period of the second node; and determining the period after the eighth time point as the first period of the second node.
With reference to the seventh aspect, in a possible implementation manner, the eighth time point satisfies the following formula:
t 7 ＝t 6 +T+L max +δ
wherein, t 7 At an eighth time point, t 6 Is a seventh time point, T is the duration of a third period of the second node, L max The maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the second node is completed, and delta is the maximum value of the time delay jitter between the first node and the second node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a third period of the first node for sending the first data message by the first node according to the time for receiving the first data message; the first period of the second node is determined according to the third period of the first node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a time interval for the first node to send the first data message according to the time for receiving the first data message, the time delay between the first node and the second node and the time delay jitter between the first node and the second node; and determining a third period of the first node for sending the first data message according to the time interval for sending the first data message by the first node.
With reference to the seventh aspect, in a possible implementation manner, the processing unit is specifically configured to: determining a mapping relation between the period of the first node and the period of the second node; and determining the first period of the first node corresponding to the first period of the second node according to the mapping relation and the first period of the second node.
With reference to the seventh aspect, in a possible implementation manner, a time interval during which the first node sends the first data packet satisfies:
wherein, t x The time of receiving the first data packet for the second node, d the time delay between the first node and the second node, δ being the time delay between the first node and the second nodeThe maximum value of jitter.
In an eighth aspect, there is provided a communication apparatus comprising: a processing unit and a communication unit; the processing unit is used for indicating the communication unit to send the measurement message in a first period of the first node; and the processing unit is further used for indicating the communication unit to send the first data message in a preset time period in the first cycle of the first node.
With reference to the eighth aspect, in a possible implementation manner, the starting time of the preset time period is the same as the starting time of the first cycle of the first node; or the end time of the preset time period is the same as the end time of the first cycle of the first node.
With reference to the eighth aspect, in a possible implementation manner, the duration of the preset time period is a difference between the duration of the first period of the first node and 2 δ; δ is the maximum value of the delay jitter between the first node and the second node.
With reference to the eighth aspect, in a possible implementation manner, the processing unit is further configured to: and indicating the communication unit to send a second data message to the second node within a preset time period of a third period of the second node, wherein the third period of the second node is a period after the first period of the first node.
In a ninth aspect, the present application provides a computer-readable storage medium comprising a computer program or instructions which, when run on a computer, causes the computer to perform the method as described in the first aspect and any one of the possible implementations of the first aspect.
In a tenth aspect, the present application provides a computer-readable storage medium comprising a computer program or instructions which, when run on a computer, cause the computer to perform the method as described in the second aspect and any one of the possible implementations of the second aspect.
In an eleventh aspect, the present application provides a computer-readable storage medium comprising a computer program or instructions which, when run on a computer, causes the computer to perform the method as described in any one of the possible implementations of the third aspect and the third aspect.
In a twelfth aspect, the present application provides a computer-readable storage medium comprising a computer program or instructions which, when run on a computer, causes the computer to perform the method as described in any one of the possible implementations of the fourth aspect and the fourth aspect.
In a thirteenth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as described in the first aspect and any one of the possible implementations of the first aspect.
In a fourteenth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as described in the second aspect and any one of the possible implementations of the second aspect.
In a fifteenth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as described in the third aspect and any one of the possible implementations of the third aspect.
In a sixteenth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as described in the fourth aspect and any one of the possible implementations of the fourth aspect.
In a seventeenth aspect, the present application provides a communication system comprising a first communication device and a second communication device. Wherein the first communication device is adapted to perform a method as described in the first aspect and any possible implementation manner of the first aspect; the second communication device is adapted to perform a method as described in the second aspect and any one of the possible implementations of the second aspect.
In an eighteenth aspect, the present application provides a communication system comprising a third communication device and a fourth communication device. Wherein the third communication device is configured to perform the method as described in the third aspect and any possible implementation manner of the third aspect; the fourth communication device is adapted to perform a method as described in the fourth aspect and any possible implementation manner of the fourth aspect.
It should be appreciated that the description of technical features, solutions, benefits, or similar language in this application does not imply that all of the features and advantages may be realized in any single embodiment. Rather, it is to be understood that the description of a feature or advantage is intended to include the specific features, aspects or advantages in at least one embodiment. Therefore, descriptions of technical features, technical solutions or advantages in this specification do not necessarily refer to the same embodiment. Furthermore, the technical features, technical solutions and advantages described in the present embodiments may also be combined in any suitable manner. One skilled in the relevant art will recognize that an embodiment may be practiced without one or more of the specific features, aspects, or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments.
Drawings
Fig. 1 is a system architecture diagram of a communication system according to an embodiment of the present application;
fig. 2 is a system architecture diagram of a smart grid system according to an embodiment of the present disclosure;
fig. 3 is a system architecture diagram of a deterministic network according to an embodiment of the present application;
fig. 4 is a schematic diagram of periodic mapping of data packets between nodes according to an embodiment of the present application;
fig. 5 is a schematic diagram of a transmission process of a data packet from a sending end to an eGW according to an embodiment of the present application;
fig. 6 is a flowchart illustrating a communication method according to an embodiment of the present application;
fig. 7 is a flowchart illustrating another communication method according to an embodiment of the present application;
fig. 8 is a schematic diagram that a second node determines a sending period of the second node according to a delimited packet according to the embodiment of the present application;
fig. 9 is a schematic diagram of a field of a delimited packet according to an embodiment of the present application;
fig. 10 is a schematic diagram of a field of another delimited packet provided in the embodiment of the present application;
fig. 11 is a schematic diagram of a field of another delimited packet provided in the embodiment of the present application;
fig. 12 is a flowchart illustrating another communication method according to an embodiment of the present application;
fig. 13 is a schematic diagram illustrating a relationship between a time of a packet at a first node and a time of a packet received at a second node when there is no delay jitter between nodes according to the embodiment of the present application;
fig. 14a is a schematic diagram illustrating the earliest time when a data packet sent by a first node reaches a second node when delay jitter exists between nodes according to the embodiment of the present application;
fig. 14b is a schematic diagram of the earliest time when a data packet sent by a first node reaches a second node when delay jitter exists between nodes according to the embodiment of the present application;
fig. 14c is a schematic diagram that when there is delay jitter between nodes and a first node does not send data within the last 2 δ time of each cycle, a data packet sent by the first node reaches the earliest time of a second node according to the embodiment of the present application;
fig. 15 is a flowchart illustrating another communication method according to an embodiment of the present application;
fig. 16 is a schematic diagram that a first node sends a data packet and a measurement packet to a second node in a T0 period, and the second node performs periodic mapping according to the measurement packet and the data packet, according to an embodiment of the present application;
fig. 17 is a flowchart illustrating another communication method according to an embodiment of the present application;
fig. 18 is a flowchart illustrating another communication method according to an embodiment of the present application;
fig. 19 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 20 is a schematic hardware structure diagram of a communication device according to an embodiment of the present application;
fig. 21 is a schematic hardware structure diagram of a communication device according to an embodiment of the present disclosure;
fig. 22 is a schematic hardware structure diagram of a terminal device according to an embodiment of the present application;
fig. 23 is a schematic hardware structure diagram of a network device according to an embodiment of the present application.
Detailed Description
In the description of this application, "/" means "or" unless otherwise stated, for example, A/B may mean A or B. "and/or" herein is merely an association describing an associated object, and means that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. Further, "at least one" means one or more, "a plurality" means two or more. The terms "first", "second", and the like do not necessarily limit the number and execution order, and the terms "first", "second", and the like do not necessarily limit the difference.
It is noted that, in the present application, words such as "exemplary" or "for example" are used to mean exemplary, illustrative, or descriptive. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
The communication system in the embodiment of the present application includes, but is not limited to, a Long Term Evolution (LTE) system, a fifth generation (5 th-generation, 5G) system, a New Radio (NR) system, a Wireless Local Area Network (WLAN) system, and a future evolution system or a multiple communication convergence system. Among them, the 4G system may also be referred to as an Evolved Packet System (EPS). The core network of the 4G system may be referred to as an Evolved Packet Core (EPC), and the access network may be referred to as Long Term Evolution (LTE). The core network of the 5G system may be referred to as a 5GC (5G core) and the access network may be referred to as a New Radio (NR). For convenience of description, the present application is exemplified below by applying the present application to a 5G system, but it is understood that the present application is equally applicable to a 4G system, a third generation (3G) system, and the like, without limitation. For example, the method provided by the embodiment of the present application may be specifically applied to an evolved-terrestrial radio access network (E-UTRAN) and a next generation radio access network (NG-RAN) system.
The network device in the embodiment of the present application is an entity for transmitting a signal, or receiving a signal, or transmitting a signal and receiving a signal on a network side. The network device may be a device deployed in a Radio Access Network (RAN) to provide a wireless communication function for a terminal, and may be, for example, a Transmission Reception Point (TRP), a base station (e.g., an evolved NodeB (eNB or eNodeB), a next generation base station (gNB), a next generation eNB (ng-eNB), etc.), various control nodes (e.g., a network controller, a radio controller (e.g., a radio controller in a Cloud Radio Access Network (CRAN) scenario)), a Road Side Unit (RSU), etc. Specifically, the network device may be a macro base station, a micro base station (also referred to as a small station), a relay station, an Access Point (AP), or the like in various forms, and may also be an antenna panel of the base station. The control node may be connected to multiple base stations, and configure resources for multiple terminals under the coverage of multiple base stations. In systems using different Radio Access Technologies (RATs), the names of devices with base station functionality may vary. For example, the LTE system may be referred to as eNB or eNodeB, and the 5G system or NR system may be referred to as gNB, and the application does not limit the specific names of the base stations. The network device may also be a network device in a Public Land Mobile Network (PLMN) for future evolution, and the like.
The terminal device in the embodiment of the present application is an entity for receiving a signal, or sending a signal, or receiving a signal and sending a signal at a user side. The terminal device is used to provide one or more of voice services and data connectivity services to the user. A terminal device may also be referred to as a User Equipment (UE), a terminal, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user equipment. The terminal device may be a vehicle to electric (V2X) device, such as a smart car (smart car or interactive car), a digital car (digital car), an unmanned car (unmanned car or drive car or pilot car or auto-mobile), an automatic car (self-driving car or auto-mobile car), a pure electric car (pure EV or Battery EV), a hybrid electric car (HEV), a Range Extended EV (REEV), a plug-in hybrid electric car (plug-in, PHEV), a new energy vehicle (new energy vehicle), and the like. The terminal device may also be a device to device (D2D) device, such as an electric meter, a water meter, etc. The terminal device may also be a Mobile Station (MS), a subscriber unit (subscriber unit), a drone, an internet of things (IoT) device, a station in a WLAN (station, ST), a cellular phone (cellular phone), a smart phone (smart phone), a cordless phone, a wireless data card, a tablet, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA) device, a laptop computer (laptop computer), a Machine Type Communication (MTC) terminal, a handheld device with wireless communication capability, a computing device, or other processing device connected to a wireless modem, a vehicle mounted device, a wearable device (also referred to as a wearable smart device). The terminal device may also be a terminal device in a next generation communication system, for example, a terminal device in a 5G system or a terminal device in a PLMN for future evolution, a terminal device in an NR system, and the like.
It should be noted that, the first node, the second node and the third node referred to in this application may be specifically implemented as a terminal device or a network device.
The communication method provided in the embodiment of the present application may be applied to the communication system 100 shown in fig. 1, and as shown in fig. 1, the communication system 100 includes:
a first node 110, a second node 120, and a third node 130. The first node 110 and the second node 120 may be communicatively coupled via a communication link; the second node 120 and the third node 130 may be communicatively coupled via a communication link. The communication link described in the embodiments of the present application may refer to a wireless communication link, a wired communication link, or another type of communication link, which is not limited in the present application.
The first node 110 is an upstream node of the second node 120, and correspondingly, the second node 120 is a downstream node of the first node 110. The second node 120 is an upstream node of the third node 30. Accordingly, the third node 130 is a downstream node of the second node 120.
The first node 110 is configured to send data packets to the second node 120 in one or more cycles, respectively. The second node 120 determines a period for forwarding the data packet after receiving the data packet from the first node 110, and sends the data packet to the third node 130 in the period.
In one possible example, the communication system provided by the embodiment of the present application may be a smart grid system 200 as shown in fig. 2.
As shown in fig. 2, the smart grid system 200 includes a substation 210, a Distribution Terminal Unit (DTU) 220, a Base Station (BS) 230, a base station side gateway (CSG) 240, an Aggregation Side Gateway (ASG) 250, and an edge computing (MEC) node 260.
In the smart grid system, the substation 210 is communicatively connected to the DTU220 via a communication link, and the DTU220 is communicatively connected to the base station 230 via a communication link. The base station 230 is communicatively coupled to one CSG240 in the CSG ring via a communication link. The CSG240 is communicatively coupled to the ASG250 via a communication link. ASG250 is communicatively coupled to MEC260 via a communication link.
It is noted that in the smart grid system 200, two DTUs 220 may be connected to each base station 230. Each CSG240 may be connected to one or more base stations 230.
There may be a plurality of CSGs 240 in the smart grid system 200, and the plurality of CSGs 240 may constitute a CSG ring. Generally, a maximum of 20 CSGs 240 may be included in one CSG ring.
Each ASG250 may connect one or more CSG rings. In general, one ASG250 may connect 20 CSG rings.
In a current smart grid system 200, the bandwidth of a CSG ring is 10gbps, and the bandwidth of an asg ring is 50Gbps. The length of the single-hop fiber between each node (e.g., CSG240 and ASG 250) is typically 2-10 km.
Each DTU220 sends 14 data packets every 5ms, with each data packet being 386B in size. The end-to-end time delay (delay) in the smart grid system is 1ms, and the time delay jitter (jitter) is 200us.
In the embodiment of the present application, the communication system shown in fig. 1 or the smart grid system shown in fig. 2 is a deterministic network (deterministic networking) communication system.
A deterministic network means that the maximum value of the delay and jitter of a data packet during transmission in the network is determined, and the delay and jitter of the data packet during transmission in the network do not exceed the maximum value. Deterministic networks need to meet the end-to-end bandwidth, delay and jitter requirements of services.
The deterministic network is mainly applied to remote real-time services such as an industrial internet, an intelligent factory, a Power Line Communication (PLC) remote, cloud deployment, an Augmented Reality (AR)/Virtual Reality (VR) technology, a remote operation, a touch internet and the like.
In a deterministic network, each node in the network divides the time to transmit data in units of cycles. And each node transmits data based on the divided periods.
An example, as shown in fig. 3, a deterministic network includes a sender, one or more nodes, and a receiver.
The sending end is used for sending data, the nodes are used for forwarding the data according to the divided periods, and the receiving end is used for receiving the data.
The one or more nodes include at least: ingress Gateway (iww), forwarding (R) node, egress interface (egress Gateway, eggw). The number of R nodes includes one or more.
The cycle of the iGW includes: t0, T1, T2, T3. The period of the R node includes: t24, T25, T26, T27. The cycle of the eGW node comprises: t159, T1160, T161, T162. The cycle length of each node is T.
That is, the iGW transmits data in the periods T0, T1, T2, T3. The R node transmits data in periods T24, T25, T26, T27. The eGW transmits data in periods T159, T160, T161, T162.
In the current deterministic network, in order to ensure that nodes can periodically forward data and maintain the certainty of end-to-end delay, the following method is adopted among the nodes of the deterministic network to process the data:
1. edge shaping
In a deterministic network, a node sends a data message in a time domain by taking a cycle as a unit. In order to ensure that the data packet sent by the node in each period does not exceed the maximum data volume that the node can send in the period, the node needs to perform edge shaping on the data packet after receiving the data packet, so that the shaped data packet conforms to the capability of the node to send the data packet in cycles.
Specifically, after receiving the data message, the node adjusts the size of the data message so that the data message forwarded by the node per period does not exceed Bi × T. Wherein Bi is a bandwidth defined in a Service Level Agreement (SLA) of the data stream, and T is a duration of each period determined by the node.
2. Periodic mapping
The period of sending data messages between two adjacent nodes (marked as an upstream node and a downstream node) of the deterministic network has a fixed mapping relation X → X + delta, delta is a period offset constant, and X is a positive integer. If the upstream node sends the data packet a to the downstream node in the xth period, the downstream node needs to send the data packet a in the xth + Δ period after receiving the data packet a.
3. Periodic tag
As can be known from the introduction of the above-mentioned period mapping, after the downstream node receives the data packet from the upstream node, it needs to determine the period of the data packet sent by the upstream node. In this way, the downstream node can determine in which cycle the data packet needs to be sent according to the cycle offset constant.
In order to enable the downstream node to determine the period in which the upstream node sends the data packet, the upstream node adds a period label to the data packet, so that the downstream node can determine the period of the mapped downstream node according to the period label and a period offset constant. And the downstream node determines the period of the mapped downstream node, and modifies the original period label in the data message into the period label of the downstream node.
In an example, as shown in fig. 4, a sending end of a first node sends a data packet at a T18 period of the first node, where the data packet carries a period identifier 18. After receiving the data packet, the receiving end of the second node parses the periodic tag in the data packet, and determines that the periodic tag in the data packet is 18. The second node receiving end determines that the value of the periodic offset constant delta between the first node and the second node is 73. The receiving end of the second node determines that the period of the second node to which the data is mapped is the period of T91 (18 + 73). The receiving end of the second node modifies the period label in the data into 91 and maps the data message to a T91 period sending queue of the second node. The second node sending end sends the data message within the T91 cycle time.
And the messages sent by the first node in the following period are periodically mapped and sent by adopting the same mapping method.
It should be noted that the period label added in the data message by the current upstream node may be a period label with a cycle number, for example, the upstream node adopts a cycle number with a period label of 0-3.
4. Periodic forwarding
The second node sets a sending queue for sending data messages in each period, and the index of the sending queue is a period label. After receiving the data message, the second node determines a sending queue of the data message according to the period label in the data message and the index of the sending queue, and the second node adds the data message into the sending queue.
An example, as shown in fig. 5, is a transmission process of a data message from a sender to an eGW.
As shown in fig. 5, a sending end sends a data packet to an iww, and an iww receiving end receives the data packet and performs edge shaping on the data packet, so that the data packet meets the requirement that the iww periodically sends the data packet. After the edge shaping, the iGW receiving end maps the data message to a corresponding periodic transmission queue. And the iGW sends the data messages in the periodic sending queue to the R node after the periodic time is reached.
As shown in fig. 5, the iGW maps data packet # 1 to the T6 period of the iGW, data packet # 2 to the T7 period of the iGW, and data packet # 3 to the T8 period of the iGW. Data packet # 1 is shown as #1, data packet # 2 is shown as #2, and data packet # 3 is shown as # 3.
And after receiving the data message from the iGW, the R node receiving end analyzes the data message, determines a period label in the data message, and determines a sending queue for mapping the message to the period of the R node according to the period label in the data message. And the R node sends the data message in the periodic sending queue to the downstream R node after the period time is reached.
The R node determines that the value of the period offset constant delta is 1, the R node maps the data message # 1 to the T7 period of the R node, maps the data message # 2 to the T8 period of the R node, and maps the data message # 3 to the T9 period of the R node.
The downstream R node processes and forwards the data message in the same processing mode as the R node.
After the data message reaches the eGW, the eGW receiving end receives the data message. And the eGW receiving end analyzes the data message, determines a periodic label in the data message, and determines a periodic transmission queue for mapping the message to the eGW according to the periodic label in the data message. And the eGW sends the data message in the periodic sending queue to the receiving end after the periodic time is reached.
As shown in fig. 5, the eGW maps the data packet # 1 to the Tx period of the eGW, maps the data packet # 2 to the Ty period of the eGW, and maps the data packet # 3 to the Tz period of the eGW.
It is noted that for any two nodes in a deterministic network, the time difference between the boundaries of the periods of the two nodes is the same. For example, if the difference between the start time of the period T4 of the iww and the end time of the period T2 of the R node is D, the difference between the start time of the period T12 of the iww and the end time of the period T10 of the R node is also D. The difference between the start time of the period T4 of the iGW and the end time of the period T153 of the eGW is D 1 The difference between the start time of the period T12 of the iGW and the end time of the period T157 of the eGW is also D 1 。
5. Period of node
The period of the node refers to a time period determined after the time for sending the data message by the node is periodically divided.
For example, the first node transmits data on a continuous time axis. At this time, the time axis of the first node may be divided into a plurality of periods by a predetermined period duration. The plurality of cycles are recorded as cycles of the first node. The first node sends a data packet in each cycle.
In this embodiment, the first period of the first node, the second period of the first node, and the third period of the third node are used to characterize different periods in which the first node sends the data packet.
The first period of the second node, and the second period of the second node, and the third period of the second node are used to represent different periods of the second node sending data packets.
6. Bound message
The delimited message is a message for periodic delimitation. The delimitation message can indicate the boundary between the data messages sent by the first node in two adjacent periods.
The first node sends the delimited message at a specific moment of the first node's cycle. After receiving the delimited message, the second node may determine, according to the delimited message, a transmission period of the data message corresponding to the delimited message.
For example, the first node may send the delimited packet at the beginning of each cycle of the first node. In this way, the data packet between every two adjacent delimited packets is the data packet sent by the first node in the same period.
For another example, the first node may send the delimiting packet at the end of each period of the first node. Thus, the data message between every two adjacent delimited messages is the data message sent by the first node in the same period.
For another example, the first node determines that the Q-th message sent in each period of the first node is the delimited message, so that after the second node receives the delimited message, Q-1 messages before the delimited message and messages between the delimited message and the next delimited message other than Q-1 messages before the next delimited message are determined to be messages in the same period. Q is a positive integer.
Based on this, after the second node receives the delimiting message and the data message sent by the first node, the second node may determine the data message belonging to the same period according to the delimiting message sent by the first node.
7. Measurement messages
The measurement packet is a packet sent by the first node in a certain period of the first node (which may be the first period of the first node) for performing time measurement.
After the second node receives the measurement packet, the second node may determine a period of the second node to which the measurement packet is mapped according to a time when the measurement packet reaches the second node. And the second node determines the period of the second node mapped by the data message according to the period of the second node mapped by the measurement message and the time interval between the data message received by the second node and the measurement message.
As can be seen from the above description, in the process of forwarding a data packet, an upstream node needs to add a period tag in the data packet to enable a downstream node to determine the period of a downstream node to which the data is mapped. The upstream node needs to modify the format of the data packet to be able to add the periodic tag in the data packet. The method is not suitable for scenes without modifying the format of the data message.
In addition, after receiving the data packet, the downstream node needs to interpret the data packet to determine the period label in the data packet, and the method is also not suitable for a scenario in which the node does not analyze the data packet. And the time required for the downstream node to analyze the data message is longer, and the method can cause the time delay of data transmission to be increased.
In order to enable a node to determine a period for sending a data packet without modifying a format of the data packet, embodiments of the present application provide a communication method, which is described below with reference to a first embodiment and a second embodiment. It should be noted that the terms or expressions used in the embodiments of the present application may be mutually referred to, and are not limited.
Example one
The communication method provided in the first embodiment may be applied to the communication system shown in fig. 1, and as shown in fig. 6, the communication method provided in the first embodiment includes:
s600, the first node sends the first boundary message and the first data message to the second node. Correspondingly, the second node receives the first delimiting message and the first data message from the first node.
The first boundary packet is used for indicating a boundary between a data packet sent in a first period of the first node and a data packet sent in a period adjacent to the first period of the first node. Further, the second node may send the cycle of the first data packet according to the first delimiting packet. The first data packet is a data packet sent by the first node to the second node in the first period of the first node. The first period of the first node is one of the one or more periods of the first node.
In one possible implementation, the first node sends a delimiting packet to the second node in each period of the first node.
If the first node sends the delimiting message at the starting time or the ending time of each period, the second node can determine that the data message between two adjacent delimiting messages is the data message sent by the first node in the same period.
It should be noted that, in this embodiment of the present application, the first node may send the first delimiting packet and the first data packet to the second node at the same time, or the first node may also send the first delimiting packet and the first data packet to the second node respectively. This is not limited in this application.
S601, the second node determines a first period of the second node corresponding to the first data message according to the first delimiting message.
Wherein the first period of the second node is one of the one or more periods of the second node. The first period of the second node is a period determined by the second node for the second node to send the first data packet.
In one possible implementation, the first node sends the first boundary packet at a fixed time of each period. After the second node receives the first bound message, the latest time of the second node for receiving the data message belonging to the same period as the first bound message can be estimated according to the time of receiving the first bound message. The second node determines that a period after the latest time is a period for the second node to send a data message which belongs to the same period as the first delimiting message.
In one example, the first delimiting packet and the first data packet are both packets sent by the first node in the first period of the first node, and the first delimiting packet is a packet sent by the first node in the start time of the first period of the first node.
In this case, the second node determines the latest time point of receiving the data packet belonging to the same cycle as the first delimiting packet according to the time point of receiving the first delimiting packet. The second node determines that a period after the latest point in time is the first period of the second node.
It should be noted that, because the first node periodically sends the data packet, the time length of the period is determined. Therefore, the second node can determine the sending period of the data message which belongs to the same period as the delimited message according to the delimited message, and can also determine the sending period of the data message which does not belong to the same period as the delimited message according to the delimited message. For example, after the latest time of the data packet belonging to the same period as the first delimiting packet, the second node determines the time after N periods of the latest time, and the time is the latest time when the data packet sent by the first node in the N periods after the delimiting packet arrives at the second node. N is a positive integer.
In addition, the second node may also determine the period of the second node corresponding to the data packet according to the delimiting packet in other manners, which is not limited in this application.
S602, the second node sends the first data message in the first period of the second node.
Based on the foregoing technical solutions, an embodiment of the present application provides a communication method, where a first node sends a first delimiting message to a second node, and the second node determines, according to the first delimiting message, a period for the second node to send a first data message. Therefore, the first node indicates the period of sending the data message by the second node through the newly added delimitation message, and the period of sending the data message can be determined without modifying the format of the data message. Therefore, the communication method provided by the embodiment of the application can be applied to a scene without modifying the format of the data message.
In addition, the second node may determine a period in which the second node transmits the first data packet according to the time of receiving the first delimiting packet. Therefore, the second node can determine the period of sending the data message without analyzing the delimitation message and the data message. Therefore, the communication method provided by the embodiment of the application can be applied to a scene without analyzing the format of the data message, and can reduce the transmission delay of the data message.
In a possible implementation manner of the embodiment of the present application, the first delimiting message and the first data message are messages sent by the first node in the same period (denoted as case 1); or, the first delimiting message and the first data message are messages sent by the first node in different periods (denoted as case 2). Hereinafter, case 1 and case 2 will be described in detail, respectively:
That is to say, the first delimiting packet and the first data packet are both packets sent by the first node in the first period of the first node.
In case 1, referring to fig. 6, as shown in fig. 7, the above S601 can be specifically realized by the following S601a to S601c, which are described in detail below:
s601a, the second node determines a first time point for obtaining the first delimiting message.
S601b, the second node determines a second time point according to the first time point.
The second time point is used for representing the time point which is estimated by the second node and used for processing the data message sent by the first node in the first period of the first node.
It should be noted that, in the embodiment of the present application, the first node sends the first delimiting packet to the second node at a fixed time point of each cycle. For example, the first node sends a first bound packet (denoted as case 1.1) to the second node at the start time of each period; or, the first node sends the first delimiting message to the second node at the end time of each period (marked as case 1.2); the first node sends a first demarcation message to the second node at the middle time of each cycle (denoted as case 1.3). This is not limited in this application.
It should be noted that, under the condition that the first node sends the first delimiting packet at different time points, the method for the second node to determine the second time point is different. The following is specifically described:
in case 1.1, the first node sends the first bound packet to the second node at the start time of each period.
In case 1.1, the maximum duration of the interval between the second point in time and the first point in time is: the sum of the cycle length of the first cycle of the first node, the maximum duration of the second node which is estimated to process the data message sent by the first node in the first cycle of the first node, and the delay jitter between the first node and the second node.
In one possible implementation, in case 1.1, the second time point satisfies the following equation 1:
t 1 ＝t 0 +T+L max + delta formula 1
Wherein, t 1 Is a second point in time, t 0 Is a first time point, T is the duration of a first period of the first node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
It should be noted that, the processing, by the second node, of the data packet sent by the first node in the first period of the first node at least includes any one of the following: a process that a second node receives a data message sent by a first node in a first period of the first node; the second node determines the sending period corresponding to the data messages; and the second node implants the data messages into the data message sending queue of the determined period.
An example, in conjunction with case 1.1 above, is that the first node sends (transmit) a first delimiting message at the start time of each cycle, as shown in fig. 8. And the second node determines a first period of the second node according to the first boundary message. The first node is at T X Periodically sending a first boundary message, and after receiving the first boundary message, determining a second time point t by a second node 1 Is T y+2 Point in time within the cycle, firstTwo nodes determine t 1 First period T of the first node y+3 The period is the first period of the second node (this process is called Mapping).
In case 1.2, the first node sends the first delimiting packet to the second node at the end time of each period.
In case 1.2, the maximum duration of the interval between the second point in time and the first point in time is: the second node processes the maximum duration of the data message sent by the first node in the first period of the first node in advance.
In one possible implementation, the second time point satisfies the following equation 2:
t 1 ＝t 0 +L max equation 2
In case 1.3, the first node sends the first delimiting packet to the second node at the middle time of each period.
The duration of each period of the first node is T, and the duration between the time when the first node sends the first delimiting message and the end time of the first period of the first node is H.
At this time, in case 1.3, the maximum duration of the interval between the second time point and the first time point is: the sum of the duration H, the maximum duration of the data packet sent by the first node in the first period of the first node after the processing predicted by the second node is completed, and the delay jitter between the first node and the second node.
In one possible implementation, the second time point satisfies the following formula 3:
t 1 ＝t 0 +H+L max + delta equation 3
S601c, the second node determines that a period after the second time point is the first period of the second node.
In a possible implementation manner, the second node determines that a first period of the first node after the first time point is a first period of the second node. In this way, the second node sends the data messages as soon as possible after processing the data messages sent by the first node in the first period of the first node, and the time delay of the data messages is reduced.
In yet another possible implementation manner, the second node determines that an mth period after the first time point is the first period of the second node. M is a positive integer.
Based on the technical solution described in the foregoing case 1, when the first node sends the first delimiting packet and the first data packet in the same period, the second node may determine the first period of the second node that sends the first data packet according to the method described in the foregoing case 1.
And 2, the first node sends the first boundary message and the first data message to the second node in different periods.
In one possible implementation manner, the first boundary packet is a data packet that is sent by the first node to the second node within N periods before the first node sends the first data packet.
In this case, the second node may determine the first period of the second node from S601a-S601c similar to that described in case 1 above. The difference lies in that:
in case 2, the second node determines that the second time point satisfies the following equation 4:
t 1 ＝t 0 +H+L max + delta + NXT equation 4
And N is the number of periods of interval between the period of sending the first delimiting message by the first node and the period of sending the first data message by the second node.
Alternatively, after the second time point determined by the second node according to the method described in case 1 above, a third time point is further determined, and one cycle after the third time point is determined by the second node as the first cycle of the second node. The third time point is a time point which is separated from the second time point by N periods.
Or, in case 2, the first period of the second node determined by the second node is: the second node determines the nth cycle after the first cycle of the second node according to S601a-S601c described in case 1.
In yet another possible implementation manner, the first node sends the first delimiting packet at the end time of a period before the first period of the first node, in which case the second node may determine the first period of the second node according to the method described in the above case 1.1, which is not described herein again.
Based on the technical solution described in the foregoing case 2, when the first node sends the first delimiting packet and the first data packet in different periods, the second node may send the first period of the second node of the first data packet according to the method described in the foregoing case 2.
In a possible implementation manner of the embodiment of the present application, the first node may send the delimited packet to the second node in each period. The delimited message has a delimited message sequence number, and the period of the second node also has a period sequence number.
For an example, the serial number of the delimiting message and the serial number of the period of the second node are both incremental serial numbers (the serial number of the delimiting message or the period of the second node may also be numbered in a cyclic numbering manner, for example, a cyclic numbering from 0 to 3, which is not limited in this application). For example, the sequence number of the delimited packet is: 0. 1, 2, 3, 4, 5, 6, 7, 8, 9, \ 8230 \ 8230: \ 8230; 99. The sequence number of the cycle of the second node is also: 0. 1, 2, 3, 4, 5, 6, 7, 8, 9, \ 8230 \ 8230: \ 8230; 99.
In this scenario, after the second node determines the first delimiting message according to the foregoing condition 1 or condition 2, and after the first period of the second node, if the second node receives the second delimiting message, the second node may determine, according to the sequence number of the first delimiting message, the sequence number of the first period of the second node, and the sequence number of the second delimiting message, the period in which the second node sends the second data message corresponding to the second delimiting message. The second delimiting message is used for indicating a boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node.
Specifically, the second node may determine the period of the data packet corresponding to the new delimiting packet in the manner described in the following manner a or manner b. Mode a and mode b are explained below:
in the mode a, the second node determines that the sequence number of the second cycle of the second node satisfies the following formula 5:
c '= C + (M' -M) formula 5
Wherein, C 'is the serial number of the second cycle of the second node, C is the serial number of the first cycle of the second node, M is the serial number of the first delimiting packet, and M' is the serial number of the second delimiting packet.
In one possible implementation, the second node has a cycle counter, and the value of the cycle counter is a sequence number of a cycle determined by the second node.
After determining the first period of the second node, the second node determines a sequence number (denoted as C) of the first period of the second node, and a sequence number (denoted as M) of the first delimiting packet. The value of the second node initialization counter is the sequence number C of the first period of the second node.
After the second node receives the second delimiting message (denoted as M '), the second node updates the value of the counter (the updated value of the counter is denoted as C') according to the second delimiting message, and the updated value of the counter satisfies the above formula 5.
And the second node determines that the updated value of the counter is the sending period of the second data message corresponding to the second delimited message.
It should be noted that, after each new delimiting message is received by the second node, the sequence number of the cycle of the second node corresponding to the new delimiting message is determined according to the sequence number of the new delimiting message, the value of the current counter, and the sequence number of the previous delimiting message. The value of the cycle counter is updated as in equation 6
C t ＝C t +(M t ’-M t ) Equation 6
Wherein, the left side C of the equation t For the updated value of the cycle counter, equation C on the right t To the value of the period counter before updating, M t ' sequence number of new delimited message, M t And the serial number of the previous delimited message.
In the mode b, the second node determines that the sequence number of the second period of the second node satisfies the following formula 7:
c '= M' + offset equation 7
Wherein C 'is a sequence number of a second cycle of the second node, M' is a sequence number of the second delimiting packet, and offset satisfies the following formula 8:
offset = C-M equation 8
Wherein, C is the sequence number of the first cycle of the second node, and M is the sequence number of the first boundary packet.
In a specific implementation manner, after determining the sequence number C of the first period of the second node and the sequence number M of the first delimiting packet, the second node determines the offset value according to the sequence number C of the first period of the second node and the sequence number M of the first delimiting packet, and the above formula 8.
When the second node receives the new delimiting message, the second node determines the cycle sequence number M 'of the new delimiting message, and the second node determines the second cycle sequence number of the second node according to the cycle sequence number M' and the formula 7.
More specifically, after receiving the first delimiting packet, the second node records the sequence number of the first delimiting packet (e.g., define the need M for delimiting packet) t = 1), the first period of the second node determined by the second node is the period T4 of the second node.
And (c) determining that the value of the period counter is 4 by the second node in combination with the mode a, and after a period of time (for example, 10 mu s), receiving a new delimiting message by the second node, wherein the serial number of the new delimiting message is M t ' =2. The second node updates the timer to C t =4+ (2-1) =5, second node updates M t And (5) =2. And the second node sends the received delimited message after the new delimited message and before the next delimited message of the new delimited message in the T5 period of the second node.
In combination with the above-described mode b, the second node determines the offset value offset =4-1=3. After a period of time (for example 10 mus), the second node receives a new delimiting message with sequence number M t ' =2. The second node determines that the delimitation packet received after the new delimitation packet is transmitted at the second node at offset + M' =2+3=5 cycles (T5 cycles).
Based on the technical scheme, the first node sends the delimiting message to the second node in each period of the first node, the delimiting message has a delimiting message serial number, and under the condition that the period of the second node has a period serial number, the second node can determine the period of the second node corresponding to the new delimiting message according to the new delimiting message serial number, the known delimiting message serial number and the known delimiting message serial number of the second node corresponding to the second node, and then the second node can determine the period of the data message corresponding to the new delimiting message sent by the second node.
It should be noted that, in the embodiment of the present application, there are various implementation forms of the delimiting message, which are illustrated in the following:
an example is, as shown in fig. 9, that a new EtherType field identifier delimiting packet is defined in an EtherType field (specifically, the EtherType size field in fig. 9) in the packet shown in fig. 9. And after receiving the message comprising the new EtherTypeSize field, the second node determines that the message is a delimited message.
As another example, as shown in fig. 10, a reserved Tag Protocol Identifier (TPID) or virtual local area network Identifier (VLAN Identifier, VID) Identifier is defined in the 802.1Q field in the message shown in fig. 10 to identify the delimited packet. And after receiving the message comprising the TPID or VID defined above, the second node determines that the message is a delimited message.
For another example, as shown in fig. 11, in a Link Layer Discovery Protocol (LLDP) message shown in fig. 11, a new TLV field is defined in an Optional (type length value, TLV) field of the LLDP message to identify the delimited message. And after receiving the LLDP message comprising the new TLV field defined above, the second node determines that the LLDP message is a delimited message.
It should be noted that, in the embodiment of the present application, the delimiting message may also be defined in other manners, which is not limited in the present application.
In the above, a method for determining, by the second node, the period for the second node to send the data packet according to the delimited packet is provided.
Example two
The second embodiment provides a communication method, which is used for determining, by the second node, the time for sending the data packet according to the time for receiving the data packet.
As shown in fig. 12, the communication method according to the second embodiment includes:
s1200, the first node sends a first data message to the second node within a preset time period of a first period of the second node. Correspondingly, the second node receives the first data message from the first node.
And the duration of the preset time period is less than the duration of the first period of the second node.
In one possible implementation, the time length of the preset time period is related to the delay jitter between the first node and the second node.
In one example, the difference between the duration of the first period of the second node and the duration of the preset time period is the maximum value of the delay jitter between the first node and the second node.
In yet another example, the difference between the duration of the first period of the second node and the duration of the preset time period is 2 times the maximum value of the delay jitter between the first node and the second node.
S1201, the second node obtains the receiving time of the first data message.
S1202, the second node determines a first period of the second node sending the first data message according to the receiving time of the first data message.
It should be noted that the first node sends the data packet to the second node within a preset time period of the first cycle of the second node, and does not send the data packet to the second node within a time period other than the preset time period. The first node reasonably sets the duration of the preset time period, so that time intervals exist among data sent to the second node in different periods. The second node may determine the data in different periods according to the time interval, and further determine the period of each data.
S1203, the second node sends the first data message in the first period of the second node.
Based on the foregoing technical solution, in another communication method provided in this embodiment of the present application, the second node determines, according to the time for receiving the first data packet, a period for the second node to send the first data packet. Therefore, the period for sending the data message can be determined without modifying the format of the data message. Therefore, the communication method provided by the embodiment of the application can be applied to scenes without modifying the format of the data message.
In addition, in the embodiment of the present application, the second node may determine the period for sending the data packet without analyzing the delimiting packet and the data packet. Therefore, the communication method provided by the embodiment of the application can be applied to a scene without analyzing the format of the data message, and can reduce the transmission delay of the data message.
In a possible implementation manner of S1202, the second node may specifically determine the first period of the second node that sends the first data packet by using any one of the following manners 1, 2, and 3, where the first period is:
in the mode 1, the second node determines a first period of the second node sending the first data packet according to the time interval to which the receiving time of the first data packet belongs.
In the mode 2, the second node determines the first period of the second node sending the first data packet according to the time difference between the first data packet and the third period of the second node of the third data packet.
In the mode 3, the second node determines the period of the first node for sending the first data message according to the receiving time of the first data message, and determines the first period of the second node according to the mapping relation between the periods of the first node and the second node.
The above-described modes 1, 2, and 3 are described below in detail:
in the mode 1, the second node determines a first period of the second node which sends the first data message according to the time interval to which the receiving time of the first data message belongs.
As shown in fig. 13, if the delay jitter between nodes is not considered in the deterministic network, the first node sends a measurement packet to the second node at T0, and then the second node sends a measurement packet to the second node at T a When the measurement packet is received, the time for the data packet sent n cycles after the first node (the Tn-th cycle) to reach the second node is t a +n×T。
Considering that the delay jitter δ exists between the first node and the second node, as shown in fig. 14a, when the delay jitter of the measurement packet transmitted from the first node to the second node is the maximum value (that is, the measurement packet experiences the maximum transmission delay between the first node and the second node), the earliest time for the second node to receive the first data packet transmitted from the first node in the Tn th cycle is t a +n*T-δ。
As shown in fig. 14b, when the delay jitter of the measurement packet transmitted from the first node to the second node is the minimum (i.e. the measurement packet experiences the minimum transmission delay between the first node and the second node), the latest time when the second node receives the last data packet transmitted from the first node in the Tn-1 th cycle is t a +n*T+δ。
As shown in fig. 14a and fig. 14b, it can be known that, if the first node sends a data packet to the second node at all times of the cycle of the first node, the time when the data sent by the first node in the last period of the Tn-1 cycle and the time when the data sent by the second node in the beginning period of the Tn cycle reach the second node may coincide. Correspondingly, the second node is at t of the second node a + n T-delta time to T a The data messages received between + n × T + δ times cannot accurately determine the time when the first node sends the data messages.
Thus, as shown in fig. 14c, the first node determines that no data is transmitted during the consecutive 2 δ periods of each cycle. For example, no data is sent during the last 2 δ period of each cycle. Thus, even if the data packet sent by the first node in the Tn-1 cycle experiences the maximum delay, the latest time for the part of the packet to reach the second node is t a + n × T- δ. First of allThe data packet sent by the node in the Tn period experiences the minimum delay, and the earliest time for the part of the packet to reach the second node is t a + n × T- δ. Therefore, the time of the data messages sent by the first node in different periods reaching the second node can not coincide, and the second node can accurately distinguish the data messages sent by the first node in different periods according to the time of the data messages reaching the second node.
Therefore, in the method 1, the first node sets a continuous 2 δ period within each cycle so as not to transmit data (the continuous 2 δ period may also be referred to as Guard Band).
As shown in fig. 15, in the mode 1, S1202 can be specifically realized by the following S1500-S1504. S1500-S1504 are explained in detail below:
s1500, the first node sends a measurement message to the second node in the first period of the first node. Correspondingly, the second node receives the measurement packet from the first node.
The measurement packet is used by the second node to determine a transmission period of the second node corresponding to a first packet transmitted by the first node in a first period of the first node.
It should be noted that the first period of the first node described in the embodiment of the present application refers to a first period of the first node that sends data to the second node after the initialization of the first node is completed; or, in the case that the first node sends the measurement packet to the second node every M periods, the first period of the first node may also refer to the first period of the first node in the M periods; alternatively, the first period of the first node may also refer to a first period of the first node determined according to another method, which is not limited in this application.
It should be noted that, in this embodiment of the present application, the first node may send the measurement packet to the second node at the start time of the first period of the first node; or, the first node may also send the measurement packet to the second node at a time other than the start time of the first period of the first node; or, the first node may send the measurement packet to the second node at any time of the first period of the first node, which is not limited in this embodiment of the present application.
In this embodiment, an example in which a first node sends a measurement packet to a second node at the start time of a first period of the first node is described.
S1501, the second node determines a third time point for receiving the measurement message.
S1502, the second node determines a plurality of time intervals and periods corresponding to the time intervals according to the third time point.
In a possible implementation manner, the S1502 may specifically be implemented as:
and the second node determines a fourth time point according to the third time point, wherein the fourth time point is used for representing the time point of processing the data message sent by the first node in the first period of the first node and pre-estimated by the second node.
The second node determines a first time interval according to the third time point; the first time interval is (t) a ,t a + T- δ); the first time interval corresponds to the Ty period of the second node; wherein, t a The third time point is T, and the T is the duration of the first period of the first node; the Ty-th period is one period after the fourth time point.
The second node determines the kth time interval as t a +k*T-δ,t a And (k + 1) T- δ), wherein the kth time interval corresponds to the Ty + k-1 period of the second node, and k is an integer greater than 1.
In one possible implementation, the fourth time point satisfies the following formula:
t 3 ＝t 2 +T+L max +δ
wherein, t 3 Is a fourth time point, t 2 Is a third time point, T is the duration of the first period of the first node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
It should be noted that S1500-S1502 may be performed before S1200, after S1200, or simultaneously with S1200, which is not limited in this application.
S1503, the second node determines, according to the receiving time of the first data packet, a time interval to which the receiving time of the first data packet belongs.
Specifically, after receiving the first data packet, the second node determines a time for receiving the first data packet. The second node determines the time of receiving the first data packet relative to the time interval t a +k*T-δ,t a The value of k in the time interval to which + (k + 1) × T- δ) belongs.
S1504, the second node determines that the period corresponding to the time interval to which the receiving time of the first data message belongs is the first period of the second node.
And after the second node determines the value of k, determining that the period for sending the first data message is Ty + k-1 period.
Based on the above technical solution, the second node may determine, according to the measurement frame sent by the first node, a period in which the second node sends the first data packet.
In the following, the measurement frame mentioned above is explained in detail, and the measurement frame provided in the embodiment of the present application has the following two cases, case a and case B, which are respectively: the situation A, the measurement message is a new message sent from the first node to the second node; in case B, the measurement packet is a data packet with a measurement packet identifier sent by the first node to the second node. Hereinafter, the case a and the case B will be described in detail, respectively:
case a, the measurement packet is a new packet sent by the first node to the second node.
The first node may send the new packet to the second node at the starting time of one period, or the first node may also send the new packet to the second node at other times of one period, which is not limited in this application.
It should be noted that, in the case a, the measurement packet has various implementation forms, and the following description is given as an example:
an example is, as shown in fig. 9, that a new EtherType field identifier measurement packet is defined in an EtherType field (specifically, the EtherType size field in fig. 9) in the packet shown in fig. 9. And after receiving the message comprising the new EtherTypeSize field, the second node determines that the message is a measurement message.
As another example, as shown in fig. 10, a reserved label protocol Identifier (TPID) or virtual local area network Identifier (VLAN Identifier, VID) Identifier is defined in the 802.1Q field in the message shown in fig. 10 to identify the measurement packet. And after receiving the message comprising the TPID or VID defined above, the second node determines the message as a measurement message.
For another example, as shown in fig. 11, in a Link Layer Discovery Protocol (LLDP) message shown in fig. 11, a new TLV field is defined in an Optional (type length value, TLV) field of the LLDP message to identify the measurement message. And after receiving the LLDP message comprising the TLV field defined above, the second node determines the LLDP message as a measurement message.
And in case B, the measurement message is a data message with a measurement message identifier sent by the first node to the second node.
It should be noted that, in this case, the data packet with the measurement packet identifier may be a first data packet sent by the first node to the second node in one period; or, the data packet with the measurement packet identifier may be a data packet other than the first data packet sent by the first node to the second node in one period; this is not a limitation of the present application.
In the following, the case B is described in detail by taking as an example that the data packet with the measurement packet identifier may be the first data packet sent by the first node to the second node in one period:
the first node adds 1bit indicating bit in the data message to indicate whether the data message is a measurement message.
In a specific implementation manner, the value of the 1-bit indicator bit of the data packet is "1" for indicating that the data packet is a measurement packet. The value of the 1-bit indicator bit in the data packet is "0" and is used to indicate that the data packet is not a measurement packet.
The measurement packet is specifically described above.
In an exemplary implementation manner of the method 1, as shown in fig. 16, the first node sends a measurement packet and a data packet to the second node in a T0 period.
After the second node receives the measurement message, determining a fourth time point t 1 And the second node determines that the first period Ty +2 period of the first node after the second node is the first period of the second node. The second node determines the time interval ((t) 0 ,t 0 + T- δ) is sent in Ty +2 cycle of the second node. The second node determines the time interval t a +k*T-δ，t a + (k + 1) T-delta) is sent within the Ty +1+ k period of the second node.
Based on the above technical solution, the second node may determine, according to the time for receiving the measurement packet, a transmission period of the second node corresponding to the measurement packet. And the correspondence between the time interval and the transmission period of the second node. The second node determines a time interval of the second node for receiving the first data message according to the time difference between the first data message and the measurement message, and further determines the period of the second node corresponding to the first data message according to the time interval.
In the mode 2, the second node determines the first period of the second node sending the first data packet according to the time difference between the first data packet and the third period of the second node of the third data packet.
As shown in fig. 17, in the method 2, S1202 can be specifically realized by the following S1700-S1706. S1700-S1706 is described in detail below:
s1700, the first node sends a third data message to the second node. Correspondingly, the second node receives the third data packet.
And the third data message is a previous data message of the first data message received by the second node.
S1701, the second node determines a third period of the second node corresponding to the third data packet.
And the third period of the second node is a period for the second node to send a third data message.
In a possible implementation manner, the method for the second node to determine the third period of the second node corresponding to the third data packet includes:
the second node receives a third data message; the second node determines a fifth time point for receiving the third data message; the second node determines a sixth time point according to the fifth time point, wherein the sixth time point is used for representing the time point of the second node for pre-estimated processing of the data message sent by the first node in the third period of the second node; and the second node determines that a period after the sixth time point is a third period of the second node.
An example, the second node determines that the sixth point in time satisfies the following formula:
t 5 ＝t 4 +T+L max +δ
wherein, t 5 Is the sixth time point, t 4 At a fifth time point, T is the duration of a third period of the second node, L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the third period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
In another possible implementation manner, the method for the second node to determine the third period of the second node corresponding to the third data packet may refer to the method for the second node to determine the first period of the second node corresponding to the first data packet in the foregoing manner 1. And will not be described in detail herein.
S1702, the second node determines whether a time difference between receiving the first data packet and receiving the third data packet is smaller than a preset value.
Specifically, in S1702, the following two scenarios, namely scenario 1 and scenario 2, exist if the time difference between the first data packet and the third data packet is determined by the second node to be smaller than the preset value, respectively:
In scenario 1 and scenario 2, the actions performed by the second node are different, and scenario 1 and scenario 2 are specifically described below.
And in the scene 1, the second node determines that the time difference between the receiving of the first data message and the receiving of the third data message is smaller than a preset value.
In scenario 1, the second node performs the following S1703.
S1703, the second node determines that the third period of the second node is the same period as the first period of the second node.
That is, when the time difference between the reception of the first data packet and the reception of the third data packet is smaller than the preset value, the second node determines to transmit the first data packet and the third data packet in the same period.
For example, the second node has determined to transmit the third data packet from the first node in the Y-th cycle. At this time, the second node receives the first data packet from the first node again. And the second node determines that the time difference between the time of receiving the first data message and the time of receiving the third data message is less than a preset value. At this time. The second node determines that the first data message is sent in the Y-th period, wherein Y is a positive integer.
And in the scene 2, the second node determines that the time difference between the first data message and the third data message is greater than or equal to a preset value.
In scenario 2, the second node performs the following S1704-S1706.
S1704, the second node determines a seventh time point for obtaining the first data message.
And S1705, the second node determines an eighth time point according to the seventh time point.
The eighth time point is used for representing a time point which is estimated by the second node and used for processing the data message sent by the first node in the first period of the second node.
In one possible implementation, the eighth time point satisfies the following formula 9:
t 7 ＝t 6 +T+L max + delta equation 9
Wherein, t 7 At an eighth time point, t 6 At a seventh time point, T is the duration of a third period of the second node, L max The maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the second node is completed, and delta is the maximum value of the time delay jitter between the first node and the second node.
S1706, the second node determines that a period after the eighth time point is a third period of the second node.
Based on the above technical scheme, the second node determines that two adjacent data messages are data messages of the same period if the interval time between the two data messages is less than δ. The second node determines that the period of the second node for sending the next data message is the same as the period of the second node for sending the previous data message.
If the interval time between two adjacent data messages is greater than or equal to delta, the second node determines that the two data messages are data messages of different periods, and the latter data message is the first data message sent by the first node in one period. The second node determines the period of the second node sending the next data packet according to the above formula 9.
In the mode 3, the second node determines the period of the first node for sending the first data message according to the receiving time of the first data message, and determines the first period of the second node according to the mapping relation between the periods of the first node and the second node.
As shown in fig. 18, in mode 3, S1202 may be specifically realized by the following S1800 to S1802. S1800-S1802 is specifically described below:
s1800, the second node determines the time for the first node to send the first data message according to the time for receiving the first data message.
It should be noted that, in a deterministic network, the value of the delay before each node and the maximum value of the delay jitter are determined. Therefore, after the second node receives the first data packet, the second node may determine the time when the first node transmits the first data packet according to the time when the first data packet is received, the time delay between the first node and the second node, and the time delay jitter between the second node and the second node.
In one example, the second node receives the first data packet at time t x The delay between the first node and the second node is d, and the maximum value of the delay jitter between the first node and the second node is delta.
At this time, the second node determines that the earliest time for the first node to send the first data packet (that is, the first data packet experiences the largest delay between the first node and the second node) is:
the second node determines that the latest time when the first node sends the first data packet (i.e., the first data packet experiences the minimum delay between the first node and the second node) is:
in combination with the earliest time and the latest time when the first node sends the first data packet, the second node may determine that the time when the first node sends the first data packet is in the time interval:
s1801, the second node determines, according to the time for the first node to send the first data packet, a third period of the first node where the first node sends the first data packet.
Specifically, the second node determines the period of the first node to which the time interval belongs according to the time interval.
The second node determines that the period of the first node including the time interval is a third period of the first node, in which the first node sends the first data packet.
It should be noted that, in the method 3, the time for sending the packet of the first data at the first time determined by the second node is a time interval, and the duration of the time interval is δ.
When the time interval is a cross-cycle time interval (i.e., includes a period of time in a cycle and also includes a period of time in an adjacent cycle), the second node cannot accurately determine that the first node sends the first data packet cycle.
Therefore, in mode 3, the first node does not transmit data for the duration of δ for each cycle. The time period for which the first node does not send data is located at the initial part of the period of the first node; or the time period for which the first node does not send data is positioned at the end part of the period of the first node; or, the time period in which the first node does not send data includes a first sub-time period and a second sub-time period, the first sub-time period is located at the beginning of the cycle of the first node, and the first sub-time period is located at the ending of the cycle of the first node. In addition, the time period when the first node does not send data may also be other time periods, which is not described in detail herein.
Under the condition that the first node does not send data in the time period of the time length of delta of each period of the first node, even if the data messages sent by the first node in different periods experience different delay jitters, the data messages do not overlap when reaching the second node when the second node receives the data messages. Therefore, the second node can accurately determine the period of the data message sent by the first node according to the time of the data message arriving at the second node.
S1802, the second node determines a first period of the second node according to the third period of the first node.
In a possible implementation manner, a mapping relationship between the period of the first node and the period of the second node exists in the second node. The second node may determine, according to the mapping relationship, a period of the second node corresponding to the period of the first node.
After the second node determines the third period of the first node, which sends the first data message, of the first node, the second node determines the first period of the second node, which sends the first data message, of the first node according to the mapping relation.
In a possible implementation, the mapping relationship may be a period shift constant Δ in the prior art. After the second node determines the third period of the first node, the second node determines that the value of the sequence number of the first period of the second node is the sum of the value of the sequence number of the third period of the first node and the period offset constant Δ.
Based on the above technical scheme, in a deterministic network, based on the determinacy of time delay and jitter between nodes, the second node may calculate the time for the first node to send the data packet according to the time for receiving the data packet, and the second node may further determine the period for the first node to send the data packet according to the time for the first node to send the data packet, thereby determining the period for the second node to send the data packet.
All the schemes in the above embodiments of the present application can be combined without contradiction.
The above-mentioned scheme of the embodiment of the present application is introduced mainly from the perspective of interaction between network elements. It is to be understood that each network element, e.g. the first node and the second node, for realizing the above-mentioned functions, comprises at least one of a corresponding hardware structure and a software module for performing each function. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed in hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiment of the present application, the first node and the second node may be divided into functional units according to the above method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that, in the embodiment of the present application, the division of the unit is schematic, and is only one logic function division, and when the actual implementation is realized, another division manner may be provided.
In the case of using an integrated unit, fig. 19 shows a schematic diagram of a possible structure of the communication device (denoted as the communication device 190) according to the foregoing embodiment, where the communication device 190 includes a processing unit 1901, a communication unit 1902, and a storage unit 1903. The schematic structure shown in fig. 19 can be used to illustrate the structures of the first node and the second node involved in the above embodiments.
When the schematic structure shown in fig. 19 is used to illustrate the structure of the first node in the foregoing embodiment, the processing unit 1901 is configured to control and manage actions of the first node, for example, control the first node to perform actions performed by the first node in S600 in fig. 6, S600 in fig. 7, S1200 in fig. 12, S1200 and S1500 in fig. 15, S1200 in fig. 17, S1200 in fig. 18, and/or other processes described in this embodiment. The processing unit 1901 may communicate with other network entities, e.g., the first node shown in fig. 1, through the communication unit 1902. The storage unit 1903 is used to store program codes and data of the first node.
When the schematic configuration diagram shown in fig. 19 is used to illustrate the configuration of the first node in the above embodiment, the communication device 190 may be the first node or a chip in the first node.
When the schematic structure diagram shown in fig. 19 is used to illustrate the structure of the second node in the above embodiments, the processing unit 1901 is configured to control and manage the actions of the second node, for example, control the second node to perform the actions performed by the second node in S600-S602 in fig. 6, S600, S602, and S601a-S601b in fig. 7, S1200-S1203 in fig. 12, S1200, S1201, S1203, and S1500-S1504 in fig. 15, S1200, S1201, S1203, and S1700-S1706 in fig. 17, S1200, S1201, S1203, and S1800-S1802 in fig. 18, and/or other processes described in this embodiment. The processing unit 1901 may communicate with other network entities, e.g., with the second node shown in fig. 1, through the communication unit 1902. The storage unit 1903 is used to store program codes and data of the second node.
When the schematic configuration diagram shown in fig. 19 is used to illustrate the configuration of the second node in the above embodiment, the communication device 190 may be the second node or a chip in the second node.
When the communication device 190 is a second node or a first node, the processing unit 1901 may be a processor or a controller, and the communication unit 1902 may be a communication interface, a transceiver circuit, a transceiver device, or the like. The communication interface is a generic term, and may include one or more interfaces. The storage unit 1903 may be a memory. When the communication device 190 is a chip in the second node or the first node, the processing unit 1901 may be a processor or a controller, and the communication unit 1902 may be an input interface and/or an output interface, a pin or a circuit, etc. The storage unit 1903 may be a storage unit (e.g., a register, a cache, etc.) in the chip, or may also be a storage unit (e.g., a read-only memory (ROM), a Random Access Memory (RAM), etc.) located outside the chip in the second node or the first node.
The communication unit may also be referred to as a transceiver unit. The antenna and the control circuit having the transceiving function in the communication device 190 may be regarded as the communication unit 1902 of the communication device 190, and the processor having the processing function may be regarded as the processing unit 1901 of the communication device 190. Optionally, a device in the communication unit 1902 for implementing a receiving function may be regarded as a receiving unit, where the receiving unit is configured to perform the receiving step in the embodiment of the present application, and the receiving unit may be a receiver, a receiving circuit, and the like.
The integrated unit in fig. 19, if implemented in the form of a software functional module and sold or used as a separate product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or make a contribution to the prior art, or all or part of the technical solutions may be implemented in the form of a software product stored in a storage medium, and including several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the methods described in the embodiments of the present application. A storage medium storing a computer software product comprising: u disk, removable hard disk, read only memory, random access memory, magnetic disk or optical disk, etc. for storing program codes.
The units in fig. 19 may also be referred to as modules, for example, the processing units may be referred to as processing modules.
The embodiment of the present application further provides a schematic diagram of a hardware structure of a communication device (denoted as a communication device 200), and referring to fig. 20 or fig. 21, the communication device 200 includes a processor 2001, and optionally, further includes a memory 2002 connected to the processor 2001.
In a first possible implementation, referring to fig. 20, the communication device 200 further comprises a transceiver 2003. The processor 2001, the memory 2002, and the transceiver 2003 are connected by a bus. The transceiver 2003 is used to communicate with other devices or communication networks. Optionally, the transceiver 2003 may include a transmitter and a receiver. The device for implementing the receiving function in the transceiver 2003 may be regarded as a receiver for performing the receiving step in the embodiment of the present application. The device for implementing the transmission function in the transceiver 2003 can be regarded as a transmitter for performing the steps of transmission in the embodiment of the present application.
Based on the first possible implementation manner, the structure diagram shown in fig. 20 may be used to illustrate the structure of the first node or the second node in the above embodiments.
When the schematic structure shown in fig. 20 is used to illustrate the structure of the first node in the above embodiment, the processor 2001 is configured to control and manage the action of the first node, for example, the processor 2001 is configured to support the first node to execute S600 in fig. 6, S600 in fig. 7, S1200 in fig. 12, S1200 and S1500 in fig. 15, S1200 in fig. 17, S1200 in fig. 18, and/or the action performed by the first node in other processes described in this embodiment. The processor 2001 may communicate with other network entities, e.g., the second node shown in fig. 1, through the transceiver 2003. The memory 2002 is used to store program codes and data for the first node.
When the schematic diagram of the structure shown in fig. 20 is used to illustrate the structure of the second node in the above embodiments, the processor 2001 is used to control and manage the actions of the second node, for example, the processor 2001 is used to support the second node to execute S600-S602 in fig. 6, S600, S602 and S601a-S601b in fig. 7, S1200-S1203 in fig. 12, S1200, S1201, S1203 and S1500-S1504 in fig. 15, S1200, S1201, S1203 and S1700-S1706 in fig. 17, S1200, S1201, S1203 and S1800-S1802 in fig. 18, and/or the actions executed by the second node in other processes described in the embodiments of the present application. The processor 2001 may communicate with other network entities, e.g., the first node shown in fig. 1, through the transceiver 2003. The memory 2002 is used to store program codes and data of the second node.
In a second possible implementation, the processor 2001 includes logic circuits and at least one of an input interface and an output interface. Wherein the output interface is used for executing the sent action in the corresponding method, and the input interface is used for executing the received action in the corresponding method.
Based on the second possible implementation manner, referring to fig. 21, the schematic structure diagram shown in fig. 21 may be used to illustrate the structure of the first node or the second node involved in the foregoing embodiment.
When the schematic structure shown in fig. 21 is used to illustrate the structure of the first node in the above embodiments, the processor 2001 is configured to control and manage the action of the first node, for example, the processor 2001 is configured to support the first node to execute the actions performed by the first node in S600 in fig. 6, S600 in fig. 7, S1200 in fig. 12, S1200 and S1500 in fig. 15, S1200 in fig. 17, S1200 in fig. 18, and/or other processes described in this embodiment. The processor 2001 may communicate with other network entities, e.g. with the second node shown in fig. 1, through at least one of the input interface and the output interface. The memory 2002 is used to store program codes and data for the first node.
When the schematic diagram of the structure shown in fig. 21 is used to illustrate the structure of the second node in the above embodiment, the processor 2001 is used to control and manage the actions of the second node, for example, the processor 2001 is used to support the second node to execute S600-S602 in fig. 6, S600, S602, and S601a-S601b in fig. 7, S1200-S1203 in fig. 12, S1200, S1201, S1203, and S1500-S1504 in fig. 15, S1200, S1201, S1203, and S1700-S1706 in fig. 17, S1200, S1201, S1203, and S1800-S1802 in fig. 18, and/or the actions performed by the second node in other processes described in the embodiments of the present application. The processor 2001 may communicate with other network entities, e.g., the first node shown in fig. 1, through at least one of the input interface and the output interface. The memory 2002 is used to store program codes and data of the second node.
Fig. 20 and 21 may also illustrate a system chip in the second node. In this case, the action executed by the second node may be implemented by the system chip, and the specific executed action may be referred to above and is not described herein again. Fig. 20 and 21 may also illustrate a system chip in the first node. In this case, the action executed by the first node may be implemented by the system chip, and the specific executed action may be referred to above and is not described herein again.
In addition, the embodiment of the present application further provides a schematic diagram of hardware structures of a terminal device (denoted as the terminal device 220) and a network device (denoted as the network device 230), which may be specifically referred to fig. 22 and fig. 23, respectively.
Fig. 22 is a schematic diagram of a hardware configuration of the terminal device 220. For convenience of explanation, fig. 22 shows only main components of the terminal device. As shown in fig. 22, the terminal device 220 includes a processor, a memory, a control circuit, an antenna, and an input-output means.
The processor is mainly configured to process the communication protocol and the communication data, and control the entire terminal device, execute a software program, and process data of the software program, for example, control the access point to perform actions performed by the access point in S600 in fig. 6, S600 in fig. 7, S1200 in fig. 12, S1200 and S1500 in fig. 15, S1200 in fig. 17, S1200 in fig. 18, and/or other processes described in this embodiment of the present application. Also for example, the control terminal device performs actions performed by the terminal device in S600-S602 in fig. 6, S600, S602, and S601a-S601b in fig. 7, S1200-S1203 in fig. 12, S1200, S1201, S1203, and S1500-S1504 in fig. 15, S1200, S1201, S1203, and S1700-S1706 in fig. 17, S1200, S1201, S1203, and S1800-S1802 in fig. 18, and/or other processes described in embodiments of the present application. The memory is used primarily for storing software programs and data. The control circuit (also referred to as a radio frequency circuit) is mainly used for converting a baseband signal and a radio frequency signal and processing the radio frequency signal. The control circuit and the antenna together, which may also be called a transceiver, are primarily intended for transceiving radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used for receiving data input by users and outputting data to the users.
When the terminal device is started, the processor can read the software program in the memory, interpret and execute the instruction of the software program, and process the data of the software program. When data needs to be sent through the antenna, the processor performs baseband processing on the data to be sent, and then outputs baseband signals to a control circuit in the control circuit, and the control circuit performs radio frequency processing on the baseband signals and then sends the radio frequency signals to the outside through the antenna in the form of electromagnetic waves. When data is transmitted to the terminal equipment, the control circuit receives radio-frequency signals through the antenna, converts the radio-frequency signals into baseband signals and outputs the baseband signals to the processor, and the processor converts the baseband signals into the data and processes the data.
Those skilled in the art will appreciate that fig. 22 shows only one memory and processor for ease of illustration. In an actual terminal device, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, and the like, which is not limited in this application.
As an alternative implementation manner, the processor may include a baseband processor and a central processing unit, the baseband processor is mainly used for processing the communication protocol and the communication data, and the central processing unit is mainly used for controlling the whole terminal device, executing the software program, and processing the data of the software program. The processor in fig. 22 integrates the functions of the baseband processor and the central processing unit, and those skilled in the art will understand that the baseband processor and the central processing unit may also be independent processors, and are interconnected through a bus or the like. Those skilled in the art will appreciate that the terminal device may include a plurality of baseband processors to accommodate different network formats, the terminal device may include a plurality of central processors to enhance its processing capability, and various components of the terminal device may be connected by various buses. The baseband processor may also be expressed as a baseband processing circuit or a baseband processing chip. The central processing unit may also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and the communication data may be built in the processor, or may be stored in the memory in the form of a software program, and the processor executes the software program to realize the baseband processing function.
Fig. 23 is a schematic diagram of a hardware structure of the network device 230. The network device 230 may include one or more radio frequency units, such as a Remote Radio Unit (RRU) 2301 and one or more baseband units (BBUs) (also referred to as Digital Units (DUs)) 2302.
The RRU2301, which may be referred to as a transceiver unit, transceiver, transceiving circuitry, or transceiver, etc., may include at least one antenna 2311 and a radio frequency unit 2312. The RRU2301 is mainly used for transceiving radio frequency signals and converting radio frequency signals and baseband signals. The RRU2301 and BBU2302 may be physically located together or separately, for example, a distributed base station.
The BBU2302 is a control center of a network device, and may also be referred to as a processing unit, and is mainly used for performing baseband processing functions, such as channel coding, multiplexing, modulation, spreading, and the like.
In an embodiment, the BBU2302 may be formed by one or more boards, where the boards may support a radio access network of a single access system (e.g., an LTE network) together, or may support radio access networks of different access systems (e.g., an LTE network, a 5G network, or other networks) respectively. The BBU2302 also includes a memory 2321 and a processor 2322, with the memory 2321 being configured to store necessary instructions and data. The processor 2322 is used to control the network devices to perform the necessary actions. The memory 2321 and the processor 2322 may serve one or more boards. That is, the memory and processor may be provided separately on each board. Multiple boards may share the same memory and processor. In addition, each single board can be provided with necessary circuits.
It should be understood that the network device 230 shown in fig. 23 is an action performed by the network device described in the embodiments of the present application. The operations and functions, or the operations and functions, of the respective modules in the network device 230 are respectively configured to implement the corresponding flows in the above-described method embodiments. Specifically, reference may be made to the description of the above method embodiments, and the detailed description is appropriately omitted herein to avoid redundancy.
In implementation, the steps in the method provided by this embodiment may be implemented by integrated logic circuits of hardware in a processor or instructions in the form of software. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
Processors in the present application may include, but are not limited to, at least one of: various computing devices running software, such as a Central Processing Unit (CPU), a microprocessor, a Digital Signal Processor (DSP), a microcontroller unit (MCU), or an artificial intelligence processor, may each include one or more cores for executing software instructions to perform operations or processing. The processor may be a single semiconductor chip or integrated with other circuits to form a semiconductor chip, for example, an SoC (system on chip) with other circuits (such as a codec circuit, a hardware acceleration circuit, or various buses and interface circuits), or may be integrated in the ASIC as a built-in processor of the ASIC, which may be packaged separately or together with other circuits. The processor may further include necessary hardware accelerators such as Field Programmable Gate Arrays (FPGAs), PLDs (programmable logic devices), or logic circuits implementing dedicated logic operations, in addition to cores for executing software instructions to perform operations or processes.
The memory in the embodiment of the present application may include at least one of the following types: read-only memory (ROM) or other types of static memory devices that may store static information and instructions, random Access Memory (RAM) or other types of dynamic memory devices that may store information and instructions, and may also be Electrically erasable programmable read-only memory (EEPROM). In some scenarios, the memory may also be, but is not limited to, a compact disk-read-only memory (CD-ROM) or other optical disk storage, optical disk storage (including compact disk, laser disk, optical disk, digital versatile disk, blu-ray disk, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
Embodiments of the present application also provide a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform any of the above methods.
Embodiments of the present application also provide a computer program product containing instructions that, when executed on a computer, cause the computer to perform any of the methods described above.
An embodiment of the present application further provides a communication system, including: the access point and the terminal equipment are provided.
Embodiments of the present application further provide a chip, where the chip includes a processor and an interface circuit, where the interface circuit is coupled to the processor, the processor is configured to execute a computer program or instructions to implement the method, and the interface circuit is configured to communicate with other modules outside the chip.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented using a software program, 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 procedures or functions described in accordance with the embodiments of the application are all or partially generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). Computer-readable storage media can be any available media that can be accessed by a computer or can comprise one or more data storage devices, such as servers, data centers, and the like, that can be integrated with the media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a Solid State Disk (SSD)), etc.
While the present application has been described in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from a review of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the word "a" or "an" does not exclude a plurality. A single processor or other unit may fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
Although the present application has been described in conjunction with specific features and embodiments thereof, it will be evident that various modifications and combinations can be made thereto without departing from the spirit and scope of the application. Accordingly, the specification and drawings are merely illustrative of the present application as defined in the appended claims and are intended to cover any and all modifications, variations, combinations, or equivalents within the scope of the application. It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Finally, it should be noted that: the above description is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope disclosed in the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (58)
1. A method of communication, comprising:
the second node receives a first delimiting message and a first data message from the first node; the first boundary packet is used for indicating a boundary between a data packet sent in a first period of the first node and a data packet sent in a period adjacent to the first period of the first node;
the second node determines a first period of a second node corresponding to a first data message according to the first delimiting message, wherein the first data message is a data message sent by the first node to the second node within the first period of the first node;
and the second node sends the first data message in a first period of the second node.
2. The method of claim 1, wherein the second node determining, according to the first demarcation packet, a first period of the second node corresponding to the first data packet comprises:
the second node determines a first time point for acquiring the first delimiting message;
the second node determines a second time point according to the first time point, wherein the second time point is used for representing the time point which is estimated by the second node and is used for processing the data message which is sent by the first node in the first period of the first node;
and the second node determines that a period after the second time point is a first period of the second node.
3. The method of claim 2, wherein after the second node determines the first period of the second node corresponding to the first data packet according to the first demarcation packet, the method further comprises:
the second node receives a second bound message; the second delimiting message is used for indicating a boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node;
the second node determines a second period of the second node corresponding to a second data message according to the sequence number of the second delimiting message and the sequence number of the first delimiting message; the second data packet is a data packet sent by the first node in a second period of the first node, and the second period of the second node is a period after the first period of the second node; the second period of the first node is a period after the first period of the first node;
and the second node sends the second data message in a second period of the second node.
4. The method of claim 3, wherein the determining, by the second node, the second cycle of the second node corresponding to the second data message according to the sequence number of the second delimiting packet and the sequence number of the first delimiting packet, comprises:
the second node determines that the sequence number of the second period of the second node satisfies the following formula:
C’＝C+(M’-M)
the node comprises a first node, a second node, a first delimiting message and a second delimiting message, wherein C 'is a serial number of a second period of the second node, C is a serial number of a first period of the second node, M is a serial number of the first delimiting message, and M' is a serial number of the second delimiting message.
5. The method of claim 3, wherein the determining, by the second node, the second cycle of the second node corresponding to the second data message according to the sequence number of the second delimiting packet and the sequence number of the first delimiting packet, comprises:
the second node determines that the sequence number of the second period of the second node satisfies the following formula:
C’＝M’+offset
wherein C 'is a sequence number of a second cycle of the second node, M' is a sequence number of the second delimiting packet, and offset satisfies the following formula:
offset＝C-M
wherein C is a sequence number of a first period of the second node, and M is a sequence number of the first delimiting packet.
6. The method according to any one of claims 1-5, wherein the first delimiting packet satisfies any one of: the first delimiting message is a data message sent by the first node at the initial time of the first period of the first node; the first delimiting message is a data message sent by the first node at the end time of the first period of the first node; the first delimiting message is a data message sent by the first node in the middle of the first period of the first node; the first delimiting message is a data message sent by the first node in a period other than the first period of the first node.
7. The method according to claim 6, wherein in the case that the first delimiting packet is a data packet sent by the first node at the start time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +T+L max +δ
wherein, t 1 Is the second time point, t 0 At the first time point, T is the duration of a first period of the first node, L max The maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node;
when the first delimiting packet is a data packet sent by the first node at the end time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +L max
when the first delimiting packet is a data packet sent by the first node in the middle time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ
h is the duration between the time when the first node sends the first delimiting message and the end time of the first period of the first node;
when the first delimiting packet is a data packet sent by the first node in a period other than the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ+N×T
and N is the number of cycles at the interval between the cycle of the first node sending the first delimiting message and the cycle of the second node sending the first data message, and N is a positive integer.
8. A method of communication, comprising:
a first node sends a first bound message to a second node; the first boundary packet is used for indicating a boundary between a data packet sent in a first period of the first node and a data packet sent in a period adjacent to the first period of the first node;
the first node sends a first data message to the second node in a first period of the first node; the first delimiting message is used by the second node to determine the sending period of the first data message.
9. The method of claim 8, wherein sending, by the first node, the first bound packet to the second node comprises:
the first node sends the first delimiting message to the second node at the starting time of a first period of the first node; or, the first node sends the first delimiting packet to the second node at the end time of the first period of the first node; or, the first node sends the first delimiting packet to the second node in the middle of the first period of the first node; or the first node sends the first delimiting packet to the second node at a time other than the first period of the first node.
10. The method according to claim 8 or 9, characterized in that the method further comprises:
the first node sends a second delimited message to the second node; the second delimiting message is used for indicating a boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node;
the first node sends a second data message to the second node in a second period of the first node; the second delimiting message is used for a second node to determine a sending period of the second data message, and the second period of the first node is a period after the first period of the first node.
11. A method of communication, comprising:
the second node receives the first data message;
the second node acquires the receiving time of the first data message, and determines a first period of the second node which sends the first data message according to the receiving time of the first data message;
and the second node sends the first data message in a first period of the second node.
12. The method of claim 11, wherein determining the first period of the second node of the first datagram according to the time of receipt of the first datagram comprises:
the second node determines a time interval to which the receiving time of the first data message belongs;
and the second node determines a first period of the second node of the first data message according to the time interval to which the receiving time of the first data message belongs.
13. The method of claim 12, further comprising:
the second node determines a third time point for receiving a measurement message, wherein the measurement message is a message sent by the first node in a first period of the first node;
and the second node determines a plurality of time intervals and periods corresponding to the time intervals according to the third time point.
14. The method of claim 13, wherein the second node determines a plurality of time intervals according to the third time point, and periods corresponding to the plurality of time intervals comprise:
the second node determines a fourth time point according to the third time point, wherein the fourth time point is used for representing the time point of the second node for pre-estimating processing of a data message sent by the first node in the first period of the first node;
the second node determines a first time interval according to the third time point; the first time interval is (t) a ，t a + T- δ); the first time interval corresponds to a Ty period of the second node; wherein, t a As the third time point, T is a duration of a first period of the first node; the Ty period is one period after the fourth time point;
the second node determines that the kth time interval is [ t ] a +k*T-δ，t a And positive (k + 1) T-delta), wherein the kth time interval corresponds to the Ty + k-1 period of the second node, and k is an integer greater than 1.
15. The method of claim 14, wherein the fourth time point satisfies the following equation:
t 3 ＝t 2 +T+L max +δ
wherein, t 3 Is the fourth time point, t 2 For the third time point, T is the duration of the first period of the first node, and L max And the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
16. The method of claim 11, wherein determining the first period of the second node of the first datagram according to the time of receipt of the first datagram comprises:
the second node determines a first period of the second node of the first data message according to the time difference between the first data message and the third period of the second node; the third data packet is a previous data packet of the first data packet received by the second node; the third period of the second node is a period in which the second node transmits the third data packet.
17. The method of claim 16, wherein before the second node determines the first period of the second node for the first datagram based on a time difference between receiving the first datagram and the third datagram and a third period of the second node, the method further comprises:
the second node receives the third data message;
the second node determines a fifth time point for receiving the third data message;
the second node determines a sixth time point according to the fifth time point, wherein the sixth time point is used for representing a time point of the second node for pre-estimated processing of a data message sent by the first node in a third period of the second node;
and the second node determines that a period after the sixth time point is a third period of the second node.
18. The method of claim 17, wherein the sixth time point satisfies the following equation:
t 5 ＝t 4 +T+L max +δ
wherein, t 5 Is the sixth time point, t 4 At the fifth time point, T is the duration of the third period of the second node, and L max The maximum time length pre-estimated for the second node and required for processing the data message sent by the first node in the third period of the second node, wherein delta is the time delay jitter between the first node and the second nodeA maximum value.
19. The method according to any of claims 16-18, wherein the second node determining the first period of the second node for the first datagram based on the time difference between receiving the first datagram and the third period of the second node comprises:
the second node determines whether the time difference between the first data message and the third data message is smaller than a preset value;
if so, the second node determines that the third period of the second node is the same as the first period of the second node;
if not, the second node determines a seventh time point for acquiring the first data message;
the second node determines an eighth time point according to the seventh time point, wherein the eighth time point is used for representing a time point which is estimated by the second node and is used for processing a data message which is sent by the first node in a first period of the second node;
and the second node determines that the period after the eighth time point is the first period of the second node.
20. The method of claim 19, wherein the eighth time point satisfies the following equation:
t 7 ＝t 6 +T+L max +δ
wherein, t 7 Is the eighth time point, t 6 At the seventh time point, T is the duration of the third period of the second node, and L max And the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
21. The method of claim 11, wherein determining the first period of the second node of the first datagram according to the time of receipt of the first datagram comprises:
the second node determines a third period of the first node for sending the first data message according to the time for receiving the first data message;
the second node determines a first period of a second node of the second nodes according to a third period of the first node.
22. The method of claim 21, wherein the second node determining a third period of the first node for the first node to send the first data packet according to the time for receiving the first data packet comprises:
the second node determines a time interval for the first node to send the first data message according to the time for receiving the first data message, the time delay between the first node and the second node and the time delay jitter between the first node and the second node;
and the second node determines a third period of the first node for sending the first data message according to the time interval for sending the first data message by the first node.
23. The method of claim 22, wherein the second node determines the first period of the second node according to the third period of the first node, comprising:
the second node determines a mapping relation between the period of the first node and the period of the second node;
and the second node determines a first period of the second node corresponding to the third period of the first node according to the mapping relation and the third period of the first node.
24. The method according to claim 22 or 23, wherein a time interval during which the first node transmits the first data packet satisfies:
wherein, t x D, a time for receiving the first data packet by the second node, wherein δ is a maximum value of a time delay jitter between the first node and the second node.
25. A method of communication, comprising:
the first node sends a measurement message in a first period of the first node;
the first node sends a first data message in a preset time period in a first period of the first node.
26. The method of claim 25, wherein a start time of the preset time period is the same as a start time of a first cycle of the first node; or the end time of the preset time period is the same as the end time of the first period of the first node.
27. The method according to claim 25 or 26, wherein the duration of the preset time period is a difference between the duration of the first cycle of the first node and 2 δ; δ is the maximum value of the delay jitter between the first node and the second node.
28. The method according to any one of claims 25-27, further comprising:
and the first node sends a third data message to the second node within a preset time period of a third period of the second node, wherein the third period of the second node is a period after the first period of the first node.
29. A communications apparatus, comprising: a communication unit and a processing unit;
the communication unit is used for receiving a first boundary message and a first data message from a first node; the first boundary packet is used for indicating a boundary between a data packet sent in a first period of the first node and a data packet sent in a period adjacent to the first period of the first node;
the processing unit is configured to determine, according to the first delimiting packet, a first period of a second node corresponding to a first data packet, where the first data packet is a data packet sent by the first node to the second node in the first period of the first node;
the processing unit is further configured to instruct the communication unit to send the first data packet in a first period of the second node.
30. The apparatus according to claim 29, wherein the processing unit is specifically configured to:
determining a first time point for acquiring the first delimiting message;
determining a second time point according to the first time point, wherein the second time point is used for representing the time point of the second node which is estimated to process the data message sent by the first node in the first period of the first node;
and determining a period after the second time point as a first period of the second node.
31. The apparatus of claim 30, wherein the communication unit is further configured to: receiving a second delimiting message; the second delimiting message is used for indicating a boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node;
the processing unit is further configured to determine a second cycle of a second node corresponding to a second data message according to the sequence number of the second delimiting message and the sequence number of the first delimiting message; the second data packet is a data packet sent by the first node in a second period of the first node, and the second period of the second node is a period after the first period of the second node; the second period of the first node is a period after the first period of the first node;
the processing unit is further configured to instruct the communication unit to send the second data packet in a second period of the second node.
32. The apparatus of claim 31, wherein the sequence number of the second period of the second node satisfies the following equation:
C’＝C+(M’-M)
the method comprises the steps of defining a first delimiting message, a second delimiting message and a third delimiting message, wherein C 'is a serial number of a second period of a second node, C is a serial number of a first period of the second node, M is a serial number of the first delimiting message, and M' is a serial number of the second delimiting message.
33. The apparatus of claim 31, wherein the sequence number of the second period of the second node satisfies the following equation:
C’＝M’+offset
wherein C 'is a sequence number of a second cycle of the second node, M' is a sequence number of the second delimiting packet, and offset satisfies the following formula:
offset＝C-M
wherein C is a sequence number of a first cycle of the second node, and M is a sequence number of the first delimiting packet.
34. The apparatus according to any of claims 29-33, wherein the first delimiting message satisfies any of: the first delimiting message is a data message sent by the first node at the starting time of the first period of the first node; the first delimiting message is a data message sent by the first node at the end time of the first period of the first node; the first delimiting message is a data message sent by the first node in the middle of the first period of the first node; the first delimiting message is a data message sent by the first node in a period other than the first period of the first node.
35. The apparatus of claim 34, wherein in a case that the first delimiting packet is a data packet sent by the first node at a start time of a first cycle of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +T+L max +δ
wherein, t 1 Is the second time point, t 0 At the first time point, T is the duration of a first period of the first node, L max The maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node;
when the first delimiting packet is a data packet sent by the first node at the end time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +L max
when the first delimiting packet is a data packet sent by the first node in the middle time of the first period of the first node, the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ
h is the duration between the time when the first node sends the first delimiting message and the end time of the first period of the first node;
in the case that the first delimiting packet is a data packet sent by the first node in a period other than the first period of the first node,
the second time point satisfies the following formula:
t 1 ＝t 0 +H+L max +δ+N×T
and N is the number of periods spaced between the period of the first node sending the first boundary message and the period of the second node sending the first data message, and N is a positive integer.
36. A communications apparatus, comprising: a communication unit and a processing unit;
the processing unit is used for indicating the communication unit to send a first boundary message to a second node; the first boundary packet is used for indicating a boundary between a data packet sent in a first period of the first node and a data packet sent in a period adjacent to the first period of the first node;
the processing unit is further configured to instruct the communication unit to send a first data packet to the second node in a first period of the first node; the first delimiting message is used for the second node to determine the sending period of the first data message.
37. The apparatus according to claim 36, wherein the processing unit is specifically configured to: instructing the communication unit to send the first delimiting packet to the second node at the start time of the first period of the first node; or, instructing the communication unit to send the first delimiting packet to the second node at the end time of the first period of the first node; or, instructing the communication unit to send the first delimiting packet to the second node in the middle of the first period of the first node; or, instructing the communication unit to send the first delimiting packet to the second node at a time other than the first period of the first node.
38. The apparatus according to claim 36 or 37, wherein the processing unit is further configured to:
instructing the communication unit to send a second delimited message to the second node in a second period of the first node; the second delimiting message is used for indicating a boundary between the data message sent in the second period of the first node and the data message sent in the adjacent period of the second period of the first node;
instructing the communication unit to send a second data packet to the second node at a second period of the first node; and the second delimiting message is used for a second node to determine the sending period of the second data message.
39. A communications apparatus, comprising: a communication unit and a processing unit;
the communication unit is used for receiving a first data message;
the processing unit is configured to obtain a receiving time of the first data packet, and determine a first period of a second node that sends the first data packet according to the receiving time of the first data packet;
the processing unit is further configured to instruct the communication unit to send the first data packet in a first period of the second node.
40. The apparatus according to claim 39, wherein the processing unit is specifically configured to:
determining a time interval to which the first data message belongs;
and determining a first period of a second node of the first data message according to the time interval to which the first data message belongs.
41. The apparatus of claim 40, wherein the processing unit is further configured to:
determining a third time point for receiving a measurement message, wherein the measurement message is a message sent by a first node in a first period of the first node;
and determining a plurality of time intervals and periods corresponding to the time intervals according to the third time point.
42. The apparatus according to claim 41, wherein the processing unit is specifically configured to:
determining a fourth time point according to the third time point, wherein the fourth time point is used for representing the time point of processing the data message sent by the first node in the first period of the first node and pre-estimated by the second node;
determining a first time interval according to the third time point; the first time interval is (t) a ，t a + T- δ); the first time interval corresponds to a Ty period of the second node; wherein, t a As the third time point, T is a duration of a first period of the first node; the Ty period is one period after the fourth time point;
determining the kth time interval as [ t ] a +k*T-δ，t a Plus (k + 1) × T- δ), the kth time interval corresponding to the Ty + k-1 period of the second node, k being an integer greater than 1.
43. The apparatus of claim 42, wherein the fourth time point satisfies the following equation:
t 3 ＝t 2 +T+L max +δ
wherein, t 3 Is the fourth time point, t 2 For the third time point, T is the duration of the first period of the first node, and L max And the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the first node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
44. The apparatus according to claim 39, wherein the processing unit is specifically configured to:
determining a first period of a second node of the first data message according to the time difference between the first data message and the third data message and a third period of the second node; the third data message is a previous data message of the first data message received by the second node; the third period of the second node is a period in which the second node transmits the third data packet.
45. The apparatus of claim 44, wherein the communication unit is further configured to receive the third data packet;
the processing unit is further configured to determine a fifth time point for receiving the third data packet;
the processing unit is further configured to determine a sixth time point according to the fifth time point, where the sixth time point is used to represent a time point, which is estimated by the second node, of processing a data packet sent by the first node in a third period of the second node;
the processing unit is further configured to determine that a period after the sixth time point is a third period of the second node.
46. The apparatus of claim 45, wherein the sixth time point satisfies the following equation:
t 5 ＝t 4 +T+L max +δ
wherein, t 5 Is the sixth time point, t 4 At the fifth time point, T is the duration of the third period of the second node, and L max And d, the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the third period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
47. The apparatus according to any one of claims 44-46, wherein the processing unit is specifically configured to:
determining whether the time difference between the receiving of the first data message and the receiving of the third data message is smaller than a preset value;
if so, determining that the third period of the second node and the first period of the second node are the same period;
if not, determining a seventh time point for acquiring the first data message;
determining an eighth time point according to the seventh time point, where the eighth time point is used to represent a time point, estimated by the second node, of processing a data packet sent by the first node in the first period of the second node;
and determining the period after the eighth time point as the first period of the second node.
48. The apparatus of claim 47, wherein the eighth time point satisfies the following equation:
t 7 ＝t 6 +T+L max +δ
wherein, t 7 Is the eighth time point, t 6 At the seventh time point, T is the duration of the third period of the second node, and L max And the maximum time length which is estimated for the second node and is required for processing the data message sent by the first node in the first period of the second node, wherein delta is the maximum value of the time delay jitter between the first node and the second node.
49. The apparatus according to claim 39, wherein the processing unit is specifically configured to:
determining a third period of the first node for the first node to send the first data message according to the time for receiving the first data message;
determining a first period of the second node according to a third period of the first node.
50. The apparatus according to claim 49, wherein the processing unit is specifically configured to:
determining a time interval for the first node to send the first data message according to the time for receiving the first data message, the time delay between the first node and the second node and the time delay jitter between the first node and the second node;
and determining a third period of the first node for sending the first data message according to the time interval for sending the first data message by the first node.
51. The apparatus according to claim 50, wherein the processing unit is specifically configured to:
determining a mapping relation between the period of the first node and the period of the second node;
and determining a first period of the first node corresponding to the first period of the second node according to the mapping relation and the first period of the second node.
52. The apparatus according to claim 50 or 51, wherein the time interval for the first node to send the first data packet satisfies:
wherein, t x D, a time for receiving the first data packet by the second node, wherein δ is a maximum value of a time delay jitter between the first node and the second node.
53. A communications apparatus, comprising: a processing unit and a communication unit;
the processing unit is configured to instruct the communication unit to send a measurement packet in a first period of a first node;
the processing unit is further configured to instruct the communication unit to send a first data packet within a preset time period in a first cycle of the first node.
54. The apparatus of claim 53, wherein a start time of the preset time period is the same as a start time of a first cycle of the first node; or the end time of the preset time period is the same as the end time of the first period of the first node.
55. The apparatus according to claim 53 or 54, wherein the duration of the preset time period is a difference between the duration of the first cycle of the first node and 2 δ; δ is the maximum value of the delay jitter between the first node and the second node.
56. The apparatus according to any one of claims 53-55, wherein the processing unit is further configured to:
and instructing the communication unit to send a third data packet to a second node within a preset time period of a third period of the second node, where the third period of the second node is a period after the first period of the first node.
57. A computer-readable storage medium comprising a computer program or instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1-7, or cause the computer to perform the method of any one of claims 8-10, or cause the computer to perform the method of any one of claims 11-24, or cause the computer to perform the method of any one of claims 25-28.
58. A computer program product, which, when run on a computer, causes the computer to perform the method of any one of claims 1 to 7, or causes the computer to perform the method of any one of claims 8 to 10, causes the computer to perform the method of any one of claims 11 to 24, and causes the computer to perform the method of any one of claims 25 to 28.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110462366.0A CN115334007A (en) | 2021-04-27 | 2021-04-27 | Communication method and device |
| PCT/CN2021/140692 WO2022227642A1 (en) | 2021-04-27 | 2021-12-23 | Communication method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110462366.0A CN115334007A (en) | 2021-04-27 | 2021-04-27 | Communication method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115334007A true CN115334007A (en) | 2022-11-11 |
Family
ID=83846510
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110462366.0A Pending CN115334007A (en) | 2021-04-27 | 2021-04-27 | Communication method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN115334007A (en) |
| WO (1) | WO2022227642A1 (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| BR112015029583B1 (en) * | 2013-05-31 | 2022-09-06 | Telecom Italia S.P.A. | METHOD FOR PERFORMING A MEASUREMENT OF A LINK, NODE FOR A COMMUNICATION NETWORK, COMMUNICATION NETWORK, AND COMPUTER READable STORAGE MEDIA |
| CN112202685A (en) * | 2017-11-06 | 2021-01-08 | 华为技术有限公司 | Message forwarding method, forwarding equipment and network equipment |
| CN112187556B (en) * | 2019-07-01 | 2023-12-08 | 华为技术有限公司 | Congestion measurement method and network node |
| CN112311494B (en) * | 2019-07-23 | 2023-12-08 | 华为技术有限公司 | Message transmission method, device and system |
-
2021
- 2021-04-27 CN CN202110462366.0A patent/CN115334007A/en active Pending
- 2021-12-23 WO PCT/CN2021/140692 patent/WO2022227642A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022227642A1 (en) | 2022-11-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111865830A (en) | Processing method, device and system for time delay sensitive network service TSN | |
| CN110445511B (en) | Self-adaptive synchronous frequency hopping method and device, wireless AP and communication system | |
| CN110493876A (en) | Data transmission method, device, equipment and storage medium | |
| US11252740B2 (en) | Controlling communications in heterogeneous networks | |
| WO2020135640A1 (en) | Transmission method and apparatus | |
| CN113784392A (en) | Communication method, device and system | |
| CN110034897A (en) | A kind of reference signal transmission method and device | |
| EP3962157A1 (en) | Mdbv determining method, apparatus, and system | |
| CN115334007A (en) | Communication method and device | |
| US11956721B2 (en) | 5G radio-aware power management at a wireless local area network (WLAN) access point (AP) in fixed wireless access (FWA) deployments | |
| WO2018059349A1 (en) | Method and apparatus for symbol setting | |
| CN111294930B (en) | Communication method and device | |
| CN110178404A (en) | A kind of resource using method, relevant apparatus and system | |
| CN110034898A (en) | A kind of reference signal transmission method and device | |
| CN106465413B (en) | Data transmission method and station | |
| CN111526583A (en) | Resource allocation method, resource acquisition method, network device and terminal | |
| EP4266740A2 (en) | 5gs interworking with time sensitive network transport network | |
| CN111757479B (en) | Communication method and device | |
| CN110972250B (en) | Power control method and device | |
| WO2023011648A1 (en) | Signal sending method and apparatus | |
| WO2023207927A9 (en) | Energy-saving method and apparatus, and storage medium | |
| CN109413742B (en) | Method and device for transmitting system information | |
| WO2020221212A1 (en) | Resource scheduling method and apparatus | |
| WO2021179269A1 (en) | Communication method and apparatus for wireless local area network | |
| Zhou et al. | Enabling efficient and wide-coverage vehicular content distribution over TV white spaces |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |