Abstract: A method and device for reducing delays of communication packets that comprise: providing a plurality of data frames belonging to different communication sessions conveyed along respective communication channels; providing protection data for protecting at least one of these data packets; and multiplexing one or more of the data frames into a second communication packet. This second communication packet comprises protection data for protecting at least one first data frame that had already been transmitted in a first communication packet that preceded the transmission of the second communication packet; the protection data is attached to a second data frame comprised in that second communication packet; the protection data is operative to protect a first data frame comprised in the first communication packet; and wherein each of the first and second data frames belongs to a different communication session.

Abstract: A compression method applies a selection rule to input symbols and generates a reduced partial set of symbols. The partial set is checked against a dictionary-index for a match. A match identifies a range of matching symbols in a dictionary. The length of the matching range is iteratively increased by checking previous and next symbols in the input data and the dictionary until a matching range length meets a threshold limit or the length of the matching range cannot be increased further. Compressed data corresponding to the input symbols is provided where input symbols are copied over and symbols in a matched range of data are replaced with a representation of their corresponding start location and length in the dictionary.

Abstract: A compression method applies a selection rule to input symbols and generates a reduced partial set of symbols. The partial set is checked against a dictionary-index for a match. A match identifies a range of matching symbols in a dictionary. The length of the matching range is iteratively increased by checking previous and next symbols in the input data and the dictionary until a matching range length meets a threshold limit or the length of the matching range cannot be increased further. Compressed data corresponding to the input symbols is provided where input symbols are copied over and symbols in a matched range of data are replaced with a representation of their corresponding start location and length in the dictionary.

Abstract: A communication channel in a network maintains client-server transparency while providing reduced bandwidth in the channel. A first and second node can communicate a compressed form of the object data between themselves in the channel. One of the first or second nodes hosts a cache database that can store, transparently to the client, the requested object data. The stored object data can be used to decompress the compressed object data communicated between the first and second node. One of the nodes can provide control signals to the other node to indicate whether the requested object data is stored in the cache database. This configuration preserves transparency between the client and the server while permitting reduced bandwidth usage between the first and second nodes via the compressed object data.

Abstract: The present invention is a method of sending compressed data includes providing a plurality of M compressing devices, each compressing device configured to apply a lossless compression algorithm and dividing uncompressed data into a first plurality of sequential segments S of uncompressed data. Each segment Si of a first N sequential segments of uncompressed data, for i=1 to N, where M >N, is applied to a respective compressing device CDi, and N respective compressed blocks Bi, each block Bi having a respective characteristic transmission time BlockDurationi.

Abstract: Method and device are provided for processing a packet conveyed in a packet switched communication network. By the invention, a processing indication is associated with the packet, where the indication is adapted to provide instruction(s) for the processing of the packet, and the indication is determined in accordance with the payload carried by that packet.

Abstract: A method and apparatus are described for determining whether to convey a communication signal in a compressed form along a communication path. The method comprises the steps of: (i) providing the communication signal that should be conveyed along said communication path; (ii) determining whether at least part of the communication signal comprises data having a non-random distribution; (iii) if the at least part of the communication signal is determined to comprise data having at least partially a non-random distribution, applying a compression algorithm onto that at least part of the communication signal to form a compressed form of the communication signal provided; and (iv) conveying the communication signal in its compressed form along the communication path.

Abstract: Communication apparatus and methods of transmitting data in a lossless compressed form over non-reliable communication links with very low complexity and high flexibility. The communication apparatus and methods operate by interleaving the compressed data utilizing a plurality of compression/decompression devices in an interleaved fashion.