Abstract: The present invention provides a method and apparatus for scheduling message processing. The present invention provides a scheduling mechanism, or scheduler (602), that receives messages (608) and stores the messages (610 or 614) in a first queue (604) or a second queue (606) based, in part, on various criteria associated with the messages. The criteria include message attributes, such as message priority, virtual private network (“VPN”) classification and destination software function. The first queue (604) can be a first-in-first-out queue, and the second queue (606) can be a multi-dimensional queue. The scheduler (602) then schedules the queued messages (612 or 616) for processing based, in part, on various operating criteria (618), such as historical operating data, current operating data and anti-starvation criteria. In addition, the scheduler (602) can be programmed to function in a variety of operating modes.

Abstract: The present invention provides a system and method for processing packetized data or packets through a communications switch using a Fast Flow-Forwarding (“FFF”) system. FFF provides expedited forwarding of packets based on pattern matching and data manipulation rules that cross protocol layer boundaries. More specifically, the present invention provides a method for processing a packet in which the packet is received and processed using one or more transformation rules whenever the packet satisfies one or more identification rules. Otherwise, the packet is processed using a standard process whenever the packet does not satisfy the one or more identification rules. This method can be implemented using a computer program having a code segment to execute each step of the method.

Abstract: The present invention provides a method, apparatus and system for routing a message to a function instance within a packet operating system by receiving the message and requesting a destination address (label) for the function instance from a local repository. Whenever the destination address (label) is local, the message is sent to the function instance. Whenever the destination address (label) is remote, the message is packaged with the destination address (label) and the packaged message is sent to the function instance. Whenever the destination address (label) is not found, the destination address (label) for the function instance is requested from a remote repository, the message is then packaged with the destination address (label) and the packaged message is sent to the function instance. This method can be implemented using a computer program with various code segments to implement the steps of the method.

Abstract: The present invention provides a system and method for processing packetized data or packets through a communications switch using a Fast Flow-Forwarding (“FFF”) system. FFF provides expedited forwarding of packets based on pattern matching and data manipulation rules that cross protocol layer boundaries. More specifically, the present invention provides a method for processing a packet in which the packet is received and processed using one or more transformation rules whenever the packet satisfies one or more identification rules. Otherwise, the packet is processed using a standard process whenever the packet does not satisfy the one or more identification rules. This method can be implemented using a computer program having a code segment to execute each step of the method.

Abstract: The present invention provides a method and apparatus for scheduling message processing. The present invention provides a scheduling mechanism, or scheduler (602), that receives messages (608) and stores the messages (610 or 614) in a first queue (604) or a second queue (606) based, in part, on various criteria associated with the messages. The criteria include message attributes, such as message priority, virtual private network (“VPN”) classification and destination software function. The first queue (604) can be a first-in-first-out queue, and the second queue (606) can be a multi-dimensional queue. The scheduler (602) then schedules the queued messages (612 or 616) for processing based, in part, on various operating criteria (618), such as historical operating data, current operating data and anti-starvation criteria. In addition, the scheduler (602) can be programmed to function in a variety of operating modes.