CN114338544A - Flow control method of FC switching network based on priority - Google Patents
Flow control method of FC switching network based on priority Download PDFInfo
- Publication number
- CN114338544A CN114338544A CN202111592250.5A CN202111592250A CN114338544A CN 114338544 A CN114338544 A CN 114338544A CN 202111592250 A CN202111592250 A CN 202111592250A CN 114338544 A CN114338544 A CN 114338544A
- Authority
- CN
- China
- Prior art keywords
- priority
- network
- data
- communication
- queue
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000005540 biological transmission Effects 0.000 claims abstract description 88
- 238000004891 communication Methods 0.000 claims abstract description 54
- 230000003068 static effect Effects 0.000 claims abstract description 27
- 238000012545 processing Methods 0.000 claims description 11
- 238000007726 management method Methods 0.000 description 11
- 230000007246 mechanism Effects 0.000 description 9
- 238000013461 design Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a flow control method of a FC switching network based on priority, which comprises the following steps: step 1: planning network communication definition according to communication flow and communication data importance degree of communication nodes in a network, wherein the communication flow comprises maximum transmission bandwidth and maximum transmission delay, and the communication data importance program is a data transmission static priority level; step 2: configuring communication queues of the node machines and the switches in a mode of transmitting static priority levels according to network communication definitions; and step 3: a token bucket algorithm is adopted to realize a flow limiting strategy, and flow-based token bucket algorithm parameters are calculated and initialized according to the maximum transmission bandwidth and the maximum transmission delay; and 4, step 4: at the network running time, the network node machine or the network switch adopts a transmission mode of a priority queue according to the network priority level and the token bucket algorithm parameters to limit the flow of all the flows with different priorities in the network, thereby ensuring the normal communication of high-priority data.
Description
Technical Field
The invention belongs to the computer network communication technology, and particularly relates to a flow control method of an FC (fiber channel) switching network based on priority.
Background
The Fiber Channel (FC) network is composed of FC switches and FC node machines, all the FC node machines are connected with the FC switches through full duplex links to form a single-redundancy or dual-redundancy network architecture, and the switching capacity of the high-speed avionic network is realized. In the fiber channel network, the flow control mechanism determines the exchange capacity and the exchange index of data transmitted in a switching network, ensures the reliability of data of different task levels in the network transmission process, and ensures that the delay of the data is in a reasonable range. The design of the flow control mechanism determines the transmission capability of the whole FC network.
The FC protocol used by the existing avionic network refers to three service protocols in FC-FS-2, and the flow control mechanism adopts a mode of calculating a credit value on an end-to-end physical link: the credit value is decreased progressively each time the sending end sends a message, and the credit value is increased progressively after the sending end receives the confirmation request of the receiving end.
The original FC network adopts an end-to-end credit mode to carry out flow management on data transmission between two ports, the flow management is only carried out on FC network flow of a single physical link, and effective management cannot be carried out on data of different task levels. Therefore, the invention innovatively designs a mechanism for carrying out flow control according to priority based on the high-speed FC network.
Disclosure of Invention
The purpose of the invention is: a method for controlling the flow of the FC network based on the high-speed FC network according to the data transmission task level is provided, the flow control principle method and the requirements are designed and explained, and a calculation formula is provided. The flow control method can provide different levels of service capability for different task level data in the FC network.
The technical scheme is as follows: the application provides a flow control method of a FC switching network based on priority, which comprises the following steps:
step 1: planning network communication definition according to communication flow and communication data importance degree of communication nodes in a network, wherein the communication flow comprises maximum transmission bandwidth and maximum transmission delay, and the communication data importance program is a data transmission static priority level;
step 2: configuring communication queues of the node machines and the switches in a mode of transmitting static priority levels according to the network communication definition;
and step 3: adopting a token bucket algorithm to realize a flow limiting strategy, and calculating and initializing a token bucket algorithm parameter based on flow according to the maximum transmission bandwidth and the maximum transmission delay;
and 4, step 4: and at the network running time, the network node machine or the network switch limits the flow of all the flows with different priorities in the network by adopting a transmission mode of a priority queue according to the network priority level and the token bucket algorithm parameters, so that the normal communication of the high-priority data is ensured.
Specifically, the communication traffic includes a maximum transmission bandwidth and a maximum transmission delay, and the important program of the communication data is a static priority level of data transmission, which specifically includes:
the maximum transmission bandwidth refers to the maximum number of bytes which can be transmitted by a network in unit time, and the maximum transmission delay refers to the maximum time from a data transmitting end to a data receiving end.
Specifically, the importance degree of the communication data refers to a static priority level of data transmission, and the higher the importance degree of the data is, the higher the static priority level of the data transmission is.
Specifically, the configuring, according to the network priority level, a communication queue of the node machine and the switch in a manner of transmitting a static priority level includes:
the transmission static limited grade refers to a static priority grade of data transmission; the priority level is statically configured according to the definition, and the priority level of data transmission is not changed in the network operation process; different transmission static priority levels correspond to different communication queues; the dispatching modes of the communication queues with different transmission static priority levels are dispatched according to the static priority levels, and the high priority level is dispatched in advance of the low priority level so as to ensure that the data in the high priority queue is sent out preferentially.
Specifically, at the network operation time, the network node machine or the network switch performs traffic limitation on all traffic with different priorities existing in the network by using a transmission mode of a priority queue according to the network priority level and the token bucket algorithm parameter, so as to ensure normal communication of high-priority data, and specifically includes:
the priority queue is as follows: each static priority level corresponds to a data transmission queue, and the data transmission queue comprises a data sending queue and a data receiving queue. And adopting a scheduling mode based on priority levels by using queues with different priority levels at the data transmission time.
Specifically, the scheduling method based on priority is adopted by the queues with different priorities at the data transmission time, and specifically includes:
a node machine or a switch sending end schedules sending and receiving actions of data queues with different priorities in a priority-based mode;
at the time of queue scheduling, the system preferentially schedules the high-priority queue until the high-priority queue is empty, then services are carried out on the next-level queue, and so on until the system finishes scheduling all priority groups, and by the scheduling mode, the system can ensure the real-time performance and accessibility of key data transmission;
and at the scheduling time of the queue, adopting a non-preemptive scheduling mode, when the data with high priority reaches the time, if the data/queue with low priority is in the processing process at that time, the queue with high priority can not forcibly occupy the processing resource, and if and only after the processing of the data/queue with low priority is finished, the queue with high priority can preferentially occupy the processing resource.
Specifically, the traffic limitation policy means that the traffic output by a certain node of the network does not exceed the upper limit of the traffic specified by the token bucket algorithm parameter in unit time.
Specifically, the node machine calculates and initializes token bucket algorithm parameters based on traffic according to the maximum transmission bandwidth and the maximum transmission delay of the network, and specifically includes:
and calculating the algorithm parameters of the token bucket according to the maximum transmission bandwidth and the maximum transmission delay of the network, wherein the algorithm parameters specifically comprise a token bucket mark number, token generation time, a committed message rate and a committed burst size.
In summary, the present application provides a method for controlling traffic of an FC switching network based on priority. The technical scheme of the invention is as follows: a flow management control method of an FC network is designed by referring to the flow management mode of an FC node machine/switch based on credit and the flow control principle requirement based on a token bucket, considering the transmission scene of multiple priorities in an airborne network and based on a data priority flow control mode, and the technical difficulty of flow control of the FC network is solved. On the basis of ensuring the quality of the existing flow control, the invention solves the defect of using the FC network flow control based on the credit mechanism in the multi-priority airborne network by selecting the reasonable flow control object, the flow control parameter and the flow control method, and realizes the fine management of the FC network data transmission.
Drawings
Fig. 1 is a schematic diagram of a priority-based isolation transport switching architecture.
Fig. 2 is a schematic diagram of a traffic-based token bucket algorithm.
Detailed Description
FC networks support a variety of topologies, and switch-centric, star-fabric FC switching networks are commonly used in avionics systems. Mechanisms of credit are typically employed in FC networks for traffic management and control. In the traffic control method based on the credit mechanism, when a large-scale burst traffic exists in the network, a data back pressure situation occurs, that is, after the receiving capacity of a receiving port reaches an upper limit, an R _ RDY primitive cannot be replied in time, so that all ports communicating with the receiving port cannot normally send all FC data frames. When the network has data back pressure, all communication data frames on the communication port are prevented from being sent. For important data transmitted on a port, a packet loss situation may occur.
Therefore, a priority-based traffic control method is needed, which is required to satisfy the following indexes: 1. support the mixed transmission of data with different priorities; 2. real-time transmission resources can be guaranteed for data with high priority; 3. the condition that burst flow occurs in the network can be supported;
the invention provides a flow management control algorithm based on data transmission priority, which comprises the following steps: at a sending end of a node machine/switch, a token bucket (hereinafter referred to as token bucket) flow control mechanism based on flow statistics is used, different flow control parameters are set for different priorities, flow classification management based on priorities is achieved, the control occurrence time is located at a data sending time point, the flow control mechanism needs to check the token bucket corresponding to the priority, and it is guaranteed that the size of data transmitted at this time meets the number of tokens in the current token bucket, namely, the maximum flow allowed to be transmitted by a current flow control algorithm.
In this way, at the sending end of the node machine or the switch, different token buckets based on data traffic are defined according to the priority, so that the maximum traffic allowed to be sent by each token bucket is different. On the premise that the node machine or the switch normally sends data, real-time transmission of high-priority flow is guaranteed, and flow burst and large-scale concurrent communication of other priority data are supported. Because different priority data use different traffic token buckets, the communication traffic of different priority data is isolated from each other, and low priority data traffic communication does not affect the normal transmission of high priority data on the network.
As shown in fig. 1, the present invention provides a method for controlling traffic of an FC switching network based on priority, which is applied to a sending end of a node machine/switch, and the method includes the following steps:
step 1: and planning the communication definition of the whole internet according to the communication flow and the communication data importance degree of each node in the network. The network communication definition includes: the number of the priority levels of the network, the maximum transmission bandwidth of nodes in the network and the maximum transmission delay of the network are defined, and further the maximum transmission bandwidth and the maximum transmission delay of each priority in unit time are defined according to the number of the priority levels, the maximum transmission bandwidth and the maximum transmission delay defined by the network;
step 2: according to the number of the network priority levels, communication queues of the node machines and the switches are configured in a static priority mode, and the scheduling modes of the communication queues with different priorities are set as priority scheduling to ensure that data in a high-priority queue is sent preferentially;
the priority queue is as follows: at the moment of design of the I CD, network transmission priority planning is performed in advance for messages transmitted in an airborne network, and each priority corresponds to a data transmission queue, which comprises a data sending queue and a data receiving queue. And adopting a scheduling mode based on priority levels at the data transmission time of different queues. At the time of queue scheduling, the system preferentially schedules the high-priority queue until the high-priority queue is empty, then services are carried out on the next-level queue, and so on until the system finishes scheduling all priority groups. Meanwhile, in order to ensure the integrity of data transmission, a non-preemptive scheduling mode is adopted at the scheduling time of the queues, when the data with high priority reaches the time, if the data/queues with low priority are in the processing process, the queues with high priority can not forcibly occupy the processing resources, and if and only after the data/queues with low priority are processed, the queues with high priority can preferentially occupy the processing resources.
The priority queue scheduling refers to the action of sending and receiving data queues with different priorities scheduled by a node machine or a switch sending end in a priority-based mode.
And step 3: and calculating and initializing token bucket algorithm parameters based on flow according to the maximum transmission bandwidth and the maximum transmission delay of data transmission with different priorities in the unit time, and selecting and executing a flow limitation strategy according to the realization characteristics of the node machine.
The core of traffic control in the priority-based traffic control method is a token bucket filtering algorithm based on traffic, and the algorithm is shown in fig. 2.
The token bucket algorithm is as follows: the token bucket can be regarded as a container for storing tokens, and a certain capacity is set. The system places tokens into the bucket at a given rate and when the bucket is full of tokens, the excess tokens overflow.
In the present invention, a data frame-based token bucket algorithm or a byte-based token bucket algorithm may be used. The difference lies in that the token bucket algorithm based on the data frame is used, the token in the token bucket is filtered by taking the data frame as a unit, the realization is simple, the efficiency is high, but the flow management is not fine enough due to the different sizes of the frames. The token bucket algorithm based on bytes takes the number of bytes of a current passing data frame as the number of tokens, can realize fine management on current passing flow, and can accurately calculate the flow on a current physical link.
Illustratively, step 3 takes a token bucket algorithm based on frames as an example, and the working flow is described as follows:
step 3.1, when the data stream reaches the exit of the transmission link, the number of tokens corresponding to the number of data frames is taken out from the token bucket according to the number of data frames to be used for transmitting data.
Step 3.2 for each frame of data transmitted by the current link, the flow control method needs to consume one token in the token bucket.
Step 3.3 to enable the data to be successfully transmitted must ensure that there are enough tokens in the token bucket, and if there are not enough tokens, the data frame must wait in the transmit queue until there are enough tokens to allow the data to be retransmitted or discarded.
Through the mode, the purpose of limiting the flow of the data frame can be achieved by controlling the token generation speed, so that the transmission speed of the data frame is smaller than or equal to the token generation speed of the token bucket, and the purpose of limiting the flow is achieved.
On the other hand, the network can evaluate the traffic state of the current network operation time by counting the number of tokens in token buckets with different priorities in each device. By using the token bucket algorithm and the flow control method, burst flow exists in the network, and the requirements of the application on the burst flow at the emergency moment are met.
The following describes a configuration manner of the token bucket algorithm by taking a data frame as a control object.
The token bucket algorithm has the following four configuration attributes, namely token bucket mark number, token generation time, committed message rate and committed burst size.
1) Token bucket token number: the mark number is counted from 0 and is in one-to-one correspondence with the priority level in the network;
2) token generation time: new tokens in the token bucket are added to the bucket interval time in milliseconds. When the token bucket is full of tokens, the newly added token is discarded;
3) committed message rate: representing the rate at which tokens are put into the token bucket;
4) committed burst size: to define the maximum burst traffic before the partial traffic exceeds, i.e., the capacity (depth) of the token bucket, the committed burst size must be greater than 1.
And 4, step 4: at the time of network permission, the network node or the network switch limits the flow of all the flows with different priorities in the network according to the pre-configured data priority and the token bucket algorithm based on the flow, and ensures the normal communication of the high-priority data.
Claims (8)
1. A method for traffic policing for a priority-based FC switched network, the method comprising:
step 1: planning network communication definition according to communication flow and communication data importance degree of communication nodes in a network, wherein the communication flow comprises maximum transmission bandwidth and maximum transmission delay, and the communication data importance program is a data transmission static priority level;
step 2: configuring communication queues of the node machines and the switches in a mode of transmitting static priority levels according to the network communication definition;
and step 3: adopting a token bucket algorithm to realize a flow limiting strategy, and calculating and initializing a token bucket algorithm parameter based on flow according to the maximum transmission bandwidth and the maximum transmission delay;
and 4, step 4: and at the network running time, the network node machine or the network switch limits the flow of all the flows with different priorities in the network by adopting a transmission mode of a priority queue according to the network priority level and the token bucket algorithm parameters, so that the normal communication of the high-priority data is ensured.
2. The traffic control method for an FC switching network according to claim 1, wherein the communication traffic includes a maximum transmission bandwidth and a maximum transmission delay, and the communication data importance procedure is a data transmission static priority level, and specifically includes:
the maximum transmission bandwidth refers to the maximum number of bytes which can be transmitted by a network in unit time, and the maximum transmission delay refers to the maximum time from a data transmitting end to a data receiving end.
3. The method for traffic policing of an FC switching network according to claim 1, wherein the importance level of the communication data is a static priority level of data transmission, and the higher the importance level of the data is, the higher the static priority level of the data transmission is.
4. The method for traffic policing in an FC switching network according to claim 1, wherein the configuring the communication queues of the node machines and the switches in a manner of transmitting a static priority class according to the network priority class specifically comprises:
the transmission static limited grade refers to a static priority grade of data transmission; the priority level is statically configured according to the definition, and the priority level of data transmission is not changed in the network operation process; different transmission static priority levels correspond to different communication queues; the dispatching modes of the communication queues with different transmission static priority levels are dispatched according to the static priority levels, and the high priority level is dispatched in advance of the low priority level so as to ensure that the data in the high priority queue is sent out preferentially.
5. The method for traffic policing in an FC switching network according to claim 1, wherein at the time of network operation, the network node or the network switch performs traffic restriction on all traffic with different priorities existing in the network by using a transmission method of a priority queue according to the network priority level and the token bucket algorithm parameter, so as to ensure normal communication of high-priority data, and specifically comprises:
the priority queue is as follows: each static priority level corresponds to a data transmission queue, and the data transmission queue comprises a data sending queue and a data receiving queue. And adopting a scheduling mode based on priority levels by using queues with different priority levels at the data transmission time.
6. The method for traffic policing in an FC switching network according to claim 3, wherein the queues with different priorities use a scheduling method based on priority at the time of data transmission, and specifically comprises:
a node machine or a switch sending end schedules sending and receiving actions of data queues with different priorities in a priority-based mode;
at the time of queue scheduling, the system preferentially schedules the high-priority queue until the high-priority queue is empty, then services are carried out on the next-level queue, and so on until the system finishes scheduling all priority groups, and by the scheduling mode, the system can ensure the real-time performance and accessibility of key data transmission;
and at the scheduling time of the queue, adopting a non-preemptive scheduling mode, when the data with high priority reaches the time, if the data/queue with low priority is in the processing process at that time, the queue with high priority can not forcibly occupy the processing resource, and if and only after the processing of the data/queue with low priority is finished, the queue with high priority can preferentially occupy the processing resource.
7. The method as claimed in claim 1, wherein the traffic limiting policy is that a traffic output from a node of the network does not exceed an upper limit of a traffic specified by a token bucket algorithm parameter per unit time.
8. The method for traffic policing in an FC switching network according to claim 1, wherein the node calculates and initializes token bucket algorithm parameters based on traffic according to a maximum transmission bandwidth and a maximum transmission delay of the network, and specifically comprises:
and calculating the algorithm parameters of the token bucket according to the maximum transmission bandwidth and the maximum transmission delay of the network, wherein the algorithm parameters specifically comprise a token bucket mark number, token generation time, a committed message rate and a committed burst size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592250.5A CN114338544B (en) | 2021-12-23 | 2021-12-23 | Flow control method of FC switching network based on priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111592250.5A CN114338544B (en) | 2021-12-23 | 2021-12-23 | Flow control method of FC switching network based on priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114338544A true CN114338544A (en) | 2022-04-12 |
| CN114338544B CN114338544B (en) | 2024-01-12 |
Family
ID=81054895
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111592250.5A Active CN114338544B (en) | 2021-12-23 | 2021-12-23 | Flow control method of FC switching network based on priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114338544B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
| CN113630335A (en) * | 2021-07-13 | 2021-11-09 | 北京电子工程总体研究所 | Method for optimizing and selecting flow control strategy of switched Ethernet data |
-
2021
- 2021-12-23 CN CN202111592250.5A patent/CN114338544B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112953848A (en) * | 2021-03-12 | 2021-06-11 | 西安电子科技大学 | Strict priority based traffic supervision method, system and equipment |
| CN113630335A (en) * | 2021-07-13 | 2021-11-09 | 北京电子工程总体研究所 | Method for optimizing and selecting flow control strategy of switched Ethernet data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114338544B (en) | 2024-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7161907B2 (en) | System and method for dynamic rate flow control | |
| US7027457B1 (en) | Method and apparatus for providing differentiated Quality-of-Service guarantees in scalable packet switches | |
| CN102971996B (en) | Switching node with the load balance of packet burst | |
| CN101616097B (en) | Method and system for managing output port queue of network processor | |
| US20050089054A1 (en) | Methods and apparatus for provisioning connection oriented, quality of service capabilities and services | |
| CN107454015B (en) | OF-DiffServ model-based QoS control method and system | |
| CN101692648B (en) | Method and system for queue scheduling | |
| CN100550852C (en) | A kind of method and device thereof of realizing mass port backpressure | |
| WO2002098080A1 (en) | System and method for scheduling traffic for different classes of service | |
| US7631096B1 (en) | Real-time bandwidth provisioning in a switching device | |
| RU2427091C2 (en) | Device and method for speed limit-based flow control for mstp device | |
| WO2008095397A1 (en) | Traffic scheduling method and apparatus thereof | |
| Loi et al. | Service differentiation in optical burst switched networks | |
| CN102893656A (en) | Network relay device, qos control method, and recording medium on which qos control program is recorded | |
| CN114095457A (en) | Shared buffer resource management based on flow | |
| CN107835133B (en) | Stream priority control method based on multi-attribute decision | |
| Imtiaz et al. | Approaches to reduce the latency for high priority traffic in IEEE 802.1 AVB networks | |
| CN112005528B (en) | Data exchange method, data exchange node and data center network | |
| CN110868359A (en) | Network congestion control method | |
| CN102209028A (en) | Flow control device and method for CPU (Central Processing Unit) | |
| CN112073230B (en) | Simplified network system compatible with standard AFDX (avionics full Duplex switched Ethernet) network | |
| Kaur et al. | Core-stateless guaranteed throughput networks | |
| US7324441B1 (en) | Methods and apparatus for alleviating deadlock in a fibre channel network | |
| CN110247859B (en) | Data sending method and device based on AIRT-ROS node | |
| CN114338544B (en) | Flow control method of FC switching network based on priority |
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 |