Buffer management

• US 20020024963A1
• Filed: 07/05/2001
• Published: 02/28/2002
• Est. Priority Date: 07/05/2000
• Status: Active Grant

• Current Assignee: ROKE Manor Research Limited (Chemring Group PLC)
• Original Assignee: ROKE Manor Research Limited (Chemring Group PLC)
• Inventors: Reeve, Andrew
• Granted Patent: US 6,888,835 B2
• Time in Patent Office: Days
• US Class Current: 370/412
• CPC Class Codes: H04L 2012/5652 Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
• CPC Class Codes: H04L 2012/5667 IP over ATM
• CPC Class Codes: H04L 2012/5681 Buffer or queue management
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9047 including multiple buffers, e.g. buffer pools
• CPC Class Codes: H04L 49/9094 Arrangements for simultaneous transmit and receive, e.g. simultaneous reading/writing from/to the storage element
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

Described herein is a method for reassembling variable length packets from fixed length cells. When a variable length packet, for example, an Internet Protocol (IP) packet, is transmitted between routers over a link which transmits data as fixed length cells, for example, an asynchronous transfer mode (ATM) link, the packet must be segmented into compatible fixed length cells. The receiving router must reassemble the original packet from the cells as they arrive. A packet buffer free pool (300) is provided which is maintained as a linked list, known as a ‘free list’, and which comprises a plurality of buffer elements (302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, 324, 326, 328, 330, 332, 334, 336, 338, 340). When a first cell for a given packet arrives, a buffer element (302) is taken from the head of the free list and allocated to that packet. The packet data from the first and subsequent cells is copied into the allocated buffer element and each time the buffer element is moved to the end of the free list. Upon the arrival of the last cell for the given packet, the complete packet is processed. Failed reassemblies are automatically abandoned as the buffer element is reused when it reaches the head of the free list. This technique is relevant to protection against “denial of service” attacks upon computer networks.

Claims

1. A method of operating a reassembly buffer function, the method comprising the steps of:

a) receiving a first fragment from a new packet;

b) allocating a buffer location to the new packet;

c) moving the allocated buffer location to the end of a buffer list;

d) receiving subsequent fragments and passing them to the allocated buffer location and repeating step c);

e) transmitting reassembled packet from the allocated buffer location when the last fragment has been received;

f) allowing the allocated buffer location to reach the top of the buffer list if no further fragments are received; and

g) reusing the allocated buffer location when it reaches the top of the buffer list.

2. A method according to claim 1, further comprising the step of using the position of the allocated buffer location in the buffer list to effect timing for receipt of fragments from each packet.