초록 ▼

Methods and systems for accelerating data communication by reducing network latency particularly by data compression in which requested data is recursively compressed by an encoder and sent to the requester in codes which may or may not be understood by the requester. The requester can subsequently

Methods and systems for accelerating data communication by reducing network latency particularly by data compression in which requested data is recursively compressed by an encoder and sent to the requester in codes which may or may not be understood by the requester. The requester can subsequently request data corresponding to unknown codes. The request-reply sequence is also recursive and continues until the requested data is present at the requester. To further accelerate communication, a persistently connected network is employed, together with a new socket layer capable of combining multiple messages from different machines, threads, and/or processes into single TCP/IP packets to be relayed along message hubs in the persistent network. These features are introduced singly and combined to create a new caching network. A new content distribution network can take advantage of these data communication improvements since requested content can be distributed in caches in a caching network.

대표청구항 ▼

The invention claimed is: 1. In a communications network having a plurality of devices which are located at different network nodes, a method of communicating data between devices, said method comprising: a) compressing data with software acting as an encoder, said compressing including representin

The invention claimed is: 1. In a communications network having a plurality of devices which are located at different network nodes, a method of communicating data between devices, said method comprising: a) compressing data with software acting as an encoder, said compressing including representing runs of data with at least one identifier, said software running on a first device in network communication with other devices, said at least one identifier to be transmitted in response to a request for the data to a second device in the network running software acting as a decoder; b) storing said at least one identifier and corresponding data represented by said at least one identifier in a database associated with said encoder; c) determining whether there are any runs of identifiers in compressed data; d) representing runs of identifiers in compressed data with a single identifier, thereby achieving further compression of said data, the use of the single identifier determined by relative frequency of occurrence of adjacency of the identifiers over a range of transmitted data; e) storing said single identifier and corresponding runs of identifiers represented by said single identifier in the database associated with said encoder; and f) transmitting from the encoder to the decoder corresponding data represented by said at least one identifier sent in response to the request for data only when said corresponding data represented by said at least one identifier is specifically requested by the decoder, the specifically requested corresponding data enabling decompression of the at least one identifier. 2. The method of claim 1 wherein the single identifier is not used to represent a run of identifiers if the database associated with the encoder has no recently generated record of the run of identifiers. 3. The method of claim 1 wherein identifiers are assigned by breaking up the data to be compressed in chunks. 4. The method of claim 3 wherein the type of data to be compressed determines how the data is broken into chunks. 5. The method of claim 1 further defined by transmitting identifiers to the second device as soon as they are generated. 6. The method of claim 2 further defined by transmitting identifiers to the second device as soon as they are generated. 7. The method of claim 3 further defined by transmitting identifiers to the second device as soon as they are generated. 8. The method of claim 1 further defined by breaking data into segments, generating a single identifier for each segment, and transmitting each identifier as it is generated. 9. The method of claim 1 further defined by the decoder initiating a round trip exchange for corresponding data for specific identifiers not contained in a database associated with the decoder from the encoder, said round trip exchange including a request from the decoder for said corresponding data and a reply to said request for said corresponding data from the encoder. 10. The method of claim 1 further defined by the decoder initiating more than one round trip exchange with the encoder for data corresponding to unknown identifiers. 11. The method of claim 1 further defined by decompressing at the encoder at least a portion of the data to be transmitted when the database associated with the encoder has no recently generated record of the identifier generated by the compressing step. 12. A method of compressing data to be communicated in a network, said method comprising: a) breaking up data to be compressed into logical segments into logical segments according to data type, said compression including representing runs of data with at least one first identifier; b) storing said at least one first identifier and data corresponding to said at least one first identifier in a database, further including maintaining a table for each server containing data that is compressed, wherein said table includes any identifier generated and information about identifiers preceding or following any given identifier; c) detecting runs of identifiers in compressed data, wherein the first identifier is part of a run of identifiers when the table indicates the first identifier has a second identifier preceding the first identifier and a third identifier following the first identifier; d) representing runs of identifiers in compressed data, each of said runs of identifiers represented by a fourth identifier; e) storing said fourth identifier and said runs of identifiers represented by said fourth identifier in said database; and f) repeating steps d)-e) as necessary to achieve desired level of compression. 13. The method of claim 12 further including ignoring certain common identifiers to determine whether the first identifier has other identifiers adjacent to the first identifier. 14. The method of claim 12 wherein any known compression method is used to detect runs of identifiers.