Abstract: The present invention generally relates to a method for describing network events in a service aware network (“SAN”). In addition, the present invention relates to software that performs the method and has a programming model containing protocol libraries, abstract protocol messages declarations, and network events. The method and software enable a user to define basic as well as complex network events in the application, presentation, session, transport and/or network layers of a communication model, which result in internet protocol (“IP”) level triggers or other triggers. Such triggers will result in actions which may be applicable in all layers of a communication model up to the highest layer. As a result, the method and software allow a user to describe a hierarchy of high level network events through a hierarchy of lower level events. In addition, a development system and an apparatus which utilizes the method and software are also provided.

Abstract: A flow-identification content addressable memory (FICAM) comprising a row of content addressable memory (CAM) cells operable to store a first flow-identification. The first flow-identification corresponds to a first packet dispatched for processing by a pipeline unit (PU) belonging to a network processor. A comparison unit compares a second flow-identification corresponding to a second packet with contents of said at least a row of CAM cells. The comparison unit is further capable of determining if the second flow-identification is same as the first flow-identification. A flow identification eraser is provided for removing the first flow-identification from said at least a row of CAM cells upon determination by the comparison unit that the second flow-identification is same as the first flow-identification.

Abstract: A method for determining and enforcing rate constraints on process flows in a network, the method comprising receiving at least one process flow. A flow rate vulnerability (FRV) factor and a required bandwidth (RBW) parameter are determined for the at least one process flow. A rate constraint is calculated for the at least one process flow and the rate constraint is enforced on the at least one process flow.

Abstract: A data packet classifier to classify a plurality of N-bit input tuples, said classifier comprising a hash address, a memory and a comparison unit. The hash address generator generate a plurality of M-bit hash addresses from said plurality of N-bit input tuples, wherein M is significantly smaller than N. The memory has a plurality of memory entries and is addressable by said plurality of M-bit hash addresses, each such address corresponding to a plurality of memory entries, each of said plurality of memory entries capable of storing one of said plurality of N-bit tuples and an associated process flow information. The comparison unit determines if an incoming N-bit tuple can be matched with a stored N-bit tuple. The associated process flow information is output if a match is found and wherein a new entry is created in the memory for the incoming N-bit tuple if a match is not found.

Abstract: The present invention is a system and method for efficient and flexible testing of data communication over computer networks. The system generates traffic streams and sends them to at least one server, and receives in return replying traffic streams. Traffic outgoing streams are generated in accordance with test parameters set by a test session creator. The system generates and receives dynamic traffic streams, and further has the capability to control the traffic rate of the reply traffic streams.

Abstract: A search engine for matching textual patterns in a traffic stream. The search engine comprises a traffic control unit, a micro-code memory, a comparator and a report memory. The traffic control unit is capable of managing the traffic stream. The micro-code memory is capable of storing and retrieving micro-code instructions. The comparator is capable of executing said micro-code instructions to match the textual patterns. The report memory is capable of storing and retrieving reports generated said comparator.

Abstract: The present invention is a system and a method for connection scheduling of crossbar switches having at least one ingress and at least one egress, each of the egresses is connected to at least one port, comprising at least one scheduler for scheduling matches between the ingresses and the egresses, which is in communication with the crossbar switch and at least one memory for holding data which is useful in the process of scheduling the crossbar switch. The memory is in communication with the scheduler. The scheduler schedules the matches between the ingresses and the egresses using data stored in the memory regarding the ingresses, egresses, and the ports. The scheduler operates in accordance with a selection algorithm, which is based on prioritizing of the ports. Selections are performed hierarchically as will be detailed hereinbelow. The scheduler efficiently matches between plurality of inputs and plurality of outputs, especially in crossbar systems having a large number of inputs and outputs.

Abstract: A method of controlling a number of sessions established on a communication network is provided. In the method, at least a first data packet transmitted on the communication network is input, and a new session corresponding to the at least the first data packet is determined. The new session is requested by at least a first user who has an account authorizing the establishment of sessions on the communication network. Also, the method determines if a creation of the new session would exceed a permitted usage of the communication network, and the permitted usage corresponds to the account. If the creation of the new session would exceed the permitted usage, the creation of the new session is prevented. On the other hand, if the creation of the new session would not exceed the permitted usage, the creation of the new session is allowed. Also, a system that performs the method and a software program that instructs the system to perform the method are also provided.

Abstract: A system that efficiently and effectively monitors Internet protocol (IP) data being transferred in an asynchronous transfer mode (ATM) protocol and provides the information necessary according to a list of specified rules and a method and computer program product therefor are provided. The system allows for opening a process flow associated with the IP data such that the total amount of information about the process flow is reduced and the associated data is promptly recognized as belonging to a specific process flow. The system is capable of directing the data belonging to a certain process flow to an assigned network processor out of a plurality of such processors, while maintaining a balanced load between those processors.

Abstract: A method and apparatus for of high-speed and memory efficient rule matching, the rule matching being performed on an m-dimensional universe with each dimension bound by a given range of coordinate values, and a set of rules that apply to an undetermined number of coordinates in that universe. More specifically, a high-speed computer based packet classification system, uses an innovative set intersection memory configuration to provide efficient matching of packets flowing through a network system to a specific process flow based on a packet tuple. The system also provides classification of packets as they flow through a network system. More particularly, this system correlates these flowing packets with previously received packets, along with identifying the packets so that they are handled efficiently. The ability to correlate packets to their corresponding process flows permits the implementation of service aware networks (SAN) that are capable of handling network situations at the application level.

Abstract: The method and apparatus presented are targeted to improve the performance of moving data between memory portions connected by a system bus where writes have higher performance than reads, such as the PCI bus. Due to the PCI bus design, read requests from memories connected across the PCI bus take a significantly longer time to complete than performing a write operation under the same circumstances. The present invention uses the faster write operations across the PCI bus, and queue management techniques, to take advantage of the relative speed of writes in a PCI system. The overall result is significant performance enhancement, which is especially useful in service aware networks (SAN) where operation at wired-speed is of paramount importance.

Abstract: A computer system according to the present invention comprises at least two CPUs; at least one shared system resource accessible to each of the CPUs; and shared memory shared by the CPUs. The shared memory has therein a resource locking table, comprising memory elements. Each of the memory elements is designated for being written to by only one of the at least two CPUs. Each of the at least two CPUs is communicatively interconnected with the shared memory and the shared system resource, and the resource locking table is operative by each of the CPUs.

Abstract: A packet transfer apparatus for a network system is disclosed. The apparatus comprises a packet receiver that accepts an input of packets from a first network segment, a packet classifier that classifies packets based on their respective process flows, a packet discarder to discard packets and a packet sender that sends packets to a second network segment. Another aspect of the invention is a network system comprising a plurality of terminal nodes, at least one packet transfer unit effectively connected between at least two of said terminal nodes, said at least one transfer unit further comprising a packet classifier that classifies packets into their respective process flows.

Abstract: A network interface that processes data packets transmitted on a network is provided. The network interface includes a first data path, a second data path, a header processor, a classifier unit, and a plurality of packet processors. The first data path unit inputs downstream data packets transmitted downstream on the network, and the second data path unit inputs upstream data packets transmitted upstream on the network. The header processor inputs data packet headers of the downstream and upstream data packets from the first and second data path units and classifies the downstream and upstream data packets by comparing the headers with predetermined rules. The classifier unit also inputs the data packet headers from the first and second data path units and evaluates the headers determine flows corresponding to the downstream and upstream data packets.

Abstract: A computer system for allocating memory comprises a central processing unit (CPU) for controlling said system, a local memory for said CPU, means for allocating a plurality of memory blocks to tasks executed on said CPU, and block headers for said memory blocks. The block header further comprises a free block header comprising addresses of free memory blocks designated by the free block header, and further comprising an allocated block header including addresses of allocated memory blocks designated by said allocated block header.

Abstract: A method for determining and enforcing rate constraints on process flows in a network, the method comprising receiving at least one process flow. A flow rate vulnerability (FRV) factor and a required bandwidth (RBW) parameter are determined for said at least one process flow. A rate constraint is calculated for said at least one process flow and the rate constraint is enforced on said at least one process flow.

Abstract: A device for classifying input data based on the values of first and second data of the input data includes a content addressable memory having one or more rows. A first row includes first and second memories, first and second comparators, and a first hit line. The first memory stores second minimum and maximum values defining a second range. The first and second comparators determine whether or not the first and second data fall within the first and second ranges, respectively. The first hit line outputs a first logic value when the first data falls within the first range and the second data falls within the second range. Conversely, the first hit line outputs a second logic value when the first data falls outside the first range or the second data falls outside the second range.

Abstract: A search engine for matching textual patterns in a traffic stream. The search engine comprises a traffic control unit, a micro-code memory, a comparator and a report memory. The traffic control unit is capable of managing the traffic stream. The micro-code memory is capable of storing and retrieving micro-code instructions. The comparator is capable of executing said micro-code instructions to match the textual patterns. The report memory is capable of storing and retrieving reports generated said comparator.

Abstract: A method of controlling a number of sessions established on a communication network is provided. In the method, at least a first data packet transmitted on the communication network is input, and a new session corresponding to the at least the first data packet is determined. The new session is requested by at least a first user who has an account authorizing the establishment of sessions on the communication network. Also, the method determines if a creation of the new session would exceed a permitted usage of the communication network, and the permitted usage corresponds to the account. If the creation of the new session would exceed the permitted usage, the creation of the new session is prevented. On the other hand, if the creation of the new session would not exceed the permitted usage, the creation of the new session is allowed. Also, a system that performs the method and a software program that instructs the system to perform the method are also provided.

Abstract: The present invention generally relates to a method for describing network events in a service aware network (“SAN”). In addition, the present invention relates to software that performs the method and has a programming model containing protocol libraries, abstract protocol messages declarations, and network events. The method and software enable a user to define basic as well as complex network events in the application, presentation, session, transport and/or network layers of a communication model, which result in internet protocol (“IP”) level triggers or other triggers. Such triggers will result in actions which may be applicable in all layers of a communication model up to the highest layer. As a result, the method and software allow a user to describe a hierarchy of high level network events through a hierarchy of lower level events. In addition, a development system and an apparatus which utilizes the method and software are also provided.