CN117596208A - Lossless flow control method suitable for deterministic network - Google Patents

Lossless flow control method suitable for deterministic network Download PDF

Info

Publication number
CN117596208A
CN117596208A CN202311491463.8A CN202311491463A CN117596208A CN 117596208 A CN117596208 A CN 117596208A CN 202311491463 A CN202311491463 A CN 202311491463A CN 117596208 A CN117596208 A CN 117596208A
Authority
CN
China
Prior art keywords
traffic
network
flow
flow control
switch
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.)
Pending
Application number
CN202311491463.8A
Other languages
Chinese (zh)
Inventor
汤雪乾
王智宇
于乐
罗泽雄
谢星宇
郭骏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Aeronautical Radio Electronics Research Institute
Original Assignee
China Aeronautical Radio Electronics Research Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Aeronautical Radio Electronics Research Institute filed Critical China Aeronautical Radio Electronics Research Institute
Priority to CN202311491463.8A priority Critical patent/CN117596208A/en
Publication of CN117596208A publication Critical patent/CN117596208A/en
Pending legal-status Critical Current

Links

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/23—Bit dropping
    • 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/19—Flow control; Congestion control at layers above the network layer
    • 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/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority

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 lossless flow control method suitable for a deterministic network, which comprises the steps that a switch sends a flow control frame to a superior network node to control the data transmission of a superior network node to transmit a flow queue in best effort. The upper level network node receives the flow control frame sent by the switch, preferentially sends the high-priority flow queue data according to the integration strategy of the deterministic network, and sends the best-effort flow queue data according to the strict priority strategy. Meanwhile, the exchanger sends high-priority flow queue data preferentially according to the received flow control frame of the next-stage network exchanger and the integration strategy of the deterministic network, and sends best-effort flow queue data according to the strict priority strategy. The switch switches different input devices according to the waiting time, so that the different input devices can be transmitted.

Description

Lossless flow control method suitable for deterministic network
Technical Field
The invention belongs to the technical field of lossless flow control, and particularly relates to a lossless flow control method suitable for a deterministic network.
Background
The IEEE 802.3 standard defines a common ethernet network, defines a medium access control method of a physical layer and a data link layer for a wired ethernet network, and performs a best effort policy to transmit ethernet traffic.
Time triggered ethernet (Time-Triggered Ethernet, TTE) specifies Time triggered traffic with strict end-to-end delay and jitter, rate limited traffic with end-to-end delay upper bound, and best effort traffic, which can guarantee quality of service without quality requirements for best effort traffic, so there is a packet loss situation for best effort traffic when the data bandwidth exceeds the network transmission bandwidth.
A Time sensitive network (Time-Sensitive Network, TSN) provides a Time aware Shaper (Time Awareness Shaper, TAS), a Credit-Based Shaper (CBS), an asynchronous data stream Shaper (Asynchronous Traffic Shaper, ATS), a periodic queuing and forwarding mechanism Shaper (Cyclic Queuing and Forwarding, CQF), wherein the TAS Shaper has a tighter end-to-end delay and lower transmission jitter, and traffic conditioned by the CBS, ATS, and CQF shapers can guarantee an upper end-to-end delay. The TSN network is compatible with ethernet defined by IEEE 802.3 standard, but there is no corresponding shaping mechanism for the best-effort traffic according to IEEE 802.3 standard, the quality of service of the best-effort traffic cannot be guaranteed, and there is a packet loss in the best-effort traffic.
In the safety critical area, best effort traffic in deterministic networks, despite a lower priority, still needs to be guaranteed against packet loss to meet the application needs of safety critical systems. There is therefore a need to provide a flow control mechanism for best effort traffic to ensure that best effort traffic does not experience packet loss during transmission.
Disclosure of Invention
In order to ensure that the best-effort traffic in a deterministic network does not lose packets, the invention provides a lossless traffic control method suitable for the deterministic network. The method can provide the transmission service without packet loss for the deterministic network.
The invention aims at realizing the following technical scheme:
a lossless flow control method for a deterministic network, the method comprising:
step one: after the network is powered on, starting from the source end node, l c+1 The stage network switch outputs the queue buffer of the best effort traffic of the output port to l when the buffer is empty c The level network node sends a flow control frame to inform the level network node that the level network node is not in operation c The level network node may currently send best effort traffic;
step two: l (L) c Stage network node receives l c+1 The flow control frame sent by the level switch then sends high priority flow according to the scheduling strategy of the deterministic network, and transmits best effort transmission flow queue data packets according to the strict priority scheduling strategy;
step three: l (L) c+1 The level switch transmits high priority traffic and best effort traffic according to the integration policy of the deterministic network, when l c+1 The stage switch receives l c+2 When the flow control frame is sent from the level switch, sending a data packet of a queue of the best-effort flow according to a strict priority strategy until the queue of the best-effort flow is empty;
step four: the other switches of the deterministic network control and send high priority traffic and best effort traffic according to steps one to three.
Further, in the first step, when all queue buffers for transmitting BE traffic on the output port are empty, the deterministic network switch sends a traffic control frame TCF to the input device on the input port, informing the input device that the BE traffic can BE currently sent; the type of the traffic control frame TCF is an event triggered bandwidth limited class traffic with a higher priority than BE traffic.
Further, in the first step, after the network is powered on, the BE traffic is transmittedOn the path, from l 0 Stage source end node starts, l 1 When the BE traffic queue buffer area of the output port is empty, the stage network switch sends TCF to the source end node to inform the source end node that BE traffic can BE sent currently; l (L) 2 When BE flow queue buffer area of output port is empty, the stage network switch outputs to l 1 The level network switch sends TCF notification/ 1 The stage network switch can currently send BE traffic; and so on to the last level of network switches.
Further, in the first step, the network switch compares the buffer depth of the BE traffic queue of the network switch with the buffer depth of the BE traffic queue of the connected input device, and selects different numbers of input devices to send traffic control frames TCF;
if BE traffic buffer depth of network switch output port is BD Sq N, and BE traffic buffer depth for input device output port BD ND =m, then k input devices are selected to transmit flow control frames each time, k=n/m, where k is a positive integer;
the network switch firstly transmits a flow control frame TCF to 1-k input port devices, then when the BE flow queue buffer area of the output port of the network switch is empty, the network switch transmits the flow control frame TCF to k+1-2 k input devices, and the like until the last input device is informed.
Further, if the network switch waits for a time interval length to exceed (δ+fl/BW), the input device still does not send any BE traffic packet to the network switch, and the network switch recognizes that the current input device has completed transmission of all BE traffic, and sends a traffic control frame TCF to the input device of the next round, δ is time synchronization accuracy of the deterministic network, FL is a maximum transmission frame length of the appointed network, and BW is a port transmission bandwidth of the appointed network.
Further, in the second step, l c Stage network node receives l c+1 The flow control frame TCF sent by the level switch firstly transmits high-priority flow and then schedules BE flow queue data packets according to a strict priority policy; traffic control frame TCF shadow onlyAnd the normal transmission of the high-priority traffic is not affected by sending the BE traffic queue.
Further, in the second step, the BE traffic queues are transmitted according to the order of priority;
further, in the second step, l c And in the BE traffic transmission process, the stage network node continuously receives a new data packet from the queue currently transmitting the BE traffic, and stores the new data packet in the queue, so that the new data packet is not scheduled to BE transmitted.
The invention has the beneficial effects that:
(1) The method fully considers the connection characteristic of the deterministic network, and is suitable for the switched network which is connected in various topologies such as star, ring and the like.
(2) The method provided by the invention considers the transmission characteristics of the deterministic network, can be compatible with the existing scheduling mechanism of the deterministic network, avoids the conflict between lossless flow control and the existing scheduling mechanism, and improves the operation reliability of the deterministic network.
(3) The method of the invention considers the strict requirements of the deterministic network in the safety critical field, and the proposed lossless flow control method can provide the service guarantee of no packet loss for best-effort flow.
(4) The lossless flow control method provided by the invention can be flexibly configured according to design requirements, so that the minimum bandwidth of low-priority best effort flow transmission can be ensured, and the real-time performance of high-priority best effort flow transmission can be ensured.
(5) The method provided by the invention can be used in combination with the scheduling method of the existing deterministic network, and can also be independently used as a scheduling mechanism to be applied to the deterministic network.
Drawings
FIG. 1 is a physical topology schematic of a deterministic network as illustrated in an embodiment;
FIG. 2 is a queue mechanism within a deterministic network node;
FIG. 3 is a schematic diagram of data transmission of a lossless flow control method according to the present invention;
fig. 4 is a flow chart of a non-destructive flow control method according to the present invention.
Detailed Description
The invention will be described in further detail with reference to the drawings and examples.
In the present invention, an End System (ES) and a Switch (Switch) in a deterministic network are connected by a bi-directional communication link. The end system acts as a source end node and a destination end node according to the role of an end-to-end communication task; network devices that contain forwarding and multiplexing functions are referred to as "switches". The end systems and switching devices are collectively referred to as "nodes". For example, fig. 1 shows an example topology of physical connections of a deterministic network.
In the invention, in the physical topology of a deterministic network, the system comprises a plurality of end systems and switches, and is marked as ND= { ES in a collective form 1 ,ES 2 ,ES 3 ,...,ES p ,...,ES P ,S 1 ,S 2 ,S 3 ,…,S q ,…,S Q }，ES 1 Representing the ES belonging to the first end system in ND 2 Representing the ES belonging to the second end system in ND 3 Representing the ES belonging to the third end system in ND P The last end system belonging to ND is shown, the angle sign p shows the identification number belonging to ND middle end system, and ES is provided for convenience of explanation p Also representing any one of the end systems belonging to ND; s is S 1 Representing the first switch belonging to ND, S 2 Representing the second switch belonging to ND, S 3 Representing the third switch belonging to ND, S Q The last switch belonging to ND is shown, the corner mark q shows the identification number of the switch belonging to ND, S for convenience of explanation q But also any switch belonging to ND.
In the present invention, in deterministic networks, the output ports of the end systems and switches have a plurality of output queues of different priorities, as shown in fig. 2, up to 8 priority queues, with the queues decreasing in order from 0 to 7. The depth of the priority queue of each output port of the network node is unified as BD ND The subscript ND indicates the priority queue depth of the output port belonging to the network node ND.
For example:the representation belonging to the exchange S 1 Priority queue depth of the output port.
In the present invention, the time synchronization accuracy δ of a deterministic network refers to the maximum difference between any two synchronization clocks in one time synchronization period.
In the present invention, FL refers to the maximum transmission frame length of the deterministic network, and BW refers to the port transmission bandwidth of the deterministic network.
In the invention, a deterministic network end system and a switch integrate and transmit high-priority traffic (time trigger traffic, time aware traffic, time sensitive traffic, bandwidth limited traffic, and the like) and low-priority traffic (Best-effort traffic, BE) according to SAE AS6802 standard protocol and IEEE 802.1Qbv standard protocol. Best effort traffic is lower priority and may be allocated to one or more priority queues, as required by the application.
In the invention, the deterministic network needs to ensure the lowest transmission bandwidth of each priority queue and ensures that best effort traffic with the lowest priority can have the opportunity of transmission when planning.
In the invention, when all queue buffers for transmitting BE traffic on an output port are empty, a deterministic network switch sends a traffic control frame (Traffic Control Frame, TCF) to an input device on an input port informing the input device that BE traffic can BE currently sent. The TCF is of a type of event triggered bandwidth limited class traffic with a higher priority than BE traffic.
In the invention, the 6 th and 7 th queues on the output port of the deterministic network node are BE traffic queues, and the rest queues are high-priority traffic queues.
In the present invention, the source end node ES is determined according to the distance p Is far from hop count Hops to perform network Level level= { l on network nodes on BE traffic transmission paths recently 0 ，l 1 ，l 2 ，…，l c ，…，l C Division of. In the present invention, the source node is regarded as the initial node of the BE traffic transmission path, and is denoted as l in the hierarchy 0 Stage, denoted as l 0 The method comprises the steps of carrying out a first treatment on the surface of the The hierarchy of network switches belonging to the last stage on the BE traffic transmission path is denoted as l C For convenience of explanation, l c But also any switch on the BE traffic transmission path.
The invention provides a lossless flow control method suitable for a deterministic network, which comprises the steps that a switch sends a flow control frame to a superior network node at the switch to control the data transmission of a superior network node to transmit a flow queue in best effort. The upper level network node receives the flow control frame sent by the switch, preferentially sends the high-priority flow queue data according to the integration strategy of the deterministic network, and sends the best-effort flow queue data according to the strict priority strategy. Meanwhile, the exchanger sends high-priority flow queue data preferentially according to the received flow control frame of the next-stage network exchanger and the integration strategy of the deterministic network, and sends best-effort flow queue data according to the strict priority strategy. The switch switches different input devices according to the waiting time, so that the different input devices can be transmitted. And the network node does not arrange the transmission of the newly received data packet when the network node best transmits the newly received data packet of the traffic in the transmission process, so that the data packet of the queue of the best-effort traffic can be transmitted at any opportunity.
The invention provides a nondestructive flow control method suitable for a deterministic network, which can be used in combination with the existing deterministic network scheduling method and can also be independently used as a nondestructive flow control method to be applied to the deterministic network.
Referring to fig. 4, a lossless flow control method suitable for deterministic networks includes the steps of:
step one: after the network is powered on, from the source end node, the best effort traffic is transmitted on the transmission path c+1 The stage network switch outputs the queue buffer of the best effort traffic of the output port to l when the buffer is empty c The level network node sends a flow control frame to inform the level network node that the level network node is not in operation c The level network node can currently send outDelivering best effort traffic;
step two: l (L) c Stage network node receives l c+1 The flow control frames sent by the level switch then send high priority flows according to the scheduling policy of the deterministic network, and transmit best effort flow queue data packets according to the strict priority scheduling policy.
Step three: l (L) c+1 The level switch sends high priority traffic according to the scheduling policy of the deterministic network, transmits best effort traffic queue data packets according to the strict priority scheduling policy, and when l c+1 The stage switch receives l c+2 And when the flow control frame is sent from the level switch, sending the data packet of the queue of the best-effort flow according to a strict priority strategy until the queue of the best-effort flow is empty.
Step four: the other switches of the deterministic network control and send the high-priority traffic and best effort traffic according to the steps one to three;
in the invention, all nodes of the deterministic network are adopted to schedule and transmit the best effort traffic in the step one to the step four, so that the packet loss-free transmission of the best effort traffic can be realized.
Step one: after the network is powered on, from the source end node, the best effort traffic is transmitted on the transmission path c+1 The stage network switch outputs the queue buffer of the best effort traffic of the output port to l when the buffer is empty c The level network node sends a flow control frame to inform the level network node that the level network node is not in operation c The level network node may currently send best effort traffic;
in the invention, after the network is powered on, on a BE traffic transmission path, from l 0 Stage source end node starts, l 1 When the BE traffic queue buffer area of the output port is empty, the stage network switch sends TCF to the source end node to inform the source end node that BE traffic can BE sent currently; l (L) 2 When BE flow queue buffer area of output port is empty, the stage network switch outputs to l 1 The level network switch sends TCF notification/ 1 The stage network switch can currently send BE traffic; and so on to the last level of network switches.
In the present invention, the netThe network switch selects different numbers of input devices to send TCFs according to the comparison result of the buffer depth of the BE flow queues of the network switch and the buffer depth of the BE flow queues of the connected input devices. Specifically, if the BE traffic buffer depth of the network switch output port isAnd BE traffic buffer depth for input device output port is BD ND And selecting k (k=n/m, wherein k is a positive integer) input devices each time to send a flow control frame, namely, the network switch firstly sends TCF to 1-k input port devices, then when BE flow queue buffer areas of output ports of the network switch are empty, sends TCF to k+1-2 k input devices, and the like until the last input device is informed.
In the invention, if the switch waits for a time interval length to exceed (delta+FL/BW), and the input end device still does not send any BE traffic data packet to the switch, the switch considers that the current input device has completed the transmission of all BE traffic, and sends TCF to the input device of the next round, and informs the input device that BE traffic can BE sent currently.
For example, see fig. 1 and 3, at time t 1 Switch S 1 When the self BE flow queue buffer is empty, the end system ES 1 Sending TCF to inform end system ES 1 BE traffic can currently BE sent. At time t 3 Switch S 1 The end system ES has not been received for a period of time that has been waiting for an interval length exceeding δ+fl/BW 1 And the current switch S 1 Is empty, therefore switch S 1 End system ES 2 Sending TCF to inform end system ES 2 BE traffic can currently BE sent.
Step two: l (L) c Stage network node receives l c+1 The flow control frame sent by the level switch then sends the high priority flow according to the scheduling policy of the deterministic network, and transmits the best effort flow queue data according to the strict priority scheduling policyAnd (5) packaging.
In the present invention, l c Stage network node receives l c+1 The TCF sent by the level switch then transmits the high priority traffic (time triggered traffic, time aware traffic, time sensitive traffic, bandwidth limited traffic, etc.) according to SAE AS6802 standard protocol or IEEE 802.1Qbv standard protocol, and then schedules BE traffic queue packets according to strict priority policy. The TCF only affects the transmission of BE traffic queues and does not affect the normal transmission of high priority traffic.
In the present invention, l c And in the BE traffic transmission process, the stage network node continuously receives a new data packet from a queue currently transmitting the BE traffic, and stores the new data packet in the queue.
In the present invention, BE traffic queues are transmitted in order of priority. The low priority queue has transmission opportunities each time, and starvation phenomenon of the low priority queue caused by unavailable transmission opportunities is prevented.
Specifically, end system ES 1 Received exchange S 1 The TCF transmits the data packets of the 0 th to 5 th queues according to SAE AS6802 standard protocol or IEEE 802.1Qbv standard protocol, and then transmits the BE traffic data packets of the 6 th to 7 th queues according to strict priority policy.
For example, see fig. 1 and 3, at time t 2 End system ES 1 Received exchange S 1 After the TCF is sent, sending high-priority flow data packets 101, 102 and 103 according to a scheduling strategy of a deterministic network, and then sending BE flow queue data packets 106 and 107 according to a strict priority strategy; at time t 3 End system ES 2 Received exchange S 1 After the TCF is sent, BE traffic queue packets 206 and 207 are sent according to strict priority; at time t 3 By time t 4 During the period, the end system ES 2 The high priority traffic packets 201, 203, 204 are sent according to the scheduling policy of the deterministic network, unaffected by the TCF.
Step three: l (L) c+1 The level switch transmits high priority traffic and best effort traffic according to the integration policy of the deterministic network, when l c+1 The stage switch receives l c+2 And when the flow control frame is sent from the level switch, sending the data packet of the queue of the best-effort flow according to a strict priority strategy until the queue of the best-effort flow is empty.
In the invention, the network switch firstly transmits high-priority traffic (time trigger traffic, time sense traffic, time sensitive traffic, bandwidth limited traffic and the like) according to SAE AS6802 standard protocol or IEEE 802.1Qbv standard protocol, and then schedules BE traffic queue data packets according to strict priority policy. The flow control frame only affects the transmission of the BE flow queues, and does not affect the normal transmission of high priority flows.
In the present invention, the switch transmits the flow control frame to control the transmission of the BE flow of the upper-level network node, and neither the end systems (source end node and destination end node) transmit the flow control frame.
In the present invention, l c+1 And when the queue currently transmitting BE traffic continuously receives a new data packet in the BE traffic transmission process, the new data packet is stored in the queue, and the round of data transmission no longer arranges for transmitting the new data packet.
In the present invention, if l c+1 The stage network switch waits for a time interval length exceeding (delta+FL/BW), l c The level network node still has no direction l c+1 The stage switch sends any BE traffic data packet, then l c+1 The stage switch asserts the current l c The stage network node has completed the transmission of all BE traffic and will send the TCF to l of the next round c Level network node, informing of l c The stage network node can currently send BE traffic.
In the present invention, l C+1 The level network switch is the last level switch on the data transmission path, then l C+1 The class switch will not receive the flow control frames from the end system, and therefore transmit high priority traffic according to the deterministic network integration policy, and schedule BE traffic queue packets according to the strict priority policy.
Specifically, for example, referring to fig. 1 and 3, since the switch S 1 Connected withEnd system ES of (a) 3 Is the destination of the data transmission path, thus switch S 1 High priority traffic packets 101, 102, 103, 201, 203, and 204 are sent preferentially according to deterministic network integration policies and best effort traffic queue packets 106 and 107 are sent according to strict priority.
Step four: the other switches of the deterministic network control and send the high-priority traffic and best effort traffic according to the steps one to three;
the lossless flow control method suitable for the deterministic network can be used in combination with the existing flow scheduling control method of the deterministic network, and can also be independently used as a flow control method to be applied to the deterministic network.
It will be understood that equivalents and modifications will occur to those skilled in the art in light of the present invention and their spirit, and all such modifications and substitutions are intended to be included within the scope of the present invention as defined in the following claims.

Claims (8)

1. A method of lossless flow control for deterministic networks, the method comprising:
step one: after the network is powered on, starting from the source end node, l c+1 The stage network switch outputs the queue buffer of the best effort traffic of the output port to l when the buffer is empty c The level network node sends a flow control frame to inform the level network node that the level network node is not in operation c The level network node may currently send best effort traffic;
step two: l (L) c Stage network node receives l c+1 The flow control frame sent by the level switch then sends high priority flow according to the scheduling strategy of the deterministic network, and transmits best effort transmission flow queue data packets according to the strict priority scheduling strategy;
step three: l (L) c+1 The level switch transmits high priority traffic and best effort traffic according to the integration policy of the deterministic network, when l c+1 The stage switch receives l c+2 When the flow control frame is sent from the level switch, the best effort transmission flow is sent according to the strict priority strategyMeasuring the data packets of the queue until the queue for transmitting the traffic at best is empty;
step four: the other switches of the deterministic network control and send high priority traffic and best effort traffic according to steps one to three.
2. The lossless flow control method for deterministic network according to claim 1, wherein in step one, when all queue buffers for transmitting BE flow on the output port are empty, the deterministic network switch sends a flow control frame TCF to the input device on the input port informing the input device that BE flow can BE currently sent; the type of the traffic control frame TCF is an event triggered bandwidth limited class traffic with a higher priority than BE traffic.
3. The method of claim 1, wherein in step one, after the network is powered on, the slave i is performed on the BE traffic transmission path 0 Stage source end node starts, l 1 When the BE traffic queue buffer area of the output port is empty, the stage network switch sends TCF to the source end node to inform the source end node that BE traffic can BE sent currently; l (L) 2 When BE flow queue buffer area of output port is empty, the stage network switch outputs to l 1 The level network switch sends TCF notification/ 1 The stage network switch can currently send BE traffic; and so on to the last level of network switches.
4. The method for lossless flow control applicable to deterministic network according to claim 1, wherein in step one, the network switch selects different numbers of input devices to transmit the flow control frame TCF according to the buffer depth of the self BE flow queue and the buffer depth of the BE flow queue of the connected input device;
if the BE traffic buffer depth of the network switch output port isAnd BE traffic buffer depth for input device output port is BD ND =m, then k input devices are selected to transmit flow control frames each time, k=n/m, where k is a positive integer;
the network switch firstly transmits a flow control frame TCF to 1-k input port devices, then when the BE flow queue buffer area of the output port of the network switch is empty, the network switch transmits the flow control frame TCF to k+1-2 k input devices, and the like until the last input device is informed.
5. A lossless flow control method suitable for deterministic networks according to claim 1, characterized in that if the network switch waits for a time interval length exceeding (δ+fl/BW), the input device still does not send any BE flow data packets to the network switch, the network switch considers that the current input device has completed the transmission of all BE flows, and sends a flow control frame TCF to the input device of the next round, δ being the time synchronization accuracy of the deterministic network, FL being the maximum transmission frame length of the deterministic network, BW being the port transmission bandwidth of the deterministic network.
6. A non-destructive flow control method according to claim 1, wherein in step two, l c Stage network node receives l c+1 The flow control frame TCF sent by the level switch firstly transmits high-priority flow and then schedules BE flow queue data packets according to a strict priority policy; the traffic control frame TCF only affects the transmission of BE traffic queues and does not affect the normal transmission of high priority traffic.
7. The method of claim 6, wherein in the second step, the BE traffic queues are transmitted in order of priority.
8. A non-destructive traffic control method according to claim 7, suitable for deterministic networksIn the second step, l is as follows c And in the BE traffic transmission process, the stage network node continuously receives a new data packet from the queue currently transmitting the BE traffic, and stores the new data packet in the queue, so that the new data packet is not scheduled to BE transmitted.
CN202311491463.8A 2023-11-09 2023-11-09 Lossless flow control method suitable for deterministic network Pending CN117596208A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311491463.8A CN117596208A (en) 2023-11-09 2023-11-09 Lossless flow control method suitable for deterministic network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311491463.8A CN117596208A (en) 2023-11-09 2023-11-09 Lossless flow control method suitable for deterministic network

Publications (1)

Publication Number Publication Date
CN117596208A true CN117596208A (en) 2024-02-23

Family

ID=89909134

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311491463.8A Pending CN117596208A (en) 2023-11-09 2023-11-09 Lossless flow control method suitable for deterministic network

Country Status (1)

Country Link
CN (1) CN117596208A (en)

Similar Documents

Publication Publication Date Title
CN111684776B (en) Method, control method and communication system for data communication in network
US6714517B1 (en) Method and apparatus for interconnection of packet switches with guaranteed bandwidth
CA2322406C (en) Prevention of deadlocks and livelocks in lossless, backpressured packet networks
US6970424B2 (en) Method and apparatus to minimize congestion in a packet switched network
JP4616535B2 (en) Network switching method using packet scheduling
CN102971996B (en) Switching node with the load balance of packet burst
US6654374B1 (en) Method and apparatus to reduce Jitter in packet switched networks
CN113711572A (en) Message transmission method and device
WO2007051374A1 (en) A method for guaranteeing classification of service of the packet traffic and the method of rate restriction
CN109639560B (en) Method for improving availability of real-time computer network
CN110870285A (en) Method for high-performance data transmission in data networks with partial real-time requirements and device for carrying out said method
US11038799B2 (en) Per-flow queue management in a deterministic network switch based on deterministically transmitting newest-received packet instead of queued packet
US11323380B2 (en) Method of synchronization of data packet transmission
CN110431877B (en) Master node for use in a network comprising bluetooth LE links and network comprising such a master node
CN115378874B (en) Data transmitting and receiving method, device, electronic equipment, chip and storage medium
CN115643220B (en) Deterministic service transmission method and device based on jitter time delay
Amari et al. AeroRing: Avionics full duplex ethernet ring with high availability and QoS management
CN110809012B (en) Train network communication data scheduling control method
CN109450817B (en) Mixed scheduling method for time-triggered Ethernet multi-service message transmission
JP6152425B2 (en) Real-time message transmission method and computer network for transmitting real-time messages
KR100772189B1 (en) Method for transferring data frame end-to-end using virtual synchronization on local area network and Network Devices appling the same
CN117596208A (en) Lossless flow control method suitable for deterministic network
Hassani et al. Work-in-progress: Layering concerns for the analysis of credit-based shaping in IEEE 802.1 TSN
US11924740B2 (en) Signal transfer system, signal transfer device, route control device and signal transfer method
CN117014384A (en) Message transmission method and message forwarding equipment

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