CN111478838B - High-efficiency high-bandwidth communication method and system - Google Patents
High-efficiency high-bandwidth communication method and system Download PDFInfo
- Publication number
- CN111478838B CN111478838B CN202010272032.2A CN202010272032A CN111478838B CN 111478838 B CN111478838 B CN 111478838B CN 202010272032 A CN202010272032 A CN 202010272032A CN 111478838 B CN111478838 B CN 111478838B
- Authority
- CN
- China
- Prior art keywords
- communication
- data
- sent
- period
- priority
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/40143—Bus networks involving priority mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a high-efficiency high-bandwidth communication method, which is applied to a high-efficiency high-bandwidth communication system, and the communication system comprises: each communication device is provided with a unique physical ID; and periodically communicating via a communication link; the method comprises the following steps: the communication equipment sends data frames in sequence according to the priority of the data in each communication period; when the equipment sends a data frame, declaring whether data are sent in the next communication period in the data frame, and informing the priority of the data; in each communication cycle, the device without data to be sent declares whether the data to be sent and the priority of the data exist in the next communication cycle after other devices with data to be sent finish sending; and after obtaining the physical IDs of the senders of all the data frames in the communication period and the corresponding priorities of the data to be sent, each device judges the data sending time point of the device of the next communication period.
Description
Technical Field
The invention belongs to the field of communication and industrial control automation, and particularly relates to a high-efficiency and high-bandwidth communication method and system.
Background
The existing industrial network communication buses and mechanisms are various, and typical mechanisms include master-slave communication, arbitration communication and distributed communication, such as POWERLINK, CAN, EPA and the like. However, these communication buses cannot fully utilize the network bandwidth due to mechanism limitations. POWERLINK adopts a master-slave type question-answering mechanism for communication, and each data interaction needs to be carried out between a master and a slave in a handshake manner, so that data transmission needs to be carried out twice in one data interaction, and only half of the bandwidth of the data is effective data. The CAN adopts an arbitration mechanism, uncertainty exists, and the device arbitration backoff and the bandwidth waste are large. The EPA adopts distributed communication, a fixed time slot is allocated to each device, and each device spontaneously sends data at corresponding time, so that the defect of master-slave communication is overcome, but as each device does not have data to interact in all communication periods, only invalid and repeated data can be sent and received in the fixed time slot, and bandwidth waste is also caused.
Existing implementations for communication resource allocation are closer to CN110336727A and CN 101719876B. The CN110336727A performs node resource scheduling by sending and receiving a resource request message, a reserved resource issue message, or a dynamic bandwidth issue message between a control node and a terminal node. The method needs a control node, and the risk of the breakdown of the whole network due to the failure of the control node exists. The bandwidth is occupied when the messages such as resource requests, reserved resource issuing and the like are transmitted and received, the types of the messages are various, and the use and the maintenance of users and engineers are complicated. In addition, the method is only suitable for ring and bus topological structures, and the application scene is small. CN101719876B refers to a method of combining small packets into large packets by dividing the network into multiple stages, thereby saving the transmission bandwidth of multiple headers generated by sending multiple small ethernet packets separately. Whether the inter-node transmission is in sequence according to pre-allocated time slices. The fixed time slice transmission of the method has the defects of EPA distributed communication mentioned above, and meanwhile, the method and the device can only transmit in sequence, and the data with different priorities cannot be dynamically adjusted in sequence. In addition, due to the time-sharing scheduling mechanism of the method, all devices need to be strictly synchronized, and if the synchronization is not achieved, the communication is collided.
Disclosure of Invention
In view of the defects in the prior art, the present invention aims to provide a method and a system for efficient and high-bandwidth communication.
The technical scheme of the invention is as follows:
an efficient high-bandwidth communication method applied to an efficient high-bandwidth communication system, the communication system comprising: each communication device is provided with a unique physical ID; each communication device periodically communicates through a communication link; the method comprises the following steps:
each communication device sends data frames in sequence according to the priority of the data to be sent in each communication period;
when the communication equipment sends a data frame, declaring whether data are sent in the next communication period in the data frame, and informing the priority of the data;
in each communication cycle, the communication device without data to be sent declares whether the data to be sent and the priority of the data exist in the next communication cycle after other communication devices with data to be sent finish sending;
and each communication device receives all the sent data frames in the communication period, and judges the data sending time point of the device of the next communication period after acquiring the physical IDs of the senders of all the data frames in the communication period and the corresponding priorities of the data to be sent.
Optionally, the data frame sent by the communication device at least includes: a physical ID field, a priority PRI field of data to be transmitted and a data frame length LEN field.
Optionally, "in each communication cycle, a communication device without data to be sent declares whether data is to be sent and the priority of the data in the next communication cycle after other communication devices with data to be sent have sent; "further includes:
in each communication period, the communication device with data to be sent sends a data frame first, and after the communication devices send the data frame, the communication device without data to be sent only sends a data frame with a small length to declare whether the next communication period has data to be sent and the priority of the data.
Optionally, "the communication devices receive all sent data frames in a communication cycle, and determine a data sending time point of a device of a next communication cycle by obtaining physical IDs of senders of all data frames in the communication cycle and corresponding priorities of data to be sent. "further includes:
after receiving and collecting the sender physical IDs of all data frames in the current communication period and the corresponding priority of data to be sent, each communication device judges that the communication device is the first sending device in the next communication period, determines a preset Timeout time Timeout according to a sending sequence, records the physical ID of the device which is closest to the communication device and is sent before the communication device in the next communication period, and records the ID as Pre-ID; wherein:
the preset Timeout is the longest waiting time from the current moment of the communication period to the time when the self equipment starts to send the data frame; if the own device is the nth device to be sent in the communication cycle, the preset Timeout is (n-1) × T, T is the time required for sending a longest data frame specified in a protocol based on communication, and n is an integer greater than 1;
after all the devices finish receiving data of all the devices in the current communication period, judging that the transmission sequence is calculated and the Timeout time is preset, entering the next communication period, and starting a new communication period; the preset Timeout is updated again after each device in the communication cycle transmits data.
Alternatively, in one communication cycle, the communication device that transmits the data frame first does not have a Pre-ID value, and the Pre-ID value thereof may be set to 0.
Optionally, the method further comprises:
when the data priorities of the data to be sent by the multiple communication devices are consistent, arbitration can be performed according to the physical IDs of the communication devices to determine the sequence of sending the data frames by each communication device with the same priority.
Optionally, the "communication link" is one of ethernet, CAN, BLVDS, RS485, and optical fiber.
Optionally, the data frame further includes: a field for alerting the network or a field for notifying fault information.
An efficient high bandwidth communication system comprising:
each communication device is provided with a unique physical ID; the communication devices communicate periodically via a communication link using the method of any one of the preceding claims.
Compared with the prior art, the invention has the following beneficial effects:
the equipment in the network sends data in sequence according to the urgency of the data, namely the priority level of the data, in each communication period. The data with high priority is sent first, and the data with low priority is sent later. Data interaction between devices does not generate conflict. And simultaneously, each device in each communication period automatically analyzes and calculates the time node required to be sent in the next communication period.
By the method, each communication period is not fixed, more data is long, and less data is short. Communication bandwidth is saved to the maximum extent, and bandwidth utilization rate is improved.
Meanwhile, based on the method of the invention, the network communication devices do not need to be synchronized, and no additional resource allocation message is needed to be sent, thereby saving the workload of each link of development, maintenance, use and the like.
In addition, the invention supports network topologies such as star type and bus type.
The invention solves the defects of low bandwidth utilization rate, inflexible resource scheduling, inconvenient development and use and the like of the existing industrial network communication, and ensures that the industrial network communication has higher real-time performance and usability.
The data frame of the present invention may be added with other fields as needed to satisfy the availability and reliability of network communication, such as an alarm field.
The device in the invention prestores the device ID which is sent in the next communication period and is closest to the device and is sent before the device, the device can not be limited to the Pre-ID, and more previous device IDs can be recorded according to the requirement to judge more device disconnection.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a schematic diagram of a network topology of an efficient high bandwidth communication system in accordance with an embodiment of the present invention;
fig. 2 is a schematic diagram of a data frame structure transmitted by a communication device according to an embodiment of the present invention;
fig. 3 is a schematic diagram of data scheduling of communication devices in the first 5 communication cycles after the power on of the communication system in the embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
The embodiment discloses a high-efficiency high-bandwidth communication method, which is applied to a high-efficiency high-bandwidth communication system, and the communication system comprises: each communication device is provided with a unique physical ID; the communication devices periodically communicate (such as data acquisition scanning, transmission interaction, response execution and the like) through the communication link.
Wherein the method comprises the following steps:
each communication device sends data frames in sequence according to the priority of the data to be sent in each communication period; when the data priorities of the data to be sent by the multiple communication devices are consistent, arbitration may be performed according to a certain rule (for example, the size of the physical ID of each communication device) to determine the sequence of sending the data frames by each communication device at the same priority.
When the communication equipment sends a data frame, declaring whether data are sent in the next communication period in the data frame, and informing the priority of the data;
in each communication cycle, the communication device without data to be sent declares whether the data to be sent and the priority of the data exist in the next communication cycle after other communication devices with data to be sent finish sending;
and each communication device receives all the sent data frames in the communication period, and judges the data sending time point of the device of the next communication period after acquiring the physical IDs of the senders of all the data frames in the communication period and the corresponding priorities of the data to be sent.
The data frame sent by the communication equipment at least comprises: a physical ID field, a priority PRI field of data to be transmitted and a data frame length LEN field. The data frame CAN be in various forms of data frame formats such as an Ethernet message, a CAN message, a serial transmission protocol message and the like.
Wherein, in each communication cycle, the communication device without data to be sent declares whether the data to be sent and the priority of the data exist in the next communication cycle after the other communication devices with data to be sent finish sending; "further includes:
in each communication period, the communication device with data to be sent sends a data frame first, and after the communication devices send the data frame, the communication device without data to be sent only sends a data frame with a small length to declare whether the next communication period has data to be sent and the priority of the data.
Wherein, each communication device receives all sent data frames in a communication cycle, and determines the data sending time point of the device of the next communication cycle by obtaining the physical IDs of the senders of all data frames in the communication cycle and the corresponding priorities of the data to be sent. "further includes:
after receiving and collecting the physical IDs of the sending parties of all data frames in the current communication period and the corresponding priorities of the data to be sent, each communication device determines that it is the first sending device in the next communication period, determines a preset Timeout according to the sending order, records the ID of the device that is closest to the device and is sent before the device in the next communication period, and records the ID as Pre-ID (where the device that sends first has no Pre-ID value, which can be set to 0). Wherein:
the preset Timeout is the longest waiting time (which may also be referred to as the maximum conservative estimation time) from the current time of a communication cycle (the current time may be started in each communication cycle, and after a device sends data in the communication cycle) to the time when the device starts sending data frames; if the own device is the nth device to be transmitted in the communication cycle, the preset Timeout time Timeout is (n-1) × T, where T is the time required for transmitting one longest data frame specified in a protocol based on communication; n is an integer greater than 1.
After all the devices finish receiving the data of all the devices in the current communication period, the next communication period is entered after the transmission sequence is judged to be calculated and the Timeout time Timeout is preset, and a new communication period starts. The preset Timeout is updated again after each device in the communication cycle transmits data.
For example, when communication starts, the preset Timeout time Timeout of the nth sending device a is (n-1) × T, and after the 1 st device sends data, the device a is in the (n-1) th remaining devices to be sent, the preset Timeout time Timeout of the device a is (n-2) × T, and so on.
When entering the next period, the communication device to be sent with the data frame with the highest priority sends the data frame first, and other communication devices to be sent judge the time for sending data by themselves according to the physical ID, the length LEN and the Pre-stored Pre-ID in the data frame sent by the current device, that is, judge whether to turn to send the next data frame by itself according to the physical ID and the Pre-stored Pre-ID in the data frame sent by the current device, and judge whether to finish sending by the current device according to the length LEN of the data frame and the length of the currently received data.
The communication device to be sent starts timing after the new communication period starts, if the timing time reaches the preset Timeout value, the Pre-ID communication device does not send out the data frame, the communication device to be sent determines that the communication device is disconnected or failed, and then the communication device to be sent starts sending the data frame. Meanwhile, the device located behind the device to be sent is also timing, and when the device to be sent sends data, the timing of the rest devices does not meet the preset timeout time. When the remaining devices receive the data of the device to be sent, the timing of the remaining devices will be restarted. Meanwhile, the preset timeout time of the other devices is adjusted and calculated according to the transmission sequence of the remaining devices in the current communication cycle.
This embodiment also discloses a high-efficient high-bandwidth communication system, including: each communication device is provided with a unique physical ID; the communication devices communicate periodically via a communication link using the method described above.
As shown in fig. 1, in this embodiment, a physical topology of the communication system is a star network topology, and includes 5 communication devices, physical IDs are 1 to 5, and the 5 communication devices communicate through a switching device/network serving as a communication link. It should be noted that the physical topology of the communication system may also be a bus-type topology or the like, and the present invention is not limited thereto.
The communication device can be a controller, an actuating mechanism, a transmitter or a data collector.
The physical ID may be an Ethernet MAC ID, IP, DEVICE ID, or other various identification numbers that may be used to identify the distinguishing DEVICE.
The communication link here may be any of ethernet, CAN, BLVDS, RS485, fiber, etc.
And after the system is powered on and all the devices are configured, entering a communication state. The configuration process is not limited in form, but each device needs to maintain the physical IDs of all devices currently in the network. As shown in fig. 3 in this embodiment, the network communication scheduling process of this embodiment is specifically as follows:
in the first communication period, all the devices do not send essential data, all the devices send null data frames in sequence from small to large according to the local physical ID, each device identifies the priority PRI of data to be sent in the next communication period in the data frames, the PRI of 0 indicates that no data is sent, the PRI value is 1-255 indicates that data is sent, the priority is a current non-0 value, and the smaller the value is, the higher the priority is. The data frame format is shown in fig. 2.
The null data frame includes: a physical ID field (destination ID, source ID), a priority PRI field (PRI) of data to be sent, a data frame length LEN field (LEN), and a check value field; the non-null data frame includes: a physical ID field (destination ID, source ID), a priority PRI field (PRI) of DATA to be transmitted, a DATA frame length LEN field (LEN), a DATA field (DATA), and a check value field; the null data frame is distinguished from the non-null data frame in that the LEN field of the null data frame is 0, and is directly followed by a check value, without data, and the entire length of the data frame is controlled to be the shortest. The LEN field of a non-null DATA frame indicates the length of the DATA portion followed. Both null and non-null data frames have a PRI assertion field to indicate whether there is data to send in the next communication cycle. All the devices receive the data frame in the communication period, compare the priority, judge that the devices are the devices which are sent in the next communication period, determine a preset Timeout time Timeout according to the sending sequence, record the device ID which is closest to the devices and is sent before the devices in the next communication period, and record the ID as Pre-ID (wherein the device which is sent first has no Pre-ID value, and the value can be set as 0). The judgment rule is as follows: the ID with high data priority is sent first, and when the priority is the same, the ID with small value is sent first.
And after all the devices in the first communication period sequentially send data frames, the device enters a second communication period, under a normal condition, the device with the highest priority to send the data frames firstly sends the data frames, other devices to send judge the time for sending data by the device according to the physical ID, the length LEN and the Pre-stored Pre-ID in the data frames sent by the current device, namely, the device judges whether the next data frame is sent by the device according to the physical ID and the Pre-stored Pre-ID in the data frames, the device judges whether the sending of the current device is finished according to the length LEN of the data frames and the currently received data length, and if the sending of the current device is finished, the next device to send the local data frames.
As shown in fig. 3, the devices 1 to 5 in the first period sequentially transmit null data frames, and the device 1, the device 2, and the device 3 respectively declare that data with priorities of 1, 2, and 1 are to be transmitted in the next communication period. Device 4 and device 5 declare that the next cycle has no data to send. In the second communication period, the device 1 with the highest priority and the smallest ID transmits the data frame first, then the device 2 with the same priority as 1 and the smallest ID transmits the data frame, and finally the device 2 with the lowest priority transmits the data frame. After all devices with data to be transmitted finish transmitting, other devices 4 and 5 without data to be transmitted start to transmit null data frames to declare whether data is transmitted in the next communication period. The second cycle, device 3 and device 5 declare that data with priority 2 and 1, respectively, are to be transmitted, and the other devices have no data to transmit. Thus, in the third cycle, the device 5 with the highest priority transmits first and the device 3 second. And when the device 3 finishes sending, the device 1, the device 2 and the device 4 which have no data to send null data frames in sequence from small to large according to the ID to declare whether the next communication period has data to send. And by analogy, all devices periodically transmit and receive data according to the mechanism in each period. Through the embodiment, the communication cycle time T1-T5 of each cycle dynamically changes according to the data quantity and the data size sent by the equipment, so that the bandwidth is saved to the maximum extent, and the real-time performance of communication is improved.
In the communication process, the Timeout time Timeout is introduced in consideration of the fact that the data frame transmission of the following device is affected by the condition of device disconnection or failure. The communication equipment to be sent starts timing after the new communication period starts, if the timing time reaches the preset Timeout value, the Pre-ID communication equipment does not send out the data frame, the connection is determined to be dropped or the fault is determined, and the equipment to be sent then starts to send the data frame. Of course, if a situation that a plurality of devices are dropped simultaneously is considered, in order to enhance the robustness of the network, the devices may record more than Pre-ID, and record more previous device IDs may determine that more devices are dropped. Meanwhile, the modes of equipment redundancy and link redundancy can be adopted, and the robustness of network communication is improved. Further, if the communication system is better operated, the data frame of the embodiment may open a field for alarming the network or a field for notifying fault information, for alarming the network, for notifying fault information such as a dropped line in the network or an ID of a faulty device.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.
Claims (9)
1. An efficient high-bandwidth communication method, applied to an efficient high-bandwidth communication system, the communication system comprising: each communication device is provided with a unique physical ID; each communication device periodically communicates through a communication link; the method comprises the following steps:
each communication device sends data frames in sequence according to the priority of the data to be sent in each communication period;
when the communication equipment sends a data frame, declaring whether data are sent in the next communication period in the data frame, and informing the priority of the data;
in each communication cycle, the communication device without data to be transmitted transmits a null data frame after the other communication devices with data to be transmitted finish transmitting, and then declares whether the next communication cycle has data to be transmitted and the priority of the data;
and each communication device receives all the sent data frames in the communication period, and judges the data sending time point of the device of the next communication period after acquiring the physical IDs of the senders of all the data frames in the communication period and the corresponding priorities of the data to be sent.
2. The method of claim 1, wherein the data frames transmitted by the communication device include at least: a physical ID field, a priority PRI field of data to be transmitted and a data frame length LEN field.
3. The method of claim 1,
in each communication cycle, the communication device without data to be transmitted transmits a null data frame after the other communication devices with data to be transmitted finish transmitting, and then declares whether the next communication cycle has data to be transmitted and the priority of the data further comprises:
in each communication period, the communication device with data to be sent sends a data frame first, and after the communication devices send the data frame, the communication device without data to be sent only sends a null data frame to declare whether the next communication period has data to be sent and the priority of the data.
4. The method as claimed in claim 2, wherein each communication device receives all transmitted data frames in a communication cycle, and after obtaining the physical IDs of the transmitters of all data frames in the communication cycle and the corresponding priorities of the data to be transmitted, determines the data transmission time point of its own device in the next communication cycle further comprises:
after receiving and collecting the sender physical IDs of all data frames in the current communication period and the corresponding priority of data to be sent, each communication device judges that the communication device is the first sending device in the next communication period, determines a preset Timeout time Timeout according to a sending sequence, records the physical ID of the device which is closest to the communication device and is sent before the communication device in the next communication period, and records the ID as Pre-ID; wherein:
the preset Timeout is the longest waiting time from the current time of a communication cycle to the start of sending a data frame by the device of the device, wherein the current time of the communication cycle includes the start of each communication cycle and two conditions after a certain device sends data in the communication cycle; if the own device is the nth device to be sent in the communication cycle, the preset Timeout is (n-1) × T, T is the time required for sending a longest data frame specified in a protocol based on communication, and n is an integer greater than 1;
after all the devices finish receiving data of all the devices in the current communication period, judging that the transmission sequence is calculated and the Timeout time is preset, entering the next communication period, and starting a new communication period; the preset Timeout is updated again after each device in the communication cycle transmits data.
5. The method as claimed in claim 4, wherein the Pre-ID value of the communication device which transmits the data frame first is set to 0 during one communication period.
6. The method of claim 1, further comprising:
when the data priorities of the data to be sent by the multiple communication devices are consistent, arbitration can be performed according to the physical IDs of the communication devices to determine the sequence of sending the data frames by each communication device with the same priority.
7. The method of claim 1, wherein the "communication link" is one of ethernet, CAN, BLVDS, RS485, fiber.
8. The method of claim 2, wherein the data frame further comprises: a field for alerting the network or a field for notifying fault information.
9. An efficient high bandwidth communication system, comprising:
each communication device is provided with a unique physical ID; the respective communication devices communicate periodically via a communication link using the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010272032.2A CN111478838B (en) | 2020-04-08 | 2020-04-08 | High-efficiency high-bandwidth communication method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010272032.2A CN111478838B (en) | 2020-04-08 | 2020-04-08 | High-efficiency high-bandwidth communication method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111478838A CN111478838A (en) | 2020-07-31 |
| CN111478838B true CN111478838B (en) | 2021-12-21 |
Family
ID=71751206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010272032.2A Active CN111478838B (en) | 2020-04-08 | 2020-04-08 | High-efficiency high-bandwidth communication method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111478838B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101133391A (en) * | 2005-02-04 | 2008-02-27 | 美普思科技有限公司 | Bifurcated thread scheduler in a multithreading microprocessor |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
| CN109479302A (en) * | 2016-07-07 | 2019-03-15 | 松下电器（美国）知识产权公司 | The improved semi-continuous resource allocation behavior sent for V2X |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI101920B (en) * | 1996-06-07 | 1998-09-15 | Nokia Telecommunications Oy | Channel reservation procedure for a packet network |
| CN100488151C (en) * | 2003-06-18 | 2009-05-13 | 索尼电子有限公司 | Method and apparatus for non-centralized network bandwidth management |
| CN100424605C (en) * | 2006-04-04 | 2008-10-08 | 西安电子科技大学 | Intelligent management apparatus and management method for distributed control network based on CAN bus |
| CN104618261B (en) * | 2015-02-13 | 2018-06-01 | 上海交通大学 | Reformation dispatching method in avionics system network |
| CN106878132B (en) * | 2017-02-16 | 2020-01-07 | 北京中航通用科技有限公司 | Bus scheduling method based on period and priority |
-
2020
- 2020-04-08 CN CN202010272032.2A patent/CN111478838B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101133391A (en) * | 2005-02-04 | 2008-02-27 | 美普思科技有限公司 | Bifurcated thread scheduler in a multithreading microprocessor |
| CN109479302A (en) * | 2016-07-07 | 2019-03-15 | 松下电器（美国）知识产权公司 | The improved semi-continuous resource allocation behavior sent for V2X |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111478838A (en) | 2020-07-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10020958B2 (en) | Can fd | |
| US5359594A (en) | Power-saving full duplex nodal communications systems | |
| CN110830276B (en) | EtherCAT communication system and method based on cold redundancy mechanism | |
| JP7512531B2 (en) | Wireless communication method and system for node equipment in the Internet of Things for power transmission and transformation equipment | |
| JPH0683221B2 (en) | Data communication method and communication system | |
| CN105577308A (en) | Method and apparatus for providing in-vehicle network time synchronization using redundant grandmaster | |
| KR20140113335A (en) | Power saving for low latency deterministic networks in wireless personal area networks | |
| US11316654B2 (en) | Communication device and method for operating a communication system for transmitting time critical data | |
| JP2523882B2 (en) | Data transmission equipment | |
| EP2140622B1 (en) | Token bus communication system | |
| CN101217445B (en) | A method of loop generation protection and Ethernet ring system | |
| CN109981404B (en) | Ad hoc network structure and diagnosis method thereof | |
| JP4727062B2 (en) | Elevator communication control device | |
| CN113940038B (en) | Subscriber station for a serial bus system and method for communication in a serial bus system | |
| CN111478838B (en) | High-efficiency high-bandwidth communication method and system | |
| CN101237319B (en) | Time synchronization method in Ethernet ring network and Ethernet ring system | |
| CN113994638B (en) | Subscriber station for a serial bus system and method for communication in a serial bus system | |
| CN109586978B (en) | Bus topology network ad hoc network method | |
| KR100605985B1 (en) | Initial Contection Signaling Method for Synchro-Ethernet Device | |
| JP3777809B2 (en) | Method for detecting line abnormality in duplex communication system | |
| JP3948330B2 (en) | Interconnect equipment between different networks | |
| JP5847002B2 (en) | Communication system, subscriber side device, station side device, and power saving control method | |
| CN100574288C (en) | The data link layer device that is used for serial communication bus | |
| CN109327440B (en) | Data transmission method of data client and multi-data server based on time slices | |
| JP2000269993A (en) | Data transmission method and transmitter |
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 |