Packet concatenation method and apparatus

• US 20020080810A1
• Filed: 07/16/2001
• Published: 06/27/2002
• Est. Priority Date: 01/15/1999
• Status: Abandoned Application

• Current Assignee: Nokia Networks (Nokia Corporation)
• Original Assignee: Nokia Networks (Nokia Corporation)
• Inventors: Casais, Eduardo
• Application Number:
  US09/906,377
• Publication Number:
  US 20020080810A1
• Time in Patent Office: Days
• US Class Current: 370/428
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/28 in relation to timing considerations
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9084 Reactions to storage capacity overflow
• 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: H04L 69/329 in the application layer [OSI layer 7]

Abstract

A method and apparatus for concatenating data packets in a communication protocol is described, wherein a connection to be used for concatenation is allocated to a memory region based on which data packets received from said connection are stored in order to be concatenated. Furthermore, an activity information of the connection is provided, wherein the allocation of the connection is changed on the basis of the activity information. Thus, a cache of connections which are deemed suitable for concatenation can be managed by shifting and cancelling the memory regions allocated to the connections so that active connections which actually utilize concatenation are kept in the cache, while other connections which do not need the concatenation feature are purged from the cache. Thereby, a restriction can be placed on the number of connections that can take advantage of the concatenation, so as to limit the overhead produced by the concatenation feature.

Claims

1. A method for concatenating data packets in a communication protocol, comprising the steps of:

a) allocating a connection to be used for concatenation to a memory region;

b) storing data packets received from said connection on the basis of said allocation;

c) providing an activity information of said connection; and

d) changing the allocation of said connection on the basis of said activity information.

2. A method according to claim 1, wherein said connection is canceled, when said activity information indicates an inactive connection for a predetermined time period.

3. A method according to claim 1 or 2, wherein said activity information comprises a timer information indicating a storing time of a data packet of said connection.

4. A method according to claim 3, wherein said activity information comprises a counting information indicating the number of times said timer information has reached a predetermined time period.

8. A method according to claim 4, wherein a predetermined value of said counting information is used to indicate an inactive connection.

5. A method according to any one of the preceeding claims, wherein a maximum number of memory regions is provided for allocating connections which can be used for concatenation.

6. A method according to any one of the preceeding claims, wherein said memory region is used to store said activity information and comprises a buffer region for storing said received data packets.

7. A method according to any of the preceeding claims, wherein an identification information for identifying said connection is stored in said memory region.

9. A method according to any one of the preceeding claims, wherein said memory region is an element of a cache memory.

10. A method according to claim 9, wherein a pointer information is stored in said memory region, said pointer information pointing to a separate memory in which said activity information and said data packets received from said connection are stored.

11. A method according to claim 9 or 10, wherein a first pointer is provided for indicating the first element of said cache memory, a second pointer for indicating the last element of said cache memory, and a third pointer for indicating an element between said first and last element of said cache memory.

12. A method according to claim 11, wherein said connection is allocated to an element defined by said third pointer, when said activity information indicates a low activity.

13. A method according to any one of claims 9 to 12, wherein said connection is allocated to an element defined by said first pointer, when said activity information indicates a high activity.

14. A method according to any one of claims 9 to 13, wherein said connection is allocated to an element defined by said second pointer, when said activity information indicates an inactive connection.

15. A method according to any one of claims 9 to 14, wherein said element of said connection is cancelled from said cache memory, when said connection has been allocated to the last element of said cache memory and a new element for a new connection is created.

16. A method according to any one of claims 9 to 15, wherein said cache memory is an array.

17. A method according to any one of claims 2 to 16, wherein said predetermined time period is adjusted based on a packet waiting time of the latest connection having the highest activity.

18. A method according to any one of claims 2 to 16, wherein said predetermined time period is adjusted based on an average of packet waiting times of all preceding connections having the highest activity.

19. A method according to any one of claims 2 to 16, wherein said predetermined time period is adjusted based on a dynamic moving average of a packet waiting time of preceding connections.

20. An apparatus for concatenating data packets in a communication protocol, comprising:

a) memory means (2) having a plurality of memory regions;

b) control means (1) for allocating a connection to one of said plurality of memory regions, said one of said plurality of memory regions being used for concatenating data packets of said connection; and

c) providing means (1) for providing an activity information of said connection,

d) wherein said control means (1) is arranged to change the allocation of said connection based on said activity information.

21. An apparatus according to claim 20, wherein a timer is provided for indicating an expiry of a predetermined storing time of a data packet of said connection, and wherein said activity information comprises a timer value of said timer.

22. An apparatus according to claim 21, wherein a counter is provided for counting the number of times said timer has reached said predetermined time period, and wherein said activity information comprises a count value of said counter.

23. An apparatus according to any one of claims 20 to 22, wherein said memory means is a cache memory (2) and wherein said memory region is an element of said cache memory (2).

24. An apparatus according to any one of claims 20 to 23, wherein said control means (1) is arranged to control said memory means (2) so as to store said data packets of said connection and said activity information in said one of said plurality of memory regions.

25. An apparatus according to any one of claims 20 to 23, wherein said control means (1) is arranged to control said memory means (2) so as to store a pointer information in said one of said plurality of memory regions, said pointer information pointing to a memory region of another memory means, in which said data packets of said connection and said activity information are stored.

26. An apparatus according to claim 22, wherein said control means (1) is arranged to cancel said connection, when said counter has reached a predetermined counter value.