Abstract: A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.

Abstract: A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.

Abstract: In a network system, an application receiving packets can consume one or more packets in two or more stages, where the second and the later stages can selectively consume some but not all of the packets consumed by the preceding stage. Packets are transferred between two consecutive stages, called producer and consumer, via a fixed-size storage. Both the producer and the consumer can access the storage without locking it and, to facilitate selective consumption of the packets by the consumer, the consumer can transition between awake and sleep modes, where the packets are consumed in the awake mode only. The producer may also switch between awake and sleep modes. Lockless access is made possible by controlling the operation of the storage by the producer and the consumer both according to the mode of the consumer, which is communicated via a shared memory location.

Abstract: A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution p? and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are within the priority resolution, an improvement in performance is achieved.

Abstract: For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

Abstract: For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

Abstract: A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.

Abstract: For balancing load, a forwarder can selectively direct data from the forwarder to a processor according to a loading parameter. The selective direction includes forwarding the data to the processor for processing, transforming and/or forwarding the data to another node, and dropping the data. The forwarder can also adjust the loading parameter based on, at least in part, feedback received from the processor. One or more processing elements can store values associated with one or more flows into a structure without locking the structure. The stored values can be used to determine how to direct the flows, e.g., whether to process a flow or to drop it. The structure can be used within an information channel providing feedback to a processor.

Abstract: Systems, apparatus and methods for the implementation of high-speed network analyzers are provided. A set of high-level specifications is used to define the behavior of the network analyzer emitted by a compiler. An optimized inline workflow to process regular expressions is presented without sacrificing the semantic capabilities of the processing engine. An optimized packet dispatcher implements a subset of the functions implemented by the network analyzer, providing a fast and slow path workflow used to accelerate specific processing units. Such dispatcher facility can also be used as a cache of policies, wherein if a policy is found, then packet manipulations associated with the policy can be quickly performed. An optimized method of generating DFA specifications for network signatures is also presented. The method accepts several optimization criteria, such as min-max allocations or optimal allocations based on the probability of occurrence of each signature input bit.

Abstract: In a multi-processor (e.g., multi-core) computer system, several processors can simultaneously access data without corruption thereof by: designating to each processor a portion of a hash table containing the data; by allowing each processor to access only those data elements belonging to the portion of the hash table designated to that processor; and by sending, via a network, other data elements to the processors that are designated the portions of the hash table to which the other data elements belong. The network avoids memory contention at each processor without requiring a memory-based lock. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules that allow a reader to quickly ascertain the subject matter of the disclosure contained herein. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Abstract: Solution methods for ensuring control and data packets to traverse network address translators (NATs) and firewalls, when a mobile terminal acquires a new (Internet Protocol) address and may move behind a new NAT/firewall are provided. These solutions form an integral part of seamless mobility and multipath packet delivery in IP networks. The solution approach decomposes the problem into downstream control-plane, downstream data-plane, and upstream data-plane sub-problems.

Abstract: Systems, apparatus and methods for the implementation of high-speed network analyzers are provided. A set of high-level specifications is used to define the behavior of the network analyzer emitted by a compiler. An optimized inline workflow to process regular expressions is presented without sacrificing the semantic capabilities of the processing engine. An optimized packet dispatcher implements a subset of the functions implemented by the network analyzer, providing a fast and slow path workflow used to accelerate specific processing units. Such dispatcher facility can also be used as a cache of policies, wherein if a policy is found, then packet manipulations associated with the policy can be quickly performed. An optimized method of generating DFA specifications for network signatures is also presented. The method accepts several optimization criteria, such as min-max allocations or optimal allocations based on the probability of occurrence of each signature input bit.

Abstract: A communication system is provided. The system has at least two nodes communicating with each other with each nodes associated with an operating system, wherein the operating system comprising a costack adapted to generate a unique or a low probability of overlap CID and intercept packets going down or up the main stack at one or more point of interception; and a subspace of a plurality of connections each connection within the subspace having a unique CID in relation to other connections.

Abstract: There is provided a system and method for providing a simple yet flexible overlay network on top of any IP networks to enable diverse network applications whereby much of the rigidities of IP protocol suite are eliminated without any modifications to the applications. In particular, the system includes: a plurality of c-nodes; one or more source terminal nodes connected to an IP network; and one or more destination terminal nodes connected to the IP network. Here, the source terminal nodes send IP packets over the plurality of c-nodes to the destination terminal nodes to accomplish arbitrary communications between arbitrary groups of the source terminal nodes to arbitrary groups of the destination terminal nodes. More specifically, a method employing the system utilizes the concept of connection ID and headers that can be inserted anywhere in the IP packet.

Abstract: a system and method is provided for multimedia multi-services over IP networks such as telephone service, SMS, MMS, video-on-demand, music-on-demand, IPTV, interactive gaming services, and etc., by exploiting unused phone lines, unused broadband access links, PSTN (Public Switched Telephone Network) switching systems, and etc.

Abstract: A system and method is provided that comprise a logical central controller; and a plurality of logical nodes; wherein a demand is performed such that to transport various commodities from a first set of at least one nodes among the plurality of logical nodes to a second set of at least one node of the plurality of logical nodes is achieved; and wherein said nodes are interconnected by directed links according to a graph, said commodities are allowed to be transported only on said directed links, simultaneous arrival (referred to as collision) of commodities at a node is lost, each transportation of said commodities across a directed link incurs.

Abstract: The present invention generally relates to a system and method for supporting (1) mobility in IP (Internet Protocol) networks and (2) multipath packet delivery when the communication paths between a group of senders and a group of receivers traverse one or more NAT and Firewall IP boxes. While at first sight mobility and multipath packet delivery may appear to be two orthogonal or somewhat independent problems, the present invention shows not only that they are intimately related but also that with the correct framework in hand, both problems can be naturally solved.

Abstract: There is provided a method of delivering a plurality of source streams from a plurality of servers to a plurality of clients through a plurality of routers over a communication network using a pay-per-period pricing scheme. Said method includes: splitting the source stream into a plurality of sub-streams to the routers; estimating available capacities of the plurality of the routers; and delivering the sub-streams to the routers at transmission rates proportional to the available capacities of the routers. The available capacity is estimated based on input and output traffic correlations in the server. Further, the client, who is not an owner of the available capacity, may be allowed to use the available capacity at a lower priority than that of the owner. The delivery of the source stream may be carried out over a plurality of paths over the communication network, wherein time-space trajectories of the paths do not cross each other.