CN110809012A - Train network communication data scheduling control method - Google Patents
Train network communication data scheduling control method Download PDFInfo
- Publication number
- CN110809012A CN110809012A CN201810884876.5A CN201810884876A CN110809012A CN 110809012 A CN110809012 A CN 110809012A CN 201810884876 A CN201810884876 A CN 201810884876A CN 110809012 A CN110809012 A CN 110809012A
- Authority
- CN
- China
- Prior art keywords
- data
- sub
- type
- time
- time slice
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding in a switch fabric
- H04L49/253—Routing or path finding in a switch fabric using establishment or release of connections between ports
- H04L49/254—Centralised controller, i.e. arbitration or scheduling
Abstract
The invention provides a train network communication data scheduling control method, which comprises the following steps: dividing the train network communication data into a plurality of types of data based on the data characteristics and the transmission requirements; dividing time of a communication schedule into time slices of minimum granularity, wherein each time slice is divided into a plurality of sub-time slices for each of the plurality of types of data; and scheduling and controlling the transmission of the multiple types of data in each of the multiple sub-time slices based on a first-in first-out mode and/or a priority sorting mode.
Description
Technical Field
The invention relates to the field of train communication scheduling control, in particular to a train network communication data scheduling control method.
Background
The existing train communication network data communication mainly has the following modes:
master-slave scheduling: one device is selected from all devices needing communication in the whole network as a main device, the main device broadcasts to the whole network to initiate a request through a specific request frame, and the slave device transmits data after receiving the request frame. Master-slave scheduling is currently used mainly in low speed bus networks, where the transmission rate is limited.
Switched priority scheduling: for a network constructed by adopting a switch, all communication equipment triggers and sends data frames according to local tasks, the data is random for the whole network, after the data frames arrive at the switch, the switch forwards the data frames according to the priority, the data frames are forwarded preferentially with high priority, the data frames are forwarded afterwards with low priority, and when queues appear, the data frames with high priority can be inserted into the front row with low priority and are forwarded preferentially. When the network load is high, the switching type priority scheduling still generates a high-priority queuing phenomenon, so that the delay of the train network is uncertain.
And (3) token ring scheduling: the token ring adopts a token which is transmitted on the ring bus in sequence, the communication equipment can send data only when the token is acquired, the token is transmitted to the next equipment after the data is sent, and the next equipment sends the data after the token is acquired. The token ring network needs to maintain the token, and once the token is lost, the token cannot work, special node monitoring and token management are needed.
In summary, the prior art has the disadvantages of low communication rate, queuing phenomenon, no scheduling management for receiving and transmitting all data frames, or the scheduling management mechanism is affected by network performance, jitter exists, and the network real-time performance and certainty are not high.
Disclosure of Invention
In view of the above problems, the present invention provides a train network communication data scheduling control method, which is controlled by time triggering, and combines with priority sequencing and first-in first-out, etc. to perform scheduling control on data frames, and has the characteristics of high bandwidth, high real-time performance and high certainty of important data, and by classifying data, allocating different bandwidths to data, and performing sending and receiving by time triggering, control data having significant association to train operation can be guaranteed to be forwarded preferentially, and the real-time performance and certainty of the control data can be guaranteed; the transmission of common data which are irrelevant to the train operation, such as audio and video, broadcasting and the like, is carried out as much as possible.
According to an aspect of the present invention, there is provided a train network communication data scheduling control method, including:
dividing the train network communication data into a plurality of types of data based on the data characteristics and the transmission requirements;
dividing time of a communication schedule into time slices of minimum granularity, wherein each time slice is divided into a plurality of sub-time slices for each of the plurality of types of data; and
and scheduling and controlling the transmission of the multiple types of data in each of the multiple sub-time slices based on a first-in first-out mode and/or a priority sorting mode.
According to an embodiment, the plurality of types of data comprises a first type of data, the plurality of sub-time slices comprises a preceding first sub-time slice, wherein the first type of data is transmitted within the first sub-time slice according to a predetermined prioritization.
According to an embodiment, wherein the first sub-time slice is divided into a plurality of time slots based on the number of priorities, the width of each time slot being divided based on the size of the data stream, each time slot being used for transmission of the first type of data of the priority to which it belongs.
According to the embodiment, when the transmission of the first type data of the same priority is not finished in the time slot, the first type data of high priority can be continuously transmitted, the first type data of high priority is allowed to preempt the time slot where the first type data of low priority is located, but the first type data of low priority is not allowed to preempt the time slot where the first type data of high priority is located, and if the transmission of the first type data of lowest priority is not finished, the first type data of low priority is directly discarded.
According to an embodiment, the plurality of types of data comprises a second type of data, the plurality of sub-time slices comprises a second sub-time slice following the first sub-time slice, wherein the second type of data is transmitted within the second sub-time slice according to a predetermined prioritization.
According to an embodiment, wherein if a certain second type of data generated within the first time slice needs to be transmitted, waiting for transmission occurs within a second sub-time slice of the cycle.
According to an embodiment, wherein the plurality of types of data includes a third type of data, the plurality of sub-time slices includes a third sub-time slice following the second sub-time slice, wherein the third type of data is transmitted within the third sub-time slice according to a first-in-first-out manner.
According to the embodiment, if some second type data generated in the third sub-time slice needs to be transmitted, the data is arranged into the second sub-time slice of the next period, and the arrangement order is arranged according to the priority from high to low.
According to an embodiment, wherein if all the third type data cannot be transmitted within the third sub-time slice, the last data is directly discarded; and if the third type data is generated in the first sub time slice or the second sub time slice, arranging the data to be transmitted in a third sub time slice of the period according to the time sequence.
According to an embodiment, wherein the first type of data is periodically transmitted process data for controlling the transmission of data, wherein the size, period, source and destination of all data streams are determined; the second type data is triggered message data which is used for transmitting partial control data and state data, and the data is transmitted only by last triggering when the data needs to be transmitted; and the third type data is common data and is used for data maintenance and audio and video data transmission.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention.
Fig. 1 is a schematic diagram illustrating data classification and time slice division of a train network communication data scheduling control method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram showing process data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the present invention.
Fig. 3 is a schematic diagram showing message data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the present invention.
Fig. 4 is a schematic diagram showing general data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the invention.
Detailed Description
As described above, the present invention provides a method for scheduling and controlling data frames by time-triggered control and combining with priority and first-in first-out, etc. which has the characteristics of high bandwidth, high real-time performance and high certainty of important data, aiming at the problems of low communication rate, queuing phenomenon, no scheduling management of the receiving and sending of all data frames, or jitter, low network real-time performance and certainty caused by the influence of network performance on the scheduling management mechanism in the prior art in the manners of master-slave data scheduling, switched scheduling, token ring scheduling, etc. for the communication data of a train network.
Generally, the present invention is characterized by classifying train network communication data into three categories, mainly:
first type data: namely, the periodically transmitted process data is mainly used for controlling the transmission of data, and the size, the period, the source end and the destination end of all data streams are determined.
The second type of data: that is, the triggered message data is mainly used for transmitting part of control data and status data, and the data is transmitted only when the data needs to be transmitted by the last trigger.
The third type of data: that is, the common data is mainly used for data maintenance and audio/video data transmission, and the requirements for real-time performance and certainty are not high. Each type of data may be divided into n priorities.
In addition, the present invention is characterized in that the scheduling time of all data on the train is globally managed. The equipment needing communication on the train network manages all the data sending moments uniformly, and for each data stream, the data is triggered to be sent and transmitted to a line at a specified moment; the device receiving the data must also receive the data at the specified time.
And, for a network device in the middle of communication (after data is received by the device, the data needs to be forwarded to other devices through a path algorithm, etc.), such as a switched network, each port of a switch is connected to a terminal device (data is initiated by the device, or the data is received by the device and then is not forwarded by the next hop), a certain port may have multiple data streams for data transmission and reception, and when multiple data streams exist, for data of the same type, data with high priority can preempt data with low priority to be forwarded preferentially, or data that comes first according to a time sequence is forwarded first.
Therefore, by classifying the data, allocating different bandwidths to the data and triggering the data to be sent and received by time, the control data which is greatly related to the train operation can be preferentially forwarded, and the real-time performance and the certainty of the control data are ensured; the transmission of common data which are irrelevant to the train operation, such as audio and video, broadcasting and the like, is carried out as much as possible.
The train network communication data scheduling control method of the present invention is specifically described below with reference to the accompanying drawings.
Fig. 1 is a schematic diagram illustrating data classification and time slice division of a train network communication data scheduling control method according to an embodiment of the present invention.
As shown in fig. 1, the method for controlling scheduling of train network communication data of the present invention includes:
dividing the train network communication Data into a plurality of types of Data, namely three types of Process Data (Process Data), Message Data (Message Data) and common Data, based on the Data characteristics and the transmission requirements;
dividing time of a communication schedule into time slices of minimum granularity, assuming that time T is taken as one time slice, each time slice is further divided into three sub-time slices T1, T2, T3 for process data, message data and normal data, wherein T1+ T2+ T3 ═ T, wherein a first sub-time slice T1, i.e., the process data time slice is at the top, a second sub-time slice T2, i.e., the message data time slice, and a third sub-time slice T3, i.e., the normal data time slice; and
the transmission of the respective types of data within each sub-time slice T1, T2, T3 is schedule controlled based on a first-in-first-out scheme and/or a prioritized scheme.
In practice, the main difference between process data and message data is that process data is periodic, and message size and period are both deterministic. The message data is non-periodically triggered, and the message size is uncertain and determined by the upper layer application.
Fig. 2 is a schematic diagram showing process data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the present invention.
As shown in fig. 2, for the first type of data, i.e., the process data, the smaller time slots T are divided again according to the priority within the first sub-time slice T1 where the process data is located, the width of each time slot T is divided according to the size of the data stream, the wider time slot is obtained when the number of data streams is large, and the fewer time slots are obtained when the number of data streams is small. For the terminal device, each piece of data must be transmitted within a specified time slot. For the network equipment needing to forward data in the middle, the data is received and then forwarded in a specified time slot according to the priority, when the same priority is not sent completely in the time slot, the high-priority network equipment can continue forwarding, the high-priority network equipment is allowed to preempt the low-priority time slot, but the low-priority network equipment is not allowed to preempt the high-priority time slot, and if the lowest priority is not sent completely, the network equipment is directly discarded. Therefore, to ensure that the process data is all sent and forwarded, its allocated time slice is larger than all time slot widths, and a certain margin Ty is reserved. And finally, ensuring that the sum of all time slots and time margins is T1.
For example, in a train network, since process data is periodic, there are 10 process data streams, and the process data streams are prioritized according to the importance level, and the lower the priority value, the higher the priority (priority 1 has the highest priority level). Where there are 2 data flows for priority 1(P ═ 1), 3 data flows for priority 2(P ═ 2), 5 data flows for priority 3(P ═ 3), and T1+ Ty1+ T2+ Ty2+ T3+ Ty3+ tn ═ T1.
Fig. 3 is a schematic diagram showing message data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the present invention.
As shown in fig. 3, for the second type of data, i.e., message data, all message data are triggered to be transmitted, and during the sub-time slice T2, all message data are sequentially transmitted or forwarded according to the priority ranking (P ═ 1, 2 … … n), and when data with high priority needs to be transmitted at a certain time, the data will be forwarded to all the front ranks with lower priority than the data. If the data is not in the sub-time slice T2, when some message data in the process data time slice T1 needs to be sent, the transmission is waited to the message data sub-time slice of the period, and some message data generated in the common data sub-time slice T3 needs to be sent, the message data is arranged in the message data sub-time slice T2 of the next period, and the arrangement order is arranged according to the priority from high to low.
Fig. 4 is a schematic diagram showing general data and sub-time slices thereof of a train network communication data scheduling control method according to an embodiment of the invention.
As shown in fig. 4, for the third type of data, i.e. normal data, all the normal data are transmitted in a first-in first-out (FIFO) manner, i.e. the data 1 that enters the time slice T3 first, and when all the normal data 1-9 in the sub-time slice T3 still cannot be transmitted, the last data 9, 10 are directly discarded and will not enter the time slice of the next cycle for transmission. If normal data is generated in the process data sub-time slice T1 or the message data sub-time slice T2, the normal data is arranged to wait for transmission in the normal data sub-time slice T3 of the present period, also in chronological order.
It should be noted that the specific values noted above are not fixed, and may be adjusted according to the network data flow requirements, for example, the priority level is not necessarily 3, and may be n. The number of data streams is not limited, and is given by way of example only.
The preferred embodiments of the present invention have been described above in detail, but the present invention is not limited to the above embodiments.
Alternatively, the data may be divided into more types (e.g., n data types), each of which is processed according to priority, first-in-first-out, etc.
Alternatively, time slice management may be performed only for data types (process data, message data, general data) without prioritization, and communication of data may be realized, for example, all process data is transmitted in T1, message data is transmitted in T2, and other data is transmitted in T3.
Alternatively, the normal data may be prioritized to ensure that high priority data is transmitted as much as possible and low priority data may be discarded.
In summary, the type of data type division, the number of priorities, and the implementation mode of each type can be combined in various ways, and the method of the invention is to place the process data at the most important position, and the real-time performance and the certainty of the process data must be ensured.
As described above, the present invention is characterized and advantageous in that the data to be communicated on the train network is classified, and scheduling management based on a combination of time triggering and priority is performed for each data classification, including:
the process data is transmitted periodically, smaller time slots are divided in the time slots, data with a certain priority is transmitted in each time slot, and a certain margin must be reserved. Any process data flow must be transmitted at a certain moment in the whole network, and must be transmitted only when the moment, so that the process data is controlled by time, and the process data has higher certainty under the condition of consistent transmission paths. Meanwhile, no message data or ordinary data transmission exists in the time slice, the data type can be guaranteed not to be influenced by other types of data, and the highest real-time performance and certainty are achieved.
The message data is transmitted in a triggering mode, data is transmitted in the time slice according to the priority, the priority of the high priority is transmitted in preference to the priority of the low priority, and the real-time performance of the high priority is guaranteed. If the message data which is not in the message data time slice needs to be sent, the message data must be transferred to the message data time slice in the current period or the next time polling period for transmission, so that the message data cannot lose the packet, and the method has higher real-time performance and certainty compared with the common data.
The common data is transmitted according to a first-in first-out mode, and the tail data is directly discarded when the time slice is not enough, so that the transmission of important process data and message data is not influenced, and the common data can be transmitted as much as possible.
Although the embodiments disclosed in the present application are described above, the descriptions are only for the convenience of understanding the present application, and are not intended to limit the present application. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure as defined by the appended claims.
Claims (10)
1. A train network communication data scheduling control method comprises the following steps:
dividing the train network communication data into a plurality of types of data based on the data characteristics and the transmission requirements;
dividing time of a communication schedule into time slices of minimum granularity, wherein each time slice is divided into a plurality of sub-time slices for each of the plurality of types of data; and
and scheduling and controlling the transmission of the multiple types of data in each of the multiple sub-time slices based on a first-in first-out mode and/or a priority sorting mode.
2. The method of claim 1, wherein the plurality of types of data comprises a first type of data, the plurality of sub-time slices comprises a preceding first sub-time slice, and wherein the first type of data is transmitted within the first sub-time slice according to a predetermined prioritization.
3. The method of claim 2, wherein the first sub-time slice is partitioned into a plurality of time slots based on a number of priorities, a width of each time slot being partitioned based on a size of a data stream, each time slot being used for transmission of a first type of data of the priority.
4. The method of claim 3, wherein when the transmission of the first type data of the same priority is not completed in the time slot in which the first type data of the same priority is located, the first type data of high priority can be transmitted continuously, and the first type data of high priority is allowed to preempt the time slot in which the first type data of low priority is located, but the first type data of low priority is not allowed to preempt the time slot in which the first type data of high priority is located, and the first type data of lowest priority is directly discarded if the transmission of the first type data of lowest priority is not completed.
5. The method of claim 1, wherein the plurality of types of data comprises a second type of data, the plurality of sub-time slices comprising a second sub-time slice subsequent to the first sub-time slice, wherein the second type of data is transmitted within the second sub-time slice according to a predetermined prioritization.
6. The method of claim 5, wherein if a certain second type of data generated within the first time slice requires transmission, waiting for transmission until a second sub-time slice of the cycle.
7. The method of any of claims 1-6, wherein the multiple types of data include a third type of data, the plurality of sub-time slices include a third sub-time slice after the second sub-time slice, wherein the third type of data is transmitted within the third sub-time slice according to a first-in-first-out manner.
8. The method as claimed in claim 7, wherein if a certain second type of data generated in the third sub-time slice needs to be transmitted, the data is arranged into the second sub-time slice of the next cycle in a sequence of priority levels from high to low.
9. The method of claim 8, wherein if all the third type data cannot be transmitted within the third sub-time slice, directly discarding the last data; and if the third type data is generated in the first sub time slice or the second sub time slice, arranging the data to be transmitted in a third sub time slice of the period according to the time sequence.
10. The method of any one of claims 1, 5, 7, wherein the first type of data is periodically transmitted process data for controlling the transmission of data, wherein the size, period, source and destination of all data streams are determined; the second type data is triggered message data which is used for transmitting partial control data and state data, and the data is transmitted only by last triggering when the data needs to be transmitted; and the third type data is common data and is used for data maintenance and audio and video data transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884876.5A CN110809012B (en) | 2018-08-06 | 2018-08-06 | Train network communication data scheduling control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810884876.5A CN110809012B (en) | 2018-08-06 | 2018-08-06 | Train network communication data scheduling control method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110809012A true CN110809012A (en) | 2020-02-18 |
| CN110809012B CN110809012B (en) | 2023-04-07 |
Family
ID=69487068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810884876.5A Active CN110809012B (en) | 2018-08-06 | 2018-08-06 | Train network communication data scheduling control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110809012B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114389954A (en) * | 2022-01-18 | 2022-04-22 | 中科边缘智慧信息科技（苏州）有限公司 | Data transmission control method and system based on fixed bandwidth |
| CN115412476A (en) * | 2021-05-29 | 2022-11-29 | 宝星智能科技(上海)有限公司 | Industrial field data routing controller |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020163933A1 (en) * | 2000-11-03 | 2002-11-07 | Mathilde Benveniste | Tiered contention multiple access (TCMA): a method for priority-based shared channel access |
| CN101075945A (en) * | 2006-05-19 | 2007-11-21 | 中国科学院沈阳自动化研究所 | Method for determining realtime Ethernet tlecommunication |
| CN102843390A (en) * | 2011-06-21 | 2012-12-26 | 中国科学院沈阳自动化研究所 | Ethernet deterministic data transmission method of data-oriented role |
| CN106911593A (en) * | 2015-12-23 | 2017-06-30 | 中国科学院沈阳自动化研究所 | A kind of industrial control network array dispatching method based on SDN frameworks |
-
2018
- 2018-08-06 CN CN201810884876.5A patent/CN110809012B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020163933A1 (en) * | 2000-11-03 | 2002-11-07 | Mathilde Benveniste | Tiered contention multiple access (TCMA): a method for priority-based shared channel access |
| CN101075945A (en) * | 2006-05-19 | 2007-11-21 | 中国科学院沈阳自动化研究所 | Method for determining realtime Ethernet tlecommunication |
| CN102843390A (en) * | 2011-06-21 | 2012-12-26 | 中国科学院沈阳自动化研究所 | Ethernet deterministic data transmission method of data-oriented role |
| CN106911593A (en) * | 2015-12-23 | 2017-06-30 | 中国科学院沈阳自动化研究所 | A kind of industrial control network array dispatching method based on SDN frameworks |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412476A (en) * | 2021-05-29 | 2022-11-29 | 宝星智能科技(上海)有限公司 | Industrial field data routing controller |
| CN114389954A (en) * | 2022-01-18 | 2022-04-22 | 中科边缘智慧信息科技（苏州）有限公司 | Data transmission control method and system based on fixed bandwidth |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110809012B (en) | 2023-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110601997B (en) | Time division multiplexing method for mixed flow fusion | |
| CN110493145B (en) | Caching method and device | |
| US9769075B2 (en) | Interference cognizant network scheduling | |
| US7230923B2 (en) | Time based packet scheduling and sorting system | |
| US7570654B2 (en) | Switching device utilizing requests indicating cumulative amount of data | |
| US9197570B2 (en) | Congestion control in packet switches | |
| CN109314673B (en) | Customer service transmission method and device | |
| US7933202B2 (en) | Bounded minimal latency for network resources without synchronization | |
| US9036654B2 (en) | Packet sharing data transmission system and relay to lower latency | |
| JP2023062077A (en) | Packet scheduling method, scheduler, network device, and network system | |
| EP4152703A1 (en) | Network control method and device | |
| CN110971538A (en) | Time-triggered transmission method supporting burst real-time data | |
| EP3032785B1 (en) | Transport method in a communication network | |
| CN110809012B (en) | Train network communication data scheduling control method | |
| US9756654B2 (en) | Timer-based scheme for user equipment queue state estimation | |
| CN113162789A (en) | Method, device, equipment, system and storage medium for adjusting service level | |
| US7990873B2 (en) | Traffic shaping via internal loopback | |
| CN109450817B (en) | Mixed scheduling method for time-triggered Ethernet multi-service message transmission | |
| Ternon et al. | FTT-openFlow, on the way towards real-time SDN | |
| WO2023123104A1 (en) | Message transmission method and network device | |
| CN114500520A (en) | Data transmission method, device and communication node | |
| CN110601744B (en) | Dispatching method for sending virtual link of AFDX (avionics full Duplex switched Ethernet) network | |
| KR101681613B1 (en) | Apparatus and method for scheduling resources in distributed parallel data transmission system | |
| EP4184887A1 (en) | Method for sending data packet, and network device | |
| US11968111B2 (en) | Packet scheduling method, scheduler, network device, and network system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |