Abstract: A computerized method of delivering popular content of a service delivery apparatus (SDA) in an asymmetrical network topology. The method comprises receiving a first acquisition request for content from a user node (UN) over an upstream data link, the request comprising at least a content identification (CID). An instruction is sent to the UN to redirect content requests to the SDA. A second acquisition request is sent from the SDA to a content source (CS) for the content requested by the first acquisition request, upon determination that the downstream data link between the UN and the CS is inaccessible to the SDA, the request including at least the CID. The content is received by the SDA from the CS. The received content from the SDA is sent to the UN.

Abstract: A computerized method of delivering popular content of a service delivery apparatus (SDA) in an asymmetrical network topology. The method comprises receiving a first acquisition request for content from a user node (UN) over an upstream data link, the request comprising at least a content identification (CID). An instruction is sent to the UN to redirect content requests to the SDA. A second acquisition request is sent from the SDA to a content source (CS) for the content requested by the first acquisition request, upon determination that the downstream data link between the UN and the CS is inaccessible to the SDA, the request including at least the CID. The content is received by the SDA from the CS. The received content from the SDA is sent to the UN.

Abstract: A method is provided in one example embodiment and includes indentifying a delay within one or more queues in a service element by evaluating a type of packet sought for processing in the service element. The method also includes comparing the delay to a threshold value to determine whether to adjust a processing mode of the service element. In more specific embodiments, the method includes providing a flow table that maps specific packets of a flow traversing the service element for receiving a certain amount of processing from a processor engine. The adjustment can include avoiding opening new flows for the service element, or providing continued service to a selected few flows and not others, or avoiding processing for certain types of services having less priority.

Abstract: A system apparatus and method for emulating a computing device are provided. Operational parameters of a computing device may be obtained and provided to an emulating computing device. An emulating device may emulate an emulated computing device. While being emulated, a computing device may operate in a reduced functionality mode. Emulation of a computing device may be transparent to client or other machines associated with an emulated computing device. Conditions requiring a termination of an emulation of a computing device may be detected. Upon detecting conditions requiring a termination of an emulation of a computing device, operational or other parameters may be provided to the emulated computing device and the emulated computing device may assume full, or other, operational mode. Other embodiments are described and claimed.

Abstract: A dispatching technique dispatches packets to a plurality of service control engines (SCEs) which in aggregate may be configured to handle traffic produced by a high-speed high-capacity data link. Upstream and downstream packets that are associated with a data flow between a subscriber and a destination node in a communication network are received from by a dispatcher which is located in a path used by the data flow. For each packet, the dispatcher identifies an SCE from among a plurality of SCEs that is to receive the packet based upon an address contained in the packet. The packet is then dispatched by the dispatcher to the identified SCE which processes the packet accordingly. After processing the packet, the SCE returns the packet to the dispatcher which further processes the packet including transferring the packet onto the communication network towards its destination.

Abstract: A dispatching technique dispatches packets to a plurality of service control engines (SCEs) which in aggregate may be configured to handle traffic produced by a high-speed high-capacity data link. Upstream and downstream packets that are associated with a data flow between a subscriber and a destination node in a communication network are received from by a dispatcher which is located in a path used by the data flow. For each packet, the dispatcher identifies an SCE from among a plurality of SCEs that is to receive the packet based upon an address contained in the packet. The packet is then dispatched by the dispatcher to the identified SCE which processes the packet accordingly. After processing the packet, the SCE returns the packet to the dispatcher which further processes the packet including transferring the packet onto the communication network towards its destination.

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: A method and apparatus for the implementation of high-speed and memory efficient rule matching in a computer system, the rule matching being performed on an m-dimensional universe with each dimension bound by a given lower and upper coordinate value, 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, without the need for dedicated hardware, 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 provides the correlation of these flowing packets with previously received packets, along with identifying the packets so that they are handled efficiently.