Signal message compression

• US 7,882,263 B2
• Filed: 10/14/2005
• Issued: 02/01/2011
• Est. Priority Date: 06/30/2005
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: Pessi, Pekka
• Primary Examiner(s): Walsh; John B.
• Application Number:
  US11/249,341
• Publication Number:
  US 20070002780A1
• Time in Patent Office: 1,936 Days
• Field of Search: None
• US Class Current: 709/238
• CPC Class Codes: H03M 7/3088 employing the use of a dictionary, e.g. LZ78
• CPC Class Codes: H04L 65/1101 Session protocols
• CPC Class Codes: H04L 65/1104 Session initiation protocol [SIP]
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC

Abstract

A method for compressing a signalling message in a communication system. The method comprising the steps of: receiving a part of the signalling message; detecting in a memory a copy of the part of the signalling message; comparing the length of the detected part against a stored length value; and dependent on the output of the comparison step performing a step of storing the detected part of the signalling message in the memory.

Claims

1. A method comprising:

detecting in a memory a copy of a part of a message to be compressed;

comparing, by a processor, a length of the detected part against a stored length value; and

in an instance in which it is determined that the stored length value is greater than the length of the detected part, causing the detected part of the message to be stored in a ring buffer.

2. A method as claimed in claim 1, wherein the message comprises a signaling message.

3. A method as claimed in claim 1, wherein the memory comprises a first memory part and a second memory part, the method further comprising:

determining in which of the first memory part or the second memory part of the memory the copy of the part of the message is detected.

4. A method as claimed in claim 3, wherein the stored length value comprises a first length value in an instance in which the copy of the part of the message is detected in the first memory part, and wherein the stored length value comprises a second length value in an instance in which the copy of the part of the message is detected in the second memory part.

5. A method as claimed in claim 3, wherein the first memory part comprises a dictionary.

6. A method as claimed in claim 5, wherein the dictionary comprises at least one of:

a dynamic dictionary, or

a static dictionary.

7. A method as claimed in claim 3, wherein the stored length value is 4 bytes in an instance in which the part of the message is detected in the first memory part.

8. A method as claimed in claim 3, wherein the stored length value is 7 bytes in an instance in which the part of the message is detected in the second memory part.

9. A method as claimed in claim 1, further comprising outputting a reference to the ring buffer as a position, length pair, the reference to be used to form a part of a compressed representation of the message.

10. An apparatus comprising at least one processor and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the apparatus to at least:

detect a stored copy of a part of a message to be compressed;

compare a length of the detected part against a length value; and

in an instance in which it is determined that the length value is greater than the length of the detected part, cause the detected part of the message to be stored in a ring buffer.

11. An apparatus as claimed in claim 10, wherein the copy of the part of the message is stored in one of a first memory part or a second memory part.

12. An apparatus as claimed in claim 10, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the apparatus to:

detect a storage position of the detected part; and

determine the length value dependent on the detected storage position.

13. An apparatus as claimed in claim 11, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the apparatus to:

determine in which of the first memory part or the second memory part the detected part of the message is detected; and

wherein the length value comprises a first length value in an instance in which the detected part is detected in the first memory part and, wherein the length value comprises a second length value in an instance in which the detected part is detected in the second memory part.

14. An apparatus as claimed in claim 11, wherein the first memory part comprises a dictionary.

15. An apparatus as claimed in claim 14, wherein the dictionary comprises at least one of:

a dynamic dictionary, or

a static dictionary.

16. A computer program product as claimed in claim 10, the method further comprising outputting a reference to the ring buffer as a position, length pair, the reference to be used to form a part of a compressed representation of the message.

17. An apparatus as claimed in claim 10 wherein the ring buffer is in a virtual machine.

18. An apparatus as claimed in claim 17, wherein the virtual machine is a universal compressor virtual machine.

19. An apparatus as claimed in claim 10, wherein the message comprises a signaling message.

20. An apparatus as claimed in claim 10, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the apparatus to output a reference to the ring buffer as a position, length pair, the reference to be used to form a part of a compressed representation of the message.

21. A computer program product comprising at least one non-transitory memory, the at least one non-transitory memory storing a computer program configured to implement a method comprising:

detecting in a memory a copy of a part of a message to be compressed;

comparing a length of the detected part against a stored length value; and

,

in an instance in which it is determined that the stored length value is greater than the length of the detected part, causing the detected part to be stored in a ring buffer.