Abstract: Apparatus and methods are provided for TCP bufferbloat resolution. In one novel aspect, the TCP client monitors a TCP throughput, determines a TCP throughput stability based on a changing rate of the TCP throughput, adjusts a RWND size dynamically based on the determined TCP throughput stability, and sends the dynamically adjusted RWND size to the TCP server for flow control. In one embodiment, the TCP throughput is stable if the changing rate of an increase or decrease of the TCP throughput is smaller than a threshold, otherwise, the TCP throughput is unstable. The TCP client decreases the RWND size if the TCP throughput is stable, otherwise the TCP client increases the RWND size. In one embodiment, the increase of the RWND size uses the default RWND size adjustment method and the decrease of the RWND size is further depending on the increasing or decreasing state of the TCP client.

Abstract: A compressed pattern matching based on LZW compressed sequences with a simple bitmap-based realization of the Amir-Benson-Farach algorithm is provided. A suffix trie for a searched pattern is determined and a LZW trie is constructed for a compressed data. For each data chunk in the compressed data a variety of information is determined and a node is added to the LZW trie. The queries used to determine the information are implemented through bitmaps, and allowing identification of all occurrence of the searched pattern.

Abstract: A compressed pattern matching based on LZW compressed sequences with a simple bitmap-based realization of the Amir-Benson-Farach algorithm is provided. A suffix trie for a searched pattern is determined and a LZW trie is constructed for a compressed data. For each data chunk in the compressed data a variety of information is determined and a node is added to the LZW trie. The queries used to determine the information are implemented through bitmaps, and allowing identification of all occurrence of the searched pattern.

Abstract: An apparatus and method for enabling rapid transfer of safe data in a data communication network. The apparatus includes a plurality of query modules, a search window, a shift detector, and a database of unsafe data. A predetermined portion of the unsafe data's signature is populated into the query modules, and the signature of a received data in the search window is compared against a plurality of query modules. The search window is shifted according to the result of comparison with the plurality of query modules detected by the shift detector.

Abstract: An apparatus and method for identifying undesirable data received from a data communication network. The apparatus includes a data receiver, a database, and a content search unit. The content search unit transitions among a plurality of internal states depending on the received data. A predetermined segment of the received data compared with a state table for a current state of the content search unit. If there is a match, the content search unit moves to a next valid state. If there is no match, the content search unit moves to a failure state. When the content search unit reaches a final state, the undesirable data is identified.

Abstract: The present invention discloses a network access admission controller and the method used to determine its schedulability. The basic principle involves determining, for all the connections to be checked, if there is any time slot, among all the time slots within a cycle, that will satisfy the scheduling property without the possible misjudgment of schedulability found in the conventional technology. The inventive method of determining schedulability makes its judgment based on packets issued by all the connections and on each of these connections individually. In particular, a determination is made regarding whether there is a particular time slot, among all the time slots, corresponding to the cycle of connection under evaluation, such that all the time slots prior to it are capable of processing the previously issued packets from the connections having higher priority than this particular time slot.