CN114401227B - Data forwarding method and device - Google Patents
Data forwarding method and device Download PDFInfo
- Publication number
- CN114401227B CN114401227B CN202111580906.1A CN202111580906A CN114401227B CN 114401227 B CN114401227 B CN 114401227B CN 202111580906 A CN202111580906 A CN 202111580906A CN 114401227 B CN114401227 B CN 114401227B
- Authority
- CN
- China
- Prior art keywords
- data
- queue
- deterministic
- queues
- packet
- 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
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000005540 biological transmission Effects 0.000 claims abstract description 36
- 238000004590 computer program Methods 0.000 claims 2
- 238000007493 shaping process Methods 0.000 abstract description 6
- 125000004122 cyclic group Chemical group 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
-
- 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/2408—Traffic characterised by specific attributes, e.g. priority or QoS for supporting different services, e.g. a differentiated services [DiffServ] type of service
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a data forwarding method and a device, wherein the data forwarding method comprises the following steps: the router receives a data packet sent by a previous node; the data packet comprises transmission path information of the data and a queue packet sequence number; the router forwards the data packet to a router outlet according to the transmission path information, and forwards the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the router forwards the message to the next node according to a deterministic network mechanism; the invention divides the exit queue into a plurality of groups by defining the exit shaping mechanism at the exit port of the router, and each group of queues forwards data with a specific time slot length, so that the system can work with a plurality of time slot lengths at the same time, realize the simultaneous guarantee of a plurality of service qualities and adapt to the coexistence scene of a plurality of multi-service flows with different service quality requirements.
Description
Technical Field
The present invention relates to the field of network communications, and in particular, to a data forwarding method and apparatus.
Background
The existing large-scale deterministic network technology realizes the end-to-end deterministic service quality guarantee through a hop-by-hop cyclic forwarding mechanism, namely, the transmission delay and jitter between a source node and a destination node are determined and controllable, and an upper bound exists. In deterministic networks, all nodes divide time into equal length time slots. And establishing a time slot mapping relation between each pair of neighbor nodes by measuring the longest transmission delay in advance. The deterministic network ensures deterministic end-to-end transmission by establishing a hop-by-hop time slot mapping and forwarding relationship, so that the time delay and jitter between the transmission of a data packet from a source node and the reception of a destination node can be ensured to be controllable, and the deterministic network has an upper bound.
However, the quality of service of large scale deterministic network technology is severely dependent on the slot length. The end-to-end delay and the time slot length form a positive correlation, and the maximum value of the delay jitter is twice the time slot length. Therefore, in the practical application process, the existing large-scale deterministic network technology has the following defects:
service scenes with various service quality requirements cannot be supported at the same time, for example, the AR service requires time delay within 2 milliseconds, and the remote industrial control requires time delay within 500 microseconds. Under the prior art, the network cannot simultaneously meet the service quality requirements of the AR and the remote industrial control.
Ultra-low latency transmission cannot be achieved. Existing deterministic networks require that the slot length be greater than or equal to the ratio of the maximum length of the data packets in the network to the minimum bandwidth of the links in the network. Because the end-to-end delay and the time slot length are in positive correlation and a lower bound exists, the performance of the prior art in a low-delay scene is not satisfactory.
Disclosure of Invention
In order to solve the above problems, the present invention provides a data transmission method and apparatus capable of simultaneously operating with a plurality of slot lengths to realize simultaneous guarantee of a plurality of service qualities.
In order to achieve the above object, an aspect of the present invention provides a data forwarding method, including:
the router receives a data packet sent by a previous node; the data packet comprises transmission path information of the data and a queue packet sequence number;
the router forwards the data packet to a router outlet according to the transmission path information, and forwards the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the packet comprises at least one deterministic traffic group and at least one best effort traffic group;
and the router forwards the message to the next node according to a deterministic network mechanism.
As a preferred solution, the deterministic traffic group comprises at least three queues and the best effort traffic group comprises at least one queue.
As a preferable technical scheme, only one queue in the same deterministic traffic group is in a data transmission state at the same time, and the other queues are in a data receiving state.
As a preferred technical solution, the time slot length of each queue in the same deterministic traffic group is the same, the time slot lengths between the queues in different deterministic traffic groups are different, and the time slot length in each queue is greater than or equal to the ratio of the data packet size to the minimum bandwidth of the link in the network.
As a preferred solution, when the number of deterministic traffic groups is greater than 1, the slot lengths of all queues in the latter deterministic traffic group are positive integer multiples of the slot lengths of the queues in the former deterministic traffic group.
As a preferred solution, queues in the same deterministic traffic group are clocked at the superslot level.
As a preferred solution, the forwarding priority of the queues of the deterministic traffic group is higher than the forwarding priority of the queues of the best effort traffic group.
As a preferred technical solution, when the number of deterministic traffic groups is greater than 1, the forwarding priority of the queues in the former deterministic traffic group is higher than the forwarding priority of the queues in the latter deterministic traffic group.
As a preferred solution, the queue packet sequence number is determined by the controller according to the service type of the data packet and the time slot length used by the current node.
On the other hand, the invention also provides a data forwarding device, which comprises:
a receiving unit, configured to receive a data packet sent by a previous node; the data packet comprises transmission path information of the data and a queue packet sequence number;
the processing unit is used for forwarding the data packet to a router outlet by the router according to the transmission path information and forwarding the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the packet comprises at least one deterministic traffic group and at least one best effort traffic group;
and the forwarding unit is used for forwarding the message to the next node according to a deterministic network mechanism.
In the above data forwarding apparatus, preferably, the deterministic traffic group includes at least three queues, and the best effort traffic group includes at least one queue.
In the above data forwarding apparatus, preferably, only one queue in the same deterministic traffic group is in a data transmission state and the other queues are in a data reception state at the same time.
In the above data forwarding device, preferably, the time slot length of each queue in the same deterministic traffic group is the same, the time slot lengths between the queues in different deterministic traffic groups are different, and the time slot length in each queue is greater than or equal to the ratio of the data packet size to the minimum bandwidth of the link in the network.
In the above data forwarding apparatus, preferably, when the number of deterministic traffic groups is greater than 1, the slot lengths of all queues in the latter deterministic traffic group are positive integer multiples of the slot lengths of the queues in the former deterministic traffic group.
As a preferable technical solution, the data forwarding device further includes a synchronization unit, configured to perform clock synchronization on queues in the same deterministic traffic group at a superslot level.
Compared with the prior art, the invention has the beneficial effects that: the invention divides the exit queue into a plurality of groups by defining the exit shaping mechanism at the exit port of the router, and each group of queues forwards data with a specific time slot length, so that the system can work with a plurality of time slot lengths at the same time, realize the simultaneous guarantee of a plurality of service qualities and adapt to the coexistence scene of a plurality of multi-service flows with different service quality requirements.
In addition, the time slot length in each queue is larger than or equal to the ratio of the data packet size to the minimum bandwidth of the link in the network, so that the time delay in the data forwarding process is low and the reliability is high.
Drawings
FIG. 1 is a diagram illustrating an outbound router port queue shaping mechanism according to one embodiment of the present invention;
fig. 2 is a flowchart of a data forwarding method according to an embodiment of the present invention;
fig. 3 is a block diagram of a data forwarding device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The data forwarding method provided in this embodiment is formed based on a router egress queue shaping mechanism, where the router egress shaping mechanism described in this embodiment refers to setting two types of packets at the router egress, and referring to fig. 1, a packet includes at least one deterministic traffic group and at least one best effort traffic group, where the two types of packets include n×m+l queues, where n×m queues are reserved for the deterministic traffic group and L queues are reserved for the best effort forwarding traffic group. Wherein the N x M queues reserved for deterministic traffic flows are divided into N groups, each group containing M queues.
Further, the M queue packets each perform cyclic queue forwarding of the data packets at different slot lengths. Let the time slot length of the mth packet work be delta m { delta } 1 ,…,Δ m The relationship is satisfied: delta k+1 ＝m k Δ k K= {1, …, M-1}, where M k Is a positive integer. Superslot length delta hc ＝NΔ M 。
It should be noted that, in this embodiment, the slot length is greater than or equal to the ratio of the packet size to the maximum value of all application packet sizes in the network.
The following describes a data forwarding method provided in this embodiment with reference to fig. 2, where the data forwarding method includes the following steps:
s10: the router receives a data packet sent by a previous node; the data packet comprises transmission path information of data and a queue packet sequence number;
specifically, after the source node submits a data transmission request to the controller, the controller generates corresponding configuration parameters according to the current network resource utilization condition, wherein the configuration parameters comprise a transmission path and a queue packet sequence number, and the configuration parameters are returned to the source node after being generated. The source node then sends the data packet to the downstream router according to the configuration parameters.
It should be noted that, the transmission path is generated by the controller according to the current network resource utilization condition, and the specific generating method belongs to the prior art means in the field, so that the description is omitted here.
In addition, the queue packet sequence number is determined by the controller according to the service type of the data packet and the time slot length used by the current node, for example, the data packet belongs to a deterministic service flow group, and is determined according to the time slot length used by the current node as to which group the data packet is specifically allocated, because the time slot lengths corresponding to each deterministic service flow group are different, and therefore, the time slot length used by the current node is allocated to which group.
The choice of the packet at the egress is based on the QoS requirements of the traffic flow and the slot length of the packet. Different slot lengths mean that the data packets are buffered at different times in (the egress queues of) the nodes. Therefore, if the end-to-end delay/jitter requirement of the service flow is strict, the service flow should be allocated to the queue packet with smaller time slot length; and vice versa.
S20: the router forwards the data packet to a router outlet according to the transmission path information, and forwards the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number;
specifically, after the router receives the data packet, the data packet is parsed, so that transmission path information and queue packet sequence number information contained in the data packet are obtained, then the data packet is forwarded to a corresponding packet according to the queue packet sequence number, and the packet is forwarded according to the existing deterministic network mechanism.
S30: and the router forwards the message to the next node according to a deterministic network mechanism.
It should be understood that the deterministic network mechanism refers to a cyclic forwarding mechanism hop by hop, so as to realize end-to-end deterministic quality of service guarantee, that is, transmission delay and jitter between a source node and a destination node are determined to be controllable, and an upper bound exists.
It should be noted that, in the forwarding process, the forwarding priority of the queues in the deterministic traffic group is higher than the forwarding priority of the queues in the best effort traffic group, and for the queues in the deterministic traffic group, the priority of the queues in the packet m is higher than the priority of the queues in the packet m+1, that is, the forwarding priority of the queues in the deterministic traffic group of the previous group is higher than the forwarding priority of the queues in the deterministic traffic group of the next group. In addition, high priority queue transmissions may preempt low priority queue transmissions; the preempted low priority transmission resumes transmission operation after the high priority transmission is completed.
In addition, in the forwarding process, the queues in the same deterministic traffic flow group need to be clock synchronized, and for the inside of the same queue packet (i.e., the N queues belonging to the same packet), each queue works according to the existing deterministic network circular queue forwarding mode. That is, at any time, only one queue is in the data transmission state within the packet, and the other queues are in the data reception state. Within the mth packet, the cyclically forwarded slot length is delta k . The time slot is set to be equal to the starting time of the superslot of each packet, and it should be noted that, in this embodiment, the superslot is related to the number of queues and the slot length of the last deterministic traffic group, and the value is the product of the two.
Due to the cyclic slot lengths of the respective queues in this embodimentLen ull BW is the minimum bandwidth of links in the network for packet size. In general, len ull Much smaller than Len. The slot length in this embodiment is thus much smaller than that of the existing deterministic network, thereby achievingThe communication is low in time delay and high in reliability. It should be appreciated that existing deterministic networks require a slot length +.>Where Len is the maximum length (in bits) of a packet in the network and BW is the minimum bandwidth of a link in the network.
It should be noted that, at the same time, only one queue in the same deterministic traffic group is in a data transmission state, and the other queues are in a data receiving state, so as to implement cyclic forwarding, and it should be understood that a specific cyclic forwarding mechanism belongs to the prior art in the field, so that details are not repeated herein.
The invention divides the exit queue into M groups by defining the exit shaping mechanism at the exit port of the router, and each group of queues carries out the cyclic forwarding of data with specific time slot length, so that the system can work with a plurality of time slot lengths at the same time, realize the simultaneous guarantee of a plurality of service qualities and adapt to the coexistence scene of a plurality of multi-service flows with different service quality requirements.
Referring to fig. 3, in another embodiment, the present invention provides a data forwarding apparatus, including:
a receiving unit 100, configured to receive a data packet sent by a previous node; the data packet comprises transmission path information of data and a queue packet sequence number; it should be noted that, since the specific receiving manner and the procedure are already described in detail in the step S10 of the data forwarding method described in the above embodiment, the detailed description is omitted here.
A processing unit 200, configured to forward the data packet to a router exit according to the transmission path information, and forward the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the packet comprises at least one deterministic traffic group and at least one best effort traffic group; it should be noted that, since the specific processing manner and the procedure are already described in detail in the step S20 of the data forwarding method described in the above embodiment, the detailed description is omitted here.
A forwarding unit 300, configured to forward the packet to a next node according to a deterministic network mechanism; it should be noted that, since the specific forwarding method and the procedure are already described in detail in step S30 of the data forwarding method described in the above embodiment, the details are not repeated here.
In another embodiment, the present invention further provides a computer readable storage medium, where the computer readable storage medium may store a program, where the program when executed includes some or all of the steps of any one of the data forwarding methods described in the foregoing method embodiments.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable memory. Based on this understanding, the technical solution of the present invention may be embodied essentially or partly in the form of a software product, or all or part of the technical solution, which is stored in a memory, and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned memory includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.
Exemplary flowcharts for forwarding data according to embodiments of the present invention are described above with reference to the accompanying drawings. It should be noted that the numerous details included in the above description are merely illustrative of the invention and not limiting of the invention. In other embodiments of the invention, the method may have more, fewer, or different steps, and the order, inclusion, functional relationship between steps may be different than that described and illustrated.
Claims (14)
1. A data forwarding method, comprising:
the router receives a data packet sent by a previous node;
the data packet comprises transmission path information of the data and a queue packet sequence number;
the router forwards the data packet to a router outlet according to the transmission path information, and forwards the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the packet comprises at least one deterministic traffic group and at least one best effort traffic group; the time slot length of each queue in the same deterministic service flow group is the same, the time slot lengths among the queues in different deterministic service flow groups are different, and the time slot length in each queue is larger than or equal to the ratio of the size of a data packet to the minimum bandwidth of a link in a network;
the router forwards the data packet to the next node according to a deterministic network mechanism.
2. The data forwarding method of claim 1 wherein: the same deterministic traffic group comprises at least three queues and the same best effort traffic group comprises at least one queue.
3. The data forwarding method of claim 2 wherein: at the same time, only one queue in the same deterministic traffic group is in a data transmission state, and the other queues are in a data receiving state.
4. The data forwarding method of claim 1 wherein: when the number of deterministic traffic groups is greater than 1, the slot lengths of all queues in the latter deterministic traffic group are positive integer multiples of the slot lengths of the queues in the former deterministic traffic group.
5. The data forwarding method of claim 4 wherein: queues in the same deterministic traffic group are clocked at the superslot level.
6. The data forwarding method of claim 5 wherein: the forwarding priority of the queues of the deterministic traffic group is higher than the forwarding priority of the queues of the best effort traffic group.
7. The data forwarding method of claim 6 wherein: when the number of deterministic traffic groups is greater than 1, the forwarding priority of the queues in the former deterministic traffic group is higher than the forwarding priority of the queues in the latter deterministic traffic group.
8. The data forwarding method of claim 1 wherein: the queue packet sequence number is determined by the controller based on the traffic type of the data packet and the length of the time slot used by the current node.
9. A data forwarding apparatus, comprising:
a receiving unit, configured to receive a data packet sent by a previous node; the data packet comprises transmission path information of the data and a queue packet sequence number;
the processing unit is used for forwarding the data packet to a router outlet by the router according to the transmission path information and forwarding the data packet to a packet corresponding to the queue packet sequence number according to the queue packet sequence number; the packet comprises at least one deterministic traffic group and at least one best effort traffic group; the time slot length of each queue in the same deterministic service flow group is the same, the time slot lengths among the queues in different deterministic service flow groups are different, and the time slot length in each queue is larger than or equal to the ratio of the size of a data packet to the minimum bandwidth of a link in a network;
and the forwarding unit is used for forwarding the data packet to the next node according to the deterministic network mechanism.
10. The data forwarding device of claim 9 wherein: the deterministic traffic group comprises at least three queues and the best effort traffic group comprises at least one queue.
11. The data forwarding device of claim 10 wherein: at the same time, only one queue in the same deterministic traffic group is in a data transmission state, and the other queues are in a data receiving state.
12. The data forwarding device of claim 11 wherein: when the number of deterministic traffic groups is greater than 1, the slot lengths of all queues in the latter deterministic traffic group are positive integer multiples of the slot lengths of the queues in the former deterministic traffic group.
13. The data forwarding device of claim 9 further comprising: and the synchronization unit is used for carrying out clock synchronization on the queues in the same deterministic service flow group at the time out slot level.
14. A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the steps of a data forwarding method according to any of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111580906.1A CN114401227B (en) | 2021-12-22 | 2021-12-22 | Data forwarding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111580906.1A CN114401227B (en) | 2021-12-22 | 2021-12-22 | Data forwarding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114401227A CN114401227A (en) | 2022-04-26 |
| CN114401227B true CN114401227B (en) | 2024-03-26 |
Family
ID=81227107
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111580906.1A Active CN114401227B (en) | 2021-12-22 | 2021-12-22 | Data forwarding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114401227B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117279034A (en) * | 2022-06-15 | 2023-12-22 | 中兴通讯股份有限公司 | Information processing method, apparatus, and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075444A (en) * | 2011-02-28 | 2011-05-25 | 北京邮电大学 | Network system and method for guaranteeing multi-type service quality |
| US9900903B1 (en) * | 2014-01-13 | 2018-02-20 | Marvell Israel (M.I.S.L) Ltd. | Weighted periodic scheduling of a shared resource |
| CN109600259A (en) * | 2018-12-11 | 2019-04-09 | 浙江工商大学 | A kind of real-time Transmission mechanism based on software definable |
| CN111431822A (en) * | 2020-04-19 | 2020-07-17 | 汪勤思 | Deterministic time delay service intelligent scheduling and control implementation method |
-
2021
- 2021-12-22 CN CN202111580906.1A patent/CN114401227B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075444A (en) * | 2011-02-28 | 2011-05-25 | 北京邮电大学 | Network system and method for guaranteeing multi-type service quality |
| US9900903B1 (en) * | 2014-01-13 | 2018-02-20 | Marvell Israel (M.I.S.L) Ltd. | Weighted periodic scheduling of a shared resource |
| CN109600259A (en) * | 2018-12-11 | 2019-04-09 | 浙江工商大学 | A kind of real-time Transmission mechanism based on software definable |
| CN111431822A (en) * | 2020-04-19 | 2020-07-17 | 汪勤思 | Deterministic time delay service intelligent scheduling and control implementation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114401227A (en) | 2022-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8089959B2 (en) | Method and apparatus to schedule packets through a crossbar switch with delay guarantees | |
| US11722407B2 (en) | Packet processing method and apparatus | |
| TWI353152B (en) | Systems and methods for dynamic mode-driven link m | |
| WO2019214561A1 (en) | Packet sending method, network node, and system | |
| CN113366805A (en) | Message scheduling method, scheduler, network equipment and network system | |
| Clemm et al. | High-precision latency forwarding over packet-programmable networks | |
| CN109921972B (en) | Method for transmitting and/or receiving data packets | |
| CN112311685A (en) | Method and related device for processing network congestion | |
| CN114401227B (en) | Data forwarding method and device | |
| CN108282416B (en) | Scheduling method and device based on data frame | |
| EP3595249A1 (en) | Service forwarding method and network device | |
| US20120127859A1 (en) | Packet scheduling method and apparatus based on fair bandwidth allocation | |
| CN114286380A (en) | Deterministic delay service transmission method and system for dynamically adjusting time slice | |
| Akpolat et al. | Genetic algorithm based ARINC 664 mixed criticality optimization using network calculus | |
| US8660001B2 (en) | Method and apparatus for providing per-subscriber-aware-flow QoS | |
| CN115643220B (en) | Deterministic service transmission method and device based on jitter time delay | |
| US11271772B2 (en) | Method for transmitting data and system comprising communicating entity | |
| CN114401228B (en) | End-to-end cross-wide area deterministic transmission network architecture and method | |
| CN111434079B (en) | Data communication method and device | |
| Mathew et al. | Packet generation schemes and network latency implications in SDN-enabled 5G C-RANs: Queuing model based analysis | |
| Qazi et al. | Performance estimation of real-time video conferencing in MPLS and non MPLS environment | |
| KR20050065503A (en) | A decision method for burst assembly parameters in optical burst switching network system | |
| KR20180081360A (en) | Photonic frame switching system determining moment of transmitting photonic frame based on time used for changing wavelength of tunable laser diode | |
| Liu et al. | An optimal design of time division multiple access protocol for data link network | |
| EP4398548A1 (en) | Protocol independent deterministic transport of data in a time-sensitive network |
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 |