Method and apparatus for data compression of network packets employing per-packet hash tables

Abstract: A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios. More particularly, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. Further, the per-packet hash table indexes particular byte strings in the packet but does not index data in any other packet(s). That is, a respective separate hash table for each packet is employed wherein such hash table is constructed as the particular packet is compressed. As such, the respective hash table is encoded with the particular packet. Employing a per-packet hash table in combination with variable history state inter-packet compression provides for efficient and robust overall compression of the packets.

Description: Field of the Invention The present invention relates generally to data compression and, more particularly, to improving the compression of data in packet networks. Background of the Invention Conventional data compression techniques and systems encode a stream of digital data into a compressed code stream and decode the compressed code stream back into a corresponding original data stream. The code stream is referred to as "compressed" because the stream typically consists of a smaller number of codes than symbols contained in the original data stream. Such smaller codes can be advantageously stored in a corresponding smaller amount of memory than the original data. Further, the compressed code stream can be transmitted in a communications system, e.g., a wired, wireless, or optical fiber communications system, in a corresponding shorter period of time than the uncompressed original data. The demand for data transmission and storage capacity in today's communications networks is ever-increasing. Thus, data compression plays an integral role in most modern transmission protocols and communications networks. As is well-known, two classes of compression techniques useful in the compression of data are so-called special purpose compression and general purpose compression. Special purpose compression techniques are designed for compressing special types of data and are often relatively inexpensive to implement. For example, well-known special purpose compression techniques include run-length encoding, zero-suppression encoding, null-compression encoding, and pattern substitution. These techniques generally have relatively small compression ratios due to the fact that they compress data which typically possesses common characteristics and redundancies. As will be appreciated, a compression ratio is the measure of the length of the compressed codes relative to the length of the original data. However, special purpose compression techniques tend to be ineffective at compressing data of a more general nature, i.e., data that does not possess a high degree of common characteristics and the like. In contrast, general purpose compression techniques are not designed for specifically compressing one type of data and are often adapted to different types of data during the actual compression process. Some of the most well-known and useful general purpose compression techniques emanate from a family of algorithms developed by, J. Ziv and A. Lempel, and commonly referred to in the art as "Lempel-Ziv coding". In particular, Ziv et al., "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory, IT-23(3):337-343, May 1977 (describing the commonly denominated "LZ1" algorithm), and Ziv et al., "Compression of Individual Sequences Via Variable-Rate Coding", IEEE Transactions on Information Technology , IT-24(5):530-536, September 1978 (describing the commonly denominated "LZ2" algorithm) . The LZ1 and LZ2 data compression schemes are well-known in the art and need not be discussed in great detail herein. In brief, the LZ1 (also referred to and known in the art as "LZ77") data compression process is based on the principle that a repeated sequence of characters can be replaced by a reference to an earlier occurrence of the sequence, i.e., matching sequences. The reference, e.g., a pointer, typically includes an indication of the position of the earlier occurrence, e.g., expressed as a byte offset from the start of the repeated sequence, and the number of characters, i.e., the matched length, that are repeated. Typically, the references are represented as "<offset, length>" pairs in accordance with conventional LZ1 coding. In contrast, LZ2 (also referred to and known in the art as "LZ78") compression parses a stream of input data characters into coded values based on an adaptively growing look-up table or dictionary that is produced during the compression. That is, LZ2 does not find matches on any byte boundary and with any length as in LZ1 coding, but instead when a dictionary word is matched by a source string, a new word is added to the dictionary which consists of the matched word plus the following source string byte. In accordance with LZ2 coding, matches are coded as pointers or indexes to the words in the dictionary. As mentioned above, the art is replete with compression schemes derived on the basic principles embodied by the LZ1 and LZ2 algorithms. For example, Terry A. Welch (see, T. A. Welch, "A Technique for High Performance Data Compression", IEEE Computer, pp. 8-19, June 1984, and U.S. Patent No. 4,558,302, issued to Welch on December 10, 1985,) later refined the LZ2 coding process to the well-known "Lempel-Ziv-Welch" ("LZW") compression process. Both the LZ2 and LZW compression techniques are based on the generation and use of a so-called string table that maps strings of input characters into fixed-length codes. More particularly, these compression techniques compress a stream of data characters into a compressed stream of codes by serially searching the character stream and generating codes based on sequences of encountered symbols that match corresponding longest possible strings previously stored in the table, i.e., dictionary. As each match is made and a code symbol is generated, the process also stores a new string entry in the dictionary that comprises the matched sequence in the data stream plus the next character symbol encounter in the data stream. As will be appreciated and as detailed above, the essence of Lempel-Ziv coding is finding strings and substrings which are repeated in the original data stream, e.g., in a document to be transmitted. The repeated phrases in the document under compression are replaced with a pointer to a place where they have occurred earlier in the original data stream, e.g., document. As such, decoding data, e.g., text, which is compressed in this manner simply requires replacing the pointers with the already decoded text to which it points. As is well-known, one primary design consideration in employing Lempel-Ziv coding is determining whether to set a limit on how far back a pointer can reach, and what that limit should be. A further design consideration of Lempel-Ziv coding involves which substrings within the desired limit may be a target of a pointer. That is, the reach of a pointer into earlier text may be unrestricted, i.e., a so-called growing window, or may be restricted to a fixed size window of the previous "N" characters, where N is typically in the range of several thousand characters, e.g., 3 kilobytes. In accordance with this coding repetitions of strings are discovered and compressed only if they both appear in the window. As will be appreciated, the considerations made regarding such Lempel-Ziv coding design choices represent a compromise between speed, memory requirements, and compression ratio. Compression is a significant consideration in improving network efficiencies. For example, when the available computational resources, i.e., the data transmission requirements, are large compared to the available network bandwidth, it is most advantageous to compress data packets before transmission across the network. Of course, the actual compression scheme must be carefully selected in terms of speed and overall compression. That is, a compression scheme which is too slow will reduce network performance and an inefficient compression scheme will limit any potential transmission gains. Further complicating the network efficiency issue is the fact that many packet networks are inherently unreliable. That is, current well-known packet networks, e.g., the Internet, routinely drop packets or reorder packets transmitted through the network thereby causing data transmission errors. For example, if the compression scheme introduces certain dependencies between packets, and the network thereafter drops or reorders such packets, the receiver may not be able to decompress a particular packet if a prior packet is lost due to the interdependencies amongst packets. As such, certain well-known approaches are employed to mitigate such problems: (1) Improve network reliability whereby, in terms of the Internet, a more reliable end-to-end transport layer service can be applied, e.g., the well-known Transmission Control Protocol ("TCP"), to compress packets at the transport level; (2) Stateless compression can be used wherein each packet is compressed independently thereby ensuring that each packet can be decompressed at the receiver; and (3) Streaming compression assumes reliable delivery and employs a reset mechanism when this assumption is violated. More particularly, when a packet is lost, the receiver discards each subsequent packet until compression is reset. After the reset, future packets are not dependent on prior packets and decompression can resume normally. Two well-known streaming-type compression techniques include the Point-to-Point Protocol's ("PPP") Compression Control Protocol, and the IP Header Compression protocol employed for Use Datagram Protocol ("UDP") packets. The above-described packet compression schemes are useful in mitigating the problems arising from packet interdependencies, however, such schemes present certain other complications. For example, compressing packets at the transport level requires end-to-end utilization, and typically requires a certain level of cooperation by the application during transmission. Similarly, while stateless compression provides a degree of robustness, the packet independence attribute of stateless compression reduces the realized compression ratio due to the fact that such compression examines the data in a single packet. Thus, for example, this compression approach cannot remove the large amount of redundancy typically found in network headers of adjacent packets. Further, while streaming compression provides greater compression ratios, these compression schemes multiply the effect of packet loss in that when one packet is lost in the network this causes the receiver to lose several other packets. For low reliability networks, e.g., the Internet, this multiplying packet effect reduces the utility of employing streaming compression. Therefore, a need exists for a compression technique which provides greater robustness and increased compression ratios without the deleterious effects of prior compression schemes. US-A-5 831 558 discloses a method of transmitting an encoded file from a first computer system to a second computer system. The method utilizes a data dictionary having a number of entries. Each of the data dictionary entries contains an entry character array, an entry compression array, and an entry counter. Data packets are read into the memory and are encoded into the encoded file by using the data dictionary. The encoded file is then transmitted from the first system to the second system. The method also contains a decoding function wherein encoded packets received by the second system are decoded using the data dictionary. Summary of the Invention The invention is as set out in the independent claims, preferred forms being set out in the dependent claims. An aspect of the invention is directed to a method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios without the deleterious effects, e.g., the effect of packet loss multiplying, of prior compression schemes. More particularly, in accordance with an aspect of the invention, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. In accordance with the preferred embodiment of the invention, the variable-length coding employs match lengths, offsets, and literals. As such, all phrases begin with a match length with literals being encoded with a zero length match followed by an encoding of the literal. In accordance with the preferred embodiment, the smallest non-zero length match is, illustratively, three bytes and the maximum match is limited by the specific packet size. Further, in accordance with an aspect of the invention, the per-packet hash table indexes particular byte strings in the packet but does not index data in any other packet(s). That is, the instant invention generates and maintains a respective separate hash table for each packet wherein such hash table is constructed independently from any other packet. Illustratively, in accordance with an embodiment of the invention, the respective hash table for a packet is constructed as the particular packet is compressed. In accordance with further embodiments of the invention, the respective hash table for the packet is constructed prior to compression or after compression. As such, the respective hash table is encoded with the particular packet. In accordance with an aspect of the invention, the respective hash table for the packet indexes the data in the entire packet a function of individual substrings. Illustratively, in accordance with the preferred embodiment of the invention, such substrings are three bytes in length. Thus, the byte size of a particular packet will determine the number of byte strings which are indexed within the respective hash table for that packet As such, employing a per-packet hash table provides for efficient and robust overall compression of the packets. That is, since each packet's hash table depends only on the data in that particular packet, a valid index for an arbitrary set of packets can be made using the corresponding hash tables. Thus, in accordance with the preferred embodiment, the search for a string is accomplished by a query of the hash table for the current packet, followed by the hash tables for each of the packets in the variable history state, beginning with the most recently sent packet. As will be appreciated, the per-packet hash tables of the preferred embodiment also maintain singly linked offset chains terminated by an invalid entry, and recycle hash tables by changing the valid offset range for the hash table (not by clearing the entire table). Further, as will appreciated, a compression level parameter. e.g., 8 strings, is utilized to determine the maximum number of strings that are checked while searching for a match. Advantageously, in accordance with an aspect of the invention, increased robustness and greater compression ratios are achieved with a wide variety of compression methods. Brief Description of the Drawings FIG. 1 shows a block diagram of an illustrative system for compressing and decompressing data; FIG. 2 shows a flowchart of illustrative operations for compressing data in accordance with an illustrative embodiment of invention and useful in the illustrative system of FIG. 1; FIG. 3 shows an illustrative packet stream compressed in accordance with the illustrative operations of FIG. 2; FIG. 4 shows a flowchart of illustrative operations for decompressing data in accordance with an embodiment of the invention and useful in the illustrative system of FIG. 1; FIG. 5 shows a flowchart of illustrative operations for compressing data in accordance with the principles of the invention; and FIG. 6 shows comparison results of compressing text files in accordance with the various aspects of the invention. Throughout this disclosure, unless otherwise noted, like elements, blocks, components or sections in the figures are denoted by the same reference designations. Detailed Description As detailed in our co-pending, commonly assigned, Application Serial No. 09/527315 , Attorney Docket No. S. M. Dorward 9-2, filed on current date herewith, (alternatively referred to herein, for convenience, as "the Acknowledged Compression Application") we recognized that by employing a select history state as a function of the packets for transmission across a network, the delivery of an elegant compression tool is achieved by which enhanced data compression can be realized. In accordance with an aspect of that invention, a select history state is employed which is determined as a function of a so-called acknowledgement vector. Further, in accordance with an aspect of that invention, the acknowledgement vector contains information with respect to the identification of packets which have been successfully received in a prior transmission over a communications channel. That is, in accordance with an aspect of that invention, the packet history state is a select history state associated with a respective packet. As such, a first side of the communications channel e.g., the transmitter or sender side, is furnished and cognizant of certain information about which packets have been successfully received by the second side of the communications channel, e.g., the receiver or recipient side. In turn, the decompressor is also furnished and cognizant of the select history to allow for efficient decompression of the transmitted compressed packets from the sender. That is, decompression occurs as a function of which packets were used as history, i.e., the select history state, during compression of such packets. As such, through the select history state and acknowledgement aspects of that invention, the compressor and decompressor (at either side of the communications channel) work cooperatively to achieve improved compression across a communications channel. The compression results, e.g., bandwidth ratio, achieved by employing the compression various aspects of the invention in the Acknowledged Compression Application is somewhat diminished for smaller packets, in particular, at higher bandwidths. This is due, in part, to the actual compression scheme utilized. For example, the well-known Deflate compression scheme utilizes a relatively inefficient format for smaller packet sizes. More particularly, in accordance with Deflate's compression scheme, each packet is compressed with either static or dynamic well-known Huffman coding. While such Huffman coding is worthwhile for offline compression of large files, the associated processing overhead of computing and transmitting the requisite Huffman dictionary in each packet is too expensive for real-time compression of smaller packets, e.g., typical data packets transmitted across the Internet. In addition, Deflate requires the additional processing overhead of approximately 8 bytes to terminate a packet which further impacts its utility in Internet-like communication applications. As will be appreciated, other compression schemes employ such Huffman codes and/or dictionaries, e.g., LZ77, will be similarly affected. Therefore, we have realized that the aspects of the invention in the Acknowledged Compression Application, as discussed in much greater detail below, and their full advantages are further realized in a novel compression format which mitigates certain processing overhead issues with conventional compression schemes. More particularly, in accordance with an aspect of the present invention, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. In accordance with the preferred embodiment of the invention, the variable-length coding employs match lengths, offsets, and literals. Before discussing the various aspects of the present invention in greater detail and to promote a complete understanding thereof, certain aspects of the above-referenced co-pending, commonly assigned Acknowledged Compression Application will be presented below. An aspect of the that invention provides a method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios without the deleterious effects, e.g., the effect of packet multiplying, of prior compression schemes. More particularly, a so-called acknowledgment scheme is employed in conjunction with the specific compression algorithm such that the transmitter, i.e., sender, can limit the history used by the compression algorithm to those packets that are correctly received. In accordance with the preferred embodiment, a vector identifying the packets used as the history is included in the compressed packet thereby enabling the receiver to reconstruct the packet history state necessary to decompress the packet. FIG. 1 shows a block diagram of an illustrative system 100 for compressing and decompressing data. System 100, inter alia. , is useful for transmitting and receiving information over a transmission medium, e.g. wire, wireless, or optical fiber, to name just a few. Further, system 100 is alternatively useful for recording information to, and reading information from, for example, a magnetic medium such as computer disk drives, or optical-readable medium such as CD-ROM's. As such, it is possible to record data compressed in accordance with the invention on to recordable medium including magnetic medium, e.g., magnet disk drives, and optical recordable medium, e.g., CD-ROM's. In FIG. 1, input data stream 105, e.g., text, is provided to input data encoder 110. As discussed in greater detail below, input data encoder 110, in accordance with an aspect of the invention, preprocesses and encodes the input data stream, by applying a variable history state inter-packet compression. The various aspects of the invention directed at this encoding process are described in greater detail below with particular reference to the illustrative operations shown in FIG. 2. Continuing with the discussion of illustrative system 100 of FIG. 1, encoded input data stream 115 produced in accordance with an aspect of the invention is passed to compressor 120. Compressor 120, in accordance with the preferred embodiment of the invention, applies a compression methodology, e.g., Lempel-Ziv compression, to compress encoded input data stream 115 to compressed data 125. As mentioned above, it will again be noted that any Lempel-Ziv type compression can be used effectively in compressing encoded input data stream 115 in accordance with the invention and for realizing the advantageous aspects of the invention as described herein. Compressed data 125 is then encoded by channel encoder 130 to produce channel encoded information 135. As will be appreciated, channel encoding adds information to the compressed information to enable error detection and/or correction in the data reading process. Conventional channel encoding techniques include well-known Reed-Solomon encoding which encodes a sequence of symbols wherein each symbol is represented by one or more data bits. These symbols are then modulation encoded by modulation encoder 140 which produces modulated data stream 145 which defines a channel sequence that is transmitted through a communications channel or recorded on medium 150. Noise and interference are often times introduced in channel/medium 150 during the transmission or recording of the data stream. As such, modulation decoder 155 and channel decoder 160 receive modulated data stream 145 with the noise and, in a well-known manner, reverse the encoding processes of channel encoder 130 and modulation encoder 140, respectively. The data stream from channel decoder 160 corresponds to compressed data 125 generated by compressor 120. This data stream is then decompressed, in accordance with the invention, by decompressor 165 and decoded by data decoder 170 producing output data stream 175 as described in detail below with regard to FIG. 4. The various aspects of the invention in the Acknowledged Compression Application are directed to realizing improved compression robustness and compression ratios. FIG. 2 shows a flowchart of illustrative operations 200 for compressing data in accordance with an aspect of that invention and useful in the illustrative system of FIG. 1, as described above. More particularly, an input data stream is received and the successfully received packets are examined (see, FIG. 2, block 210). Examination of the successfully received packets allows for, in accordance with this aspect of the invention, the identification of a packet history state as a function of the acknowledgement vector (see, FIG. 2, block 220). In accordance with the preferred embodiments of the invention, the packet history state is a previous set of packets upon which the compression of the current packet is determined. For example, in terms of Lempel-Ziv 77 compression history state is a direct correlation to the so-called dictionary employed in such Lempel-Ziv compression. Interestingly, a major difference between the aforementioned stateless compression and streaming compression of network packets is the particular history state each scheme employs. That is, stateless compression employs no history state, while streaming compression allows any previous packet as history. Such differences hold still further with respect to the principles of the invention. More particularly, in accordance with the preferred embodiment of the invention, the packet history state is a select history state with respect to particular packets that have been successfully received across the communications channel e.g., by the receiver side or recipient. In turn, the recipient is furnished and cognizant of the select history to allow for efficient decompression of the transmitted compressed packets. Advantageously, in accordance with this aspect of the invention, utilizing the select inter-packet history state improves the compression robustness and ratio over prior streaming compression schemes which suffer from their inherent packet losses. After identifying the select packet history state as detailed above, such history state is employed to encode certain information to the packets waiting for transmission from the sender. More particularly, in accordance with the preferred embodiment of the invention, the individual packets are encoded as a function of the respective packet history state associated therewith (see, FIG. 2, block 230). In accordance with an embodiment of the invention, each packet is prefixed with a header that includes, illustratively, a history vector which identifies the respective packet history associated with that packet. Turning our attention briefly to FIG. 3, an illustrative packet stream 300 is shown compressed in accordance with the illustrative operations of FIG. 2. In accordance with the embodiment of FIG. 3, the packet header includes additional items such as a sequence number and the acknowledgement vector. That is, in accordance with further embodiments of the invention, the aforementioned acknowledgement vector may be transmitted as part of the packet header. As will be appreciated by those skilled in the art, the determination of whether the acknowledgement vector is transmitted separately from the encoded packets (as discussed above) or as part of the packet header is a matter of design choice with the principles of the invention applying equally in either context. For example, the acknowledgement vector can be transmitted to the sender using a so-called "piggybacking" technique where there exists a data stream in the opposite direction from the receiver to the sender. For example, packet stream 300 includes a series of packets (e.g., packet 1 through packet n shown as packets 305-315, respectively, in FIG. 3). In addition, each packet includes a header (e.g., H 1 through H n shown as headers 320-330, respectively, in FIG. 3). Further, illustratively, header 320 is shown in greater detail including the encoded sequence number 335, history vector 340, and acknowledgement vector 345. In accordance with the preferred embodiment, the sequence number, e.g., sequence number 335, is utilized by both the sender and receiver to identify packets compressed in accordance with the principles of the invention. The number of bits used for encoding the sequence number need to be sufficient to avoid the well-known adverse consequences of so-called "wrapping" during the maximum time required to traverse the entire network. Illustratively, sequence number 335 is shown as 24 bits in length. Further, in accordance with the preferred embodiment, the history vector, e.g., history vector 340, describes the set of previous packets used for compression, i.e., the select history state. In terms of the preferred embodiment of the invention which utilizes the acknowledgement packets for history determination, a time delay may occur related to the roundtrip time of the network between the time a packet is transmitted and the time that the packet will be used as history. As such, in accordance with the preferred embodiment of the invention, the history vector is encoded using an offset and a bit mask such that the offset is subtracted from the packet's sequence number to establish the sequence number of the most recent history packet. The bit mask identifies additional history packets directly preceding this most recent history packet. Illustratively, in terms of header 320, history vector 340 includes 8 bits of offset and 8 bits of mask thereby limiting the history state to at most nine consecutive packets within the last 263. As mentioned above, the packet header of the FIG. 3 embodiment also includes the acknowledgement vector, e.g., acknowledgement vector 345, describing a set of recently received packets. The acknowledgement vector includes at least the sequence number of the most recently received packet and a bit mask describing the status of the directly preceding packets. Illustratively, acknowledgement vector 345 is 32 bits in length to cover 24 bits for the sequence number and 8 bits for the associated mask. Turning our attention back to FIG. 2, after encoding the packets as a function of their respective packet history states (see, FIG. 2, block 230) in accordance with the principles of the invention, these packets are ready for further compression. As detailed above, an advantage of the instant invention is that it may be applied in conjunction with a large variety of existing compression techniques. For example, as described in greater detail below, the principles of the invention improve the compression of a packet stream to which well-known LZ77 compression is applied or the well-known "Deflate" compression scheme. Thus, after applying the selected compression scheme to the encoded packets (see, FIG. 2, block 240), the compressed packets are ready for transmission (see, FIG. 2, block 250). In accordance with an aspect of the invention, we have recognized that by employing a select history state as a function of the packets for transmission across a network, the delivery of an elegant compression tool is achieved by which enhanced data compression can be realized. That is, in accordance with an aspect of the invention, the packet history state associated with a respective packet is a select history state in that the transmission side, i.e., sender, is furnished and cognizant of certain information about which packets have been successfully received by the receiver side, i.e., recipient. In turn, the receiver side is also furnished and cognizant of the select history state associated with such packets to allow for efficient decompression of the compressed packets from the sender. As such, through select history state and acknowledgement aspects of the invention, the sender and receiver work cooperatively to achieve improved compression across the communications channel. More particularly, in accordance with an aspect of the invention, the acknowledgment vector is employed in conjunction with the specific compression algorithm such that the transmitter, i.e., sender, can limit the history used by the compression algorithm to those packets that are correctly received. Thus, in accordance with an embodiment of the invention, the vector identifying the packets used as the history is included in the compressed packet thereby enabling the receiver to reconstruct the packet history state necessary to decompress the packet. In accordance with further embodiments of the invention, the acknowledgement vector is transmitted separately from the compressed packets. Further, while the illustrative embodiments herein, for clarity, discuss a single communications channel arrangement, it will be understood that the principles of the invention are equally applicable to multiple communications channel arrangements and configurations. Advantageously, in accordance with this aspect of the invention, utilizing the select history state improves the compression robustness and ratio over prior streaming compression schemes which suffer from inherent compounding of packet losses. FIG. 4 shows a flowchart of illustrative operations 400 for decompressing data in accordance with a further aspect of the invention of the Acknowledged Compression Application. More particularly, from the compressed stream of packets received (see, FIG. 4, block 410), the history vector is extracted (see, FIG. 4, block 420) on a packet-by-packet basis. As such, the respective packet history state associated with a packet is determined as a function of the history vector. Illustratively, the following pseudocode describes the extraction of these items in accordance with an embodiment of the invention: As will be appreciated, the above-described pseudocode can be used by those skilled in the art to develop a variety of programs, e.g., a computer program in the well-known C programming language, for execution in a processor for implementing the invention. From the extraction of the history vector, the respective packet history state of the packet under decompression is identified (see, FIG. 4, block 430). In accordance with further embodiments of the invention, the extraction may also include extracting the acknowledgment vector and the sequence number from the packet header. In accordance with the preferred embodiment of the invention, decompression of the current packet can proceed as a function of the respective history state (see, FIG. 4, block 440). As such, the current uncompressed packet is added to the current received packet state (see, FIG. 4, block 450) of the respective decompressor, e.g., the decompressor on the receive side of the specific communications channel, thereby updating the set of received packets. Finally, after decompressing the current packet, the acknowledgement vector is constructed and transmitted (see, FIG. 4, block 460) back to the sender. As detailed previously, the acknowledgement vector describes the set of recently received packets and will be used by the sender to compress future packets in conjunction with the select history state in accordance with an aspect of the invention. As mentioned above, we have realized that the aspects of the invention in the Acknowledged Compression Application, as detailed above, and its advantages are further realized in a novel encoding technique and compression format. Such inventive compression format and associated encoding is the subject of the present invention. As with certain well-known compression schemes, an important implementation characteristic is finding matches. Typically, matches are found in a portion of the current packet that has been compressed or any of the packets that makes up the history state. For example, the Zlib implementation of Deflate (as discussed above) employs a single hash table to search for matches which provides acceptable results when used in conjunction with streaming compression, for example. In contrast, and advantageously, the instant invention generates and maintains a separate hash table for each packet. More particularly, FIG. 5 shows a flowchart of illustrative operations 500 for compressing data in accordance with as aspect the present invention. From a set of input data (see, FIG. 5, block 510), a separate hash table for each packet is generated and maintained (see, FIG. 5, block 520). That is, the instant invention generates and maintains a respective separate hash table for each packet wherein such hash table is constructed independently from the contents of other packets. In accordance with a preferred embodiment of the invention, the particular hash table is constructed with its respective packet as the packet is compressed. As mentioned previously, in accordance with further embodiments of the invention, the respective hash table for the packet is constructed prior to compression or after compression. Thus, in accordance with a preferred embodiment of the invention, individual packets are encoded with respect to the respective hash tables for the packets in a packet's history state (see, FIG. 5, block 530). That is, encoding a particular packet "P" employs an associated set of packets "S" which define a packet history state. In accordance with an aspect of the invention, each packet in S has a respective hash table associated therewith. Thus, the encoding of particular packet P, in accordance with an aspect of the invention, is accomplished with respect to the respective hash tables for the packets in S. In accordance with an aspect of the invention, the respective hash table for the packet indexes the data in the entire packet as a function of individual substrings. As such, the encoding of P includes looking up a series of substrings from P in the hash tables associated with the packets in S. Illustratively, in accordance with the preferred embodiment of the invention, such substrings are three bytes in length. Thus, the overall byte size of a particular packet will determine the number of byte strings which are indexed within the respective hash table for that packet. As such, employing a per packet hash table in combination with variable history state inter-packet compression provides for efficient and robust overall compression of the packets. More particularly, in accordance with an aspect of the present invention, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. In accordance with the preferred embodiment of the invention, the variable-length coding employed for match lengths, offsets, and literals. The match lengths are encoded (see, FIG. 5, block 540) such that all phrases begin with a match length with literals being encoded with a zero length match followed by an encoding of the literal. In accordance with the preferred embodiment, the smallest non-zero length match is, illustratively, three bytes and the maximum match is limited by the specific packet size. Illustratively, Table 1 below shows an encoding of particular match lengths in accordance with the preferred embodiment: Match 0 3 4 5 6 7 8 9 Bits 1 2 3 5 5 6 7 7 Code 0 01 110 11100 11101 111100 1111010 1111011 Further, in accordance with the preferred embodiment of the present invention, literals are encoded (see, FIG. 5, block 550) using a predictive scheme: (a) a default 8 bit literal encoding is applied; unless (2) when four literals in a row fall within the range of 32 to 127, inclusive, a variable length coding is employed until a literal outside the range is encoded. The 7 least significant bits are emitted for values within the specified range; and (3) other literals are encoded by adding 64 bits to the number, modulo 256. The resulting number is encoded in 9 bits if less than 96, or 10 bits otherwise. In accordance with the preferred embodiment of the invention, match offsets are defined and encoded (see, FIG. 5, block 560) as the distance between the matching phrase and the most recently encoded input byte. An offset is, illustratively, 14 bits and encoded in two pieces: (1) a range; and (2) the position within with range. The range determining the number of bits used to encode the position, wherein fewer bits are used to encode closer offsets. Illustratively, Table 2 below shows an encoding of match offsets in accordance with the preferred embodiment: Offset bits <6 7 8 9 10 11 12 13 14 Range bits 3 3 3 3 3 3 3 4 4 Extra bits 6 6 7 8 9 10 11 12 13 In accordance with the preferred embodiment of the invention, the per-packet hash table indexes the byte strings in the packet but does not index data in any other packet(s). Thus, since each packet's hash table depends only on the data in that particular packet, a valid index for an arbitrary set of packets can be made using the corresponding hash tables. That is, in accordance with the preferred embodiment, the search for a string is accomplished by a query of the hash table for the current packet, followed by the hash tables for each of the packets in the variable history state, beginning with the most recently sent packet. As will be appreciated, the per-packet hash tables of the preferred embodiment also maintain singly linked offset chains terminated by an invalid entry, and recycle hash tables by changing the valid offset range for the hash table (not by clearing the entire table). Further, as will appreciated, a compression level parameter. e.g., 8 strings, is utilized to determine the maximum number of strings that are checked while searching for a match. As will be appreciated, the compression level parameter is an indicator for determining the overall computation level used during compression, the higher the level the more computation which will be performed in compressing the data. To further illustrate the various aspects of the invention and advantages, the principles of the invention were applied in the context of a comparison to the well-known zlib Deflate compression, as discussed previously. More particularly, FIG. 6 shows bandwidth ratio simulation results 600 and 610 for packet sizes of 1600 bytes and 125 bytes, respectively. Bandwidth ratio simulation results 600 and 610 contain results with respect to two different compression level settings. That is, results 620 and 640 compare the two compression schemes at a compression level parameter of six (6), and results 630 and 650 compare the two compression schemes at a compression setting of one. As will be understood from examination of the results of bandwidth ratio simulation results 600 and 610, compression achieved, on the whole, in accordance with the principles of the invention (i.e., "thwack-6", see results 640; and "thwack -1", see results 650) is superior to that of Deflate (i.e., "zlib-6", see results 620; and "zlib-1", see results 630), and clearly superior in terms of compressing smaller packet sizes. The various aspects of the present invention can be embodied in the form of methods and apparatuses for practicing those methods. The invention can also be embodied in the form of program code embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. The invention can also be embodied in the form of program code, for example, in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. When implemented on a general-purpose processor, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits. The foregoing merely illustrates the principles of the present invention. It will thus be appreciated that those skilled in the art will be able to devise various arrangements which, although not explicitly described or shown herein, embody the invention as defined in the claims. Furthermore, all examples and conditional language recited herein are principally intended expressly to be only for pedagogical purposes to aid the reader in understanding the principles of the invention and the concepts contributed by the Applicants to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure. Thus, for example, it will be appreciated by those skilled in the art that the block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the invention. Similarly, it will be appreciated that any flowcharts, flow diagrams, state transition diagrams, pseudocode, program code, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer, machine, or processor, whether or not such computer, machine, or processor, is explicitly shown.

Claims: A data communications method comprising: dividing an input stream of data into a plurality of packets; CHARACTERISED BY : identifying a respective packet history state-for particular ones of the packets as a function of at least one acknowledgement vector (220); generating a respective hash table for each packet of the particular ones of the packets (520); and encoding the particular ones of the plurality of packets as a function of the respective packet history associated therewith, each encoded packet being encoded with the respective hash table associated therewith (530). The method of claim 1 wherein the respective hash table associated with the packet is identified as a function of at least a portion of the data within the packet. The method of claim 2 wherein the respective hash table associated with the packet includes a series of byte substrings, the series of byte substrings determined as a function of the portion of the data within the packet. The method of claim 2 wherein the encoding the plurality of packets further comprises: encoding a plurality of match lengths, a plurality of literals, and a plurality of match offsets as a function of the portion of the data within the packet (540, 550, 560). The method of claim 3 wherein the encoding the packets further comprises: identifying a particular string of the input stream of data by searching the respective hash tables associated with the packets. The method of claim 5 wherein the searching operation further comprises: constructing an index as a function of the respective hash tables, and using the index during the searching to identify the particular one byte substring. The method of claim 5 wherein the searching is performed as a function of the respective packet history state of the packet. The method of claim 7 wherein a number of searches made during the searching of the respective hash tables is determined using a compression level parameter. The method of claim 8 wherein the compression level parameter is defined as at least eight strings. A method as claimed in any of the preceding claims including the step of: transmitting the encoded data stream across a communications channel from a sending location to a receiving location (250). An apparatus for processing a digital signal comprising: a receiver for receiving an encoded digital signal from a communications channel; and a decoder for decoding the received encoded digital signal, and recovering an input stream of digital data from the decoded digital signal; CHARACTERISED IN THAT : said decoder is adapted to decode a digital signal produced by: dividing an input stream of digital data into a plurality of packets; identifying a respective packet history state for particular ones of the packets as a function of at least one acknowledgement vector; generating a respective one hash table for each one of the packets; encoding each packet as a function of the respective packet history associated therewith to produce an encoded digital signal, each one of the encoded packets being encoded together with the packet's respective hash table; and applying the encoded digital signal to said communications channel. The apparatus of claim 11 wherein the respective hash table associated with the packet is identified as a function of at least a portion of the digital data contained within the packet. The apparatus of claim 12 wherein the respective hash table associated with the packet includes a series of byte substrings such that particular ones of the byte substrings are identified by searching the respective hash tables of the packets, the searching being performed as a function of the respective packet history state associated with the packet. The apparatus of claim 13 wherein a maximum number of searches performed during the searching is established using a compression level parameter. The apparatus of claim 14 wherein the communications channel is part of an Internet Protocol network.

Inventors: DORWARD SEAN MATTHEW, QUINLAN SEAN, DORWARD, SEAN MATTHEW, QUINLAN, SEAN
Applicants: LUCENT TECHNOLOGIES INC, LUCENT TECHNOLOGIES INC.
Application year: 2000
Main classification: H03M7
IPC codes: H03M7