CN101594201A - The method of integrally filtering error data in linked queue management structure - Google Patents

Abstract

The method of integrally filtering error data in linked queue management structure, belong to technical field of the computer network, it is characterized in that: to external space being carried out the structure of queue management by the chained list mode, in the reclaimer operation process, only need revise the operating feature that a small amount of pointer is recyclable a plurality of linked list units by chained list, design new filtering error data mechanism, supported data to wrap in the filtering error data that replaces between different queue under the arrival situation.Its feature is to postpone low, and expense is few, favorable expandability.

Description

The method of integrally filtering error data in linked queue management structure

Technical field

Queue management is one of key technology of the applications of computer network (as router, in the nucleus equipments such as switch and fire compartment wall).The task of queue management is by corresponding architecture, according to the corresponding identification information of packet, realization is to the branch formation storage and output of packet, and the method for integrally filtering error data in linked queue management structure of the present invention belongs to technical field of the computer network.

Background technology

Along with further developing of internet, new Network continues to bring out.The various network services that comprises voice service, VPN (virtual private network) is had higher requirement to network service quality.Because the burst characteristic of network traffics, the excessive reservation of employing bandwidth can not effectively guarantee the service quality of network.Meanwhile, the Internet Service Provider also wishes by providing differentiated service to increase income.

By being carried out the corresponding priority level service, different Networks can realize network service quality preferably.And, just must realize queue management to packet in order to realize priority service, specifically be divided into queuing storage and scheduling output again.The main task of storing of lining up is that the packet of input is stored respectively according to correspondence sign (as stream number), differentiation formation, and safeguards FIFO (First In First Out, FIFO) structure according to the sequencing of packet arrival in each formation.Scheduling output then is the SO service order that draws according to dispatching algorithm, the packet of specified queue head of the queue is sent, and upgrades the respective queue state.

Along with the quick raising of network link transmission rate, the queue management that realizes by software mode can not meet the demands, and relies on its huge performance advantage to occupy the high-end applications field gradually by hard-wired queue management chip.By design relevant hardware chip, cooperate and adopt dynamic random access memory (DynamicRandom Access Memory, DRAM), (Static Random AccessMemory SRAM) waits the external memory chip can realize at a high speed and cheap queue management system to static random access memory.At certain applications occasion (in switching network), packet may present the phenomenon that alternately arrives between each logic query.Because may there be the unusual of partial data in various unpredictable factors, packet inside or lose.How to filter this part misdata bag and be one of problem that queue management system need solve.

At the filtration problem of misdata bag, general solution is that two-level cache is filtered.Level cache promptly additionally is set in the porch, and each complete packet of buffer memory is let pass to the next stage buffer memory after the data to be tested bag is errorless again in advance.Since may exist between packet the phenomenon that alternately arrives (as, receive the packet header of A packet earlier, and receive the packet header of B packet, just receive A packet bag tail then), first order buffer memory need be safeguarded a large amount of logic queries.Each formation simultaneously needs to reserve the memory space of at least one complete data packet again.This mode storage overhead is big, autgmentability is poor, and bigger delay has been introduced in a queue management of in fact additionally carrying out again.

Various problems at the conventional method existence, the advance and the novelty of the technical method of present patent application are embodied in: only need revise the operating feature that a small amount of pointer is recyclable a plurality of linked list units by chained list in the reclaimer operation process, designed new filtering error data mechanism, its delay is low, expense is few, favorable expandability.

Summary of the invention

The invention is characterized in that this is a kind of based on the method for integrating filtering error data in the switching network of chained list, realizes according to the following steps successively in a kind of buffer queue management system:

Step (1). make up a queue management system that is used for the many buffer queue management of described switching network, described system contains: the SRAM that fpga chip, data cached bag DRAM and data cached bag description control information are used, wherein:

Fpga chip contains: queue management module and on-chip memory, wherein

Queue management module is provided with: packet input port and packet output port,

On-chip memory MRAM, with described queue management module interconnection,

Data cached bag DRAM, with described queue management module interconnection, described data cached bag DRAM is a kind of RLDRAM that postpones compression, with 16 cycles minimum time unit that is read-write operation, actual disposition is 64Bx512k, have the data/address bus that read/write is separated, but read and write a multiplexing cover address and a control bus

The SRAM that data cached bag description control information is used, model is CYTC1370C, has the multiplexing DCB of a cover read-write, actual disposition is 32bitsx512k;

Step (2). the common linked list units of forming one " data field separates with control domain " of selected RLDRAM and SRAM, described each linked list units comprises the data field of a 64B and the control domain of a 32bits, form by the described RLDRAM and the SRAM that have identical high address

Step (3). in described FGPA, set up the management of the idle managerial structure realization of a chain type: the pointer end to end of each logic query of additional maintenance in the on-chip memory MRAM of this FPGA to 512 described linked list units, corresponding to the external memory address of linked list units end to end, again by one be provided with idle queues end to end the separate queue Freelist of pointer realize management to the idle chain table unit, simultaneously on this on-chip memory MRAM, add 50bits information and be used for error detection and recovery for each formation, wherein, comprising:

Two 19bits amount to the recovery pointer information of 38bits, storage be the tail pointer of formation under the last correct situation and in order to store new cell newly assigned linked list units address,

The 1bit parity check identifies, and whether all cells of expression current data packet correspondence check errors occurred, and wherein, mistake appears in " 1 " expression, and " 0 " expression is correct, with the correctness of detection packet content,

1bit sequence of cells checking mark, all cells of expression current data packet correspondence whether reach sequence correct, with the packet header of detecting packet, the correctness that the bag tail tag is known, mistake appears in " 1 " expression, " 0 " expression is correct,

Step (4). obtain after the control information of many buffer queues in the described switching network compressed to greatest extent: stream number Flow No, account for 16bits, segment information Seg.Info accounts for 2bits, and cell length length accounts for 5bits, total length of data packets Total Length accounts for 9bits, wherein:

Stream number Flow No, high bit representation purpose line card number Card No,

Segment information Seg.Info, comprising: four kinds of states: " 01 " expression data packet head, " 00 " expression packet stage casing, " 10 " expression packet tail, " 11 " expression independent data bag,

Then, described 16bits stream number of storage and 9bits data source total length information in first linked list units, the described segment information Seg.Info of storage in the subsequent cell of follow-up linked list units, so that the control information of when described DRAM is operated, obtaining next linked list units among the described SRAM

Step (5). the administration module of described formation judges according to the following steps successively whether the packet join the team is correct, when data-bag lost cell or parity errors are mistaken the execution error recovery operation:

Step (5.1). locate the beginning cell of each packet according to segment information, and upgrade described recovery pointer information, the parity check sign, sequence of cells checking mark, and cell number quantitative character,

Step (5.2). afterwards, for the operation described in each the cell execution in step (5.1) that arrives,

Step (5.3). when navigating to the end cell of this packet according to segment information, the information that is write down in integrating step (5.1) and the step (5.2) judges whether this packet is correct:

If correct packet then reports that to scheduler module this packet arrives,

If error data packets, (5.3) execution error recovery operation set by step,

Step (5.4). described queue management module execution error recovery operation:

With recovering pointer the formation of described misdata bag is returned to this misdata bag of reception correct status before, simultaneously the next hop address for the linked list units address of this packet packet header distribution of being preserved in the described recovery pointer information is pointed to the head of current free pointer, be this linked list units address setting idle chained list initial address again, then, reclaim all misdatas in this misdata bag by the modification of pointer again.

The flow process of above operating procedure as shown in Figure 1.

Fig. 2 has illustrated the system block diagram of queue management, packet generally outside storage chip DRAM rank and buffer memory, the formation descriptor that packet constitutes can be stored in external memory chip DRAM/SRAM or the FPGA sheet stored.Because of the DRAM limited bandwidth, generally extra descriptor is placed in SRAM or the sheet stored as far as possible.

The objective of the invention is to design an effective filtering error data scheme.This scheme is abandoned the two-level cache strobe utility, introduces the filtering error data mechanism filter false data based on chained list.

General chain type managerial structure, all packet is divided into the cell of fixed length, be stored in the external memory, link to each other with indicator linking between the cell, the packet of same formation also links to each other with indicator linking, the tail cell of promptly going up a packet links with pointer with a cell of next packet, and pointer information both can leave among the external memory DRAM with cell, also can leave in the sheet separately or SRAM that sheet is outer in.

The emphasis of this invention design is: in the space management process, except safeguard list structure in each logic query, system also organizes and manages the idle chain table unit by a separate queue.

The benefit of this structure maximum is can once reclaim a plurality of linked list units by simple operations, thereby reach the purpose of filter false packet in reclaiming the chained list operating process.The pointer information that writes down current corresponding formation when at every turn receiving data packet head is then constantly checked in the operating process of packet as recovering pointer.When receiving the packet tail, judge the integrality and the correctness of corresponding data bag, under the situation of packet error, utilize the recovery pointer that recovery operation is carried out in former formation.Simultaneously, because inner each linked list units of misdata bag presents continuous list structure,, can realize disposable recovery, thereby realize the filtration of misdata a plurality of linked list units by revising the mode of idle chain list index.And the influence that chained list distributes and removal process is not alternately arrived by many formations.

Describe in conjunction with object lesson.

Fig. 3 has shown how be numbered three correct cells of 1,2,3 is stored and to be maintained as corresponding list structure respectively.In this process, safeguarded certain control information simultaneously.

Initial condition: have two A of logic query, B in the system, the packet that has only a cell has been stored in two formations, and the tail of the queue unit of a free time arranged all, when newly to a cell, can at first distribute the tail of the queue storage to cell, then to new free cells of formation application, be assumed to the address of cell memory cell below the cell.When initial, the current correct status tail of the queue address of A is 0x02 (being the memory address of next first cell of packet), and the address of first next jumping of cell of next packet is not also arranged; The current correct status tail of the queue address of B is 0x08, and the address of first next jumping of cell of next packet is not also arranged.

Give cell 1 memory allocated unit: cell 1 be first cell of new packet, belongs to the A of logic query, be stored among the 0x02 1, and be that formation A newly applies for a free block 0x03; The current correct status tail of the queue address of A still is 0x02, and the address of first next jumping of cell of next packet is 0x03; The state of B does not change;

Give cell 2 memory allocated unit: cell 2 belongs to a packet together with cell 1, is second cell of this packet, be stored among the 0x03 2, and be free block 0x04 of the new application of formation A; The current correct status tail of the queue address of A still is 0x02, and the address of first next jumping of cell of next packet still is 0x03; The state of B does not change;

Give cell 3 memory allocated unit: cell 3 be first cell of new data packets, belongs to the B of logic query, be stored among the 0x08 3, and be that formation B newly applies for a free block 0x05; The current correct status tail of the queue address of B is 0x08, and the address of first next jumping of cell of next packet is 0x05; The state of A is for changing.

After cell 1,2,3 is successfully stored, arrive new cell 4 counterlogic formation A, its arrival makes system awareness to the linked list units of must recovery having distributed to cell 1,2.Reason may be:

1, cell 4 is heads of second packet, and cell 2 is not the tail of packet;

2, cell 4 is tails of packet, but the information inconsistency of record in data packet length after calculating and the data packet head cell 1;

3, cell 4 is tails of packet, and the length unanimity.But finding has one or more cell to have parity error in the cell 1,2,4.

So, the information that system will preserve before is used for recovering, way links to each other the unit of the current tail of the queue address 0x04 of A as shown in Figure 4 with idle queues team leading address, with the address 0x03 of first next jumping of cell of next packet of A as the new team's leading address of idle queues; The tail of the queue address of upgrading A is the current correct status tail of the queue address 0x02 of A, though note next hop address and the non-NULL of 0x02, the free cells of 0x02 for can directly being used, this information can be upgraded after treating to store cell next time; And the current correct status tail of the queue address of replacement A is 0x02.

So wrong linked list units just has been recovered.Idle linked list order after please paying special attention to reclaim is III, IV, VI.And V has been assigned with away.Even the high flexible of chain table handling shows cell and alternately arrives that system also can normal filtration misdata bag between logic query.

Effect of the present invention is, use less storage cost (to each logic query, need the recovery of stomge pointer), simple recovery operation (only needing to revise indicator linking one time) just can be easy to filter when data make a mistake with memory space and reclaim.

Description of drawings

Fig. 1 flow chart of the present invention.

The system block diagram of Fig. 2 queue management device.

Fig. 3 cell arrives back assigning process schematic diagram:

Initial condition,

After giving cell 1 assignment logic formation,

After giving cell 2 assignment logic formations,

After giving cell 3 assignment logic formations.

The a plurality of linked list units process of the disposable recovery of Fig. 4 schematic diagram:

After giving cell 3 assignment logic formations,

Mistake is recovered.

Fig. 5 chain type space management structural representation.

Embodiment

For summary of the invention better is described, this paper has proposed a concrete enforcement example at many buffer queues structure in the switching network.

The fpga chip model that adopts in the process is Altera Stratix EP1S80F1508C5, and the model of RLDRAM (Reduced Latency DRAM) is MT49H16M18C, and the SRAM model of employing is CY7C1370C.

RLDRAM is a kind of less DRAM memory that postpones, and the chip capacity of this use reaches 16M * 18bits, amounts to 288Mbits, have 8 Bank, running frequency is 166Mhz, and it has adopted DDR (Double Date Rate) technology, and equivalent running frequency is 333Mhz.The characteristics of its maximum are to have the data/address bus that read/write is separated, but a multiplexing cover address and the control bus of read/write.

Parallel for the read/write that realizes RLDRAM, utilize bandwidth to the full extent, in the using of RLDRAM with the minimum time unit of 16 cycles as read-write operation.The maximum throughput that corresponding this 16 cycle can reach is 18bits * 2 * 16=576bits, and wherein to be used for the live part after the verification be 576bits * (16/18)=512bits=64B in eliminating.Then the actual disposition of RLDRAM can be understood as 64B * 512K.

CY7C1370C is a high-performance SRAM that Cypress company produces.It has the multiplexing DCB of a cover read-write.All data manipulations all can only trigger at rising edge clock.Its configuration mode is 36bits * 512K, and capacity amounts to 18Mbits, and running frequency is 166Mhz.Consider that 4bits will be used for verification, real surplus space and configuration mode can only be 32bits * 512K, amount to 16Mbits.

Design one: realize the chain type space management.

Utilize RLDRAM identical with the SRAM logical address space (being 512K all), form " data field separates with control domain " linked list units structure jointly with SRAM by RLDRAM.In logic, RLDRAM that has identical high address and SRAM are considered as a complete linked list units.Corresponding each linked list units comprises the data field of a 64B and the control domain of a 32bits.

By chain type space management structure realization shown in Figure 5 management to 512K linked list units.The pointer end to end of each logic query of additional maintenance in FPGA on-chip memory (MRAM) wherein, and realize maintenance to the idle chain table unit by a separate queue (Freelist).Illustrated the link information of three linked list units among the figure: the cell of data field storage of 64B that the address is respectively the RLDRAM of 0x02,0x04,0x07 correspondence has linking relationship, address 0x02 is 0x04 corresponding to the information of control domain, and promptly data field next cell in presentation address 0x02 place is stored by address 0x04.

Design two: based on the filtering error data mechanism of chained list.

The filtering error data mechanism based on chained list has clearly been described in the description of explanation before and Fig. 3 and Fig. 4.Its specific implementation mainly is discussed here.

The sheet stored has been safeguarded the pointer information end to end of each logic query as shown in Figure 5.Add 50bits information for each formation on this basis and be used for error detection and recovery.Specifically be divided into:

1, two 19bits amount to the recovery pointer information of 38bits.What recover the pointer information storage is the tail pointer of formation under the last correct status situation and for storing the newly assigned linked list units of new cell address.

2,1bit odd-even check sign.Whether all cells of its expression current data packet correspondence check errors occurred.Be used for detecting the correctness of packet content specially.

3,1bit sequence of cells check tag.Whether its expression current data packet cell arrives sequence correct.Be used for detecting the correctness that packet packet header bag tail tag is known specially.

4, two 5bits cell number quantitative characters.Each packet all can be divided into cell, and 1500 the longest byte data bags can be divided into 24 cells.Here store the original cell number of current data packet correspondence and the cell number of having received respectively with two 5bits.Be used for detecting the long correctness of packet bag specially.

Concrete operating procedure is:

1, (packet is divided into cell through behind the switching network, need be reduced to packet, needs this moment an information to be used for instructing reorganization according to segment information.Segment information has identified which part of the corresponding former packet of current data.) can locate the beginning and the end of each packet.When each packet begins, upgrade and recover pointer information.Upgrade the odd-even check sign simultaneously, sequence of cells check tag, cell number quantitative character.

2, afterwards, each a cell just identifies odd-even check, the sequence of cells check tag, and the cell number quantitative character upgrades.

3, when receiving the end cell of a packet, just can judge whether this packet is correct in conjunction with the information of record.

Be divided into two kinds of situations this moment again:

When 1) packet is correct, report that to scheduler module this packet arrives.

2) (losing cell or parity error) during packet error.The execution error recovery operation.

The state of corresponding formation is recovered with the recovery pointer.So the formation of corresponding data bag just returns to and receives this packet state before, just correct status.

Simultaneously, the next hop address of the linked list units of distributing for this packet packet header of preserving in the step 1 is before pointed to current free pointer head.Address setting with this linked list units is the initial address of idle chained list again.

Because the link of the inner chained list of misdata bag is finished, at this moment, the modification by pointer just can in this process wrong data recovery.

It is complicated that this process seems, but because practical operation is a unit with the cell, and under the limiting case 16 cycles just have a new cell and arrive, it is very little to upgrade cost.

Conclusion, we adopt based on the fault recovering mechanism of chained list and support data to wrap in the filtering error data under the situation about alternately arriving between different queue, and are littler with respect to two-stage buffer structure expense, favorable expandability.Current other any technology are both at home and abroad led in global design.

Claims (1)

1. the method for integrally filtering error data in linked queue management structure is characterized in that, this is a kind of based on the method for integrating filtering error data in the switching network of chained list, realizes according to the following steps successively in a kind of buffer queue management system:

Step (1). make up a queue management system that is used for the many buffer queue management of described switching network, described system contains: the SRAM that fpga chip, data cached bag DRAM and data cached bag description control information are used, wherein:

Fpga chip contains: queue management module and on-chip memory, wherein

Queue management module is provided with: packet input port and packet output port,

On-chip memory MRAM, with described queue management module interconnection,

Data cached bag DRAM, with described queue management module interconnection, described data cached bag DRAM is a kind of RLDRAM that postpones compression, with 16 cycles minimum time unit that is read-write operation, actual disposition is 64B * 512k, have the data/address bus that read/write is separated, but read and write a multiplexing cover address and a control bus

The SRAM that data cached bag description control information is used, model is CYTC1370C, has the multiplexing DCB of a cover read-write, actual disposition is 32bits * 512k;

Step (2). the common linked list units of forming one " data field separates with control domain " of selected RLDRAM and SRAM, described each linked list units comprises the data field of a 64B and the control domain of a 32bits, form by the described RLDRAM and the SRAM that have identical high address

Step (3). in described FGPA, set up the management of the idle managerial structure realization of a chain type: the pointer end to end of each logic query of additional maintenance in the on-chip memory MRAM of this FPGA to 512 described linked list units, corresponding to the external memory address of linked list units end to end, again by one be provided with idle queues end to end the separate queue Freelist of pointer realize management to the idle chain table unit, simultaneously on this on-chip memory MRAM, add 50bits information and be used for error detection and recovery for each formation, wherein, comprising:

Two 19bits amount to the recovery pointer information of 38bits, storage be the tail pointer of formation under the last correct situation and in order to store new cell newly assigned linked list units address,

The 1bit parity check identifies, and whether all cells of expression current data packet correspondence check errors occurred, and wherein, mistake appears in " 1 " expression, and " 0 " expression is correct, with the correctness of detection packet content,

1bit sequence of cells checking mark, all cells of expression current data packet correspondence whether reach sequence correct, with the packet header of detecting packet, the correctness that the bag tail tag is known, mistake appears in " 1 " expression, " 0 " expression is correct,

Step (4). obtain after the control information of many buffer queues in the described switching network compressed to greatest extent: stream number Flow No, account for 16bits, segment information Seg.Info accounts for 2bits, and cell length length accounts for 5bits, total length of data packets Total Length accounts for 9bits, wherein:

Stream number Flow No, high bit representation purpose line card number Card No,

Segment information Seg.Info, comprising: four kinds of states: " 01 " expression data packet head, " 00 " expression packet stage casing, " 10 " expression packet tail, " 11 " expression independent data bag,

Then, described 16bits stream number of storage and 9bits data source total length information in first linked list units, the described segment information Seg.Info of storage in the subsequent cell of follow-up linked list units, so that the control information of when described DRAM is operated, obtaining next linked list units among the described SRAM

Step (5). the administration module of described formation judges according to the following steps successively whether the packet join the team is correct, when data-bag lost cell or parity errors are mistaken the execution error recovery operation:

Step (5.1). locate the beginning cell of each packet according to segment information, and upgrade described recovery pointer information, the parity check sign, sequence of cells checking mark, and cell number quantitative character,

Step (5.2). afterwards, for the operation described in each the cell execution in step (5.1) that arrives,

Step (5.3). when navigating to the end cell of this packet according to segment information, the information that is write down in integrating step (5.1) and the step (5.2) judges whether this packet is correct:

If correct packet then reports that to scheduler module this packet arrives,

If error data packets, (5.3) execution error recovery operation set by step,

Step (5.4). described queue management module execution error recovery operation:

With recovering pointer the formation of described misdata bag is returned to this misdata bag of reception correct status before, simultaneously the next hop address for the linked list units address of this packet packet header distribution of being preserved in the described recovery pointer information is pointed to the head of current free pointer, be this linked list units address setting idle chained list initial address again, then, reclaim all misdatas in this misdata bag by the modification of pointer again.

Images