WO2022095669A1 - 一种通信调度方法、装置和存储介质 - Google Patents

一种通信调度方法、装置和存储介质 Download PDF

Info

Publication number
WO2022095669A1
WO2022095669A1 PCT/CN2021/123502 CN2021123502W WO2022095669A1 WO 2022095669 A1 WO2022095669 A1 WO 2022095669A1 CN 2021123502 W CN2021123502 W CN 2021123502W WO 2022095669 A1 WO2022095669 A1 WO 2022095669A1
Authority
WO
WIPO (PCT)
Prior art keywords
queue
mapping relationship
sending
cycle
receiving
Prior art date
Application number
PCT/CN2021/123502
Other languages
English (en)
French (fr)
Inventor
杜宗鹏
刘鹏
Original Assignee
中国移动通信有限公司研究院
中国移动通信集团有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中国移动通信有限公司研究院, 中国移动通信集团有限公司 filed Critical 中国移动通信有限公司研究院
Publication of WO2022095669A1 publication Critical patent/WO2022095669A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]

Definitions

  • the present application relates to the field of networks, and in particular, to a communication scheduling method, device and storage medium.
  • DIP Deterministic Internet Protocol
  • the main purpose of the present application is to provide a communication scheduling method, device and storage medium.
  • An embodiment of the present application provides a communication scheduling method, and the method includes:
  • the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle
  • the queue mapping relationship is used to determine a sending queue corresponding to each of the receiving queues in at least one receiving queue in a corresponding period.
  • determining the second mapping relationship based on the first mapping relationship includes:
  • the second mapping relationship is obtained by modifying the sending queue corresponding to each receiving queue in the corresponding period in the first mapping relationship.
  • the method also includes:
  • the second mapping relationship is determined based on the first mapping relationship:
  • the first scenario when the first scenario is that the receiving queue receives the message, the sending queue corresponding to the receiving queue needs to send the message at the same time, and the message received by the receiving queue needs to be sent in the current sending cycle;
  • the second scenario when the second scenario is that when a sending queue sends a message, the receiving queue corresponding to the sending queue needs to receive the message at the same time, and the message received by the receiving queue needs to wait for the message to be sent by the sending queue in the next sending cycle.
  • the send queue emits.
  • the determining of the second mapping relationship based on the first mapping relationship includes:
  • the first sending queue corresponding to the receiving queue is modified to a second sending queue; the second sending queue is a subsequent queue of the first sending queue;
  • the first sending queue corresponding to the receiving queue is modified into a second sending queue; the second sending queue is the previous queue of the first sending queue.
  • the corresponding mapping relationship includes: a queue mapping relationship corresponding to each cycle in at least three cycles;
  • the number of cycles is related to the number of the send queues
  • the number of cycles is related to the number of receive queues.
  • the queue mapping relationship includes: a mapping mode
  • the mapping mode represents a mode for determining a transmit queue corresponding to each of the receive queues.
  • the number of the mapping patterns is related to the number of cycles
  • mapping modes include: plus one mode, plus two mode, plus three mode;
  • mapping modes include: plus one mode, plus two mode, plus three mode, plus four mode.
  • An embodiment of the present application provides a communication scheduling device, and the device includes:
  • a processing module configured to determine the second mapping relationship based on the first mapping relationship
  • a communication module configured to send a message according to the second mapping relationship
  • the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle
  • the queue mapping relationship is used to determine a sending queue corresponding to each receiving queue in at least one receiving queue in a corresponding period.
  • the processing module is configured to modify the sending queue corresponding to each receiving queue in the corresponding period in the first mapping relationship to obtain the second mapping relationship.
  • the processing module is configured to determine the second mapping relationship based on the first mapping relationship when it is determined that at least one of the following requirements is met:
  • the first scenario when the first scenario is that the receiving queue receives the message, the sending queue corresponding to the receiving queue needs to send the message at the same time, and the message received by the receiving queue needs to be sent in the current sending cycle;
  • the second scenario when the second scenario is that when a sending queue sends a message, the receiving queue corresponding to the sending queue needs to receive the message at the same time, and the message received by the receiving queue needs to wait for the message to be sent by the sending queue in the next sending cycle.
  • the send queue emits.
  • the processing module is configured to, corresponding to the first scenario, modify the first sending queue corresponding to the receiving queue to a second sending queue; the second sending queue is a second sending queue of the first sending queue. the latter queue;
  • the first sending queue corresponding to the receiving queue is modified into a second sending queue; the second sending queue is the previous queue of the first sending queue.
  • the corresponding mapping relationship includes: a queue mapping relationship corresponding to each cycle in at least three cycles;
  • the number of cycles is related to the number of the send queues
  • the number of cycles is related to the number of receive queues.
  • the queue mapping relationship includes: a mapping mode
  • the mapping mode represents a mode for determining a transmit queue corresponding to each of the receive queues.
  • the number of the mapping patterns is related to the number of cycles
  • mapping modes include: plus one mode, plus two mode, plus three mode;
  • mapping modes include: plus one mode, plus two mode, plus three mode, plus four mode.
  • An embodiment of the present application provides a communication scheduling device, including a memory, a processor, and a computer program stored in the memory and running on the processor, the processor implements any one of the above communication scheduling when executing the program steps of the method.
  • Embodiments of the present application further provide a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, implements the steps of any one of the above communication scheduling methods.
  • a communication scheduling method, device, and storage medium provided in the embodiments of the present application include: determining a second mapping relationship based on a first mapping relationship; sending a message according to the second mapping relationship; and the corresponding mapping relationship includes: The queue mapping relationship corresponding to each cycle in at least one cycle; the queue mapping relationship is used to determine the sending queue corresponding to each of the receiving queues in the at least one receiving queue in the corresponding cycle; in this way, from the first mapping in the problem state The relationship is scheduled to the second mapping relationship in a stable state, and by implementing the adjustment of the mapping relationship, it is ensured that the data packet is transmitted in an appropriate period.
  • Fig. 1 is a kind of relation between the scheduling mechanism of existing IP and DIP scheduling mechanism
  • FIG. 2 is a schematic diagram of a CQF scheduling method
  • Fig. 3 is a kind of forwarding delay effect diagram of CQF
  • FIG. 4 is a schematic diagram of a CQF scheduling method in a two-queue scenario
  • FIG. 5 is a schematic diagram of a CQF scheduling method in a three-queue scenario
  • Fig. 6 is a kind of schematic diagram of the scheduling method of DIP
  • FIG. 7 is a schematic diagram of a DIP scheduling method application
  • FIG. 8 is a schematic diagram of a circular queue of a local interface of a DIP
  • Fig. 9(a) is a schematic diagram of an error caused by the slightly higher clock frequency of the downstream node relative to the upstream node;
  • Fig. 9(b) is a schematic diagram of an error caused by the slightly lower clock frequency of the downstream node relative to the upstream node;
  • FIG. 10 is a schematic flowchart of a communication scheduling method provided by an embodiment of the present application.
  • FIG. 11 is a schematic diagram of a transmission exception occurring according to an embodiment of the present application.
  • FIG. 12 is a schematic diagram of a communication scheduling method for problem scenarios provided by an embodiment of the present application.
  • FIG. 13 is a schematic diagram of another transmission abnormality occurrence according to an embodiment of the present application.
  • FIG. 14 is a schematic diagram of another communication scheduling method for problem scenarios provided by an embodiment of the present application.
  • 15 is a schematic diagram of analysis of asynchronous DIP provided by an embodiment of the present application.
  • FIG. 16 is a schematic diagram of a state description provided by an embodiment of the present application.
  • FIG. 17 is a schematic diagram of another state description provided by an embodiment of the present application.
  • FIG. 18 is a schematic structural diagram of a communication scheduling apparatus provided by an embodiment of the present application.
  • FIG. 19 is a schematic structural diagram of another communication scheduling apparatus provided by an embodiment of the present application.
  • DIP is an important development trend of future networks. Because traditional IP packets are based on statistical multiplexing and do their best, service level agreement (SLA, Service Level Agreement) indicators such as delay, bandwidth, and packet loss cannot be guaranteed; for specific scenarios of 5G/6G, strict determinations are proposed. Sexual service capability requirements and traditional IP forwarding cannot be met. For example, telemedicine requires that the end-to-end delay is less than 50ms and the jitter is less than 200us; in order to ensure the accuracy of relay protection in smart grid scenarios, the one-way time difference needs to be less than 200us and the jitter is less than 50us.
  • SLA Service Level Agreement
  • TSN Time Sensitive Networking
  • IEEE Institute of Electrical and Electronics Engineers
  • CQF circular queue forwarding
  • Time-Aware Shaper In the Time-Aware Shaper (TAS, Time-Aware Shaper) defined by 802.1Qbv, a gate is added to each queue. Only when the corresponding gate is opened, the queue is allowed to send packets. The opening and closing of the door is controlled by a circular schedule. For example, in a certain time window 1, the entry data is 00000001, which means that the last queue in this time window is opened, and the other queues are closed.
  • the TAS mechanism can achieve the shortest transmission delay of a data flow (Critical flow) with strict delay requirements.
  • the above solution requires the time synchronization of the devices on the entire network, and each new critical flow enters, the entire network needs to be re-planned.
  • Figure 2 is a schematic diagram of a CQF scheduling method; as shown in Figure 2, for example, only two queue loops can be used, assuming that they are queue 2 and queue 3 (or queue 4 and queue 5); queue 2 and Queue 3 is opened and closed alternately.
  • queue 2 When queue 2 is turned on to transmit data, queue 3 will be closed and receive data, then queue 3 will be opened to transmit data, and queue 2 will be closed and receive data.
  • the frames of the Critical stream will be sent segment by segment (or called cycle by cycle), as shown in the white frame, they must arrive within a certain time window and enter a specific queue (Queue 2 or Queue 4 in the figure), in the same time window, queue 3 or queue 5 needs to complete the transmission, so that the entire mechanism can operate normally.
  • this mechanism can use two buffers (for example, only queue 2 and queue 3 in the figure), Otherwise this mechanism needs to use more queues (eg queue 2 and queue 3, queue 4 and queue 5 in the figure). If all devices in the network support CQF, then the critical flow packets can enter a cycle at the edge node of the network, and then stay for about one cycle each time an intermediate node passes, so that critical flow packets can be deterministically obtained. Forwarding, reaches the edge node of the peer network in a fixed period.
  • Figure 3 is a schematic diagram of the forwarding delay effect of CQF.
  • the shadow in Figure 3 is the effect of forwarding.
  • a wave of packets actually sent in cycle i is required to reach the downstream in cycle i.
  • CQF divides time into periodic sequences, and the length of each period is t.
  • A, B and C where B is downstream of A and C is downstream of B.
  • CQF requires that the frame sent by A in the i-th cycle be forwarded by B in the i+1-th cycle, which in turn is forwarded by C in the i+2-th cycle, and so on.
  • the maximum possible time interval between the frame sent by A and the forwarding of the frame by B is close to 2t, and the minimum possible time interval is close to 0; when it reaches C, the maximum time interval is close to 3t, and the minimum possible time is close to t.
  • the delay (delay) in the transmission process is related to the number of hops (N) & period (t), and the delay is roughly: (N-1)*t ⁇ delay ⁇ (N+1)*t; the resulting
  • the jitter is about one cycle, which means that once a packet enters A, it must be a certain cycle when it exits C, but the premise is that each network node operates normally. Therefore, the above CQF is suitable for scenarios where the link delay can be ignored relative to the cycle duration.
  • the CQF scheme has the following problems:
  • a specific implementation method of CQF is provided in the related art. For example, using two queues: queue 1 (denoted as queue1) and queue 2 (denoted as queue2), during the interval (cycle interval) of odd-numbered cycles (such as cycles 1, 3, 5, etc.), queue1 receives packets (but Do not send), queue2 sends all the data packets received during the interval of the previous even cycle (such as the 2nd, 4th, 6th, etc.) interval (does not receive any data packet); during the even cycle interval, queue2 receives data from the ingress port Packet (not sent), queue1 sends all the data packets received during the previous odd-numbered period interval and sent out (does not receive data packets), and so on.
  • the following provides the CQF solution in the two-queue scenario and the CQF solution in the three-queue scenario.
  • Circular queue Two queues are required.
  • the circular mode of the exit time window of node 3 is: 01, 10, 01, ...; in cycle a, queue 1 receives queue 2, and in cycle b, queue 1 sends and queue 2 receives (relatively, At the exit of node 1, queue 1 sends and queue 2 does not send in cycle a).
  • node 1 performs shaping after accessing traffic 1, and is sent out by queue1 in the first cycle (represented by a cycle in the figure); node 2 is shaped after accessing traffic 2, and is sent out by queue1 in cycle a ; Node 3 receives traffic 1 and traffic 2 on port 1 and port 2, and queue1 receives traffic 1 and traffic 2 in a cycle, and sends traffic 1 and traffic 2 on port 3 in the next cycle (port 3 will temporarily block traffic 1 and traffic 2, and issued in the next cycle).
  • the packets sent by the same periodic queue 1 will be aggregated, and the relevant resources should be sufficient (that is, the total sending time of the packets of each period on each port should not exceed the period length);
  • the sending time of the message is ta(ti ⁇ ta ⁇ ti+1), and the delay is d(0 ⁇ d ⁇ t), then it reaches ta+d(ti ⁇ ta+d ⁇ ti+1+t).
  • Circular queue Three queues are required, two for receiving and one for sending.
  • the looping method of node 3 time window is: 010, 001, 100, 010, 001, 100, 010, 001..., and so on, where 0 represents data received , 1 represents sending data.
  • r flag2 refers to when the first part of the flag1 message is received, the receiving place is the message received by queue2, and the sending cycle of upstream node 1 is 2 cycles (marked as flag2), after queue2 receives it, it will be based on The mapping relationship of node 3, modify the flag to 1, and send it to the corresponding sending queue1 at the same time.
  • the flag is used to identify the period of the message, which is to consider that the message of one period will appear in different downstream periods; unless the downstream records the exact delay d, and considers that the upstream one
  • the wave packet arrives within t (the requirements are more demanding, the time is precisely synchronized, and the appropriate guard band is reserved).
  • the flag is used to identify the message, the above-mentioned problem of determining the period of the upstream message can be simplified. For example, when each upstream message is sent, there is a flag according to the upstream period, and the downstream can know the upstream message. Period information of these packets when they are sent upstream.
  • node 1 performs shaping after accessing traffic 1, and is sent out by queue1 in the first cycle (represented by a cycle in the figure); after node 2 accesses traffic 2, it performs shaping and is sent out by queue1 in cycle a. ;
  • Node 3 receives traffic 1 and traffic 2 from queue1 in port 1 and port 2, a cycle or the second cycle (represented by b cycle in the figure), and sends traffic 1 and traffic 2 on port 3 in the next cycle (this When the port 3 sends out in the third cycle (represented by the c cycle in the figure), the mapping rule is that the a cycle of the previous hop will be mapped to the c cycle, and it is mapped every other cycle).
  • a DIP scheduling method is also proposed in the related art. Different from the scheduling method of CQF, the scheduling method of DIP no longer assumes the time synchronization of the whole network, but the frequency synchronization of the whole network, and all support the DIP scheduling mechanism.
  • the fiber delay cannot be ignored, and more queues are set, such as 3 queues, which are different from the CQF's one-transmit-one-receive rotation queue.
  • 3 queues which are different from the CQF's one-transmit-one-receive rotation queue.
  • two cycles are used to ensure the receiving The packets of one cycle are collected and sent, that is, the three queues cooperate in a cycle.
  • the three cycles of a, b, and c are set as follows for the corresponding conditions of the queue:
  • the message selection enters a cycle at the edge node of the network, and then stays for about two cycles each time an intermediate node passes, so that the message of this critical flow can be forwarded deterministically, and arrive at a fixed cycle.
  • the peer network edge node When applied, the message selection enters a cycle at the edge node of the network, and then stays for about two cycles each time an intermediate node passes, so that the message of this critical flow can be forwarded deterministically, and arrive at a fixed cycle.
  • the peer network edge node When applied, the message selection enters a cycle at the edge node of the network, and then stays for about two cycles each time an intermediate node passes, so that the message of this critical flow can be forwarded deterministically, and arrive at a fixed cycle.
  • the peer network edge node When applied, the message selection enters a cycle at the edge node of the network, and then stays for about two cycles each time an intermediate node passes, so that the message of this critical flow can be forwarded deterministically, and
  • Figure 6 is a schematic diagram of communication scheduling using the DIP mechanism; it is similar to the previous one, but in addition to the variable delay d, there is also a phase difference variable p (because only frequency synchronization is assumed); at this time, it cannot be assumed that the downstream equipment understands The phase difference p between the two can only be used to use the flag of each wave of traffic to let the downstream node know which sending cycle the received traffic belongs to in the upstream.
  • a wave of packets sent by upstream node 1 will be received within two cycles of downstream node 3 (calculated according to d, it should be between i+2 and i+3, after considering p, the range There will be deviations, but on the whole, the downstream node 3 will still receive it in two cycles, because the width of the packet sent in the first cycle is one t, and two cycles are used to determine the first After the packet group sent in one cycle arrives, it will be sent out in the next cycle).
  • the DIP mechanism assumes that when the network is started, each interface is probed to determine which mapping relationship is, and will not change (based on the assumption of frequency synchronization). As long as the offset caused by the delay and phase difference of the link is determined by detecting the packets, the mapping relationship can be determined; the three receiving queues of each interface are always double receiving and one stop, and double receiving is guaranteed. A wave of data flow can be received in full; if the queue that should be suspended receives the message, the operating mechanism will be considered to have a problem, and the packet may be lost (the data packet needs to have a flag).
  • Figure 8 is a schematic diagram of the circular queue of the local interface of the DIP; as shown in Figure 8, the mapping relationship between the circular queue of the local interface and the upstream (that is, for a specific link, the relationship between the upstream transmission period and the downstream transmission period)
  • the mapping relationship between the circular queue of the local interface and the upstream that is, for a specific link, the relationship between the upstream transmission period and the downstream transmission period
  • the packet of the a period of the upstream node 1 arrives in the a period of the downstream node 3 and is sent out in the b period; correspondingly, the flag changes from 1 to 2, so it is recorded as a plus-one mapping.
  • the downstream node 3 there are three queues for receiving, which are respectively recorded as: queue1, queue2, queue3 (the way the three received queues process the message is to carry the period flag flag1 into queue1; similarly, the message for flag2 Enter queue2; messages to flag3 enter queue3). Because it is an add-one mapping, node 3 will modify the flag in the way of adding 1, and then send it from the corresponding downstream interface. For example, if the received queue1, the message flag is changed to 2, it will enter the downstream sending queue2 and wait for its own sending cycle ( b cycle) issued.
  • the related art lacks an adjustment mechanism in the scenario where the two nodes adjacent to the DIP are not well synchronized in frequency (such as the scenario across the synchronization domain), for example, the upstream cycle arrival time moves to the right or to the left. ;
  • Fig. 9(a) it can be seen that the arrival time of the upstream period (as indicated by the dotted shading) moves to the right; as shown in Fig. 9(b), it can be seen that the upstream period (as indicated by the dotted shading) period) The arrival time is shifted to the left.
  • the DIP mechanism in the related art, if the frequency synchronization cannot be well guaranteed, after the arrival time of the upstream cycle moves to a certain extent or runs according to a certain mapping relationship for a period of time, the message will appear in the area that should not appear. period, the DIP mechanism reports an error and then fails.
  • a second mapping relationship is determined based on the first mapping relationship; a message is sent according to the second mapping relationship; and the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle ; The queue mapping relationship is used to determine a sending queue corresponding to each receiving queue in at least one receiving queue in a corresponding period.
  • FIG. 10 is a schematic flowchart of a communication scheduling method provided by an embodiment of the application; as shown in FIG. 10 , the method includes:
  • Step 1001 based on the first mapping relationship, determine a second mapping relationship
  • Step 1002 sending a message according to the second mapping relationship
  • the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle
  • the queue mapping relationship is used to determine a sending queue corresponding to each receiving queue in at least one receiving queue in a corresponding period.
  • the determining the second mapping relationship based on the first mapping relationship includes:
  • the second mapping relationship is obtained by modifying the sending queue corresponding to each receiving queue in the corresponding period in the first mapping relationship.
  • the method is applied to a DIP node, and the DIP node is a certain node in the DIP network, for example, it may be a router used in the DIP network.
  • the packet may be a data flow (called a critical flow) with severe delay requirements.
  • the DIP mechanism in related technologies, for two adjacent DIP nodes, if the frequency synchronization is not guaranteed well, the arrival time of the upstream cycle moves to a certain extent, and the message will appear in the area that should not appear. Period, the DIP mechanism reports an error and fails.
  • the above communication scheduling method is provided to enter from one mapping relationship (the first stable state, that is, the first mapping relationship) to another stable state, that is, the second mapping relationship. It is also necessary to provide a method to determine the specific timing at which the second mapping relationship is changed.
  • the method further includes:
  • the second mapping relationship is determined based on the first mapping relationship:
  • the first scenario when the first scenario is that the receiving queue receives the message, the sending queue corresponding to the receiving queue needs to send the message at the same time, and the message received by the receiving queue needs to be sent in the current sending cycle;
  • the second scenario when the second scenario is that when a sending queue sends a message, the receiving queue corresponding to the sending queue needs to receive the message at the same time, and the message received by the receiving queue needs to wait for the message to be sent by the sending queue in the next sending cycle.
  • the send queue emits.
  • the receiving end can map the period identifier to the period identifier of the sending queue according to the period identifier carried in the message received by the receiving queue and in combination with the first mapping relationship, that is, determine the corresponding sending queue; however, there may be some If the time when the received message actually arrives at the receiving queue is different from the time when the received message should arrive at the receiving queue, it will cause the above first or second scenario; in this way, the node's receiving queue cannot be expected to arrive at the receiving queue.
  • the two cycles (referring to the time when the received message should arrive in the receiving queue) completes the reception of one cycle of upstream messages, and an error needs to be reported (as mentioned above, two cycles are used under the DIP mechanism to ensure that all messages are received, while The above situation means that it is impossible to receive all the packets, that is, the receiving work is not completed in the two cycles that the packets should be received, and the specific reason is the above-mentioned drift problem).
  • the time when the received message should arrive at the receiving queue refers to the estimated time when the upstream deterministic service message arrives in the receiving queue according to the deterministic forwarding mechanism in the deterministic network.
  • the message refers to a message transmitted in the DIP network.
  • the method provided by the embodiment of the present application is used to enter from one mapping relationship (a first stable state, that is, a first mapping relationship) to another stable state, that is, a second mapping relationship.
  • the determining the second mapping relationship based on the first mapping relationship includes:
  • the first sending queue corresponding to the receiving queue is modified to a second sending queue; the second sending queue is a subsequent queue of the first sending queue;
  • the first sending queue corresponding to the receiving queue is modified into a second sending queue; the second sending queue is the previous queue of the first sending queue.
  • the corresponding mapping relationship includes: a queue mapping relationship corresponding to each cycle in at least three cycles;
  • the number of cycles is related to the number of the send queues
  • the number of cycles is related to the number of receive queues.
  • the number of cycles is three, that is, in the scenario of three cycles, the number of sending queues is three, and the number of receiving queues is also three;
  • the number of cycles is four, that is, in the scenario of four cycles, the number of sending queues is four, and the number of receiving queues is also four.
  • the queue mapping relationship includes: a mapping mode
  • the mapping mode represents a mode for determining a transmit queue corresponding to each of the receive queues.
  • the number of mapping patterns is related to the number of cycles
  • mapping modes include: plus one mode, plus two mode, plus three mode;
  • mapping modes include: plus one mode, plus two mode, plus three mode, plus four mode.
  • the first cycle the first sending state of the sending queue, the second receiving state of the receiving queue, and the third receiving state of the receiving queue;
  • the second cycle receiving queue 1 receiving state, sending queue 2 sending state, receiving queue 3 receiving state;
  • the third cycle receiving queue one receiving state, receiving queue two receiving state, sending queue three sending state;
  • the mapping mode is the plus one mode. It is assumed that the upstream send queue is one, and the downstream receive queue three and the receive queue one receive a certain message. Based on the plus one mode, it is determined that the send queue two forwards the message;
  • the upstream send queue is one, and the downstream receive queue one and receive queue two receive a certain packet. Based on the plus two mode, it is determined that the send queue three forwards the packet;
  • the upstream send queue is one, and the downstream receive queue two and receive queue three receive a certain packet. Based on the plus three mode, it is determined that the send queue one forwards the packet.
  • the first sending queue corresponding to the receiving queue is modified to a second sending queue
  • the second sending queue is a subsequent queue of the first sending queue, indicating that the assumption is based on the first mapping.
  • the sending queue determined by the relationship is sending queue two (that is, the first sending queue mentioned above), and the sending queue is modified to sending queue three (that is, the second sending queue mentioned above); and if the determined sending queue is sending queue three, the sending queue will be sent
  • the queue is modified to send queue one; and so on.
  • the first sending queue corresponding to the receiving queue is modified to a second sending queue, and the second sending queue is the previous queue of the first sending queue, indicating that the assumption is based on the first mapping. If the send queue determined by the relationship is send queue 2, change the send queue to send queue one; and if the determined send queue is send queue one, change the send queue to send queue three; and so on.
  • the method provided by the embodiment of the present application proposes a mechanism that does not require strict frequency synchronization of adjacent DIP nodes.
  • the DIP system enters an abnormal state, but does not crash, and is to determine the target steady state (a new cycle mapping relationship).
  • the above scheme only needs to correct each queue cycle by cycle (T) in three cycles with a duration of 3T (correct each queue in each cycle in turn, so only three cycles are required; if applied to For a four-cycle scenario, you can use four-cycle duration) to enter a new target steady state.
  • T cycle
  • 3T correct each queue in each cycle in turn, so only three cycles are required; if applied to For a four-cycle scenario, you can use four-cycle duration
  • the method provided by the embodiment of the present application converts the mapping relationship of the DIP to another steady state through a transition state.
  • the traffic of two periods needs to be combined, it is enough to confirm that the traffic of the two periods can be combined and does not exceed the capacity of the period. For example, if it is necessary to combine a certain period 1 and the following period 2 It is necessary to check whether the bandwidth reserved in period 1 and the bandwidth reserved in period 2 exceed the bandwidth of the combined period. If the bandwidth does not exceed the bandwidth of the combined period, it can be combined, that is, it is necessary to ensure that the combined period can be sent before the period 1 and All packets sent in cycle 2. This requires that the packets of period 1 and period 2 cannot be crowded compared to the packets that can be sent in one period, and it is easier to perform merging if there is more free bandwidth.
  • the excess packets can be sent in a subsequent period, which can be followed by After the combining period, it can also be separated from the combined period by two sending periods (applicable to a three-period cycle scenario), or three sending cycles (applicable to a four-cycle cycle scenario).
  • PSFP Per-Stream Filtering and Policing
  • PSFP is IEEE Std 802.1Qci Per-Stream Filtering and Policing, which is used at the entrance of DIP nodes and supports identification and processing of each stream or priority; related processing includes marking, checking whether it arrives at the correct time, etc. .
  • the current IEEE-defined high-speed Ethernet devices generally use free-oscillating clocks with an accuracy requirement of 100ppb.
  • Each interface supports locking according to the leading part of the packet header, which is regarded as a kind of synchronous transmission to a certain extent. If the synchronous Ethernet technology is used, the synchronization accuracy can be improved, so that there is basically no frequency offset, and the normal operation of the DIP network is guaranteed. Synchronous Ethernet requires a clock source with an accuracy of 4.6ppb.
  • the method provided by the embodiments of the present application expands the current deterministic network scenario of periodic DIP, and reduces related restrictions. For example, in the scenario of a large-scale cross-domain network, it is impossible to require different networks to synchronize to the same frequency source (clock source). However, the method provided by the real-time example of this application can enable DIP data transmission across synchronization domains, even in For use in simple IP networks with asynchronous frequencies (accuracy range plus or minus 100ppb).
  • FIG. 11 is a schematic diagram of the occurrence of a transmission abnormality provided by an embodiment of the present application; in the lower three tables in FIG. 11 , the mapping relationships displayed by the three groups of tables from left to right are: original mapping relationship, abnormal mapping relationship, target mapping relationship; the original mapping relationship is equivalent to the above-mentioned first mapping relationship; the target mapping relationship is equivalent to the above-mentioned second mapping relationship determined based on the first mapping relationship;
  • the upper four graphs in Figure 11 show that the period of the dotted shadow is shifted to the right.
  • the first and second graphs correspond to the original mapping relationship;
  • the third graph has a problem and corresponds to the abnormal mapping relationship;
  • the fourth graph corresponds to the target mapping relation.
  • the upstream periodic packets have not been collected yet, and the sending queue 2 (queue2) of node 3 starts to send new packets (that is, the upstream periodic arrival time moves to the right); but queue2 has already
  • the received packets will not be sent all at once, and the certainty of the DIP system will not be destroyed if several packets are sent and received at the same time.
  • the PSFP finds the abnormality caused by the above-mentioned time-of-arrival offset, it will discard the message and make the DIP system invalid; Instead of losing packets, enter the following processing mode, that is, from one steady state (ie, the first mapping relationship) to another steady state (ie, the second mapping relationship).
  • PSFP revises the current mapping rules, and changes the one-plus mapping into a plus-two mapping.
  • the flag is changed from f2 to f3 (indicating that it was originally sent to queue 2 and modified to be sent to queue 3).
  • mapping relationships displayed by the three groups of tables from left to right are: original mapping relationship, transition mapping relationship, and target mapping relationship; the original mapping relationship is equivalent to the above-mentioned first mapping relationship; The mapping relationship is equivalent to the above-mentioned second mapping relationship determined based on the first mapping relationship;
  • the second diagram corresponds to the abnormal mapping relationship
  • the third diagram corresponds to the target mapping relationship
  • transition period will only appear for 3T time (one queue mapping relationship is adjusted for each T), through the table on the left in Figure 11 (the space indicates no action), you can understand the action of the transition period and the action of the target mapping relationship in 3 cycles .
  • the entry corresponds to receive queue 1 (recorded as receive q1), receive queue 2 (recorded as receive q2), and receive queue 3 (recorded as receive q3);
  • the export corresponds to sending queue 1 (recorded as sending q1), sending queue 2 (recorded as sending q2), and sending queue 3 (recorded as sending q3).
  • fx (x is 1, 2 or 3, indicating that the sending cycle of the message is the first cycle, the second cycle or the third cycle), specifically, the message received by node 3 will carry the upstream cycle identifier
  • the information, such as fx, indicates which cycle is sent from the upstream.
  • Node 3 determines the sending cycle of the message on its own node according to the cycle mapping relationship on the interface that receives the message, and modifies the cycle identification information of the message.
  • qy (y is 1, 2 or 3) indicates that the cycle number corresponding to the queue (receiving queue or sending queue) is the first cycle, the second cycle or the third cycle, that is, receiving qy (y is 1, 2 or 3), it can represent the upstream receiving queue of the first cycle, the upstream receiving queue of the second cycle, and the upstream receiving queue of the third cycle; correspondingly, sending qy (y is 1, 2 or 3) can represent the first cycle.
  • the sending queue, the sending queue of the second cycle, and the sending queue of the third cycle specifically, at the entrance of node 3, if the corresponding cycle identification information is determined to be f1 based on the mapping relationship, then enter the receiving q1, and the others are similar, in At the exit of node 3, if the modified cycle identification information is f2, the corresponding should enter to send q2, and the others are similar. It should be noted that since the sending queues and receiving queues of different periods are preset (that is, the mapping relationship is determined), the corresponding sending queues can be determined according to the period identification information; therefore, when entering a new steady state, the corresponding sending queues can be determined. New mapping relationship.
  • the specific operation methods include:
  • Step 01. Associate the receiving q1 with the sending q3;
  • Step 02 associate receiving q2 with sending q1;
  • Step 03 associate receiving q3 with sending q2;
  • send q2 empty, send q3 to collect f3 messages, send q1 with some f1p1 messages (modified from f2); at this time, send q3 to send, send q1 to receive f2p2, For q3, replace f1 with f2 (both predecessors are f3), which was originally sent to send q1 instead of sent to send q2.
  • Fig. 13 is a schematic diagram of another transmission abnormality occurrence provided by an embodiment of the present application; as shown in Fig. 13, the sending cycle corresponding to the upstream periodic message has not been sent yet, and the sending queue q2 of node 3 (corresponding to the left oblique At the same time, the part of the queue associated with the dotted shadow corresponds to the receiving queue q1) and there is a problem that new messages need to be received (that is, the dotted shadowed part corresponds to the message received by the receiving queue q1, which will be mapped according to the addition of one.
  • the PSFP will detect these packets that should not appear, and will discard the packets, making the DIP system invalid; in the mechanism of this application, the PSFP will detect this problem and will not discard the packets, but is to enter the following processing flow.
  • PSFP finds the above problems during inspection, but neither loses nor sends packets, but enters the subsequent processing mode to enter another steady state. Specifically, PSFP revises the current mapping rules, and changes the one-plus mapping into a plus-three mapping. The specific manifestation is that when the message of queue 1 starts in a certain a cycle, f2 is changed to f1, and originally sent to queue 2 is changed to Sent to queue 1.
  • sending q1 In the second transition period, because sending q1 is associated with two receive queues, it will receive two sets of messages at the same time, receiving q2 is switched to send q2, and send q2 sends the message; in the third transition period, both sending q1 and sending q2 receive the message, receiving q3 switches to send q3, and sends it; sending the message in the first cycle of the target mapping relationship, sending q1 at the same time Send two cycles of messages, one is from q1 and the other is from q3.
  • the specific operation methods include:
  • Step 11 Associate the receiving q1 with the sending q1;
  • the full data here refers to the collection of data for one cycle upstream.
  • Step 12 switch the receiving q2 to the sending q2;
  • send q2 full data (changed from f1 to f2), send q3 full data (modified from f2), and send q1 with some f1p1 messages (modified from f3p1 messages) ;
  • the receiving q1 changes f1p1 to f1p1 (logically it can be considered unchanged) and sends it to the sending q1.
  • the receiving q2 is associated with the sending q2;
  • Step 13 Switch the receiving q3 to the sending q3;
  • sending q3 to send, receiving q3 is associated with sending q3, sending q1 and collecting f1p2 (modified from f1), note that at this time, sending q1 has two cycles of traffic, one is modified from f1, the other The wave is modified from the previous f3.
  • the period of the dotted shadow is recorded as the a period
  • the period of the left oblique line shadow is recorded as the b period
  • the right oblique line shaded period is recorded as the c period.
  • FIG. 15 is a schematic diagram of asynchronous DIP analysis provided by an embodiment of the present application; with reference to FIG. 15, you can understand the reason why the follower of the downstream node and the upstream node send periodic movement (for example, the above a cycle moves to the left and moves to the right).
  • the specific instructions are as follows:
  • the actual arrival time of the upstream cycle such as the period of the dotted shadow will shift (the specific reason is that the actual frequency of node 1 and the actual frequency of node 3 may deviate); if the frequency of node 1 If it is lower than node 3, that is, the table of node 3 is faster, the cycle time of node 1 is longer, and the dotted shadow will slowly move backward until a cycle is missed, causing the PSFP of the entrance to fail (which should be in cycle c, The flag1 message that appeared in the a cycle did not arrive completely).
  • the cycle time 3 of node 3 is a little longer, and the actual arrival time of the upstream cycle such as the cycle of the dotted shadow will move forward slowly until a cycle is missed, allowing the entry There is an error in the PSFP (the flag1 message that should have appeared in the c cycle and the a cycle appeared in the b cycle).
  • Fig. 16 is a schematic diagram of a state description provided by an embodiment of the present application.
  • Fig. 16 shows the state of the sending queue in the three cycles of the transition mapping relationship and the state description of the sending queue in the first three cycles of the subsequent target mapping relationship chart;
  • Fig. 17 is a schematic diagram of another state description provided by the embodiment of the present application.
  • Fig. 17 shows the state of the sending queue in the three cycles of the transition mapping relationship and the state of the sending queue in the first three cycles of the subsequent target mapping relationship describe the chart;
  • Question 1 There is a period of time in the a period of sending and receiving at the same time, but the received message cannot be sent. At this time, it is necessary to set the boundary between the previous message and the newly received message, otherwise it cannot be distinguished;
  • FIG. 18 is a schematic structural diagram of a communication scheduling apparatus provided by an embodiment of the application; as shown in FIG. 18 , the apparatus is applied to a DIP node; the apparatus includes:
  • a processing module configured to determine the second mapping relationship based on the first mapping relationship
  • a communication module configured to send a message according to the second mapping relationship
  • the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle
  • the queue mapping relationship is used to determine a sending queue corresponding to each receiving queue in at least one receiving queue in a corresponding period.
  • the processing module is configured to modify the sending queue corresponding to each receiving queue in the corresponding period in the first mapping relationship to obtain the second mapping relationship.
  • the processing module is configured to determine the second mapping relationship based on the first mapping relationship when it is determined that at least one of the following requirements is met:
  • the first scenario when the first scenario is that the receiving queue receives the message, the sending queue corresponding to the receiving queue needs to send the message at the same time, and the message received by the receiving queue needs to be sent in the current sending cycle;
  • the second scenario when the second scenario is that when a sending queue sends a message, the receiving queue corresponding to the sending queue needs to receive the message at the same time, and the message received by the receiving queue needs to wait for the message to be sent by the sending queue in the next sending cycle.
  • the send queue emits.
  • the processing module is configured to, corresponding to the first scenario, modify the first sending queue corresponding to the receiving queue to a second sending queue;
  • the second sending queue is a post-secondary sending queue of the first sending queue a queue;
  • the first sending queue corresponding to the receiving queue is modified to be a second sending queue; the second sending queue is the previous queue of the first sending queue.
  • the corresponding mapping relationship includes: a queue mapping relationship corresponding to each cycle in at least three cycles;
  • the number of cycles is related to the number of the send queues
  • the number of cycles is related to the number of receive queues.
  • the queue mapping relationship includes: a mapping mode
  • the mapping mode represents a mode for determining a transmit queue corresponding to each of the receive queues.
  • the number of the mapping modes is related to the number of the cycles
  • mapping modes include: plus one mode, plus two mode, plus three mode;
  • mapping modes include: plus one mode, plus two mode, plus three mode, plus four mode.
  • the communication scheduling apparatus provided in the above embodiment implements the corresponding communication scheduling method
  • only the division of the above program modules is used as an example for illustration.
  • the above processing may be allocated to different program modules as required. To complete, that is, to divide the internal structure of the server into different program modules to complete all or part of the above-described processing.
  • the apparatus provided in the above-mentioned embodiment and the embodiment of the corresponding method belong to the same concept, and the specific implementation process thereof is detailed in the method embodiment, which will not be repeated here.
  • FIG. 19 is a schematic structural diagram of a communication scheduling apparatus provided by an embodiment of the present application.
  • the communication scheduling apparatus 190 includes: a processor 1901 and a computer program configured to store a computer program that can run on the processor memory 1902; when the processor 1901 is configured to run the computer program, execute: determine a second mapping relationship based on the first mapping relationship; send a message according to the second mapping relationship; the corresponding mapping relationship includes at least one cycle The queue mapping relationship corresponding to each period in the corresponding period; the queue mapping relationship is used to determine the sending queue corresponding to each receiving queue in at least one receiving queue in the corresponding period.
  • the communication scheduling apparatus 190 may further include: at least one network interface 1903 .
  • Various components in the communication scheduling apparatus 190 are coupled together through a bus system 1904 .
  • the bus system 1904 is used to implement the connection communication between these components.
  • the bus system 1904 also includes a power bus, a control bus, and a status signal bus.
  • the various buses are labeled as bus system 1904 in FIG. 19 .
  • the number of the processors 1901 may be at least one.
  • the network interface 1903 is used for wired or wireless communication between the communication scheduling apparatus 190 and other devices.
  • the memory 1902 in this embodiment of the present application is used to store various types of data to support the operation of the communication scheduling apparatus 190 .
  • the methods disclosed in the above embodiments of the present application may be applied to the processor 1901 or implemented by the processor 1901 .
  • the processor 1901 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above-mentioned method can be completed by an integrated logic circuit of hardware in the processor 1901 or an instruction in the form of software.
  • the above-mentioned processor 1901 may be a general-purpose processor, a digital signal processor (DSP, DiGital Signal Processor), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like.
  • DSP Digital signal processor
  • DiGital Signal Processor DiGital Signal Processor
  • the processor 1901 may implement or execute the methods, steps, and logical block diagrams disclosed in the embodiments of this application.
  • a general purpose processor may be a microprocessor or any conventional processor or the like.
  • the steps of the methods disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor.
  • the software module may be located in a storage medium, the storage medium is located in the memory 1902, the processor 1901 reads the information in the memory 1902, and completes the steps of the foregoing method in combination with its hardware.
  • the communication scheduling apparatus 190 may be implemented by one or more Application Specific Integrated Circuit (ASIC, Application Specific Integrated Circuit), DSP, Programmable Logic Device (PLD, Programmable Logic Device), Complex Programmable Logic Device (CPLD, Complex Programmable Logic Device), Field Programmable Gate Array (FPGA, Field-Programmable Gate Array), General Purpose Processor, Controller, Micro Controller (MCU, Micro Controller Unit), Microprocessor (Microprocessor), or other Electronic components are implemented for carrying out the aforementioned method.
  • ASIC Application Specific Integrated Circuit
  • DSP Programmable Logic Device
  • PLD Programmable Logic Device
  • CPLD Complex Programmable Logic Device
  • FPGA Field Programmable Gate Array
  • General Purpose Processor Controller
  • MCU Micro Controller
  • Micro Controller Unit Micro Controller Unit
  • Microprocessor Microprocessor
  • Embodiments of the present application further provide a computer-readable storage medium on which a computer program is stored; when the computer program is run by a processor, execute: determine a second mapping relationship based on the first mapping relationship; Two mapping relationships are used to send packets; the corresponding mapping relationship includes a queue mapping relationship corresponding to each cycle in at least one cycle; the queue mapping relationship is used to determine the sending queue corresponding to each receiving queue in at least one receiving queue in the corresponding cycle .
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined, or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the coupling, or direct coupling, or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be electrical, mechanical or other forms. of.
  • the unit described above as a separate component may or may not be physically separated, and the component displayed as a unit may or may not be a physical unit, that is, it may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present application may all be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above integration
  • the unit can be implemented either in the form of hardware or in the form of hardware plus software functional units.
  • the aforementioned program may be stored in a computer-readable storage medium, and when the program is executed, execute Including the steps of the above method embodiment; and the aforementioned storage medium includes: a mobile storage device, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk and other various A medium on which program code can be stored.
  • ROM read-only memory
  • RAM random access memory
  • magnetic disk or an optical disk and other various A medium on which program code can be stored.
  • the above-mentioned integrated unit of the present application is implemented in the form of a software function module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.
  • the computer software products are stored in a storage medium and include several instructions for A computer device (which may be a personal computer, a server, or a network device, etc.) is caused to execute all or part of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic disk or an optical disk and other mediums that can store program codes.

Landscapes

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

Abstract

本申请公开了一种通信调度方法、装置和存储介质，包括：基于第一映射关系，确定第二映射关系；按照所述第二映射关系发送报文；相应映射关系包括至少一个周期中每个周期对应的队列映射关系；所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。

Description

一种通信调度方法、装置和存储介质
相关申请的交叉引用
本申请基于申请号为202011233487.X、申请日为2020年11月06日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及网络领域，尤其涉及一种通信调度方法、装置和存储介质。
背景技术
在未来第五代移动通信(B5G，Beyond5thGeneration)/第六代移动通信(6G，6th Generation)的特定场景中，如工业控制、远程医疗、全息通信等提出了严格的确定性服务能力要求、传统IP转发无法满足。因此，确定性互联网协议(DIP，Deterministic IP)网络是未来网络的一个重要发展趋势，对DIP网络的报文调度提出了要求。
发明内容
有鉴于此，本申请的主要目的在于提供一种通信调度方法、装置和存储介质。
为达到上述目的，本申请的技术方案是这样实现的：
本申请实施例提供了一种通信调度方法，所述方法包括：
基于第一映射关系，确定第二映射关系；
按照所述第二映射关系发送报文；
相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述 接收队列对应的发送队列。
较佳地，所述基于第一映射关系，确定第二映射关系，包括：
修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
较佳地，所述方法还包括：
确定满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
到达预定调整时间；
第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
较佳地，所述基于第一映射关系确定第二映射关系，包括：
相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的前一队列。
较佳地，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
所述周期的数量与所述发送队列的数量相关；
所述周期的数量与所述接收队列的数量相关。
较佳地，所述队列映射关系，包括：映射模式；
所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
较佳地，所述映射模式的数量与所述周期的数量相关；
所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、加三模式、加四模式。
本申请实施例提供一种通信调度装置，所述装置包括：
处理模块，配置为基于第一映射关系，确定第二映射关系；
通信模块，配置为按照所述第二映射关系发送报文；
其中，相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
较佳地，所述处理模块，配置为修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
较佳地，所述处理模块，配置为确定满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
到达预定调整时间；
第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
较佳地，所述处理模块，配置为相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的前一队列。
较佳地，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
所述周期的数量与所述发送队列的数量相关；
所述周期的数量与所述接收队列的数量相关。
较佳地，所述队列映射关系，包括：映射模式；
所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
较佳地，所述映射模式的数量与所述周期的数量相关；
所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、加三模式、加四模式。
本申请实施例提供一种通信调度装置，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现以上任一项所述通信调度方法的步骤。
本申请实施例还提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现以上任一项所述通信调度方法的步骤。
本申请实施例所提供的一种通信调度方法、装置和存储介质，所述方法包括：基于第一映射关系，确定第二映射关系；按照所述第二映射关系发送报文；相应映射关系包括至少一个周期中每个周期对应的队列映射关系；所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列；如此，从问题状态下的第一映射关系调度到稳定状态下的第二映射关系，通过实现对映射关系的调整，保证数据包在合 适的周期内进行传送。
附图说明
图1为一种现有IP的调度机制与DIP调度机制的关系；
图2为一种CQF调度方法的示意图；
图3为一种CQF的转发时延效果图；
图4为一种二队列场景下CQF调度方法的示意图；
图5为一种三队列场景下CQF调度方法的示意图；
图6为一种DIP的调度方法的示意图；
图7为一种DIP的调度方法应用的示意图；
图8为一种DIP的本地接口的循环队列的示意图；
图9(a)为一种由于下游节点时钟频率相对于上游节点略高导致的误差产生的示意图；
图9(b)为一种由于下游节点时钟频率相对于上游节点略低导致的误差产生的示意图；
图10为本申请实施例提供的一种通信调度方法的流程示意图；
图11为本申请实施例提供的一种传输异常发生的示意图；
图12为本申请实施例提供的一种针对问题场景的通信调度方法的示意图；
图13为本申请实施例提供的另一种传输异常发生的示意图；
图14为本申请实施例提供的另一种针对问题场景的通信调度方法的示意图；
图15为本申请实施例提供的异步DIP的分析的示意图；
图16为本申请实施例提供的一种状态描述的示意图；
图17为本申请实施例提供的另一种状态描述的示意图；
图18为本申请实施例提供的一种通信调度装置的结构示意图；
图19为本申请实施例提供的另一种通信调度装置的结构示意图。
具体实施方式
以下结合实施例对本申请再作进一步详细的说明。
如上所述，DIP是未来网络的一个重要发展趋势。由于传统的IP报文基于统计复用，尽力而为，时延、带宽、丢包等服务级别协议(SLA，Service Level Agreement)指标无法承诺；对于5G/6G的特定场景，提出了严格的确定性服务能力要求、传统IP转发无法满足。例如：远程医疗要求端到端时延小于50ms，抖动小于200us；智能电网场景为保证继电保护的准确性，单向时间的差别需要小于200us，抖动小于50us。
相关技术中，通过电气和电子工程师协会(IEEE，Institute of Electrical and Electronics Engineers)标准化的时间敏感网络(TSN，Time Sensitive Networking)技术提供一系列的拥塞控制、队列调度的标准，但是其本身是按照以太网(Ethernet)局域网络设计的，一些时间同步、逐流识别等前提在大网上不现实，可扩展性，可维护性是三层(L3，Layer3)网络实现确定性的最大挑战。
为此，相关技术中提出过一种基于周期调度DIP的思路，以希望能提供大规模骨干网的确定性，但是缺乏部署实践，在维护方便等方面存在一些问题。如图1所示，基于现有IP的调度技术和TSN的相关机制，提出DIP机制。
为对现有技术中的DIP机制进行说明，以下先对相关技术中的循环队列转发(CQF，Cyclic queuing and forwarding)进行说明。CQF为相关技术中应用于确定性网络的一种队列管理的方法。
802.1Qbv定义的时间感知整形器(TAS，Time-Aware Shaper)中，每个队列增加了1个门控，只有对应的门打开，该队列才被允许发送分组报文。门的打开和关闭通过一个循环的调度表来控制，例如某个时间窗1，表 项数据为00000001，代表这个时间窗最后一个队列打开，其他队列关闭。这种方案的优点在于，在一些流比较简单的场景，通过精确的规划，TAS机制能达到苛刻时延要求的数据流(Critical流)的最短传输时延。然而，也存在一定问题：上述方案要求全网设备时间同步，每个新的Critical流进入，都需要重新全网规划工作计划(schedule)。
图2为一种CQF调度方法的示意图；如图2所示，例如，可以仅采用两个队列循环，假设分别为队列(queue)2和队列3(或者队列4和队列5)；队列2和队列3交替的打开和关闭，当队列2打开传送数据时，队列3会关闭并且接收数据，之后队列3打开传送数据，队列2关闭并且接收数据。在这种机制中，Critical流的帧会一段一段地发送(或称为一个周期(cycle)一个周期地发送)，如图中白色的帧，它们必须在确定的时间窗到达，并且进入特定队列(图中的队列2或队列4)，在相同的时间窗里，队列3或者队列5需要完成发送，如此，整个机制才能正常运行。如果链路时延和处理时延相对于周期时长是可以忽略的，那么对一个特定的Critical流，这个机制使用两个缓冲(Buffer)即可(例如只有图中的队列2和队列3)，否则这个机制需要使用更多的队列(例如图中的队列2和队列3、队列4和队列5)。如果是网络中的设备都支持CQF，那么Critical流的报文可以在网络边缘节点进入一个周期，之后每经过一个中间节点停留约一个周期的时间，从而，Critical流的报文可以得到确定性的转发，在一个固定的周期到达对端网络边缘节点。在CQF的机制中，从每个报文的角度看，每跳停留的时间在一个周期左右，但是从整体CQF系统上看，一段接收周期的报文集合，在每个节点的整体时延是一个周期。可结合图3所示，图3为CQF的转发时延效果的示意图，图3中阴影是转发的效果图，二队列时实际在周期i发送的一波报文，要求在周期i到达下游。
CQF的运用效果为：CQF将时间划分为周期序列，每个周期长度为t。 假设有三个网桥(即网络节点)A、B和C，其中，B是A的下游，C是B的下游。CQF要求A在第i个周期内发出的帧，被B在第i+1个周期内转发，进而被C在第i+2个周期内转发，依此类推。这样，A发出的帧到B转发该帧可能的最大时间间隔接近2t，最小可能时间间隔接近于0；到达C，最大的时间间隔接近3t，最小可能的时间接近于t。如此，传输过程中的时延(delay)，与跳数(N)&周期(t)相关，时延大致为：(N-1)*t<delay<(N+1)*t；产生的抖动在一个周期左右，表现为一个报文一旦进入A，则出C的时刻必然是某个周期，但前提是每个网络节点运行正常。因此，上述CQF适用于相对于周期时长，链路时延可以忽略的场景。
综上所述，CQF的方案存在以下问题：
需要全网的设备时间同步；不同的业务的周期长度需求不同，不好整合，端到端时延要求低，则要求更短的周期长度，而周期长度短，则一个周期放入的报文数量有限，支持的业务数量就受限；不适合于长距离链路，长距离链路会降低网络资源利用率。
相关技术中提供一种CQF的具体实现方法。例如，采用两个队列：队列1(记做queue1)和队列2(记做queue2)，在奇数周期(如第1、3、5等周期)间隔(cycle interval)期间，queue1接收数据包(但不发送)，queue2将此前偶数周期(如第2、4、6等周期)间隔期间收到的数据包全部发送出去(不接收任何数据包)；在偶数周期间隔期间，queue2从入端口接收数据包(不发送)，queue1发送此前一个奇数周期间隔期间收到的数据包全部发送出去(不接收数据包)，如此循环进行。
以下提供二队列场景下CQF的方案和三队列场景下CQF的方案。
图4为一种二队列场景下CQF调度方法的示意图；如图4所示，在可忽略传播时延的情况下，在一个时间同步的网络中，报文在i周期到达节点3，i+1周期发出，单节点时延(delay)＝t(上限、即周期时长)。此时假设 报文的发出时间是ta(ti<ta<ti+1)，链路时延d(0<d<t，且d可以忽略)，则到达时间为ta+d(ti<ta+d<ti+1)。
循环队列：需要两个队列，节点3出口时间窗的循环方式是：01、10、01、……；a周期中队列1收队列2发，b周期中队列1发队列2收(相对的，在节点1出口，a周期中队列1发队列2不发)。
对报文转发举例说明，节点1接入流量1后进行整形，在第一种周期(图中用a周期表示)由queue1出；节点2接入流量2后进行整形，在a周期由queue1发出；节点3在端口1和端口2，a周期由queue1收到流量1、流量2，并且在下一个周期在端口3发出流量1和流量2(端口3会暂时性的阻塞流量1和流量2，并在下一周期发出)。
如果在a周期queue1收流量时，同时收到第二种周期(图中用b周期表示)的报文(且能识别)，则会丢弃。
对于同一个周期队列1发的报文会汇聚，相关的资源也应足够(即每个端口上的各个周期的报文总的发送时间不应超过周期长度)；
入口侧的效果：业务在边缘节点，例如节点1和节点2，有两种选择，选择a周期由queue1发，或者b周期由queue2发，一旦选定，并且路径确定，则中间节点，例如，节点3上的对应周期即可确定，按照循环交替发送，出口节点(如节点3)的周期也被确定。
图5为一种三队列场景下CQF调度方法的示意图；如图5所示，对于传播时延较长的情况，但最长也不超过1个t，那么报文在i和i+1周期到达B，i+2周期发出，单节点delay＝2t(上限)。
此时假设报文的发出时间是ta(ti<ta<ti+1)，时延d(0<d<t)，则到达ta+d(ti<ta+d<ti+1+t)。
循环队列：需要三个队列，两个收，一个发，节点3时间窗的循环方式是：010、001、100、010、001、100、010、001……，如此循环，其中0 代表收数据，1代表发数据。
图5中示例中，假设，10公里的情况下，光纤时延是50us，如果此时的周期长度是100us，则满足光纤链路时延(d)<周期时长(t)，但是d相对于t不能忽略。图中，r指的是接收(receive)，send(flag1)指的是发送的queue1，已经收集齐了一个周期的报文(源头上是接收queue2(可以看为报文的入口)发送过来的)，在周期a执行发送操作，且能够发完；
正常情况下此时发送queue1和接收queue2不会收到报文；此时，周期b、周期c，queue2执行收报文操作，分别收齐第一部分flag1报文和第二部分的flag1报文。而r flag2(part1)指的是在收第一部分flag1报文的时候，接收处是queue2收到的报文，上游节点1发送周期是2周期(标记为flag2)，queue2收到之后，会根据节点3的映射关系，修改flag为1，同时发送给对应发送queue1。
在CQF调度方法的基础上，进一步提出了用flag标识报文的周期，这是考虑到一个周期的报文会在不同的下游周期出现；除非下游记录精确的时延d，并且认为上游的一波报文在t内到达(要求比较苛刻，时间精确同步，且保留适当的保护带)。而如果使用了flag标识报文，就可以简化上述的上游报文周期确定的问题，例如每个上游报文发送的时候，按照上游的周期有一个标识flag，则在下游可以了解到上游发送的这些报文具体在上游发送的时候的周期信息。
对报文转发举例说明，节点1接入流量1后进行整形，在第一种周期(图中用a周期表示)由queue1发出；在节点2接入流量2后进行整形，在a周期queue1发出；节点3在端口1和端口2，a周期或者第二种周期(图中用b周期表示)由queue1收到流量1和流量2，并且在下一个周期在端口3发出流量1和流量2(这时端口3在第三种周期(图中用c周期表示)发出，映射规则是上一跳的a周期会映射到c周期，隔一个周期映射)。
相关技术中还提出了一种DIP调度的方式。不同于CQF的调度方式，DIP的调度方式不再假设全网的时间同步，而是假设了全网的频率同步，且都支持DIP调度机制。
因为针对大规模，长距离网络，光纤时延不能忽略，设定了更多的队列，例如3个队列，跟CQF的一发一收轮换的队列不同，这里使用两个周期的时间，保证收齐一个周期的报文，然后发送，即三个队列配合循环，例如，a、b、c三个周期，分别与对队列(queue)的对应情况设定如下：
a周期：queue1发送状态、queue2接收状态，queue3接收状态；
b周期：queue1接收状态，queue2发送状态，queue3接收状态；
c周期：queue1接收状态，queue2接收状态，queue3发送状态；
如此循环。
应用时，报文选择在网络边缘节点进入一个周期，之后每经过一个中间节点停留约两个周期的时间，从而，这个Critical流的报文可以得到确定性的转发，在一个固定的周期，到达对端网络边缘节点。
图6为一种采用DIP机制进行通信调度的示意图；与之前类似，但是除了时延d这个变量，还有一个相位差变量p(因为仅仅假设了频率同步)；这时，不能假设下游设备了解两者的相位差p，只能使用每波流量的flag标识来让下游节点了解收到的流量在上游具体属于哪个发送周期。
如图6所示，上游节点1发送的一波报文，会在下游的节点3的两个周期内收到(根据d来计算，应该在i+2和i+3，考虑p之后，范围会会有偏差，但是整体上，在下游的节点3，还是会在两个周期内收到，因为第一种周期内发送的报文组的宽度是一个t，并且用两个周期确定第一种周期内发送的报文组到达后，会在下一个周期发出)。
当前的DIP机制假设了固定的d和p，因此单节点时延delay＝2t；也是需要三个队列(两个用于接收，一个用于发送)，但是每两个节点之间与前 面相同，还是只会有三种可能的映射关系。
DIP机制假设在网络启动的时候，就每接口进行了探测，确定了是哪一种映射关系，不再变化(基于频率同步的假设)。只要通过探测报文，确定了链路的时延和相位差导致的偏移，那么就可以确定是哪种映射关系；每个接口的三个收队列，总是双收一停，双收保证了一波数据流能被全部接收到；如果应该暂停的队列收到报文，则运行机制会被认为出现了问题，可能会丢包(数据包需要有flag标识)。
图7为一种DIP的调度方法应用的示意图；如图7所示，节点1发出一波a周期的报文(报文的flag＝1)，到达节点3(节点3对于节点1的报文采用加二映射模式)，在a周期和b周期收到这些报文，然后发出报文的flag被改为3；到达节点4，节点4不修改报文的flag(或者说改动flag，但是具体数值跟以前相同)。
节点2发出一波a周期的报文(flag＝1)，到达节点3(节点3对于节点2的报文采用加一映射模式)，在c周期和a周期收到报文，然后flag改为2，在b周期发出报文；报文到达节点4，节点4不修改报文的flag(或者说改动flag，但是具体数值跟以前相同)。
图8为DIP的本地接口的循环队列的示意图；如图8所示，本地的接口的循环队列与上游的映射关系(即对一个特定链路，上游的发送周期和下游的发送周期的关系)有三种可能，分别为加一映射、加二映射和加三映射。每个DIP的网络设备，在启动的时候，如果配置为了3个周期且周期长度相同，那么其会选择一个时间点开始进行周期循环，因此虽然上游和下游之间周期长度相同，但是还是会存在相位差。同时，上下游之间的传输时延也会影响周期之间的映射关系。
在第一种映射关系中，上游节点1的a周期的报文，在下游节点3的a周期到达、b周期发出；对应的，flag从1变成2，因此记为加一映射。在 下游的节点3上，接收有三个队列，分别记作：queue1、queue2、queue3(接收的这三个队列处理报文的方式是，携带周期标识flag1进入queue1；类似的，对flag2的报文进入queue2；对flag3的报文进入queue3)。因为是加一映射，节点3会按照加1的方式修改flag，之后从下游的对应接口发出，例如接收的queue1，报文flag改为2，会进入下游的发送queue2，等待自己的发送周期(b周期)发出。
加2和加3映射有类似的处理。
结合以上内容，相关技术中缺少在DIP相邻的两个节点不是很好的频率同步的场景(例如跨同步域的场景)下的调整机制，例如上游周期到达时间向右移动，或者向左移动；
如图9(a)所示，可以看出上游周期(如点状阴影表示的周期)到达时间向右移动；如图9(b)所示，可以看出上游周期(如点状阴影表示的周期)到达时间向左移动。
综上所述，相关技术中的DIP机制，如果频率同步不能很好的保障，在上游周期到达时间移动到一定程度或者说按某一映射关系运行一段时间后，报文会出现在不应该出现的周期，这时DIP机制报错，然后失效。
基于此，本申请实施例提供的方法，基于第一映射关系，确定第二映射关系；按照所述第二映射关系发送报文；相应映射关系包括至少一个周期中每个周期对应的队列映射关系；所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
下面结合实施例对本申请再作进一步详细的说明。
图10为本申请实施例提供的一种通信调度方法的流程示意图；如图10所示，所述方法包括：
步骤1001、基于第一映射关系，确定第二映射关系；
步骤1002、按照所述第二映射关系发送报文；
相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
在一实施例中，所述基于第一映射关系，确定第二映射关系，包括：
修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
所述方法应用于DIP节点，所述DIP节点为DIP网络中的某一节点，例如，可以是DIP网络中采用的一个路由器。
所述报文可以为一种苛刻时延要求的数据流(称为Critical流)。
实际应用时，考虑到相关技术中的DIP机制，对于两个相邻的DIP节点，如果频率同步保障得不好，那么在上游周期到达时间移动到一定程度，报文会出现在不应该出现的周期，DIP机制报错且失效的问题，提供了上述通信调度方法，以从一个映射关系(第一稳态、即第一映射关系)进入另一个稳态，即第二映射关系。还需要提供一种方法，以确定具体在哪个时机变为第二映射关系。
在一实施例中，所述方法还包括：
确定满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
到达预定调整时间；
第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
具体来说，接收端根据接收队列所接收的报文中携带的周期标识，结 合第一映射关系，可以将周期标识映射到发送队列的周期标识，即确定相应的发送队列；但是，可能存在所述接收的报文实际到达接收队列的时间与所述接收的报文应该到达接收队列的时间不同的情况，也即会造成上述第一场景或第二场景；如此，节点的接收队列无法在预期的两个周期(指接收的报文应该到达接收队列的时间)完成上游的一个周期的报文的接收，需要报错(如上所述，DIP机制下用两个周期来保证收齐报文，而上述情况即表征无法收齐，也即应该收齐报文的两个周期并没有完成接收工作，具体原因即为上述漂移的问题)。
这里，所述接收的报文应该到达接收队列的时间，指的是上游的确定性业务的报文在确定性网络中，根据确定性的转发机制，预估的到达接收队列的时间。
所述报文指DIP网络中传输的报文。
针对上述第一场景、第二场景，通过本申请实施例提供的方法，以从一个映射关系(第一稳态、即第一映射关系)进入另一个稳态，即第二映射关系。
基于此，在一实施例中，所述基于第一映射关系确定第二映射关系，包括：
相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的前一队列。
在一实施例中，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
所述周期的数量与所述发送队列的数量相关；
所述周期的数量与所述接收队列的数量相关。
例如，周期数量为三，即在三个周期的场景下，发送队列的数量为三，接收队列的数量也为三；
周期数量为四，即在四个周期的场景下，发送队列的数量为四，接收队列的数量也为四。
在一实施例中，所述队列映射关系，包括：映射模式；
所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
在一实施例中，所述映射模式的数量与所述周期的数量相关；
所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、加三模式、加四模式。
以上根据接收队列接收的报文周期，进行加一、加二、加三、加四，可以将周期标识映射到发送队列的周期标识，即确定相应的发送队列。
具体以三个周期的场景为例进行说明。
第一周期：发送队列一发送状态、接收队列二接收状态、接收队列三接收状态；
第二周期：接收队列一接收状态、发送队列二发送状态、接收队列三接收状态；
第三周期：接收队列一接收状态、接收队列二接收状态、发送队列三发送状态；
映射模式为加一模式，假设，上游的发送队列为一，下游的接收队列三和接收队列一接收某一报文，基于加一模式，确定由发送队列二转发该报文；
上游的发送队列为一，下游的接收队列一和接收队列二接收某一报文，基于加二模式，确定由发送队列三转发该报文；
上游的发送队列为一，下游的接收队列二和接受队列三接收某一报文，基于加三模式，确定由发送队列一转发该报文。
相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列，所述第二发送队列为所述第一发送队列的后一队列，表示，假设基于第一映射关系确定的发送队列为发送队列二(即上所述第一发送队列)，将发送队列修改为发送队列三(即上述第二发送队列)；而如果确定的发送队列为发送队列三，将发送队列修改为发送队列一；如此类推。
相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列，所述第二发送队列为所述第一发送队列的前一队列，表示，假设基于第一映射关系确定的发送队列为发送队列二，将发送队列修改为发送队列一；而如果确定的发送队列为发送队列一，将发送队列修改为发送队列三；如此类推。
本申请实施例提供的方法，提出了一种不要求相邻的DIP节点频率严格同步的机制，在发现报文出现在不该出现的周期，DIP系统进入了异常状态，但是并没有崩溃，而是确定目标稳态(一个新的周期映射关系)。上述方案只需在一个3T时长的三个周期中，逐个周期(T)对每个队列进行修正(依次对每个周期的每个队列进行修正，因此，只需要三个周期时长；若应用于四个周期的场景，则可以采用四个周期时长)，即可进入新的目标稳态。在两个设备出现频差，导致周期性DIP的周期映射关系缓慢的发生变化时，本申请实施例提供的方法通过一个过渡状态，将DIP的映射关系转化为另外一个稳态。
而且，在进行周期关系调整之前，如果需要两个周期的流量合并，则确认两个周期的流量能够合并且不超过周期的容量即可，例如，如果需要合并某个周期1和之后的周期2的报文，需要检查周期1预留的带宽与周期2预留的带宽和是否超过合并后的周期的带宽，不超过即可合并，即需 要保证合并后的周期能够发送完之前在周期1和周期2发送的全部报文。这是要求周期1和周期2的报文相对于一个周期能发送的报文，不能都比较拥挤，都有较多的空余带宽会比较容易执行合并。另外，在另一种实现中，如果周期1和周期2的报文合并后，超过了一个周期能够承载的数量，那么超出的报文，可以选择在后续的周期发出，该周期可以是紧跟在合并周期之后，也可以是与合并的周期间隔两个发送周期(适用于三周期循环场景)，或者间隔三个发送周期(适用于四周期循环场景)。
在异常状态中，如果一个接收队列在绑定的发送队列发送报文的周期，又有新的周期的报文到达(即发生上述上游周期到达时间前移的情况)，入口的触发网络设备(PSFP，Per-Stream Filtering and Policing)需要识别新的周期，并且等待当前的周期结束，才允许这些报文发送给后端绑定的发送队列。其中，PSFP是IEEE Std 802.1Qci Per-Stream Filtering and Policing，用于DIP节点的入口处，支持每流或者每优先级的识别和处理；相关的处理包括打标记、检查是否在正确的时间到达等。
需要说明的是，目前的IEEE定义的高速以太网设备一般使用自由震荡的时钟，精度要求是100ppb，每个接口支持根据报文头的前导部分锁定，一定程度上算是一种同步传输。如果使用了同步以太网技术等，可以使同步精度上升，从而基本不会出现频率偏移的情况，保证DIP网络的正常工作。同步以太网要求一个精度4.6ppb的时钟源。
通过本申请实施例提供的方法，拓展了目前周期性DIP的确定性网络的场景，减少了相关的限制。例如在大规模跨域网络的场景中，无法要求不同网络同步到相同的频率源(时钟源)，而本申请实时例提供的方法，可以使能跨同步域的DIP的数据传输，甚至是在频率不同步的简单IP网络中使用(精度范围加或减100ppb)。
图11为本申请实施例提供的一种传输异常发生的示意图；图11中下 方的三个表格，从左至右三组表格显示的映射关系，分别为：原始映射关系、异常映射关系、目标映射关系；原始映射关系相当于上述第一映射关系；目标映射关系相当于上述基于第一映射关系确定的第二映射关系；
图11中上方四个图，显示了点状阴影的周期在右移，第一和第二个图对应原始映射关系；第三个图出问题，对应异常映射关系；第四个图对应目标映射关系。
针对图11所示的情况，上游周期的报文出现了还没收完，节点3的发送队列2(queue2)就开始发送新报文的问题(即上游周期到达时间向右移)；但是queue2已经收到的这些报文不会一下都发送完，有几个包边发边收也不会破坏DIP系统的确定性。在传统的DIP机制中，PSFP如果发现上述的到达时间偏移导致的异常，会丢弃报文，使DIP系统失效；在本申请实施例提供的机制中，PSFP在检查的时候发现上述问题，但是不丢包，而是进入后面的处理方式，也即从以从一个稳态(即第一映射关系)进入另一个稳态(即第二映射关系)。
针对上述问题，运用本申请实施例提供的方法，PSFP修正目前的映射规则，把加一映射变成加二映射，具体表现为将队列1的报文在某个a周期开始的时候，目标队列的flag由f2改为f3(表示原来是发给队列2的，修改为发送给队列3)。
结合图12对具体地操作方法进行说明。首先对图12中下方的三个表格，从左至右三组表格显示的映射关系，分别为：原始映射关系、过渡映射关系、目标映射关系；原始映射关系相当于上述第一映射关系；目标映射关系相当于上述基于第一映射关系确定的第二映射关系；
图12中上方三个图中，第二个图对应了异常映射关系；第三个图对应到目标映射关系；
过渡周期只会出现3T的时间(每个T调整一个队列映射关系)，通过 图11中左侧的表格(空格表示无动作)，可以了解过渡周期的动作，以及目标映射关系3个周期的动作。
图中，入口对应有接收队列1(记做接收q1)、接收队列2(记做接收q2)、接收队列3(记做接收q3)；
出口对应有发送队列1(记做发送q1)、发送队列2(记做发送q2)、发送队列3(记做发送q3)。
以下描述中，fx(x为1、2或3，表示报文的发送周期为第一周期、第二周期或第三周期)，具体的，节点3收到的报文，会携带上游周期标识信息，例如fx，代表是从上游的哪个周期发出的，节点3根据收到报文的接口上的周期映射关系，决定报文在本节点的发送周期，同时修改报文的周期标识信息。
qy(y为1、2或3)，表示队列(接收队列或发送队列)对应的周期号为第一周期、第二周期或第三周期，也就是说，接收qy(y为1、2或3)，可以表示上游第一周期的接收队列、上游第二周期的接收队列、上游第三周期的接收队列；相应的，发送qy(y为1、2或3)，可以表示第一周期的发送队列、第二周期的发送队列、第三周期的发送队列，具体的，在节点3的入口处，如果基于映射关系确定对应的周期标识信息为f1，则进入接收q1，其他的类似，在节点3的出口处，如果修改后的周期标识信息为f2，则对应的应进入发送q2，其他的类似。需要说明的是，由于不同周期的发送队列和接收队列预设(即映射关系确定)，因此，可以根据周期标识信息确定对应的发送队列；也因此，在进入一个新的稳态时，即确定新的映射关系。具体操作方法包括：
步骤01、将接收q1关联到发送q3；
具体来说，前一个c周期结束时，发送q2空，发送q3空，发送q1有一些f1的报文(由f3修改而来)；这时，对于接收q1用f3替换f2(两个 前身都是f1，即接收的报文f1根据映射表改为f3)，本来发给发送q2改为发给发送q3；
步骤02、将接收q2关联到发送q1；
具体来说，前一个a周期结束时，发送q2空，发送q3有一些f3p1的报文(由f1修改而来)，发送q1空；这时，接收q1将f1p2改为f3p2发给q3(开始执行稳定周期的行为)，对于接收q2用f1替换f3(两个前身都是f2)，本来发给发送q3改为发给发送q1；
步骤03、将接收q3关联到发送q2；
具体来说，前一个b周期结束时，发送q2空，发送q3收集齐了f3报文，发送q1有一些f1p1报文(f2修改而来)；这时，发送q3发送，发送q1接收f2p2，对于q3用f2替换f1(两个前身都是f3)，本来发给发送q1改为发给发送q2。
图13为本申请实施例提供的另一种传输异常发生的示意图；如图13所示，上游周期的报文对应的发送周期出现了还没发完，节点3的发送队列q2(对应左斜线的部分，同时该队列关联到点状阴影的部分对应接收队列q1)又出现新报文需接收的问题(即点状阴影的部分对应接收队列q1收到的报文，会按照加一映射到左斜线映射的部分，即发送队列q2，而左斜线阴影的部分之前的三个周期，又会有发送队列q2，即此时发送队列q2正在被使用来发送数据，也就是说，上游a周期的报文在节点3的到达时间向左移带来了问题)；但是这些报文如果只有几个，并且节点3能识别这些报文的分界，不是直接在这个周期发出，那么也可以接收。在传统的DIP机制中，PSFP会检查到这些不应该出现的报文，会丢弃报文，使DIP系统失效；在本申请的机制中，PSFP检查到这个问题，并不会丢弃报文，而是进入下面的处理流程。
PSFP在检查的时候发现上述问题，但是不丢包也不发包，而是进入后 面的处理方式，以进入另一个稳态。具体地，PSFP修正目前的映射规则，把加一映射变成加三映射，具体表现为把队列1的报文在某个a周期开始的时候，f2改为f1，本来发给队列2改为发给队列1。
结合图14对具体地操作方法进行说明。首先对图14中的内容进行说明如下：在过渡周期(包含三个周期(即3T)，每周期切换一个队列)的第一个周期，接收q1切换到发送q1，这时接收q3仍然关联到发送q1，发送q1会发送报文，同时收报文，在第二个过渡周期，因为发送q1被两个接收队列关联，会同时受到两组报文，接收q2切换连接到发送q2，并且发送q2发送报文；在第三个过渡周期，发送q1和发送q2都收到报文，接收q3切换连接到发送q3，并且发送；发送报文在目标映射关系的第一个周期，发送q1同时发送两个周期的报文，一个是接收q1来的，一个是接收q3来的。
具体操作方法包括：
步骤11、将接收q1关联到发送q1；
具体来说，前一个c周期结束时，发送q1满数据(由f3改为f1)，发送q3有一些f3p1报文(由f2p1报文修改而来)，发送q2满数据(由f1改为f2)；这时，对于发送q1发送报文，发送q1同时收到一些f1p1报文(由f3p1报文修改而来)，但是暂时性抑制发送，接收q1关联到发送q1；
此处的满数据指的是，收齐了上游一个周期的数据。
步骤12、将接收q2切换关联到发送q2；
具体来说，前一个a周期结束时，发送q2满数据(由f1改为f2)，发送q3满数据(由f2修改而来)，发送q1有一些f1p1报文(f3p1报文修改而来)；这时，接收q1将f1p1改为f1p1(逻辑上也可以认为未改变)发给发送q1，对于发送q2发送报文，接收q2关联到发送q2；
步骤13、将接收q3切换连接到发送q3；
具体来说，前一个b周期结束时，发送q2空，发送q3满数据，发送q1有一些f1p1报文(f1修改而来)，同时还有整周期f1的报文(f3修改而来)；这时，发送q3发送，接收q3关联到发送q3，发送q1又收集到了f1p2(f1修改而来)，注意此时发送q1是有两个周期的流量的，一波是f1修改而来，一波是之前的f3修改而来。
需要说明的是，以上对点状阴影的周期记做a周期，对左斜线阴影的周期记做b周期，对右斜线阴影的周期记做c周期。
以下进一步对异步DIP所产生的原因进行说明。
图15为本申请实施例提供的异步DIP的分析的示意图；结合图15可以了解下游节点的跟随者上游节点发送周期移动的原因(如上述a周期向左移动、向右移动)。具体说明如下：
本申请的机制中，在引入了相位和频率的偏差的基础上，映射关系还是三种，假设传播时延和相位差是恒定的，每对邻居需要确定的还是映射关系是三种的哪一个，此处认为这种关系是相对稳定的。因为频率差的存在，经过一段时间，上游周期例如点状阴影的周期的实际到达时间会发生偏移(具体原因是节点1的实际频率和节点3的实际频率可能有偏差)；如果节点1频率低于节点3，即节点3的表快，节点1的周期时长(cycle time)长一点，点状阴影会慢慢后移，直到错过一个周期，让入口的PSFP出错(本应在c周期、a周期出现的flag1报文，没有完全到达)。
如果节点1频率高于节点3，即节点3的表慢，节点3的cycle time 3长一点，上游周期例如点状阴影的周期的实际到达时间会慢慢前移，直到错过一个周期，让入口的PSFP出错(本应在c周期、a周期出现的flag1报文，出现在b周期)。
图16为本申请实施例提供的一种状态描述的示意图；图16中显示了过渡映射关系的三个周期中发送队列的状态以及随后的目标映射关系的前 三个周期中发送队列的状态描述图表；
点状阴影的周期(即a周期)向右移动时，如前所述，会进入异常状态，需要通过过渡状态，使其进入一个新的稳定周期，从而保持另一段时间的稳定循环，经过前面的分析，可以发现，所述的调整，其实是空出了一个周期，没有任何的报文发送，该变动对DIP整体系统的影响不大。
图17为本申请实施例提供的另一种状态描述的示意图；图17中显示了过渡映射关系的三个周期中发送队列的状态以及随后的目标映射关系的前三个周期中发送队列的状态描述图表；
点状阴影的周期(即a周期)向左(向前)移动时，如前所述，会进入异常状态，需要通过过渡状态，使其进入一个新的稳定周期，从而保持另一段时间的稳定循环，经过前面的分析，可以发现，所述的调整是把两个发送周期挤在了一个周期，同时发送两个周期的报文，相关的影响比较大，包括：
问题1：a周期有一个时间段在边发边收，但是收到的报文不能发，这时需要设定前面的报文和新收报文的边界，否则无法区分；
相关的解决方案如下：使用特殊字段做一个标识，例如一个明确的标识报文来表明这是一个新的周期开始的a周期的报文；
问题2：双发的a周期发生流量聚合，无法确定是否会有流量溢出；
相关的解决方案如下：需要合理的监控每个周期的资源利用率情况，检测是否允许可能出现的这种合并；
如果不超过a周期的带宽，则进行合并；如果超过，则进行超过的报文需要等待一个3T的时间，并入下次a周期发送，或者直接报错。
图18为本申请实施例提供的一种通信调度装置的结构示意图；如图18所示，所述装置应用于DIP节点；所述装置包括：
处理模块，配置为基于第一映射关系，确定第二映射关系；
通信模块，配置为按照所述第二映射关系发送报文；
其中，相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
具体地，所述处理模块，配置为修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
具体地，所述处理模块，配置为确定满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
到达预定调整时间；
第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
具体地，所述处理模块，配置为相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的前一队列。
具体地，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
所述周期的数量与所述发送队列的数量相关；
所述周期的数量与所述接收队列的数量相关。
具体地，所述队列映射关系，包括：映射模式；
所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
具体地，所述映射模式的数量与所述周期的数量相关；
所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、加三模式、加四模式。
需要说明的是：上述实施例提供的通信调度装置在实现相应通信调度方法时，仅以上述各程序模块的划分进行举例说明，实际应用中，可以根据需要而将上述处理分配由不同的程序模块完成，即将服务器的内部结构划分成不同的程序模块，以完成以上描述的全部或者部分处理。另外，上述实施例提供的装置与相应方法的实施例属于同一构思，其具体实现过程详见方法实施例，这里不再赘述。
图19为本申请实施例提供的一种通信调度装置的结构示意图，如图19所示，所述通信调度装置190包括：处理器1901和配置为存储能够在所述处理器上运行的计算机程序的存储器1902；所述处理器1901配置为运行所述计算机程序时，执行：基于第一映射关系，确定第二映射关系；按照所述第二映射关系发送报文；相应映射关系包括至少一个周期中每个周期对应的队列映射关系；所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
所述处理器运行所述计算机程序时实现本申请实施例的各个方法的相应流程，为了简洁，在此不再赘述。
实际应用时，所述通信调度装置190还可以包括：至少一个网络接口1903。所述通信调度装置190中的各个组件通过总线系统1904耦合在一起。可理解，总线系统1904用于实现这些组件之间的连接通信。总线系统1904 除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。但是为了清楚说明起见，在图19中将各种总线都标为总线系统1904。其中，所述处理器1901的个数可以为至少一个。网络接口1903用于通信调度装置190与其他设备之间有线或无线方式的通信。
本申请实施例中的存储器1902用于存储各种类型的数据以支持通信调度装置190的操作。
上述本申请实施例揭示的方法可以应用于处理器1901中，或者由处理器1901实现。处理器1901可能是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法的各步骤可以通过处理器1901中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器1901可以是通用处理器、数字信号处理器(DSP，DiGital Signal Processor)，或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。处理器1901可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤，可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于存储介质中，该存储介质位于存储器1902，处理器1901读取存储器1902中的信息，结合其硬件完成前述方法的步骤。
在示例性实施例中，通信调度装置190可以被一个或多个应用专用集成电路(ASIC，Application Specific Integrated Circuit)、DSP、可编程逻辑器件(PLD，Programmable Logic Device)、复杂可编程逻辑器件(CPLD，Complex Programmable Logic Device)、现场可编程门阵列(FPGA，Field-Programmable Gate Array)、通用处理器、控制器、微控制器(MCU，Micro Controller Unit)、微处理器(Microprocessor)、或其他电子元件实现，用于执行前述方法。
本申请实施例还提供了一种计算机可读存储介质，其上存储有计算机程序；所述计算机程序被处理器运行时，执行：基于第一映射关系，确定第二映射关系；按照所述第二映射关系发送报文；相应映射关系包括至少一个周期中每个周期对应的队列映射关系；所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
所述计算机程序被处理器运行时实现本申请实施例的各个方法的相应流程，为了简洁，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置和方法，可以通过其它的方式实现。以上所描述的设备实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，如：多个单元或组件可以结合，或可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的各组成部分相互之间的耦合、或直接耦合、或通信连接可以是通过一些接口，设备或单元的间接耦合或通信连接，可以是电性的、机械的或其它形式的。
上述作为分离部件说明的单元可以是、或也可以不是物理上分开的，作为单元显示的部件可以是、或也可以不是物理单元，即可以位于一个地方，也可以分布到多个网络单元上；可以根据实际的需要选择其中的部分或全部单元来实现本实施例方案的目的。
另外，在本申请各实施例中的各功能单元可以全部集成在一个处理单元中，也可以是各单元分别单独作为一个单元，也可以两个或两个以上单元集成在一个单元中；上述集成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能单元的形式实现。
本领域普通技术人员可以理解：实现上述方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成，前述的程序可以存储于一计算机可读取存储介质中，该程序在执行时，执行包括上述方法实施例的步骤； 而前述的存储介质包括：移动存储设备、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
或者，本申请上述集成的单元如果以软件功能模块的形式实现并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机、服务器、或者网络设备等)执行本申请各个实施例所述方法的全部或部分。而前述的存储介质包括：移动存储设备、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
需要说明的是：“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
另外，本申请实施例所记载的技术方案之间，在不冲突的情况下，可以任意组合。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (16)

  1. 一种通信调度方法，所述方法包括：
    基于第一映射关系，确定第二映射关系；
    按照所述第二映射关系发送报文；
    相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
    所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
  2. 根据权利要求1所述的方法，其中，所述基于第一映射关系，确定第二映射关系，包括：
    修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
  3. 根据权利要求2所述的方法，其中，所述方法还包括：
    确定满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
    到达预定调整时间；
    第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
    第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
  4. 根据权利要求1所述的方法，其中，所述基于第一映射关系确定第二映射关系，包括：
    相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
    相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二 发送队列；所述第二发送队列为所述第一发送队列的前一队列。
  5. 根据权利要求1至4任一项所述的方法，其中，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
    所述周期的数量与所述发送队列的数量相关；
    所述周期的数量与所述接收队列的数量相关。
  6. 根据权利要求5所述的方法，其中，所述队列映射关系，包括：映射模式；
    所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
  7. 根据权利要求6所述的方法，其中，所述映射模式的数量与所述周期的数量相关；
    所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
    所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、加三模式、加四模式。
  8. 一种通信调度装置，所述装置包括：
    处理模块，配置为基于第一映射关系，确定第二映射关系；
    通信模块，配置为按照所述第二映射关系发送报文；
    其中，相应映射关系包括至少一个周期中每个周期对应的队列映射关系；
    所述队列映射关系用于确定相应周期内至少一个接收队列中每个所述接收队列对应的发送队列。
  9. 根据权利要求8所述的装置，其中，所述处理模块，配置为修改所述第一映射关系中相应周期内每个所述接收队列对应的发送队列，得到所述第二映射关系。
  10. 根据权利要求9所述的装置，其中，所述处理模块，配置为确定 满足以下至少一个要求时，基于第一映射关系确定第二映射关系：
    到达预定调整时间；
    第一场景；所述第一场景为接收队列接收报文时，所述接收队列对应的发送队列同时需发送报文，且所述接收队列接收的报文需在当前发送周期发出；
    第二场景；所述第二场景为发送队列发送报文时，所述发送队列对应的接收队列同时需接收报文，且所述接收队列接收的报文需等待下一个发送周期内由所述发送队列发出。
  11. 根据权利要求8所述的装置，其中，所述处理模块，配置为相应于第一场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的后一队列；
    相应于第二场景下，将所述接收队列对应的第一发送队列修改为第二发送队列；所述第二发送队列为所述第一发送队列的前一队列。
  12. 根据权利要求8至11任一项所述的装置，其中，相应映射关系，包括：至少三个周期中每个周期对应的队列映射关系；
    所述周期的数量与所述发送队列的数量相关；
    所述周期的数量与所述接收队列的数量相关。
  13. 根据权利要求12所述的装置，其中，所述队列映射关系，包括：映射模式；
    所述映射模式表征确定每个所述接收队列对应的发送队列的模式。
  14. 根据权利要求13所述的装置，其中，所述映射模式的数量与所述周期的数量相关；
    所述周期的数量为三时，所述映射模式包括：加一模式、加二模式、加三模式；
    所述周期的数量为四时，所述映射模式包括：加一模式、加二模式、 加三模式、加四模式。
  15. 一种通信调度装置，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现权利要求1至7任一项所述方法的步骤。
  16. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1至7任一项所述方法的步骤。
PCT/CN2021/123502 2020-11-06 2021-10-13 一种通信调度方法、装置和存储介质 WO2022095669A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011233487.XA CN114449586A (zh) 2020-11-06 2020-11-06 一种通信调度方法、装置和存储介质
CN202011233487.X 2020-11-06

Publications (1)

Publication Number Publication Date
WO2022095669A1 true WO2022095669A1 (zh) 2022-05-12

Family

ID=81362151

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/123502 WO2022095669A1 (zh) 2020-11-06 2021-10-13 一种通信调度方法、装置和存储介质

Country Status (2)

Country Link
CN (1) CN114449586A (zh)
WO (1) WO2022095669A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024036476A1 (zh) * 2022-08-16 2024-02-22 新华三技术有限公司 一种报文转发方法及装置
WO2024093676A1 (zh) * 2022-11-04 2024-05-10 中国移动通信有限公司研究院 一种确定性业务的处理方法及装置

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117240801A (zh) * 2022-06-08 2023-12-15 大唐移动通信设备有限公司 数据调度处理方法、设备、装置及存储介质
CN117675719A (zh) * 2022-08-31 2024-03-08 华为技术有限公司 队列调度方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106533954A (zh) * 2015-09-15 2017-03-22 深圳市中兴微电子技术有限公司 一种报文调度方法和装置
US20190044920A1 (en) * 2016-02-03 2019-02-07 Ted H. Szymanski Methods to strengthen cyber-security and privacy in a deterministic internet of things
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备
CN111404840A (zh) * 2019-01-03 2020-07-10 华为技术有限公司 报文处理方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106533954A (zh) * 2015-09-15 2017-03-22 深圳市中兴微电子技术有限公司 一种报文调度方法和装置
US20190044920A1 (en) * 2016-02-03 2019-02-07 Ted H. Szymanski Methods to strengthen cyber-security and privacy in a deterministic internet of things
CN110868363A (zh) * 2018-08-27 2020-03-06 华为技术有限公司 周期映射的方法及网络设备
CN111404840A (zh) * 2019-01-03 2020-07-10 华为技术有限公司 报文处理方法和装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024036476A1 (zh) * 2022-08-16 2024-02-22 新华三技术有限公司 一种报文转发方法及装置
WO2024093676A1 (zh) * 2022-11-04 2024-05-10 中国移动通信有限公司研究院 一种确定性业务的处理方法及装置

Also Published As

Publication number Publication date
CN114449586A (zh) 2022-05-06

Similar Documents

Publication Publication Date Title
WO2022095669A1 (zh) 一种通信调度方法、装置和存储介质
Laursen et al. Routing optimization of AVB streams in TSN networks
US10218631B2 (en) Method for traffic shaping of data frames in network and device and computer program product therefor
US20200213022A1 (en) Method and device for time-controlled data transmission in a time-sensitive network
EP4319055A1 (en) Message transmission method and apparatus
Zhou et al. Analysis and modeling of asynchronous traffic shaping in time sensitive networks
Suethanuwong Scheduling time-triggered traffic in TTEthernet systems
EP4152703A1 (en) Network control method and device
Zhou et al. Analysis and implementation of packet preemption for time sensitive networks
TWI756666B (zh) 在封包交換網路中藉由通訊實體之電腦手段實施之方法、及其電腦程式及電腦可讀取之非暫時性記錄媒體、以及封包交換網路之通訊實體
CN107070815B (zh) 一种sdn网络中同步报文排队延时控制方法和装置
CN110460548B (zh) 基于多平面的时间触发以太网交换机及调度分组交换方法
CN108777609A (zh) 在tte网络中避免tt业务与et业务输出冲突的方法
CN108282416A (zh) 一种基于数据帧的调度方法和装置
CN115242728B (zh) 一种报文传输方法及装置
Li et al. Joint routing and scheduling for deterministic networking: A segment routing approach
CN111181678B (zh) 一种应用于时间触发fc网络的时间同步方法
CN114500163A (zh) 一种通信调度方法、装置和存储介质
CN115208837B (zh) 一种报文调度方法和系统
Nie et al. TAMCQF: Hybrid Traffic Scheduling Mechanism Integrating TAS and Multi-CQF in TSN
EP2640011B1 (en) A method for transporting real time packets
WO2024016327A1 (zh) 报文传输
Orehawa Real-time motion control over switched industrial Ethernet utilising IEEE1588 synchronisation
Zhou et al. Reliable Transmission Scheme Based on Time-Sensitive Network in Smart Grid
CN107210940B (zh) 控制网络系统、及其节点装置

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 17/08/2023)

122 Ep: pct application non-entry in european phase

Ref document number: 21888366

Country of ref document: EP

Kind code of ref document: A1