CN114338544B - 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
- CN114338544B CN114338544B CN202111592250.5A CN202111592250A CN114338544B CN 114338544 B CN114338544 B CN 114338544B CN 202111592250 A CN202111592250 A CN 202111592250A CN 114338544 B CN114338544 B CN 114338544B
- Authority
- CN
- China
- Prior art keywords
- network
- priority
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000005540 biological transmission Effects 0.000 claims abstract description 84
- 238000004891 communication Methods 0.000 claims abstract description 48
- 230000003068 static effect Effects 0.000 claims abstract description 25
- 238000013439 planning Methods 0.000 claims abstract description 5
- 238000012545 processing Methods 0.000 claims description 12
- 230000007246 mechanism Effects 0.000 description 9
- 238000007726 management method Methods 0.000 description 8
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a flow control method of an FC switching network based on priority, which comprises the following steps: step 1: planning network communication definition according to communication traffic of communication nodes in a network and importance degree of communication data, wherein the communication traffic 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 machine and the switch by adopting a mode of transmitting static priority levels according to network communication definition; 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; step 4: and when the network operates, 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 parameter to limit the flow of all the flows with different priorities in the network, so that the normal communication of high-priority data is ensured.
Description
Technical Field
The invention belongs to the computer network communication technology, and particularly relates to a flow control method of an FC switching network based on priority.
Background
The Fiber Channel (FC) network consists of an FC switch and FC node machines, wherein all the FC node machines are connected with the FC switch through full duplex links to form a single-redundancy or dual-redundancy network architecture, and the exchange capacity of the high-speed avionics network is realized. In the fiber channel network, the flow control mechanism determines the exchange capacity and exchange index of the transmission data in the exchange network, ensures the reliability of the data with different task grades in the network transmission process, and ensures the delay of the data to be in a reasonable range. The design of the flow control mechanism determines the transmission capacity of the whole FC network.
The FC protocol used by the existing avionic network refers to three types of 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: and each time the sending end sends out a message, the credit value is decremented, and when the sending end receives a confirmation request of the receiving end, the credit value is incremented.
The original FC network adopts an end-to-end credit mode to manage the data transmission between two ports, and the FC network traffic of a single physical link is only managed, so that the data of different task grades cannot be effectively managed. Thus, the present invention innovatively designs a mechanism for flow control by priority based on a high speed FC network.
Disclosure of Invention
The purpose of the invention is that: a flow control method of an FC network based on a high-speed FC network is provided, a flow control principle method and requirements are designed and set forth, and a calculation formula is provided. The traffic policing method is capable of providing different levels of service capabilities to different task level data in the FC network.
The technical scheme is as follows: the application provides a traffic control method of an FC switching network based on priority, which comprises the following steps:
step 1: planning network communication definition according to communication traffic of communication nodes in a network and importance degree of communication data, wherein the communication traffic 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 machine and the switch by adopting a mode of transmitting static priority levels according to the network communication definition;
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;
step 4: and when the network operates, 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 parameter to limit the flow of all the flows with different priorities in the network, so that the normal communication of high-priority data is ensured.
Specifically, the communication traffic includes a maximum transmission bandwidth and a maximum transmission delay, and the communication data importance program is a data transmission static priority level, specifically including:
the maximum transmission bandwidth refers to the maximum number of bytes that can be transmitted by the network in unit time, and the maximum transmission delay refers to the maximum time from the data transmitting end to the data receiving end.
Specifically, the importance degree of the communication data is a data transmission static priority level, and the higher the importance degree of the data is, the higher the data transmission static priority level is.
Specifically, the configuring the communication queues of the node machine and the switch by adopting a mode of transmitting the static priority level according to the network priority level specifically includes:
the transmission static limited level refers to a static priority level of data transmission; the priority level is statically configured according to 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 scheduling modes of different transmission static priority level communication queues schedule according to the static priority level, and the high priority level schedules before the low priority level so as to ensure that the data in the high priority level queue is sent preferentially.
Specifically, at the network operation 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 parameter to limit the flow of all the flows with different priorities in the network, so as to ensure the normal communication of high-priority data, and specifically comprises the following steps:
the priority queue refers to: each static priority corresponds to a data transmission queue, including a data transmission queue and a data reception queue. And at the time of data transmission, adopting a scheduling mode based on priority by using queues with different priorities.
Specifically, the scheduling manner based on the priority is adopted by the queues with different priorities at the time of data transmission, and the scheduling manner specifically comprises the following steps:
the node machine or the exchanger transmitting end uses a priority-based mode to schedule the transmitting and receiving actions of the data queues with different priorities;
at the time of queue scheduling, the system schedules the high-priority queue preferentially until the high-priority queue is empty, then serves the next-level queue, and so on until the system schedules all priority packets, and by the scheduling mode, the system can ensure the real-time performance and the accessibility of key data transmission;
the queue adopts a non-preemptive scheduling mode at the scheduling moment, when the data with high priority reaches the moment, if the data/queue with low priority is in the processing process at the moment, the queue with high priority cannot forcedly occupy the processing resources, and if and only after the processing of the data/queue with low priority is completed, the queue with high priority can preferentially occupy the processing resources.
Specifically, the flow limiting policy refers to that in a unit time, the flow output by a certain node of the network does not exceed the upper limit of the flow specified by the algorithm parameter of the token bucket.
Specifically, the node machine calculates and initializes the token bucket algorithm parameters based on the flow according to the maximum transmission bandwidth and the maximum transmission delay of the network, and specifically includes:
and calculating 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 promised message rate and a promised burst size.
In summary, the present application provides a priority-based FC switching network traffic control method. The technical scheme of the invention is as follows: referring to the flow management mode of the FC node machine/exchanger based on credit and the flow control principle requirement based on the token bucket, the transmission scene of multiple priority in the airborne network is considered, and the FC network flow management control method is designed based on the data priority flow control mode, so that the technical difficulty of FC network flow control 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 a credit mechanism in the multi-priority airborne network by selecting a reasonable flow control object, a reasonable flow control parameter and a reasonable flow control method, and realizes the fine management of FC network data transmission.
Drawings
Fig. 1 is a schematic diagram of a priority-based isolated 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 in avionics systems, switch-centric star-structured FC switching networks are typically used. Credit mechanisms are typically employed in FC networks for traffic management and control. In the flow control method based on the credit mechanism, when a large-scale burst flow exists in the network, a data back pressure condition occurs, namely when the receiving capacity of a receiving port reaches the upper limit, the R_RDY primitive cannot be replied in time, so that all ports communicating with the receiving port cannot normally send all FC data frames. All communication data frames on the communication port are prevented from being transmitted when a data backpressure condition occurs in the network. For important data transmitted on a port, a packet loss situation may occur.
Therefore, there is a need for a priority-based traffic policing method that meets the following criteria: 1. support the mixed transmission of the data of different priorities; 2. real-time transmission resources can be ensured for high-priority data; 3. the condition of burst traffic of the network can be supported;
the invention provides a flow management control algorithm based on data transmission priority: at the transmitting end of the node machine/switch, a token bucket (hereinafter referred to as token bucket) flow control mechanism based on flow statistics is used to set different flow control parameters for different priorities, so that flow classification management based on priorities is realized, the control occurrence time is located at a data transmission time point, the flow control mechanism needs to check the token bucket corresponding to the priorities, and the size of the data transmitted at this time is ensured to meet the number of tokens in the current token bucket, namely the maximum flow allowed to be transmitted by the current flow control algorithm.
In this way, at the node machine or the switch transmitting end, different token buckets based on data traffic are defined according to the priority, so that the maximum traffic allowed to be transmitted by each token bucket is different. On the premise that the node machine or the switch normally transmits data, the real-time transmission of high-priority traffic is ensured, and traffic burst and large-scale concurrent communication of other priority data are supported. Because different priority data uses different traffic token buckets, the traffic of the different priority data is isolated from each other, and low priority data traffic communications do not affect the normal transmission of high priority data over the network.
As shown in fig. 1, the present invention provides a traffic control method of an FC switching network based on priority, the method is applied to a sender 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 of each node in the network and the importance degree of communication data. The network communication definition includes: the method comprises the steps of defining the maximum transmission bandwidth and the maximum transmission delay of each priority in unit time according to the number of 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, configuring the communication queues of the node machine and the switch in a static priority mode, setting the scheduling modes of the communication queues with different priorities as priority scheduling, and ensuring that data in the high-priority queue is sent preferentially;
the priority queue refers to: at the time of I CD design, network transmission priority planning is performed in advance on messages transmitted in the airborne network, where each priority corresponds to a data transmission queue, and the data transmission queue and the data reception queue are included. Different queues adopt a scheduling mode based on priority at the time of data transmission. At the time of queue scheduling, the system schedules the high-priority queue preferentially until the high-priority queue is empty, then serves the next-level queue, and so on until the system schedules all priority packets, and by the scheduling mode, the system can ensure the real-time performance and the accessibility of key data transmission. Meanwhile, in order to ensure the integrity of data transmission, a non-preemptive scheduling mode is adopted for the queues at the scheduling moment, when the data with high priority reaches the moment, if the data/queue with low priority is in the processing process at the moment, the queue with high priority cannot forcedly occupy the processing resources, and if and only after the processing of the data/queue with low priority is completed, the queue with high priority can preferentially occupy the processing resources.
The priority queue scheduling refers to the sending and receiving actions of a node machine or a switch sending end for scheduling the data queues with different priorities in a priority-based mode.
Step 3: and calculating and initializing token bucket algorithm parameters based on the flow according to the maximum transmission bandwidths and the maximum transmission delays of the data transmission with different priorities in the unit time, and selecting and executing a flow limiting strategy according to the implementation characteristics of the node machine.
The core of flow control in the priority-based flow control method is a token bucket filtering algorithm based on flow, and the algorithm is shown in fig. 2.
The token bucket algorithm refers to: 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, 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 method is different in that the token in the token bucket is filtered by taking the data frame as a unit at the moment of using the token bucket algorithm based on the data frame, the realization is simple, the efficiency is high, but the traffic management is not fine enough due to the different sizes of the frames. The byte-based token bucket algorithm takes the number of bytes of the current passing data frame as the number of tokens, can realize fine management on the current passing traffic, and can accurately calculate the traffic on the current physical link.
Illustratively, step 3 takes a frame-based token bucket algorithm as an example, whose workload is described as follows:
step 3.1, when the data stream arrives at the exit of the sending link, firstly, 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 for data transmission.
Step 3.2 the flow control method consumes one token in the token bucket every time the current link transmits one frame of data.
Step 3.3 in order for the data to be successfully transferred must ensure that there are enough tokens in the token bucket, and if the number of tokens is insufficient, the data frame must wait in the transmit queue until there are enough tokens to allow the data to be retransmitted or discarded.
By the method, the purpose of limiting the flow of the data frames can be achieved by controlling the speed of token generation, so that the transmission speed of the data frames is smaller than or equal to the speed of token bucket generation of the tokens, and the purpose of limiting the flow is achieved.
On the other hand, the network can evaluate the flow state of the current network running time by counting the number of tokens in token buckets with different priorities in each device. By using a token bucket algorithm, the traffic control method allows burst traffic to exist in the network, and meets the requirements of the application on the burst traffic in emergency.
The following describes a configuration mode of the token bucket algorithm by taking a data frame as a control object as an example.
The token bucket algorithm has the following four configuration attributes, namely a token bucket flag number, token generation time, a promised message rate and a promised burst size.
1) Token bucket flag number: the mark numbers are counted from 0 and are in one-to-one correspondence with priority levels in the network;
2) Token generation time: the new tokens in the token bucket are added to the bucket interval time in milliseconds. When the token bucket is full, the newly added token is discarded;
3) Promise message rate: representing a rate of delivery of tokens into a token bucket;
4) Promise 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.
Step 4: and at the network permission moment, 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 flow-based token bucket algorithm, so that the normal communication of the high-priority data is ensured.
Claims (3)
1. A method for traffic policing of an FC switching network based on priority, the method comprising:
step 1: planning network communication definition according to communication flow of communication nodes in a network and importance degree of communication data, wherein the communication flow comprises maximum transmission bandwidth and maximum transmission delay, the importance degree of the communication data is a data transmission static priority level, and the higher the importance degree of the data is, the higher the data transmission static priority level is; the maximum transmission bandwidth refers to the maximum byte number which can be transmitted by the network in unit time, and the maximum transmission delay refers to the maximum time from a data transmitting end to a data receiving end;
step 2: according to the network communication definition, adopting a mode of transmitting static priority level to configure the communication queues of the node machine and the switch, wherein the method specifically comprises the following steps: the transmission static priority level refers to a static priority level of data transmission; the priority level is statically configured according to 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; scheduling modes of different transmission static priority level communication queues schedule according to the static priority level, and the high priority level schedules before the low priority level so as to ensure that data in the high priority level queue is sent preferentially;
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;
step 4: in the running time of the network, the network node machine or the network switch adopts a transmission mode of a priority queue according to the data transmission static priority level and the token bucket algorithm parameter to limit the flow of all the flows with different priorities in the network, so that the normal communication of high-priority data is ensured;
the priority queue refers to: each static priority corresponds to a data transmission queue, and comprises a data transmission queue and a data receiving queue;
the scheduling mode based on priority is adopted for the queues with different priorities at the time of data transmission, and the scheduling method specifically comprises the following steps:
the node machine or the exchanger transmitting end uses a priority-based mode to schedule the transmitting and receiving actions of the data queues with different priorities;
at the time of queue scheduling, the system schedules the high-priority queue preferentially until the high-priority queue is empty, then serves the next-level queue, and so on until the system schedules all priority packets, and by the scheduling mode, the system can ensure the real-time performance and the accessibility of key data transmission;
the queue adopts a non-preemptive scheduling mode at the scheduling moment, when the data with high priority reaches the moment, if the data/queue with low priority is in the processing process at the moment, the queue with high priority cannot forcedly occupy the processing resources, and if and only after the processing of the data/queue with low priority is completed, the queue with high priority can preferentially occupy the processing resources.
2. The method for traffic control in an FC switching network according to claim 1, wherein the traffic restriction 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 a unit time.
3. The method for traffic policing in an FC switching network according to claim 1, wherein said node machine calculates and initializes traffic-based token bucket algorithm parameters based on a network maximum transmission bandwidth and maximum transmission delay, specifically comprising:
and calculating 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 promised message rate and a promised 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 CN114338544A (en) | 2022-04-12 |
| CN114338544B true 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 |
|---|---|
| CN114338544A (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7002911B1 (en) | Flow control mechanism | |
| EP1882336B1 (en) | Queue aware flow control | |
| US7492779B2 (en) | Apparatus for and method of support for committed over excess traffic in a distributed queuing system | |
| CA2546624C (en) | Apparatus and method for improved fibre channel oversubscription over transport | |
| 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 | |
| WO2010020988A2 (en) | System and methods for distributed quality of service enforcement | |
| WO2002098080A1 (en) | System and method for scheduling traffic for different classes of service | |
| RU2427091C2 (en) | Device and method for speed limit-based flow control for mstp device | |
| CN100550852C (en) | A kind of method and device thereof of realizing mass port backpressure | |
| US7631096B1 (en) | Real-time bandwidth provisioning in a switching device | |
| CN101692648A (en) | Method and system for queue scheduling | |
| CN110868359B (en) | Network congestion control method | |
| WO2002098047A2 (en) | System and method for providing optimum bandwidth utilization | |
| CN101836196B (en) | Methods and systems for providing efficient provisioning of data flows | |
| CN112005528B (en) | Data exchange method, data exchange node and data center network | |
| CN112073230B (en) | Simplified network system compatible with standard AFDX (avionics full Duplex switched Ethernet) network | |
| CN114338544B (en) | Flow control method of FC switching network based on priority | |
| Kaur et al. | Core-stateless guaranteed throughput networks | |
| CN100502370C (en) | Optimizing system and method for medium transmission on different transmission channels | |
| Hassani et al. | Work-in-progress: Layering concerns for the analysis of credit-based shaping in IEEE 802.1 TSN | |
| CN117014384A (en) | Message transmission method and message forwarding equipment | |
| Min et al. | Traffic scheduling strategy of power communication network based on SDN | |
| JP2000295281A (en) | Flow controller and flow controller method for multicast packet | |
| Liu et al. | Deployment of Asynchronous Traffic Shapers in Data Center Networks |
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 |