Mapping relation determination method and device, medium and program product

Abstract

The embodiment of the invention provides a mapping relation determination method and device, a medium and a program product, and the method comprises the steps: transmitting a request message to a second node, and transmitting the following information to the second node through the request message: a serial number, an arrangement period length, a time slot length used by a first port of a first node, and a transmission time deviation parameter; a reply message sent by the second node according to the request message is received, and the reply message carries the following information: the serial number, the arrangement period length, the time slot length used by a second port of the second node and a remaining time parameter; the remaining time parameter is determined by the second node according to the sending time deviation parameter; and determining the mapping relationship between the first port and the second port according to the arrangement period length and the remaining time parameter, and completing the detection of the mapping relationship between the outlet ports and the inlet ports of the upstream and downstream nodes.

Description

Technical Field

[0001] The present application relates to the technical field of communication equipment, and in particular to a method, device, medium and program product for determining a mapping relationship. Background Art

[0002] A time slot resource is a time slot within an orchestration period of a specific length. Each node in the network can be configured with multiple orchestration periods of different lengths, but nodes must use the same orchestration period to communicate.

[0003] The Internet Engineering Task Force (IETF) published a personal draft, draft-peng-detnet-packet-timeslot-mechanism-05, describing a timeslot-based scheduling mechanism (Timeslot Queueing and Forwarding, TQF) that converts timeslots into resources, making them available and reserved for services. It describes a scheme for allocating and announcing timeslot resources. At the network's ingress node, corresponding outbound timeslot resources are reserved on the egress port for traffic flows with corresponding arrival times. Alternatively, at intermediate nodes in the network, corresponding outbound timeslot resources are reserved on the egress port for traffic flows with corresponding inbound timeslots. This ensures that the estimated residence delay of traffic flows at each node meets the budget. Forwarded packets are then sent sequentially in the outbound timeslots of the egress ports of each node along the path. However, a specific detection protocol design is currently lacking to determine the mapping between the egress and ingress ports of upstream and downstream nodes. Summary of the Invention

[0004] The embodiments of the present application provide a mapping relationship determination method, device, medium, and program product for obtaining a mapping relationship between egress ports and ingress ports of upstream and downstream nodes.

[0005] In a first aspect, an embodiment of the present application provides a method for determining a mapping relationship, which is applied to a first node, and the method includes:

[0006] Sending a request message to the second node, so as to deliver the following information to the second node through the request message: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a sending time offset parameter;

[0007] receiving a reply message sent by the second node in response to the request message, wherein the reply message carries the following information: the sequence number, the orchestration cycle length, the time slot length used by the second port of the second node, and a remaining time parameter, where the remaining time parameter is determined by the second node according to the sending time offset parameter;

[0008] A mapping relationship between the first port and the second port is determined according to the orchestration cycle length and the remaining time parameter.

[0009] In a second aspect, an embodiment of the present application provides a method for determining a mapping relationship, which is applied to a second node, and the method includes:

[0010] receiving a request message sent by a first node, and obtaining the following information from the request message: a sequence number, an orchestration cycle length, a time slot length used by a first port of the first node, and a transmission time offset parameter;

[0011] Determine a remaining time parameter according to the sending time deviation parameter;

[0012] Send a reply message to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: the sequence number, the orchestration cycle length, the time slot length used by the second port, and the remaining time parameter.

[0013] In a third aspect, an embodiment of the present application provides an electronic device, including:

[0014] one or more processors;

[0015] A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the following:

[0016] The mapping relationship determination method according to the first aspect;

[0017] or,

[0018] The mapping relationship determination method described in the second aspect.

[0019] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the following:

[0020] The mapping relationship determination method according to the first aspect;

[0021] or,

[0022] The mapping relationship determination method described in the second aspect.

[0023] In a fifth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the following:

[0024] The mapping relationship determination method according to the first aspect;

[0025] or,

[0026] The mapping relationship determination method described in the second aspect.

[0027] According to the mapping relationship determination method, device, medium and program product provided by the embodiment of the present application, the first node sends a request message to the second node to pass the sequence number, the scheduling cycle length, the time slot length used by the first port of the first node and the sending time deviation parameter to the second node through the request message; the second node receives the request message sent by the first node, determines the remaining time parameter according to the sending time deviation parameter, and sends a reply message containing the sequence number, the scheduling cycle length, the time slot length used by the second port of the second node and the remaining time parameter to the first node, and the remaining time parameter is determined by the second node according to the sending time deviation parameter; the first node determines the mapping relationship between the first port of the first node and the second port of the second node based on the received scheduling cycle length and the remaining time parameter. According to the embodiment of the present application, the mapping relationship between the egress port and the ingress port of the upstream and downstream nodes can be obtained. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Figure 1 A schematic diagram of the time slot mapping relationship between the egress and ingress ports of upstream and downstream nodes;

[0029] Figure 2 Schematic diagram of another time slot mapping relationship between the egress port and the ingress port of the upstream and downstream nodes;

[0030] Figure 3 A flowchart of a method for determining a mapping relationship applied to a first node provided in an embodiment of the present application;

[0031] Figure 4 for Figure 1 Specific flow diagram of step S101;

[0032] Figure 5 for Figure 1 Another specific flow chart of step S101;

[0033] Figure 6 for Figure 1 Another specific flow chart of step S101;

[0034] Figure 7 for Figure 1Another specific flow chart of step S101;

[0035] Figure 8 A flowchart of a method for determining a mapping relationship applied to a second node provided in an embodiment of the present application;

[0036] Figure 9 for Figure 8 Specific flow diagram of step S601;

[0037] Figure 10 for Figure 8 Another specific flow chart of step S601;

[0038] Figure 11 A flowchart of a method for determining a mapping relationship provided in an embodiment of the present application;

[0039] Figure 12 A schematic diagram of a message field structure provided in an embodiment of the present application;

[0040] Figure 13 A schematic diagram of another message field structure provided in an embodiment of the present application;

[0041] Figure 14 A schematic diagram of another message field structure provided in an embodiment of the present application;

[0042] Figure 15 Another message field structure diagram provided in an embodiment of the present application;

[0043] Figure 16 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0044] In order to enable those skilled in the art to better understand the technical solution of the present application, the technical solution provided by the present application is described in detail below with reference to the accompanying drawings.

[0045] Example embodiments will be described more fully hereinafter with reference to the accompanying drawings, but the described example embodiments may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this application will be thorough and complete and will fully convey the scope of this application to those skilled in the art.

[0046] As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items.

[0047] The terms used herein are used only to describe specific embodiments and are not intended to limit this application. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms, unless the context clearly indicates otherwise. It will also be understood that when the terms "comprising" and / or "made of" are used in this specification, they specify the presence of features, wholes, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, wholes, steps, operations, elements, components, and / or groups thereof.

[0048] In the following description, reference is made to “some embodiments”, which describes a subset of all possible embodiments, but it will be understood that “some embodiments” may be the same subset or different subsets of all possible embodiments and may be combined with each other without conflict.

[0049] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and the present application, and will not be interpreted as having an idealized or overly formal meaning, unless clearly defined in the examples of the present application.

[0050] To facilitate a better understanding of the solutions of the embodiments of the present application, the relevant technologies are first introduced below.

[0051] Timeslot is a basic unit of resource. In a mobile communication system in time division duplexing (TDD) mode, timeslot resources are usually divided into multiple time segments of fixed or variable length, which are allocated to different users or services for data transmission. Through reasonable timeslot resource allocation, higher data transmission rates, lower communication delays and better user experience can be achieved. The timeslot resource allocation algorithm needs to meet some key requirements, including fairness, efficiency and flexibility. Fairness means that each user should obtain a certain amount of timeslot resources to prevent some users from occupying a large amount of resources for a long time, causing other users to be unable to communicate normally; efficiency requires that the algorithm can maximize the system's throughput and transmission efficiency, and improve the data transmission rate and reduce communication delay through reasonable resource allocation; flexibility means that the algorithm can adapt to different network environments and business needs, such as the data transmission rate requirements of different users, different business priorities, etc.

[0052] An orchestration period refers to the time period used for resource allocation, configuration updates, or state synchronization in network resource management and scheduling. This concept typically appears in slot-based scheduling mechanisms, such as TDD systems, where an orchestration period consists of multiple equal-length slots. For example, an orchestration period of 1ms contains 100 slots, each 10µs long. For the same orchestration period, different nodes can configure different slot lengths and corresponding numbers of slots for each orchestration period instance. Based on the needs of all deterministic services, an orchestration period allocates slot resources within the orchestration period, specifically which slots a service occupies and how many bits it occupies within the slot. The length of an orchestration period is the least common multiple of the intervals between all service bursts, an integer multiple of the intervals between service bursts. Multiple orchestration period instances of varying lengths can be configured across the network, and all nodes communicate based on the same orchestration period instance.

[0053] In network communications, an incoming timeslot typically refers to the timeslot used to receive uplink data transmissions from user devices or other network nodes. For the head node of a specific path, the timeslot corresponding to the user-facing port at the moment a message received from the source client arrives at the user-facing port after traffic conditioning is the message's incoming timeslot. For an intermediate node along a specific path, the outgoing timeslot assigned by the upstream node when sending the message is the message's incoming timeslot at the downstream node.

[0054] An outgoing timeslot is a time period used to send downlink data from a network node (such as a base station or router) to a user device or other network node in a timeslot-based scheduling mechanism. In contrast to the inbound timeslot, the outgoing timeslot is dedicated to processing downlink transmissions, ensuring that data is correctly delivered from the network node to the destination device. When an intermediate node in a specific path continues to send a message to a downstream node, it selects a designated timeslot based on resource reservations or specific rules. This timeslot is called the outgoing timeslot.

[0055] Ongoing Sending Timeslot: When the end of the incoming timeslot to which a message belongs reaches the egress port, the timeslot in which the egress port is currently sending is called the ongoing sending timeslot. Note that the ongoing sending timeslot is not an outgoing timeslot.

[0056] The service burst interval (SBI) is a time-dependent parameter used to describe the burstiness of service traffic in network communications. This parameter is commonly used in network planning and performance analysis to help predict and manage network traffic patterns. The traffic specification for a deterministic service flow typically adheres to a certain burst size within a recurring burst interval (i.e., the service burst interval). For example, if a service flow generates 1000 bits of traffic every 1ms, the corresponding service burst interval is 1ms. Determining the service burst interval requires considering various factors, including user behavior, application characteristics, and network topology. By analyzing historical traffic data, user behavior patterns, and network performance data, the size and frequency of service burst intervals can be estimated. This information is crucial for network planning and resource management, helping network engineers predict and manage traffic bursts, thereby ensuring network stability and performance.

[0057] A time slot resource is a time slot within an orchestration period of a specific length. Each node in the network can be configured with multiple orchestration periods of different lengths, but nodes must use the same orchestration period to communicate.

[0058] The Internet Engineering Task Force (IETF) published a personal draft, draft-peng-detnet-packet-timeslot-mechanism-05, describing a timeslot-based scheduling mechanism (Timeslot Queueing and Forwarding, TQF) that transforms timeslots into resources, opening them up and reserving them for services. It describes a scheme for allocating and announcing timeslot resources. At the network's ingress node, corresponding outbound timeslot resources are reserved on the egress port for traffic flows with corresponding arrival times. Similarly, at intermediate nodes in the network, corresponding outbound timeslot resources are reserved on the egress port for traffic flows with corresponding inbound timeslots. This ensures that the estimated residence delay of traffic flows at each node meets the budgeted value. Forwarded packets are then sent sequentially in the outbound timeslots of the egress ports of each node along the path.

[0059] To reserve appropriate time slot resources on each egress port, the time slot mapping relationship within the orchestration cycle between the egress port pairs of upstream and downstream nodes must be known. draft-peng-detnet-packet-timeslot-mechanism-05 mentions two relatively inexpensive detection methods: one is to detect the time slot mapping relationship between the egress and ingress ports of upstream and downstream nodes, from which the time slot mapping relationship between the egress port pairs of upstream and downstream nodes can be derived; the other is to detect the orchestration cycle mapping relationship between the egress and ingress ports of upstream and downstream nodes, from which the time slot mapping relationship between the egress and ingress ports of upstream and downstream nodes can be derived. However, there is currently a lack of specific detection protocol designs to obtain the time slot mapping relationship or orchestration cycle mapping relationship between the egress and ingress ports of upstream and downstream nodes.

[0060] According to the requirements of draft-peng-detnet-packet-timeslot-mechanism-05, a detection mechanism is required to obtain the relationship between any time slot x of the egress port of an upstream node and the time slot y of the ingress port of a downstream node within a specific orchestration period length (OPL), or to obtain the relationship between the orchestration period of the egress port of an upstream node and the orchestration period of the ingress port of a downstream node within a specific orchestration period length.

[0061] Please refer to Figure 1 , is a schematic diagram of the time slot mapping relationship between the egress port and ingress port of an upstream and downstream node. The relationship between any time slot x of the egress port of an upstream node and the time slot y of the ingress port of a downstream node under a specific orchestration period length (OPL) is as follows: Figure 1 As shown, the upstream node U and the downstream node V use the same OPL for interconnection. The egress port port-1 of node U and the ingress port port-2 of node V may use different time slot lengths. For example, the time slot length (TL, Timeslot Length) used by the egress port of node U is TL1, and the entire orchestration cycle contains N1 time slots. The time slot length used by the ingress port of node V is TL2, and the entire orchestration cycle contains N2 time slots, satisfying N1*TL1=N2*TL2. It is necessary to obtain the mapping relationship between the time slot x of the egress port port-1 of the upstream node U and the time slot y of the ingress port port2 of the downstream node V under this OPL, that is, when the end of the time slot x of port-1 reaches the port-2 of node V after the link delay, it is in the time slot y of port-2, and there is still T_xy time left before the end of time slot y. This time slot mapping relationship is recorded as<OPL,U.port-1.x:V.port-2.y,T_xy> .

[0062] Please refer to Figure 2 , which is another schematic diagram of the time slot mapping relationship between the egress port and ingress port of the upstream and downstream nodes. The relationship between the scheduling period of the egress port of the upstream node under a specific scheduling period length and the scheduling period of the ingress port of the downstream node is as follows: Figure 2 As shown, the upstream node U and the downstream node V use the same orchestration cycle length (OPL) to communicate with each other. The egress port port-1 of node U and the ingress port port-2 of node V may use different time slot lengths. For example, the time slot length used by the egress port of node U is TL1, and the entire orchestration cycle includes N1 time slots. The time slot length used by the ingress port of node V is TL2, and the entire orchestration cycle includes N2 time slots, satisfying N1*TL1=N2*TL2. It is necessary to obtain the phase difference between the orchestration cycle of the egress port port-1 of the upstream node U and the orchestration cycle of the ingress port port-2 of the downstream node V under the OPL, that is, when the end of the orchestration cycle of port-1 reaches port-2 of node V after the link delay, it is in the current orchestration cycle of port-2, and there is still P_uv time left before the end of the current orchestration cycle. This orchestration cycle mapping relationship is recorded as<OPL,U.port-1:V.port-2,P_uv> .

[0063] The implementation environment of the mapping relationship determination method provided in the embodiments of the present application may include a first node and a second node, wherein the first node and the second node are in communication with each other. The first node and the second node may be network nodes, and the network nodes may specifically be physical nodes or logical nodes. A physical node is a network device such as a switch or a router. A logical node is a functional module in a network device, for example, a virtual switch or a virtual router deployed in the network device.

[0064] Please refer to Figure 3 , is a flow chart of a method for determining a mapping relationship provided in an embodiment of the present application, which can be applied to a first node, such as Figure 3 As shown, this includes but is not limited to steps S101 to S103:

[0065] Step S101: Send a request message to a second node to convey the following information to the second node through the request message: a sequence number, an arrangement cycle length, a time slot length used by a first port of a first node, and a sending time offset parameter.

[0066] Step S102: Receive a reply message sent by the second node according to the request message; wherein the reply message carries the following information: a sequence number, an arrangement cycle length, a time slot length used by the second port of the second node, and a remaining time parameter, where the remaining time parameter is determined by the second node according to the sending time deviation parameter.

[0067] Step S103: Determine a mapping relationship between the first port and the second port according to the scheduling cycle length and the remaining time parameter.

[0068] It should be noted that the mapping relationship described in the embodiments of the present application includes a time slot mapping relationship and / or a scheduling period mapping relationship.

[0069] In one embodiment, the mapping relationship includes a time slot mapping relationship; the request message sent by the first node to the second node also carries the target time slot of the first port; the reply message also carries the mapped time slot of the second port; the remaining time parameter includes a first remaining time parameter, which represents the remaining time from the end of the target time slot of the first port to the end of the mapped time slot when the end reaches the second port; the time slot mapping relationship includes at least one of the following elements: the length of the scheduling cycle, the first port, the target time slot of the first port, the second port, the mapped time slot of the second port, and the first remaining time parameter. The target sending time of the request message is determined based on a preset position within the target time slot of the first port.

[0070] In one embodiment, the mapping relationship includes an orchestration period mapping relationship; the remaining time parameter includes a second remaining time parameter, which indicates the remaining time from the end of the orchestration period of the first port to the end of the current orchestration period when the end of the orchestration period of the second port reaches the end of the current orchestration period; the orchestration period mapping relationship includes at least one of the following elements: the orchestration period length, the first port, the second port, and the second remaining time parameter. The target sending time of the request message is determined based on a preset position within the orchestration period of the first port.

[0071] It should be noted that the reply message may also carry a return code, and the return code is used to indicate the processing result of the request message by the second node.

[0072] Please refer to Figure 8 , which is a flow chart of a method for determining a mapping relationship applied to a second node provided in an embodiment of the present application, such as Figure 8 As shown, a method for determining a mapping relationship applied to a second node provided in an embodiment of the present application includes but is not limited to steps S601 to S603:

[0073] Step S601: Receive a request message sent by a first node, and obtain the following information from the request message: a sequence number, an arrangement cycle length, a time slot length used by a first port of the first node, and a transmission time offset parameter.

[0074] Step S602: Determine the remaining time parameter according to the sending time deviation parameter.

[0075] Step S603: Send a reply message to the first node, so that the first node determines the mapping relationship between the first port of the first node and the second port of the second node based on the reply message; wherein the reply message carries the following information: a sequence number, an arrangement cycle length, a time slot length used by the second port, and a remaining time parameter.

[0076] It should be noted that the request message received by the second node from the first node also includes the target time slot of the first port; the remaining time parameter includes a first remaining time parameter, which represents the remaining time from the end of the target time slot of the first port to the end of the mapped time slot when the end reaches the second port. When the second node receives the request message, it determines the remaining time parameter based on the sending time deviation parameter. The specific process includes:

[0077] Determining a target arrival time based on an actual arrival time of the request message, a time slot length used by the first port, and a sending time deviation parameter;

[0078] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0079] Determining a mapping time slot of the second port according to the time offset parameter and the time slot length used by the second port;

[0080] A first remaining time parameter is determined according to the mapped time slot of the second port, the time slot length used by the second port, and a time offset parameter.

[0081] The remaining time parameter also includes a second remaining time parameter, which represents the remaining time from the end of the first port's scheduling cycle to the end of the current scheduling cycle when the end reaches the second port. The remaining time parameter is determined based on the sending time deviation parameter, and the specific process includes:

[0082] Determine the target arrival time based on the actual arrival time of the request message and the sending time deviation parameter;

[0083] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0084] A second remaining time parameter is determined according to the programming period length and the time offset parameter.

[0085] It is understood that in the embodiment of the present application, the first node is an upstream node and the second node is a downstream node. Through the above-mentioned mapping relationship determination method applied to the first node and the mapping relationship determination method applied to the second node, a specific detection protocol design for obtaining the time slot mapping relationship or the scheduling cycle mapping relationship between the egress port and the ingress port of the upstream and downstream nodes can be obtained.

[0086] For example, please refer to Figure 11 , which is a flow chart of a method for determining a mapping relationship provided in an embodiment of the present application, such as Figure 11 As shown, in the embodiment of the present application, when determining the mapping relationship under the requirements of draft-peng-detnet-packet-timeslot-mechanism-05, the mapping relationship determination method includes but is not limited to steps S901 to S906:

[0087] Step S901: A first node sends a request message to a second node, so as to transmit the following information to the second node through the request message: a sequence number, an arrangement cycle length, a time slot length used by a first port of the first node, and a transmission time offset parameter.

[0088] Step S902: The second node receives the request message sent by the first node, and obtains the sequence number, the scheduling cycle length, the time slot length used by the first port of the first node, and the transmission time offset parameter from the request message.

[0089] Step S903: The second node determines a remaining time parameter according to the sending time deviation parameter.

[0090] Step S904: The second node sends a reply message to the first node.

[0091] Step S905: The first node receives a reply message sent by the second node according to the request message.

[0092] Step S906: The first node determines a mapping relationship between the first port and the second port according to the orchestration cycle length and the remaining time parameter.

[0093] It should be noted that when the first node generates a request message, the time slot related information and remaining time parameters of the second node in the request message are unknown. At this time, this information is recorded as 0. When the second node receives the request message and performs subsequent steps to determine the above information, it will be filled in and replaced.

[0094] It should be noted that two methods for determining the mapping relationship are proposed in the embodiment of the present application, which are divided into a one-step method and a two-step method. When different methods are adopted, the mapping relationship determination method applied to the first node and the mapping relationship determination method applied to the second node perform corresponding processes according to the different methods adopted. The two methods provided in the embodiment of the present application will be explained in conjunction with the accompanying drawings below.

[0095] When the one-step method is adopted, the first node, ie, the upstream node, can include complete information filled in by the upstream node in the generated request message.

[0096] Please refer to Figure 4 ,for Figure 1The specific flow chart of step S101 is as follows: Figure 4 As shown, when the one-step method proposed in this application is adopted, step S101 includes but is not limited to steps S201 to S205:

[0097] Step S201: Buffer a request message at a starting position of a sending buffer of a dedicated time slot configured for the request message by a first port.

[0098] Step S202: Determine the actual sending time of the request message according to the start time of the dedicated time slot.

[0099] Step S203: Obtain the target sending time of the request message.

[0100] Step S204: Determine a sending time offset parameter according to the actual sending time and the target sending time, and add the sending time offset parameter to the request message.

[0101] Step S205: Send the request message to the second port of the second node through the first port.

[0102] It should be noted that Figure 4 The process in can be used to determine both the time slot mapping relationship and the scheduling period mapping relationship. Figure 4 When the step is used as a specific process step of step S101, the first node always reserves bandwidth for the request message in each time slot within the orchestration cycle length of the outbound port, or in certain specific time slots, or in a specific time slot (reserving bandwidth means that sending the request message in these time slots will not cause the loss of ordinary data messages in the same time slot). These time slots with bandwidth reserved for request messages are dedicated time slots.

[0103] For example, in one embodiment of the present application, when the time slot mapping relationship is determined using the one-step method, Figure 4 The process sets time slot i as a dedicated time slot, and the target time slot of the first port is time slot x. When initiating mapping relationship detection, the dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0104] The request message is cached to the starting position of the sending buffer of the dedicated time slot configured for the request message on the first port, for example, the request message is inserted into the first position of the sending buffer corresponding to time slot i;

[0105] Determine the actual sending time of the request message according to the starting time of the dedicated time slot i;

[0106] Get the target sending time of the request message, which is set to the start time of the target time slot x;

[0107] Determine a sending time offset parameter based on the actual sending time and the target sending time, and add the sending time offset parameter to the request message. The sending time offset is (xi)*TL1. Specifically, if x=i, then the time offset E=0;

[0108] The request message is sent to the second port of the second node through the first port.

[0109] It should be noted that the dedicated time slot can be equal to the target time slot, and this application does not restrict whether the dedicated time slot is equal to the target time slot. The target transmission time can be set to a preset position within time slot x, such as the start time or end time of time slot x, or any other position. This application does not restrict the selection of the target transmission time.

[0110] For example, in one embodiment of the present application, a one-step method is used to determine the mapping relationship of the scheduling period. Figure 4 During the process, set time slot i as a dedicated time slot, the target time slot of the first port is time slot x, and time slot x is equal to time slot 0. When initiating mapping relationship detection, the specified dedicated time slot i can be configured, the time deviation is E, and the target time slot length of the first port is TL1.

[0111] The request message is buffered at the start position of the send buffer of the dedicated time slot configured for the request message on the first port (for example, the request message may be inserted at the first position of the send buffer corresponding to time slot i);

[0112] Determine the actual sending time of the request message according to the starting time of the dedicated time slot i;

[0113] Get the target sending time of the request message. The target sending time is set to the start time of time slot x, where time slot x is equal to time slot 0.

[0114] Determine a sending time offset parameter based on the actual sending time and the target sending time, and add the sending time offset parameter to the request message. The sending time offset is (xi)*TL1. Specifically, if x=i, then the time offset E=0;

[0115] The request message is sent to the second port of the second node through the first port.

[0116] It should be noted that when using the one-step method to determine the mapping relationship of the orchestration cycle, Figure 4 During the process, the target time slot x is equal to time slot 0, and the target sending time is configured as a preset position within the scheduling period, such as the start time of the scheduling period, which is also the start time of time slot 0, or the end time, or other position. This application does not limit the selection of the target sending time.

[0117] It is understandable that the embodiment of the present application Figure 4The provided process is step S101 of the one-step method, and the chip implementation is simple because the time slot and time deviation of the first node are already filled in when the control plane constructs the request message, and no chip modification is required. However, the forwarding plane is required to strictly send packets based on the time slot on time, that is, to work in the on-time scheduling mode, but the chip bandwidth is not fully utilized.

[0118] Please refer to Figure 5 ,for Figure 1 Another specific flow chart of step S101 is as follows: Figure 5 As shown, when the one-step method proposed in this application is adopted, step S101 may also include but is not limited to steps S301 to S305:

[0119] Step S301: Cache the request message in a sending buffer of a dedicated time slot configured for the request message by the first port, or in a sending buffer corresponding to a time slot with idle bandwidth resources of the first port, or in a best effort queue of the first port.

[0120] Step S302: Determine the actual sending time of the request message according to the cache location of the request message.

[0121] Step S303: Obtain the target sending time of the request message.

[0122] Step S304: Determine a sending time offset parameter according to the actual sending time and the target sending time, and add the sending time offset parameter to the request message.

[0123] Step S305: Send a request message to the second port of the second node through the first port.

[0124] It should be noted that Figure 5 The process in can be used to determine the time slot mapping relationship, and can also be used to determine the scheduling period mapping relationship. Figure 4 The specific process of step S101 is different in that when the Figure 5 When the step is used as a specific process step of step S101, the request message is not arranged to be sent at a preset position. It is necessary to subtract the actual sending time from the target sending time to obtain the sending time deviation and update it into the request message.

[0125] For example, in one embodiment of the present application, when the time slot mapping relationship is determined using the one-step method, Figure 5 The process sets time slot i as a dedicated time slot, and the target time slot of the first port is time slot x. When initiating mapping relationship detection, the dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0126] Buffering the request message in a send buffer of a dedicated time slot configured for the request message on the first port, such as a send buffer of time slot i, wherein the request message is not actually sent at the scheduled start time of time slot i, but is inserted into a non-first position of the send buffer corresponding to time slot i;

[0127] Determine the actual sending time of the request message according to the cache location of the request message, that is, the non-first location of the sending buffer corresponding to the time slot i;

[0128] Get the target sending time of the request message, that is, the start time of slot x;

[0129] Determine a sending time offset parameter based on the actual sending time and the target sending time, obtain the sending time offset E by subtracting the actual sending time from the target sending time, and add the sending time offset E parameter to the request message;

[0130] A request message is sent to the second port of the second node through the first port.

[0131] For example, in one embodiment of the present application, when the time slot mapping relationship is determined using the one-step method, Figure 5 In the process, the target time slot of the first port is time slot x. When initiating the mapping relationship detection, the first node does not reserve bandwidth for the request message in any time slot of the orchestration cycle length of the first port. The time offset is set to E, and the target time slot length of the first port is TL1.

[0132] The request message is temporarily inserted into the sending buffer corresponding to other time slots with idle bandwidth resources, or even into the low-priority best-effort queue;

[0133] Determine the actual sending time of the request message based on the cache location of the request message;

[0134] Get the target sending time of the request message, that is, the start time of slot x;

[0135] Determine a sending time offset parameter based on the actual sending time and the target sending time, obtain the sending time offset E by subtracting the actual sending time from the target sending time, and add the sending time offset E parameter to the request message;

[0136] A request message is sent to the second port of the second node through the first port.

[0137] For example, in one embodiment of the present application, when using the one-step method to determine the mapping relationship of the scheduling period, the following method is used: Figure 5In the process, time slot i is set as a dedicated time slot, the target time slot of the first port is time slot x, and time slot x is equal to time slot 0. When initiating mapping relationship detection, a dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0138] Buffering the request message in a send buffer of a dedicated time slot configured for the request message on the first port, such as a send buffer of time slot i, wherein the request message is not actually sent at the scheduled start time of time slot i, but is inserted into a non-first position of the send buffer corresponding to time slot i;

[0139] Determine the actual sending time of the request message according to the cache location of the request message, that is, the non-first location of the sending buffer corresponding to the time slot i;

[0140] Get the target sending time of the request message, that is, the starting time of time slot x, where time slot x is equal to time slot 0;

[0141] Determine a sending time offset parameter based on the actual sending time and the target sending time, obtain the sending time offset E by subtracting the actual sending time from the target sending time, and add the sending time offset E parameter to the request message;

[0142] A request message is sent to the second port of the second node through the first port.

[0143] It should be noted that when using the one-step method to determine the mapping relationship, Figure 5 During the process, the forwarding plane does not strictly send packets based on time slots, that is, it works in in-time mode. The chip needs to subtract the actual sending time from the target sending time of the request information in real time to obtain the actual time offset and update it to the request message. This situation makes better use of the chip's bandwidth, but requires higher processing capabilities for the chip.

[0144] Since the upstream node can include complete information filled in by the upstream node in the generated request message when using the one-step method, the second node can directly determine the remaining time parameters based on the request message and respond after receiving the request message sent by the first port. Please refer to Figure 9 ,for Figure 8 The specific flow chart of step S601 is as follows: Figure 8 As shown, when the one-step method is used to confirm the mapping table, step S601 includes but is not limited to step S701 and step S702:

[0145] Step S701: Receive a request message sent by a first port of a first node to a second port of a downstream node, wherein the request message carries the following information: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a transmission time offset parameter.

[0146] Step S702: The actual arrival time of the request message refers to the time when the request message arrives at the second port.

[0147] Exemplarily, when the one-step method is used to determine the time slot mapping relationship, for the second node,

[0148] receiving a request message sent by a first port of a first node to a second port of a downstream node, the request message carrying the following information: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a transmission time offset parameter;

[0149] The actual arrival time of the request message refers to the time when the request message arrives at the second port;

[0150] Determining a target arrival time based on an actual arrival time of the request message, a time slot length used by the first port, and a sending time deviation parameter;

[0151] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0152] Determining a mapping time slot of the second port according to the time offset parameter and the time slot length used by the second port;

[0153] Determine a first remaining time parameter according to the mapped time slot of the second port, the time slot length used by the second port, and a time offset parameter;

[0154] A reply message is sent to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: a sequence number, a scheduling cycle length, a time slot length used by the second port, and a remaining time parameter.

[0155] It should be noted that the above reply message also carries the mapping time slot of the second port.

[0156] Exemplarily, when the one-step method is used to determine the orchestration period mapping relationship, for the second node,

[0157] receiving a request message sent by a first port of a first node to a second port of a downstream node, the request message carrying the following information: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a transmission time offset parameter;

[0158] The actual arrival time of the request message refers to the time when the request message arrives at the second port;

[0159] Determine the target arrival time based on the actual arrival time of the request message and the sending time deviation parameter;

[0160] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0161] Determine a second remaining time parameter according to the programming cycle length and the time offset parameter;

[0162] A reply message is sent to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: a sequence number, a scheduling cycle length, a time slot length used by the second port, and a remaining time parameter.

[0163] It is understandable that, after the reply message sent by the second node is received by the first node, the first node can determine the mapping relationship between the first port and the second port according to the orchestration cycle length and the remaining time parameter.

[0164] It should be noted that, unlike the one-step method proposed in the embodiments of this application, when using the two-step method proposed in the embodiments of this application, the first node cannot include all the information it is responsible for filling in the request message. Therefore, the request message must be split into a request pre-message containing the unknown send time offset E and a request follow-up message containing the send time offset parameter. The send time offset parameter in the request follow-up message is the valid value of the send time offset E. When using the two-step method, the first step is to send the request pre-message to the second node, determine the actual send time and target send time, and determine the send time offset parameter; the second step is to send the request follow-up message containing the send time offset parameter.

[0165] The two-step method places lower requirements on the chip than the one-step method. Generally, the two-step method proposed in the embodiment of the present application is adopted when the chip does not support complex calculations and message filling operations.

[0166] Please refer to Figure 6 ,for Figure 1 Another specific flow chart of step S101 is as follows: Figure 6 As shown, when the two-step method proposed in this application is adopted, step S101 may include but is not limited to steps S401 to S406:

[0167] Step S401: Cache the request preamble message to the starting position of the sending buffer of the dedicated time slot configured by the first port for the request message.

[0168] Step S402: Send a request preamble message to the second port of the second node at the start time of the dedicated time slot of the first port.

[0169] Step S403: Determine the actual sending time of the request preamble message according to the start time of the dedicated time slot.

[0170] Step S404: Obtain the target sending time of the request pre-message.

[0171] Step S405: Determine a sending time deviation parameter according to the actual sending time and the target sending time.

[0172] Step S406: Send a follow-up request message to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0173] It should be noted that Figure 6 The process in can be used to determine the time slot mapping relationship, and can also be used to determine the scheduling period mapping relationship.

[0174] For example, in one embodiment of the present application, when a two-step method is used to determine the time slot mapping relationship, Figure 6 The process sets time slot i as a dedicated time slot, and the target time slot of the first port is time slot x. When initiating mapping relationship detection, the dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0175] The request preamble message is cached at the starting position of the send buffer of the dedicated time slot configured for the request message on the first port, for example, the request message is inserted at the first position of the send buffer corresponding to time slot i;

[0176] At the start time of the dedicated time slot i of the first port, a request preamble message is sent to the second port of the second node. At this time, the sending time offset E is (xi)*TL1, but the sending time offset parameter in the request preamble message is an unknown sending time offset E;

[0177] Determine the actual sending time of the request preamble message according to the starting time of the dedicated time slot i;

[0178] Get the target sending time of the request preceding message;

[0179] Determine the sending time deviation parameter according to the actual sending time and the target sending time. The sending time deviation parameter is the effective value of the sending time deviation E, that is, (xi)*TL1;

[0180] A follow-up request message is sent to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0181] For example, in one embodiment of the present application, a two-step method is used to determine the scheduling period mapping relationship. Figure 6 During the process, set time slot i as a dedicated time slot, the target time slot of the first port is time slot x, and time slot x is equal to time slot 0. When initiating mapping relationship detection, the specified dedicated time slot i can be configured, the time deviation is E, and the target time slot length of the first port is TL1.

[0182] The request preamble message is cached at the starting position of the send buffer of the dedicated time slot configured for the request message on the first port, for example, the request message is inserted at the first position of the send buffer corresponding to time slot i;

[0183] At the start time of the dedicated time slot i of the first port, a request preamble message is sent to the second port of the second node. At this time, the sending time offset E is -i*TL1, but the sending time offset parameter in the request preamble message is the unknown sending time offset E;

[0184] Determine the actual sending time of the request preamble message according to the starting time of the dedicated time slot i;

[0185] Get the target sending time of the request preceding message;

[0186] Determine the sending time deviation parameter according to the actual sending time and the target sending time. The sending time deviation parameter is the effective value of the sending time deviation E, that is, -i*TL1;

[0187] A follow-up request message is sent to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0188] It is understandable that the embodiment of the present application Figure 6 The provided process is step S101 of the two-step method. The chip implementation is simple because the time slot and time deviation of the first node are filled in the control plane construction request follow-up message. The chip does not need to modify the message in real time. However, the forwarding plane needs to strictly send packets based on the time slot on time, that is, work in the on-time scheduling mode, but the chip bandwidth is not fully utilized.

[0189] Please refer to Figure 7 ,for Figure 1 Another specific flow chart of step S101 is as follows: Figure 7 As shown, when the two-step method proposed in this application is adopted, step S101 may also include but is not limited to steps S501 to S505:

[0190] Step S501: Cache the request preamble message in a sending buffer of a dedicated time slot configured by the first port for the request preamble message, or cache it in a sending buffer corresponding to a time slot with idle bandwidth resources of the first port, or cache it in a best effort queue of the first port.

[0191] Step S502: Send a request preamble message to the second port of the second node through the first port, and obtain the actual sending time of the request preamble message.

[0192] Step S503: Obtain the target sending time of the request pre-message.

[0193] Step S504: Determine a sending time deviation parameter according to the actual sending time and the target sending time.

[0194] Step S505: Send a follow-up request message to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0195] It should be noted that Figure 7 The process in can be used to determine the time slot mapping relationship, and can also be used to determine the scheduling period mapping relationship. Figure 6 The specific process of step S101 is different in that when the Figure 7 When the step is used as a specific process step of step S101, the request message is not arranged in a pre-set position, and the target sending time minus the actual sending time needs to be subtracted to obtain the sending time deviation and updated to the request message.

[0196] For example, in one embodiment of the present application, when a two-step method is used to determine the time slot mapping relationship, Figure 7 The process sets time slot i as a dedicated time slot, and the target time slot of the first port is time slot x. When initiating mapping relationship detection, the dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0197] The request preamble message is cached in a send buffer of a dedicated time slot configured for the request preamble message on the first port, such as a send buffer of time slot i. The request preamble message is not actually sent at the scheduled start time of time slot i, but is inserted into a non-first position of the send buffer corresponding to time slot i.

[0198] Sending a request preamble message to the second port of the second node through the first port, and obtaining an actual sending time of the request preamble message, where a sending time offset parameter in the request preamble message is an unknown sending time offset E;

[0199] Get the target sending time of the request preceding message;

[0200] Determine a sending time deviation parameter based on the actual sending time and the target sending time, where the sending time deviation parameter is a valid value of the sending time deviation E;

[0201] A follow-up request message is sent to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0202] For example, in one embodiment of the present application, when a two-step method is used to determine the time slot mapping relationship, Figure 7In the process, the target time slot of the first port is set to time slot x. When initiating mapping relationship detection, the time offset is set to E, and the target time slot length of the first port is TL1. When initiating mapping relationship detection, the first node does not reserve bandwidth for the request message in any time slot of the orchestration cycle length of the first port. The time offset is set to E, and the target time slot length of the first port is TL1.

[0203] The request preamble message is temporarily inserted into the sending buffer corresponding to other time slots with idle bandwidth resources, or even into the low-priority best-effort queue;

[0204] Sending a request preamble message to the second port of the second node through the first port, and obtaining the actual sending time of the request preamble message, where the time offset in the request preamble message is the unknown sending time offset E;

[0205] Get the target sending time of the request preceding message;

[0206] Determine a sending time deviation parameter based on the actual sending time and the target sending time, where the sending time deviation parameter is a valid value of the sending time deviation E;

[0207] A follow-up request message is sent to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0208] For example, in one embodiment of the present application, when a two-step method is used to determine the mapping relationship of the scheduling period, Figure 7 In the process, time slot i is set as a dedicated time slot, the target time slot of the first port is time slot x, and time slot x is equal to time slot 0. When initiating mapping relationship detection, a dedicated time slot i can be configured, the time deviation is set to E, and the target time slot length of the first port is TL1.

[0209] The request preamble message is cached in a send buffer of a dedicated time slot configured for the request preamble message on the first port, such as a send buffer of time slot i. The request preamble message is not actually sent at the scheduled start time of time slot i, but is inserted into a non-first position of the send buffer corresponding to time slot i.

[0210] Sending a request preamble message to the second port of the second node through the first port, and obtaining the actual sending time of the request preamble message, where the time offset in the request preamble message is the unknown sending time offset E;

[0211] Get the target sending time of the request preceding message;

[0212] Determine a sending time deviation parameter based on the actual sending time and the target sending time, where the sending time deviation parameter is a valid value of the sending time deviation E;

[0213] A follow-up request message is sent to the second node, where the follow-up request message includes at least a sequence number and a sending time offset parameter.

[0214] It should be noted that when using the two-step method to determine the mapping relationship, Figure 7 During the process, the forwarding plane does not strictly send packets based on time slots, that is, it works in in-time mode. The chip needs to obtain the actual sending time of the request pre-information in real time. This situation makes better use of the chip bandwidth, but the message interaction process is more cumbersome.

[0215] When using the two-step method, the second node needs to receive the request pre-message and the request follow-up message in sequence. Please refer to Figure 10 ,for Figure 8 Another specific flow chart of step S601 is as follows: Figure 10 As shown, when a two-step method is used to confirm the mapping table, step S601 includes but is not limited to steps S801 to S803:

[0216] Step S801: Receive a request preamble message sent by a first port of a first node to a second port of a downstream node.

[0217] Step S802: Receive a follow request message sent by the first node.

[0218] Step S803: The actual arrival time of the request message refers to the time when the request preamble message arrives at the second port.

[0219] Exemplarily, when the two-step method is used to determine the time slot mapping relationship, for the second node,

[0220] receiving a request preamble message sent by a first port of a first node to a second port of a downstream node;

[0221] receiving a request-to-follow message sent by the first node;

[0222] The actual arrival time of the request message refers to the time when the request preamble message arrives at the second port;

[0223] Determining a target arrival time based on an actual arrival time of the request message, a time slot length used by the first port, and a sending time deviation parameter;

[0224] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0225] Determining a mapping time slot of the second port according to the time offset parameter and the time slot length used by the second port;

[0226] Determine a first remaining time parameter according to the mapped time slot of the second port, the time slot length used by the second port, and a time offset parameter;

[0227] A reply message is sent to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: a sequence number, a scheduling cycle length, a time slot length used by the second port, and a remaining time parameter.

[0228] It should be noted that the above reply message also carries the mapping time slot of the second port.

[0229] Exemplarily, when the two-step method is used to determine the orchestration period mapping relationship, for the second node,

[0230] receiving a request preamble message sent by a first port of a first node to a second port of a downstream node;

[0231] receiving a request-to-follow message sent by the first node;

[0232] The actual arrival time of the request message refers to the time when the request preamble message arrives at the second port;

[0233] Determine the target arrival time based on the actual arrival time of the request message and the sending time deviation parameter;

[0234] Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain the time offset parameter;

[0235] Determine a second remaining time parameter according to the programming cycle length and the time offset parameter;

[0236] A reply message is sent to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: a sequence number, a scheduling cycle length, a time slot length used by the second port, and a remaining time parameter.

[0237] It is understandable that, after the reply message sent by the second node is received by the first node, the first node can determine the mapping relationship between the first port and the second port according to the orchestration cycle length and the remaining time parameter.

[0238] The following describes the mapping relationship determination method provided by the embodiment of the present application in conjunction with a message field structure diagram and specific embodiments:

[0239] It should be noted that, according to STAMP protocol specification, Sender (corresponding first node) can send Session-Sender Test Packet (corresponding request message) to Reflector (corresponding second node), and then Reflector can reply Session-Reflector Test Packet (corresponding reply message) to Sender. Reflector has two modes of operation: stateless (reflector does not maintain test state) or stateful (reflector maintains test state), and the present embodiment uses the stateful pattern.

[0240] RFC8762 defines the format of the base STAMP Session-Sender packet and the base STAMP Session-Reflector packet, while RFC8972 defines how to insert the optional Type-Length-Value data encoding format (TLV) at the end of the base message.

[0241] Example 1

[0242] Please refer to Figure 12 , is a schematic diagram of a message field structure provided by an embodiment of the present application, such as Figure 12 As shown, the STAMP protocol extensions corresponding to the request message and reply message are as follows:

[0243] The sequence number information contained in the request message is carried by the existing sequence number field in the base STAMP Session-Sender packet. Other information contained in the request message is carried by the newly defined TimeslotMapping One-step TLV, which is inserted at the end of the base STAMP Session-Sender packet.

[0244] The sequence number information contained in the reply message is carried by the existing sequence number field in the base STAMP Session-Reflector packet. Other information contained in the reply message is carried by the TimeslotMapping One-step TLV and inserted at the end of the base STAMP Session-Reflector packet.

[0245] It should be noted that the STAMP TLV Flags definition is the same as RFC8972; the value of the Type field is subject to assignment by IANA (Internet Assigned Numbers Authority), indicating that this TLV is a Timeslot Mapping One-step TLV; Length indicates the length of this TLV, excluding the first 4 bytes of the TLV; OPL indicates the orchestration period length; Session-Sender Slot Length indicates the timeslot length used by the sender (corresponding to the first node), that is, the aforementioned TL1;

[0246] Session-Sender Slot x represents the target time slot x specified by the Sender (corresponding to the first node); the starting time of time slot x will be used as the target sending time of the Session-Sender Test Packet; Session-Sender Trans-Deviation E represents the sending time deviation E when the Sender (corresponding to the first node) sends the Session-Sender Test Packet, that is, the difference between the target sending time and the actual sending time; Session-Reflector Slot Length represents the time slot length used by the Reflector (corresponding to the second node), that is, the aforementioned TL2, the Sender fills in 0, and the Reflector is responsible for filling in a valid value; Session-Reflector Slot y represents the time slot y of the Reflector (corresponding to the second node) to which the time slot x of the Sender (corresponding to the first node) is mapped, the Sender fills in 0, and the Reflector is responsible for filling in a valid value; Reflector's Slot Remaining Time represents the remaining time of time slot y, which is T_xy, the Sender fills in 0, and the Reflector is responsible for filling in a valid value; Return Code indicates the return code. Sender fills in 0, and Reflector is responsible for filling in a valid value.

[0247] When determining the mapping relationship, the one-step method provided in the embodiment of the present application is used to determine the time slot mapping relationship.

[0248] First, the first node sends a request message to the second node, so as to convey the following information to the second node through the request message: sequence number, scheduling cycle length, time slot length used by the first port of the first node, and sending time deviation parameter.

[0249] It should be noted that the first node can send a request message using Figure 4 Process or Figure 5 process.

[0250] After the second node receives the request message sent by the first node, it will attempt to complete information such as the time slot y of the second node in the reply message, the time slot length TL2 used by the second node, the remaining time of the time slot y of the second node, and the return code return_code, as follows:

[0251] If the second port does not enable the OPL specified in the request message: Set the return_code of the reply message to 1, indicating "Exception: The specified OPL is not supported", and send the reply message to the first node; end the processing.

[0252] If the second port enables the OPL specified in the request message: The target arrival time = arrival_time + the time slot length TL1 used by the first node + the transmission time deviation E, where arrival_time is the actual arrival time when the request message arrives at the second port; Subtract the start time of the scheduling cycle in which the target arrival time is located from the target arrival time to obtain t_offset; The mapped time slot y = t_offset / TL2, and set the corresponding fields of the reply message; The remaining time T_xy of the time slot y = (y + 1)*TL2 - t_offset, and set the corresponding fields of the reply message; Set TL2 in the corresponding fields of the reply message. Set the return_code of the reply message to 0, indicating "Normal"; send the reply message to the first node.

[0253] It should be noted that there is actually a certain error in the calculation of the above target arrival time, and it also needs to subtract the maximum value of the packet sending time at the first port of the first node and the packet receiving time at the second port of the second node for the request message. Considering that this error is very small, it is ignored as 0.

[0254] Processing after the first node receives the reply message:

[0255] According to the sequence number in the reply message, associate the request message with the same sequence number. If the return_code in the reply message is an exception, or the information such as the scheduling cycle length OPL, the time slot x of the first node, the time slot length TL1 used by the first node, and the transmission time deviation E in the reply message and the associated request message are inconsistent: end the processing. Otherwise, establish a time slot mapping entry <OPL, U.port-1. time slot x:V.port-2. time slot y, remaining time of time slot y> according to the scheduling cycle length OPL, the time slot x of the first node, the time slot y of the second node, and the remaining time of the time slot y of the second node in the reply message.

[0256] Embodiment 2

[0257] Please refer to Figure 13 , is another message field structure diagram provided by an embodiment of the present application, such as Figure 13 As shown, the STAMP protocol extensions corresponding to the request message and reply message are as follows:

[0258] The sequence number information contained in the request message is carried by the existing sequence number field in the base STAMP Session-Sender packet. Other information contained in the request message is carried by the following newly defined OPMapping One-step TLV, which is inserted at the end of the base STAMP Session-Sender packet.

[0259] The sequence number information contained in the reply message is carried by the existing sequence number field in the base STAMP Session-Reflector packet. Other information contained in the reply message is carried by the OP MappingOne-step TLV and inserted at the end of the base STAMP Session-Reflector packet.

[0260] When determining the mapping relationship, the one-step method provided in the embodiment of the present application is used to determine the mapping relationship of the arrangement period.

[0261] First, the first node sends a request message to the second node, so as to convey the following information to the second node through the request message: sequence number, scheduling cycle length, time slot length used by the first port of the first node, and sending time deviation parameter.

[0262] It should be noted that the first node can send a request message using Figure 4 Process or Figure 5 process.

[0263] When the second node receives the request message from the first node, it will try to complete the information in the reply message, such as the time slot length TL2 used by the second node, the remaining time of the second node, and the return code return_code, as follows:

[0264] If the second port does not enable the OPL specified in the request message: set return_code=1 in the reply message, indicating "Exception: Specified OPL not supported", and send a reply message to the first node; end the processing.

[0265] If the second port has the OPL specified in the enable request message: target arrival time = arrival_time + send time offset E, where arrival_time is the actual arrival time of the request message at the second port; subtract the start time of the orchestration period in which the target arrival time occurs from the target arrival time to obtain t_offset; the remaining time of the orchestration period P_uv = OPL - t_offset, and set the corresponding fields of the reply message; set TL2 to the corresponding fields of the reply message; set return_code of the reply message to 0, indicating "normal"; and send a reply message to the first node.

[0266] It should be noted that the calculation of the target arrival time mentioned above actually has a certain error. It also needs to subtract the maximum value of the time it takes for the request message to be sent by the first port of the first node and the time it takes for the request message to be received by the second port of the second node. Considering that this error is very small, it is ignored and set to 0.

[0267] Processing after the first node receives the reply message:

[0268] Based on the sequence number in the reply message, associate the request message with the same sequence number. If the return code return_code in the reply message is abnormal, or the orchestration period length OPL, the time slot length TL1 used by the first node, and the transmission time offset E in the reply message and the associated request message are inconsistent: end the process. Otherwise, create an orchestration period mapping table entry based on the orchestration period length OPL in the reply message and the remaining time of the second node.<OPL,U.port-1:V.port-2,P_uv> .

[0269] Example 3

[0270] Please refer to Figure 14 , is another message field structure diagram provided by an embodiment of the present application, such as Figure 14 As shown, the STAMP protocol extensions corresponding to the request message and reply message are as follows:

[0271] The sequence number information contained in the request preamble is carried by the existing sequence number field in the base STAMP Session-Sender packet. Other information contained in the request preamble is carried by the following newly defined Timeslot Mapping Two-step TLV, which is inserted at the end of the base STAMP Session-Sender packet.

[0272] It should be noted that the fields and interpretations of this TLV are essentially the same as those of the Timeslot Mapping One-step TLV, except that the Tpe field indicates that this TLV is a Timeslot Mapping Two-step TLV. A new flag, F-flag, is defined in the STAMP TLV Flags field to further distinguish between request-prefix and request-follow messages in the two-step scheme. A value of 0 indicates a request-prefix message, while a value of 1 indicates a request-follow message. That is, for a request-prefix message, the F-flag is set to 0.

[0273] The sequence number information contained in the request-follow message is carried in the existing sequence number field of the base STAMP Session-Sender packet. Other information contained in the request-follow message is carried in the TimeslotMapping Two-step TLV and inserted at the end of the base STAMP Session-Sender packet. At this time, the F-flag is set to 1.

[0274] The sequence number information contained in the reply message is carried by the existing sequence number field in the base STAMP Session-Reflector packet. Other information contained in the reply message is carried by the TimeslotMapping Two-step TLV and inserted at the end of the base STAMP Session-Reflector packet.

[0275] When determining the mapping relationship, the two-step method provided in the embodiment of the present application is used to determine the time slot mapping relationship.

[0276] First, the first node sends a request message to the second node, so as to convey the following information to the second node through the request message: sequence number, scheduling cycle length, time slot length used by the first port of the first node, and sending time deviation parameter.

[0277] It should be noted that the first node can send a request message using Figure 6 Process or Figure 7The process is as follows: the request message is split into a request preamble message containing an unknown sending time deviation E and a request follow-up message containing a sending time deviation parameter. The sending time deviation parameter in the request follow-up message is a valid value of the sending time deviation E. The first step is to send the request preamble message to the second node to determine the actual sending time and the target sending time, and determine the sending time deviation parameter; the second step is to send the request follow-up message containing the sending time deviation parameter.

[0278] After receiving the request preamble message, the second node immediately obtains the actual arrival time arrival_time of the request preamble message at the second port, and obtains information such as the sequence number, the orchestration period length OPL, the time slot x of the first node, and the time slot length TL1 used by the first node from the message.

[0279] After receiving the request-to-follow message, the second node further obtains the sending time offset parameter E from the message and constructs a reply message, including the sequence number, the orchestration period length OPL, the time slot x of the first node, the time slot length TL1 used by the first node, and the value of the sending time offset E, which will be copied from the request-to-follow message.

[0280] The second node will try to complete the information in the reply message, such as the time slot of the second node, the time slot length TL2 used by the second node, the remaining time of the time slot of the second node, and the return code return_code. The second node specifically performs the following process:

[0281] If no request preceding message matching the request following (note: matching based on sequence number) has been received before, or the orchestration period length OPL, the time slot x of the first node, the time slot length TL1 used by the first node in the request following message and the matching request preceding message are inconsistent: set the return_code of the reply message to 2, indicating "Exception: Failed to match the request preceding message"; send a reply message to the first node; and end the processing.

[0282] If the second port does not enable the OPL specified in the request message: set the return_code of the reply message to 1, indicating "Exception: Specified OPL not supported"; send a reply message to the first node; and end the process.

[0283] If the second port has the OPL specified in the enable request message: the target arrival time = arrival_time + the slot length TL1 used by the first node + the transmission time deviation E; subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain t_offset; the mapped slot y = t_offset / TL2, and set the corresponding fields of the reply message; the remaining time T_xy of slot y = (y + 1) * TL2 - t_offset, and set the corresponding fields of the reply message; set the corresponding fields of the reply message with TL2; set the return_code of the reply message to 0, indicating "normal"; send the reply message to the first node.

[0284] It should be noted that there is actually a certain error in the calculation of the above target arrival time, and it also needs to subtract the maximum value of the packet sending time at the first port of the first node and the packet receiving time at the second port of the second node for the request preamble message. Considering that this error is very small, it is ignored as 0.

[0285] Processing after the first node receives the reply message:

[0286] According to the sequence number in the reply message, associate the request message with the same sequence number. If the return code return_code in the reply message is abnormal, or the information such as the scheduling period length OPL, the slot x of the first node, the slot length TL1 used by the first node, and the transmission time deviation E in the reply message and the associated request message are inconsistent: end the processing. Otherwise, establish a slot mapping entry <OPL, U.port-1. slot x:V.port-2. slot y, the remaining time of slot y> according to the scheduling period length OPL, the slot x of the first node, the slot y of the second node, and the remaining time of the slot y of the second node in the reply message.

[0287] Embodiment 4

[0288] Please refer to Figure 15 , another schematic diagram of the message field structure provided by the embodiment of the present application. As Figure 15 shown, the STAMP protocol extensions corresponding to the request message and the reply message are as follows:

[0289] The sequence number information contained in the request preamble is carried by the existing sequence number field in the base STAMP Session-Sender packet. Other information contained in the request preamble is carried by the following newly defined OP Mapping Two-step TLV, which is inserted at the end of the base STAMP Session-Sender packet.

[0290] It should be noted that, except for the Type field indicating that this TLV is an OP Mapping Two-step TLV and setting the newly defined F-flag in the STAMP TLV Flags field to 0, the fields contained in this TLV and their interpretations are basically the same as those of the OP Mapping One-step TLV.

[0291] The sequence number information contained in the request-follow message is carried by the existing sequence number field in the base STAMP Session-Sender packet. Other information contained in the request-follow message is carried by the OPMapping Two-step TLV and inserted at the end of the base STAMP Session-Sender packet. At this time, the F-flag is set to 1.

[0292] The sequence number information contained in the reply message is carried by the existing sequence number field in the base STAMP Session-Reflector packet. Other information contained in the reply message is carried by the OP MappingTwo-step TLV and inserted at the end of the base STAMP Session-Reflector packet.

[0293] When determining the mapping relationship, the two-step method provided in the embodiment of the present application is used to determine the mapping relationship of the time arrangement period.

[0294] First, the first node sends a request message to the second node, so as to convey the following information to the second node through the request message: sequence number, scheduling cycle length, time slot length used by the first port of the first node, and sending time deviation parameter.

[0295] It should be noted that the first node can send a request message using Figure 6 Process or Figure 7The process is as follows: the request message is split into a request preamble message containing an unknown sending time deviation E and a request follow-up message containing a sending time deviation parameter. The sending time deviation parameter in the request follow-up message is a valid value of the sending time deviation E. The first step is to send the request preamble message to the second node to determine the actual sending time and the target sending time, and determine the sending time deviation parameter; the second step is to send the request follow-up message containing the sending time deviation parameter.

[0296] After receiving the request preamble message, the second node immediately obtains the actual arrival time arrival_time of the request preamble message at the second port, and obtains information such as the sequence number, the orchestration period length OPL, and the time slot length TL1 used by the first node from the message.

[0297] After receiving the request-to-follow message, the second node further obtains the sending time offset parameter E from the message and constructs a reply message, including the sequence number, the orchestration period length OPL, the time slot length TL1 used by the first node, and the value of the sending time offset E, which will be copied from the request-to-follow message.

[0298] If no request preceding message matching the request following (note: matching based on sequence number) has been received before, or the orchestration period length OPL, time slot length TL1 used by the first node, and other information in the request following message and the matching request preceding message are inconsistent: set return_code of the reply message to 2, indicating "Exception: Failed to match the request preceding message"; send a reply message to the first node; and terminate the processing.

[0299] If the second port does not enable the OPL specified in the request message: set the return_code of the reply message to 1, indicating "Exception: Specified OPL not supported"; send a reply message to the first node; and end the process.

[0300] If the second port has the OPL specified in the enable request message: target arrival time = arrival_time + send time offset E; subtract the start time of the orchestration period in which the target arrival time is located from the target arrival time to obtain t_offset; the remaining time of the orchestration period P_uv = OPL - t_offset, and set the corresponding fields of the reply message; set TL2 to the corresponding fields of the reply message; set return_code of the reply message to 0, indicating "normal"; and send a reply message to the first node.

[0301] It should be noted that the calculation of the target arrival time mentioned above actually has a certain error. It also needs to subtract the maximum value of the time it takes for the request preamble message to be sent by the first port of the first node and the time it takes for the request preamble message to be received by the second port of the second node. Considering this error is very small, it is ignored and set to 0.

[0302] Processing after the first node receives the reply message:

[0303] Based on the sequence number in the reply message, associate the request message with the same sequence number. If the return code return_code in the reply message is abnormal, or the orchestration period length OPL, the time slot length TL1 used by the first node, and the transmission time offset E in the reply message and the associated request message are inconsistent: end the process. Otherwise, create an orchestration period mapping table entry based on the orchestration period length OPL in the reply message and the remaining time of the second node.<OPL,U.port-1:V.port-2,P_uv> .

[0304] The present application also provides an electronic device, such as Figure 16 As shown, the electronic device 1400 includes:

[0305] one or more processors 1410;

[0306] The memory 1420 stores one or more programs. When the one or more programs are executed by the one or more processors 1410, the one or more processors 1410 implement the mapping relationship determination method described in any of the above embodiments.

[0307] The memory 1420 is a non-transient network system that can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory 1420 may include a high-speed random access memory and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 1420 may optionally include a memory 1420 remotely located relative to the processor 1410, and these remote memories 1420 may be connected to the processor 1410 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0308] The memory 1420 can be implemented in the form of a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1420 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1420 and is called by the processor 1410 to execute the methods of the embodiments of this application.

[0309] The processor 1410 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application.

[0310] In some embodiments, the electronic device further comprises:

[0311] Input / output interface, used to realize information input and output;

[0312] Communication interface, used to realize communication interaction between this device and other devices, which can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, Wi-Fi, Bluetooth, etc.);

[0313] A bus that transmits information between various components of the device (e.g., the processor 1410, memory 1420, input / output interfaces, and communication interfaces);

[0314] The processor 1410 , the memory 1420 , the input / output interface, and the communication interface can be communicatively connected to each other within the device via a bus.

[0315] An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the mapping relationship determination method described in any of the above embodiments.

[0316] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium. A processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes the mapping relationship determination method described in any of the above embodiments.

[0317] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0318] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0319] Those skilled in the art will appreciate that all or some of the steps and systems in the method disclosed above can be implemented as software, firmware, hardware, and appropriate combinations thereof. Some physical components or all physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, and the computer-readable medium can include computer storage media (or non-transitory media) and communication media (or temporary media). As known to those skilled in the art, the term computer storage media is included in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data) and is volatile and non-volatile, removable, and non-removable. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory, or other memory technology, CD-ROM, digital versatile disks (DVD), or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage, or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0320] It should be understood that in this application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0321] The above description of some embodiments of the present application with reference to the accompanying drawings does not limit the scope of the present invention. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present invention shall be within the scope of the present application.

Claims

1. A method for determining a mapping relationship, applied to a first node, comprising: Sending a request message to the second node, so as to deliver the following information to the second node through the request message: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a sending time offset parameter; receiving a reply message sent by the second node in response to the request message, wherein the reply message carries the following information: the sequence number, the orchestration cycle length, the time slot length used by the second port of the second node, and a remaining time parameter, where the remaining time parameter is determined by the second node according to the sending time offset parameter; A mapping relationship between the first port and the second port is determined according to the orchestration cycle length and the remaining time parameter.

2. The method according to claim 1, characterized in that The mapping relationship includes a time slot mapping relationship; the request message also carries the target time slot of the first port; the reply message also carries the mapping time slot of the second port; the remaining time parameter includes a first remaining time parameter, which represents the remaining time from the end of the target time slot of the first port to the end of the mapping time slot when the end reaches the second port; the time slot mapping relationship includes at least one of the following elements: the scheduling cycle length, the first port, the target time slot of the first port, the second port, the mapping time slot of the second port and the first remaining time parameter; the target sending time of the request message is determined according to the preset position within the target time slot of the first port.

3. The method according to claim 1, characterized in that The mapping relationship includes an orchestration cycle mapping relationship; the remaining time parameter includes a second remaining time parameter, which represents the remaining time from the end of the orchestration cycle of the first port to the end of the current orchestration cycle when the end of the orchestration cycle of the second port reaches the end of the current orchestration cycle; the orchestration cycle mapping relationship includes at least one of the following elements: the orchestration cycle length, the first port, the second port, and the second remaining time parameter; the target sending time of the request message is determined based on a preset position within the orchestration cycle of the first port.

4. The method according to claim 1, wherein The sending a request message to the second node includes: Buffering the request message at a starting position of a sending buffer of a dedicated time slot configured by the first port for the request message; Determining the actual sending time of the request message according to the starting time of the dedicated time slot; Obtaining the target sending time of the request message; Determine the sending time offset parameter according to the actual sending time and the target sending time, and add the sending time offset parameter to the request message; The request message is sent to the second port of the second node through the first port.

5. The method according to claim 1, wherein The sending a request message to the second node includes: Buffering the request message in a sending buffer of a dedicated time slot configured by the first port for the request message, or caching it in a sending buffer corresponding to a time slot with idle bandwidth resources of the first port, or caching it in a best-effort queue of the first port; Determining the actual sending time of the request message according to the cache location of the request message; Obtaining the target sending time of the request message; Determine the sending time offset parameter according to the actual sending time and the target sending time, and add the sending time offset parameter to the request message; The request message is sent to the second port of the second node through the first port.

6. The method according to claim 1, characterized in that The request message includes a request pre-message and a request follow-up message; and sending the request message to the second node includes: Cache the request prefix message at the start position of a sending buffer of a dedicated time slot configured by the first port for the request message, wherein the request prefix message carries at least the following information: the sequence number, the scheduling cycle length, and the time slot length used by the first port; Sending the request preamble message to the second port of the second node at the start time of the dedicated time slot of the first port; Determining the actual sending time of the request preamble message according to the starting time of the dedicated time slot; Obtaining the target sending time of the request pre-message; Determine the sending time deviation parameter according to the actual sending time and the target sending time; The request-to-follow message is sent to the second node, wherein the request-to-follow message carries at least the following information: the sequence number and the sending time offset parameter.

7. The method according to claim 1, characterized in that The request message includes a request pre-message and a request follow-up message; and sending the request message to the second node includes: caching the request preamble message in a sending buffer of a dedicated time slot configured by the first port for the request preamble message, or caching it in a sending buffer corresponding to a time slot with idle bandwidth resources of the first port, or caching it in a best-effort queue of the first port; Sending the request prefix message to the second port of the second node through the first port, and obtaining an actual sending time of the request prefix message; Obtaining the target sending time of the request pre-message; Determine the sending time deviation parameter according to the actual sending time and the target sending time; The request-to-follow message is sent to the second node, wherein the request-to-follow message carries at least the following information: the sequence number and the sending time offset parameter.

8. The method according to claim 1, characterized in that The reply message also carries a return code, and the return code is used to indicate the processing result of the request message by the second node.

9. A method for determining a mapping relationship, applied to a second node, the method comprising: receiving a request message sent by a first node, and obtaining the following information from the request message: a sequence number, an orchestration cycle length, a time slot length used by a first port of the first node, and a transmission time offset parameter; Determine a remaining time parameter according to the sending time deviation parameter; Send a reply message to the first node, so that the first node determines a mapping relationship between the first port of the first node and the second port of the second node according to the reply message, wherein the reply message carries the following information: the sequence number, the orchestration cycle length, the time slot length used by the second port, and the remaining time parameter.

10. The method according to claim 9, characterized in that The request message further carries the target timeslot of the first port; the remaining time parameter includes a first remaining time parameter, which represents the remaining time from the end of the target timeslot of the first port to the end of the mapped timeslot when the end of the target timeslot of the first port reaches the second port; and determining the remaining time parameter according to the sending time deviation parameter includes: determining a target arrival time according to an actual arrival time of the request message, a time slot length used by the first port, and the sending time deviation parameter; Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain a time offset parameter; determining a mapping time slot of the second port according to the time offset parameter and a time slot length used by the second port; The first remaining time parameter is determined according to the mapped time slot of the second port, the time slot length used by the second port, and the time offset parameter.

11. The method according to claim 10, characterized in that The reply message also carries the mapped time slot of the second port.

12. The method according to claim 9, characterized in that The remaining time parameter includes a second remaining time parameter, which represents the remaining time from the end of the scheduling cycle of the first port to the end of the current scheduling cycle when the end of the scheduling cycle of the second port reaches the second port. The determining of the remaining time parameter according to the sending time deviation parameter includes: Determining a target arrival time based on the actual arrival time of the request message and the sending time deviation parameter; Subtract the start time of the scheduling period in which the target arrival time is located from the target arrival time to obtain a time offset parameter; The second remaining time parameter is determined according to the programming cycle length and the time offset parameter.

13. The method according to any one of claims 10 to 12, characterized in that: The receiving a request message sent by the first node includes: receiving a request message sent by the first port of the first node to the second port of the downstream node, wherein the request message carries the following information: a sequence number, an orchestration cycle length, a time slot length used by the first port of the first node, and a transmission time offset parameter; The actual arrival time of the request message refers to the time when the request message arrives at the second port.

14. The method according to any one of claims 10 to 12, characterized in that: The receiving a request message sent by the first node includes: receiving a request prefix message sent by the first port of the first node to the second port of the downstream node, wherein the request prefix message carries at least the following information: the sequence number, the orchestration cycle length, and the time slot length used by the first port; receiving a request-to-follow message sent by the first node, wherein the request-to-follow message carries at least the following information: the sequence number and the sending time offset parameter; The actual arrival time of the request message refers to the time when the request prefix message arrives at the second port.

15. An electronic device comprising: one or more processors; A memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the following: The method for determining a mapping relationship according to any one of claims 1 to 8; or, The method for determining a mapping relationship according to any one of claims 9 to 14.

16. A computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the computer program performs the following steps: The method for determining a mapping relationship according to any one of claims 1 to 8; or, The method for determining a mapping relationship according to any one of claims 9 to 14.

17. A computer program product comprising a computer program, wherein when the computer program is executed by a processor, The method for determining a mapping relationship according to any one of claims 1 to 8; or, The method for determining a mapping relationship according to any one of claims 9 to 14.

Images