CN112787956B - Method, system, storage medium and application for crowding occupation processing in queue management - Google Patents

Abstract

The invention belongs to the technical field of wireless communication, and discloses a method, a system, a storage medium and an application for crowding occupation in queue management, wherein when grouping is enqueued, the residual amount of available cache space of a destination port of a current data frame is judged; judging the priority of the data frame stored in the destination port cache space of the current data frame; after judging that the high-priority data frames which are squeezed to occupy are successfully enqueued, judging that the squeezing to occupy needs to be carried out through the priority of the data frames stored in the destination port cache space of the current data frames, extracting destination port, frame length and priority information in the data frames, and writing the information into a corresponding value in a squeezing to occupy information table; updating the crowding information table; and reading the occupation information table when occupation is effective, and dequeuing and scheduling each priority. The invention ensures that the buffer memory of each port is enough to store the next longest data frame in the limit state for high priority to carry out crowding; when flow control is performed or the input flow exceeds the capacity of the switch, the enqueue of the incoming high-priority data frames is ensured as much as possible.

Description

A method, system, storage medium and application for crowding processing in queue management

technical field

The invention belongs to the technical field of wireless communication, and in particular relates to a method, system, storage medium and application for crowding processing in queue management.

Background technique

At present: the satellite is equipped with switching equipment, which can greatly improve the data transmission efficiency of the satellite communication system and provide convenience for flexibly meeting the various needs of users. The information transmission between the terrestrial network and the satellite network can be realized more conveniently and quickly. The on-board switching equipment can replace the switching equipment of the ground station to complete the switching management work, and can form a network by itself. With the development of satellites and space stations, the services processed also increase, and the priority of services also increases. It is of great significance to ensure high-priority services.

The packet forwarding process includes packet reception and buffering, output port lookup, queue management, dequeue scheduling, and packet sending. Queue management is an important function of packet switching equipment, and the crowded processing method can further ensure the stable transmission of high-priority services.

Xi'an University of Electronic Science and Technology disclosed a queue management method and device in the patent document "Queue Management Method and Device for Storing Variable-Length Packet Based on Fixed-Length Unit" (Publication No. CN 102377682 B). On the basis of storing variable-length packets based on fixed-length units, the method divides the queue storage space into basic cache units of equal size, sets a cache descriptor for each unit, and stores these descriptors in the cache descriptor storage table. A linked list is formed; the disadvantages of this method used in packet switching systems are: first, the complexity of the current business type increases, and as the number of logical ports under the physical port increases, the cache required for queue management needs to be greatly increased; second , there are different priorities for the same queue. If the low-priority packet occupies the cache, the high-priority packet cannot be queued. For one, under the queue management with crowding, there is no need to set a minimum threshold for each priority, and the queue buffer does not need to increase as the priority increases.

Through the above analysis, the existing problems and defects in the prior art are: in the queue management in the existing packet switching system, the low-priority service data occupies the cache, and the high-priority cannot be queued.

The difficulty of solving the above problems and defects is as follows: in the queue management method and device for storing variable-length packets based on fixed-length units, since the packet length is flexible and variable, the variable-length packets are crowded, which has greater randomness, and the fixed-length packets are occupied. The management of cells is very complex and involves random updates of multiple entries. At the same time, the fixed-length unit is managed according to the linked list, and random coverage of the fixed-length unit will cause the linked list to be chaotic.

The significance of solving the above problems and defects is: establishing a crowded buffer area with the longest frame, and discarding crowded packets on the basis of the original dequeuing, which can maintain the stability of the linked list. In the existing communication system, high-priority services are often handshake information. Once blocked, the link will be disconnected. The realization of high-priority crowding can ensure that high-priority services are more fully guaranteed, and further ensure the link reliability.

SUMMARY OF THE INVENTION

Aiming at the problems existing in the prior art, the present invention provides a method, system, storage medium and application for crowding processing in queue management.

The present invention is implemented in the following way, a method for processing crowding in queue management, and the method for processing crowding in queue management includes:

Set a buffer area for each port, and each priority queue under each port shares the buffer; when the group is queued, determine the remaining amount of buffer space available at the destination port of the current data frame; determine the buffer space stored in the destination port of the current data frame. The priority of the data frame; ensure that the high priority can enter the buffer area under limited circumstances.

When the high-priority data frame judged to be crowded is successfully entered into the queue, the priority of the data frame stored in the buffer space of the destination port of the current data frame needs to be crowded, and the destination port, frame length, and priority information in the data frame are extracted. Write it as the corresponding value in the crowding information table; update the crowding information table; provide the basis for how to judge whether the low priority is crowded for dequeuing.

When the crowding is valid, read the crowding information table, and perform dequeue scheduling for each priority; access the crowding information table, when the crowding flag is valid, determine the port that needs to be crowded according to the destination port, and judge whether the destination port can have enough space for a maximum Long frame: According to the order of priority of each queue under the port from low to the priority in the crowding information table, dequeue operations one by one until the available buffer space satisfies a longest frame. This ensures that the cache space can be squeezed the next time.

Further, determining the remaining amount of buffer space available for the destination port of the current data frame by the crowding processing method in the queue management includes;

If the current destination port buffer space is larger than the actual buffer space after adding the length of the data frame to be queued, the queue will fail;

If the current destination port buffer space is not enough to store a longest data frame after adding the length of the data frame to be queued, further judgment is required;

If the buffer space available on the current destination port is sufficient to store the longest data frame, the frame is successfully enqueued.

Further, in the described queue management, the processing method for judging the priority of the data frame stored in the destination port cache space of the current data frame includes; after judging the remaining amount of cache space available at the destination port of the current data frame, the enqueue is successful and the current destination port cache is successful. If the space is not enough to store the longest data frame, the priority of the data frame stored in the destination port buffer space of the current data frame is read for judgment;

If the current destination port buffer space is lower than the data frame priority and the sum of the queue lengths is less than the data frame length of this priority, the queue will fail;

If the current destination port buffer space is lower than the data frame priority and the sum of the queue lengths is greater than or equal to the data frame length of this priority, the queue entry is successful and it needs to be crowded.

Further, the crowding information table is used to store the information of the data frame in which crowding occurs, and it consists of a table, and the table entry has 3 items of information: destination port, frame length, and priority.

Further, when the crowding is valid, the crowding information table is read, and the dequeue scheduling is performed for each priority: when a group of a certain queue is dequeued, if the crowding flag is valid, the frame is discarded, otherwise it is normal. out of the team.

Another object of the present invention is to provide a computer device, the computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the following step:

Set a buffer area for each port, and each priority queue under each port shares the buffer; when the group is queued, determine the remaining amount of buffer space available at the destination port of the current data frame; determine the buffer space stored in the destination port of the current data frame. the priority of the data frame;

When the high-priority data frame judged to be crowded is successfully entered into the queue, the priority of the data frame stored in the buffer space of the destination port of the current data frame needs to be crowded, and the destination port, frame length, and priority information in the data frame are extracted. Write as the corresponding value in the crowding information table; update the crowding information table;

When the crowding is valid, read the crowding information table, and perform dequeue scheduling for each priority; access the crowding information table, when the crowding flag is valid, determine the port that needs to be crowded according to the destination port, and judge whether the destination port can have enough space for a maximum Long frame; according to the order of priority of each queue under the port from low to the priority in the crowding information table, dequeue operations one by one until the available buffer space satisfies a longest frame;

When a group of a queue is dequeued, if the crowding flag is valid, the frame will be discarded, otherwise it will be dequeued normally.

Another object of the present invention is to provide a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, causes the processor to perform the following steps:

Set a buffer area for each port, and each priority queue under each port shares the buffer; when the group is queued, determine the remaining amount of buffer space available at the destination port of the current data frame; determine the buffer space stored in the destination port of the current data frame. the priority of the data frame;

When the high-priority data frame judged to be crowded is successfully entered into the queue, the priority of the data frame stored in the buffer space of the destination port of the current data frame needs to be crowded, and the destination port, frame length, and priority information in the data frame are extracted. Write as the corresponding value in the crowding information table; update the crowding information table;

When the crowding is valid, read the crowding information table, and perform dequeue scheduling for each priority; access the crowding information table, when the crowding flag is valid, determine the port that needs to be crowded according to the destination port, and judge whether the destination port can have enough space for a maximum Long frame; according to the order of priority of each queue under the port from low to the priority in the crowding information table, dequeue operations one by one until the available buffer space satisfies a longest frame;

When a group of a queue is dequeued, if the crowding flag is valid, the frame will be discarded, otherwise it will be dequeued normally.

Another object of the present invention is to provide a queue management crowding processing system for implementing the queue management crowding processing method, and the queue management crowding processing system includes:

The priority queue cache sharing module is used to set a buffer area for each port, and each priority queue under each port shares the buffer;

The crowding information table update module is used to update the crowding information table after the high-priority data frame judged to be crowded is successfully entered into the queue;

The dequeue scheduling module is used to read the crowding information table when crowding is effective, and perform dequeue scheduling for each priority;

The packet dequeue processing module is used to discard the frame if the crowding flag is valid when a group of a queue is dequeued, otherwise, the frame is dequeued normally.

Another object of the present invention is to provide a wireless communication control system, the wireless communication control system is used to implement the method for crowding in queue management.

Another object of the present invention is to provide a satellite communication system, which is used for implementing the method for crowding in queue management.

Combining all the above technical solutions, the advantages and positive effects of the present invention are: in the prior art, when a low priority occupies the buffer area managed by the queue, the high priority cannot be served, and the high priority can be guaranteed by the processing method of crowding. business. In the prior art, when the priority of the same destination port increases, more buffer area guarantees are required. The unlimited increase of the buffer area can be avoided by crowding.

It is assumed that under the requirement of traffic burst tolerance, the buffer area is at least M, the storage space of a longest frame is N, and M=16N. For the buffer area required by the prior art, the minimum threshold of a priority is 2N, which can ensure that the enqueue and dequeue of a longest frame can be performed at the same time.

The invention ensures that the buffer of each port is sufficient to store the longest data frame in the limit state, so as to prepare for the high priority to crowd; when the flow control is performed or the input flow exceeds the capacity of the switch, the lower than the current queue by discarding the port The data frames of the low-priority queue of the frame priority, as far as possible, ensure that the incoming high-priority data frames are queued.

Description of drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the following will briefly introduce the drawings that need to be used in the embodiments of the present application. Obviously, the drawings described below are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort.

FIG. 1 is a flowchart of a method for processing crowding in queue management provided by an embodiment of the present invention.

2 is a schematic structural diagram of a crowding processing system in queue management provided by an embodiment of the present invention;

In Fig. 2: 1. Priority queue cache sharing module; 2. Occupation information table updating module; 3. Dequeue scheduling module; 4. Packet dequeue processing module.

FIG. 3 is a flowchart of an implementation of information processing for entering a queue provided by an embodiment of the present invention.

FIG. 4 is a flowchart of an implementation of updating a crowding information table provided by an embodiment of the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.

In view of the problems existing in the prior art, the present invention provides a method, system, storage medium and application for crowding in queue management. The present invention will be described in detail below with reference to the accompanying drawings.

As shown in FIG. 1 , the method for processing crowding in queue management provided by the present invention includes the following steps:

S101: Set a buffer area for each port, and each priority queue under each port shares the buffer; when the group is queued, determine the remaining amount of buffer space available at the destination port of the current data frame; determine the buffer space of the destination port of the current data frame the priority of the stored data frame;

S102: After the high-priority data frame judged to be crowded is successfully entered into the queue, the priority of the data frame stored in the buffer space of the destination port of the current data frame needs to be crowded, and the destination port, frame length, and priority of the data frame are extracted. Information, written as the corresponding value in the crowding information table; update the crowding information table;

S103: when the crowding is valid, read the crowding information table, and perform dequeue scheduling for each priority; access the crowding information table, and when the crowding flag is valid, determine the port that needs to be crowded according to the destination port, and determine whether the space available for the destination port is sufficient A longest frame; according to the order of priority of each queue under the port from low to the priority in the crowding information table, dequeue operations one by one until the available buffer space satisfies a longest frame;

S104: When a group in a certain queue is dequeued, if the crowding flag is valid, the frame is discarded, otherwise, it is dequeued normally.

Those skilled in the art of the method for processing crowding in queue management provided by the present invention may also use other steps to implement the method. The method for processing crowding in queue management provided by the present invention in FIG. 1 is only a specific embodiment.

As shown in Figure 2, the crowding processing system in queue management provided by the present invention includes:

The priority queue cache sharing module 1 is used to set a cache area for each port, and each priority queue under each port shares the cache;

The crowding information table update module 2 is used to update the crowding information table after the high-priority data frame judged to be crowded is successfully entered into the queue;

The dequeue scheduling module 3 is used to read the crowding information table when the crowding is effective, and perform dequeue scheduling for each priority;

The grouping dequeue processing module 4 is used for discarding the frame if the crowding flag is valid when a group in a certain queue is dequeued, otherwise, the frame is normally dequeued.

The technical solutions of the present invention will be further described below with reference to the accompanying drawings.

Queue management in the present invention: its function is to assign different queues to different priorities of ports, and to dequeue from high to low when dequeuing, so as to realize the distinction of service quality; crowding: based on queue management, different priorities share a cache , when the low priority occupies the buffer area, the high priority can squeeze the cache space of the low priority to further ensure the high priority.

The crowded processing method in queue management provided by the present invention specifically includes the following steps:

The first step is to set a buffer area for each port, and each priority queue under each port shares the buffer; when the group is queued, determine the remaining amount of buffer space available at the destination port of the current data frame; determine the destination port of the current data frame The priority of the data frame stored in the cache space; the processing process of grouping into the queue is shown in Figure 3:

(1) Judging the remaining amount of cache space available to the destination port of the current data frame;

If the current destination port buffer space is larger than the actual buffer space after adding the length of the data frame to be queued, the queue will fail;

If the current destination port buffer space is not enough to store a longest data frame after adding the length of the data frame to be queued, further judgment is required;

If the buffer space available on the current destination port is sufficient to store the longest data frame, the frame is successfully enqueued.

(2) judging the priority of the data frame stored in the destination port buffer space of the current data frame;

After the judgment of (1), the entry into the team is successful and the current destination port cache space is not enough to store a longest data frame on the basis of reading the priority of the data frame stored in the destination port cache space of the current data frame to judge;

If the current destination port buffer space is lower than the data frame priority and the sum of the queue lengths is less than the data frame length of this priority, the queue will fail;

If the current destination port buffer space is lower than the data frame priority and the sum of the queue lengths is greater than or equal to the data frame length of this priority, the queue entry is successful and it needs to be crowded.

In the second step, after the high-priority data frame that is judged to be crowded is successfully entered into the queue, the priority of the data frame stored in the buffer space of the destination port of the current data frame needs to be crowded, and the destination port in the data frame, the frame length, The priority information is written as the corresponding value in the crowding information table; the crowding information table is updated as shown in Figure 4; the crowding information table is used to store the information of the data frame where crowding occurs, it consists of a table, and the table items are 3 items of information: destination port, frame length, priority;

The third step is to read the crowding information table when the crowding is valid, and dequeue each priority; dequeue the data frames lower than the priority in the crowding information table from low to high until the available buffer area satisfies a The longest frame is valid, and the crowded flag is updated at the same time; the dequeue scheduling process includes: accessing the crowding information table, when the crowding flag is valid, determining the port that needs to be crowded according to the destination port, and judging whether the space available for the destination port satisfies a longest frame. frame; according to the order of priority of each queue under the port from low to the priority in the crowding information table, dequeue operations one by one until the available buffer space satisfies a longest frame;

In the fourth step, when a group of a queue is dequeued, if the crowding flag is valid, the frame will be discarded, otherwise, it will be dequeued normally.

Tested by a network tester, the eight priorities are 327692-327689, the priority is from low to high, each priority is 12M, the total flow is 96M, and the flow control is 44.4M. The crowding processing method ensures that relatively high priority corresponds to no frame loss .

It should be noted that the embodiments of the present invention may be implemented by hardware, software, or a combination of software and hardware. The hardware portion may be implemented using special purpose logic; the software portion may be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. Those of ordinary skill in the art will appreciate that the apparatus and methods described above may be implemented using computer-executable instructions and/or embodied in processor control code, for example on a carrier medium such as a disk, CD or DVD-ROM, such as a read-only memory Such code is provided on a programmable memory (firmware) or a data carrier such as an optical or electronic signal carrier. The device and its modules of the present invention can be implemented by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., It can also be implemented by software executed by various types of processors, or by a combination of the above-mentioned hardware circuits and software, such as firmware.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art is within the technical scope disclosed by the present invention, and all within the spirit and principle of the present invention Any modifications, equivalent replacements and improvements made within the scope of the present invention should be included within the protection scope of the present invention.

Claims (8)

1. A method for handling crowding in queue management is characterized in that the method for handling crowding in queue management comprises the following steps:

setting a buffer area for each port, wherein each priority queue under each port shares the buffer; when the packet is enqueued, judging the residual amount of available buffer space of a destination port of the current data frame; judging the priority of the data frame stored in the destination port cache space of the current data frame;

after judging that the high-priority data frames which are squeezed to occupy are successfully enqueued, judging that the squeezing to occupy needs to be carried out through the priority of the data frames stored in the destination port cache space of the current data frames, extracting destination port, frame length and priority information in the data frames, and writing the information into a corresponding value in a squeezing to occupy information table; updating the crowding information table;

reading the occupation information table when occupation is effective, and dequeuing and scheduling each priority; accessing an occupation information table, determining a port needing to be occupied according to a target port when an occupation flag bit is effective, and judging whether the available space of the target port meets a longest frame; according to the sequence of the priority of each queue in the port from low to the priority in the crowding occupation information table, dequeuing one by one until the available buffer space meets a longest frame;

the method for processing the crowding in the queue management judges that the priority of the data frame stored in the target port cache space of the current data frame comprises the priority; reading the priority of the data frame stored in the buffer space of the destination port of the current data frame for judgment on the basis that the queuing is successfully judged through the residual amount of the buffer space available at the destination port of the current data frame and the buffer space of the current destination port is not enough to store one longest data frame;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is less than the length of the priority data frame, the enqueue is failed;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is greater than or equal to the length of the priority data frame, the enqueue is successful and the data frame needs to be crowded and occupied;

when the occupation is effective, the occupation information table is read, and after dequeuing and scheduling are carried out on each priority, the following steps are required: when a certain queue has a packet to be dequeued, if the occupation flag bit is effective, the frame is discarded, otherwise, the queue is normally dequeued.

2. The method according to claim 1, wherein the method for handling squashing in queue management determines the remaining amount of available buffer space of the destination port of the current data frame;

if the current destination port cache space is larger than the actual cache space after the length of the data frame needing to be enqueued is added, the enqueuing fails;

if the current destination port cache space is not enough to store a longest data frame after adding the length of the data frame to be enqueued, further judgment is needed;

if the available buffer space of the current destination port is enough to store one longest data frame, the frame is enqueued successfully.

3. The method as claimed in claim 1, wherein the preemption information table is used to store information of data frames where preemption occurs, and comprises a table, and the table entry has 3 items of information: destination port, frame length, priority.

4. A computer device, characterized in that the computer device comprises a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to carry out the steps of:

setting a buffer area for each port, wherein each priority queue under each port shares the buffer; when the grouping is enqueued, judging the residual amount of the available buffer space of the destination port of the current data frame; judging the priority of the data frame stored in the destination port cache space of the current data frame;

after judging that the high-priority data frames which are squeezed to occupy are successfully enqueued, judging that the squeezing to occupy needs to be carried out through the priority of the data frames stored in the destination port cache space of the current data frames, extracting destination port, frame length and priority information in the data frames, and writing the information into a corresponding value in a squeezing to occupy information table; updating the crowding information table;

reading the occupation information table when occupation is effective, and dequeuing and scheduling each priority; accessing an occupation information table, determining a port needing occupation according to a target port when an occupation flag bit is effective, and judging whether the space of the target port can meet a longest frame; according to the sequence of the priority of each queue in the port from low to the priority in the crowding occupation information table, dequeuing one by one until the available buffer space meets a longest frame;

when a certain queue has packets to dequeue, if the occupation flag bit is effective, the frame is discarded, otherwise, the packets are dequeued normally;

the method for processing the crowding in the queue management judges that the priority of the data frame stored in the target port cache space of the current data frame comprises the priority; reading the priority of the data frame stored in the buffer space of the destination port of the current data frame for judgment on the basis that the queuing is successfully judged through the residual amount of the buffer space available at the destination port of the current data frame and the buffer space of the current destination port is not enough to store one longest data frame;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is less than the length of the priority data frame, the enqueue is failed;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is greater than or equal to the length of the priority data frame, the enqueue is successful and the data frame needs to be crowded and occupied.

5. A computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the steps of:

setting a buffer area for each port, wherein each priority queue under each port shares the buffer; when the packet is enqueued, judging the residual amount of available buffer space of a destination port of the current data frame; judging the priority of the data frame stored in the destination port cache space of the current data frame;

after judging that the high-priority data frames which are squeezed to occupy are successfully enqueued, judging that the squeezing to occupy needs to be carried out through the priority of the data frames stored in the destination port cache space of the current data frames, extracting destination port, frame length and priority information in the data frames, and writing the information into a corresponding value in a squeezing to occupy information table; updating the crowding information table;

reading the occupation information table when the occupation is effective, and performing dequeue scheduling on each priority; accessing an occupation information table, determining a port needing occupation according to a target port when an occupation flag bit is effective, and judging whether the space of the target port can meet a longest frame; according to the sequence of the priority of each queue from low priority to the priority in the crowding occupation information table under the port, dequeuing one by one until the available buffer space meets a longest frame;

when a certain queue has packets to dequeue, if the occupation flag bit is effective, the frame is discarded, otherwise, the packets are dequeued normally;

the method for processing the crowding in the queue management judges that the priority of the data frame stored in the target port cache space of the current data frame comprises the priority; reading the priority of the data frame stored in the buffer space of the destination port of the current data frame for judgment on the basis that the queuing is successfully judged through the residual amount of the buffer space available at the destination port of the current data frame and the buffer space of the current destination port is not enough to store one longest data frame;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is less than the length of the priority data frame, the enqueue is failed;

if the sum of the queue lengths of the current destination port cache space lower than the priority of the data frame is greater than or equal to the length of the priority data frame, the enqueue is successful and the data frame needs to be crowded and occupied.

6. A queue management preemption processing system for implementing the queue management preemption processing method of any claim from 1 to 3, wherein the queue management preemption processing system comprises:

the priority queue cache sharing module is used for setting a cache region for each port, and each priority queue under each port shares the cache;

the system comprises an occupation information table updating module, a display module and a display module, wherein the occupation information table updating module is used for updating an occupation information table after judging that the occupied high-priority data frames are successfully enqueued;

the dequeue scheduling module is used for reading the occupation information table when occupation is effective and dequeue scheduling each priority;

and the packet dequeuing processing module is used for discarding the frame if the occupation flag bit is effective when a certain queue has a packet dequeue, and otherwise, dequeuing normally.

7. A wireless communication control system, wherein the wireless communication control system is configured to implement the method for handling preemption in queue management according to any one of claims 1 to 3.

8. A satellite communication system, wherein the satellite communication system is configured to implement the method for handling preemption in queue management according to any one of claims 1 to 3.

Images