High-speed data frame conflict-free enqueueing processing method and device

Abstract

The invention discloses a high-speed data frame conflict-free enqueueing processing method and a high-speed data frame conflict-free enqueueing processing device. The high-speed data frame conflict-free enqueueing processing device comprises a CPU module, an enqueueing scheduling module, a conflict detection module, a queue information management module, a cache management module, a receiving busmodule and a cache area module. The high-speed data frame conflict-free enqueueing processing method comprises the steps of: reading an enqueuing frame application request, performing threshold arbitration, allocating an idle cache address for data frames meeting requirements, and moving the data frames into a corresponding address of a cache region by means of the receiving bus; and detecting a head-of-queue information updating conflict situation according to conflicts, determining whether to update head-of-queue information in advance, correcting a queue length updating value according to aqueue length information updating conflict situation, and completing the enqueueing processing of the data frames. The high-speed data frame conflict-free enqueueing processing method and the high-speed data frame conflict-free enqueueing processing device support data frame parallel enqueueing and dequeueing processing, solve the problem of queue information updating conflicts, and accelerate the data frame enqueuing processing speed.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a device and method for processing high-speed data frames in a queue without conflict in the technical field of network communication. The invention can be used in the communication network system to realize the enqueue processing of high-speed data frames for large-capacity switching equipment, while ensuring no queue information update conflict. Background technique [0002] With the rapid development of science and technology, people's demand for network services is increasing, and the requirement for data transmission rate is getting higher and higher. Ethernet is also gradually developing from 100M and 1000M to 10G to meet the needs of the network. Optical fiber can transmit 10G, 40G or even 100G data, but it only solves the transmission problem. The data processing performance of network nodes is the key to restricting network throughput. As a key network devi...

AI Technical Summary

Problems solved by technology

The weak point that this device exists is, the first is that the enqueue times update module only maintains a queue, can't distinguish attributes such as data frame priority, can't guarantee service quality; The implementation steps of this method are: first, according to the data packet processing device The maximum number of multicast copies of data packets supported, and the initial enqueue times are set for the data packet processing device; second, the initial enqueue times are initialized to the external memory; third, when data packets enter or leave the queue, update the above The number of times the data packet enters the queue; fourth, determine whether the PMAU of the data packet needs to be recycled, and if so, the PMAU recycling module will recycle it

The disadvantage of this method is that the enqueue and dequeue operations cannot be updated in parallel, and only the enqueue information or dequeue information can be updated and processed at the same time, which limits the enqueue processing rate. On the other hand, when the arrival rate of data frames increases , this method will cause the data frame to wait when entering the queue and performing the dequeue operation, resulting in congestion or even frame loss

The disadvantage of this device is that it lacks a conflict detection processing module, and it cannot solve the queue information update conflict problem when the queue-entry and dequeue operations are simultaneously updated.

The shortcomings of this method are: firstly, each time you apply for an idle cache, and then move, the data frame needs to wait for the free address allocation to be provided before moving, which limits the processing rate; on the other hand, the pre-queue Method, in a low-speed system, when the bus transfer is relatively slow, the data frame can be moved in advance through the bus to improve the bus utilization; but in a high-speed switching system above 10 Gigabit, the bus transfer is relatively fast, and it will still wait for processing after the transfer is completed in advance As a result, bus utilization will not be improved, further limiting enqueue processing rates

Images