Header compression method for network protocols

• US 20030182454A1
• Filed: 01/24/2003
• Published: 09/25/2003
• Est. Priority Date: 07/25/2000
• Status: Abandoned Application

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Pandel, Juergen, Kutka, Robert, Huth, Hans-Peter
• Application Number:
  US10/333,773
• Publication Number:
  US 20030182454A1
• Time in Patent Office: Days
• US Class Current: 709/247
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC
• CPC Class Codes: H04L 69/22 Parsing or analysis of headers

Abstract

The invention relates to an encoding method, which uses statistical characteristics of all types of network protocols without requiring specific knowledge of the definitions of individual protocol fields. Network protocols in general contain long contiguous sections, which remain unchanged. Said sections are therefore predicted from the preceding header and do not need to be transmitted. The position of the modified and unmodified fields is also predicted, so that in most cases, transmission of the position co-ordinates is not necessary. Said principle, together with a corresponding differential encoding, achieves a high data compression, as only the modified data and a small amount of overhead need to be transmitted.

Claims

1. A method for compression of header information in network protocols having the following steps:

transmission of a complete header (FH) during the setting up of a connection, as well as transmitter-end and receiver-end use of this header as a reference,

coding by transmitter-end segmentation of each further header into changed fields (c-F;

c1, c2) and unchanged fields (u-P;

u1, u2) with respect to the respectively preceding header, with a cohesive area which has changed symbols and intervals of at most m unchanged symbols being classified as a changed field (c-F) and a cohesive area of at least m+1 unchanged symbols being classified as an unchanged field (u-F),

prediction of the positions of these fields (u-F, c-F) from the field of the preceding header,

differential transmission of the current header by transmitting a feature (M) for each predicted position, which feature (M) signals whether a position has changed.

2. The method for compression of header information in network protocols as claimed in claim 1, with a value m=2 being chosen for intervals of at most m unchanged symbols for classification as a changed field (c-F).

3. The method for compression of header information in network protocols as claimed in claim 1 or 2, with a complete header (FH) being transmitted once again as required at intervals which can be predetermined during a transmission, and being used as a new reference at the transmitter end and at the receiver end.

4. The method for compression of header information in network protocols as claimed in one of the preceding claims

with, in addition to each feature (M) which is transmitted for a predicted position,

if a changed field (c-F) occurs when the position has not changed, the content of the changed part of this field is transmitted, and

if a changed field (c-F) or an unchanged field (u-F) occurs when the position has changed, a length code is in each case transmitted in order to describe the length of an unchanged part, and/or a length code is transmitted in order to describe a changed part as well as the content of the changed part. The content of the changed part of this field is transmitted, and

if a changed field (c-F) or an unchanged field (u-F) occurs when the position has changed, a length code is in each case transmitted in order to describe the length of an unchanged part, and/or a length code is transmitted in order to describe a changed part as well as the content of the changed part.

5. The method for compression of header information in network protocols as claimed in claim 4, with each feature (m) which is transmitted for a predicted position being one bit and each length code indicating the length of the respective area of a field in a number of bits, whose size is governed by

[log₂ (Area−

m)]

with [x] representing a rounding operation in which the number x is rounded up to the next higher interger value.

6. The method for compression of header information in network protocols as claimed in claim 4, with one byte being used as the smallest coding unit, with each feature (M) which is transmitted for a predicted position being one byte, and with field lengths being determined in units of bytes.

7. The method for compression of header information in network protocols as claimed in one of claims 1 to 5, with changed fields (c-F) having an adjacent symbol added to them if the position has changed, when coding of this supplemented field is less complex than coding of the changed position.

8. The method for compression of header information in network protocols as claimed in claim 7, with an adjacent symbols always being added when [log₂ (total of the −

m required to describe the field length)] is greater than or equal to 2, where [x] representing a rounding operation in which the number x is rounded up to the next-higher integer value.

9. The method for compression of header information in network protocols as claimed in one of the preceding claims, with error-identifying and/or error-correcting codes which are contained in a protective header stream that is to be transmitted, in particular checksums, also being compressed.

10. The method for compression of header information in network protocols as claimed in one of the preceding claims, with the compressed data stream having error-identifying and/or error-correcting protection mechanisms added to it when required.

11. A method for decompression of header information, which has been compressed in accordance with one of the above claims, in network protocols, in which a respective header which is being compressed as claimed in one of the preceding claims is reconstructed at the receiver end on the basis of headers which follow the complete header (FH) and the differentially transmitted information.

12. An encoder for compression of header information in network protocols, with the encoder being designed such that a method as claimed in one of the preceding claims 1 to 10 can be carried out.

13. A decoder for decompression of header information, which has been compressed in accordance with one of the preceding claims 1 to 10, in network protocols, in that each header which has been compressed as claimed in one of claims 1 to 10 can be reconstructed on the basis of headers which follow the received reference header (FH) and the differentially transmitted information.

14. A transmitting unit having an encoder as claimed in claim 12.

15. A receiving unit having a decoder as claimed in claim 13.