Abstract: A technique for executing a segmented virtual machine (VM) is disclosed. A plurality of core VMs is implemented in a plurality of core spaces. Each core VM is associated with one of a plurality of shell VMs. Resources of the core spaces are allocated among the core VMs.

Abstract: Stitching a proxied connection between a first core virtual machine (VM) and a second core VM is disclosed. Stitching includes determining that a stitched connection should be generated between the first core VM and the second core VM and generating the stitched connection between the first core VM and the second core VM.

Abstract: A technique is disclosed for redirecting information in a segmented virtual machine. The technique includes sending information to a shell VM and redirecting the information to bypass the shell VM. A technique for evaluating whether to redirect information may include sending a discovery packet, receiving a reply to the discovery packet; and determining whether a switch is capable of stitching based on the reply. A technique for responding to a discovery packet may include receiving the discovery packet at a switch and sending a response indicating a capability of the switch.

Abstract: A technique for executing a segmented virtual machine (VM) is disclosed. A plurality of core VM's is implemented in a plurality of core spaces. Each core VM is associated with one of a plurality of shell VM's. Resources of the core spaces are allocated among the core VM's.

Abstract: A technique for executing a segmented virtual machine (VM) is disclosed. A plurality of core VM's is implemented in a plurality of core spaces. Each core VM is associated with one of a plurality of shell VM's. Resources of the core spaces are allocated among the core VM's.

Abstract: A system and method are disclosed for a segmented virtual machine. The segmented virtual machine includes a core VM and a shell VM associated with the core VM. The core VM is configured to perform VM internal execution functionality and the shell VM is configured to perform shell VM functions and communicate with the core VM.

Abstract: An internet service node (ISN) enabling the provision of desired service policies to each subscriber. The desired service policies for each subscriber are provided as an input. The desired service policies are translated into processing rules. Each processing rule contains a classifier and associated action. A classifier generally identifies the application data flows to which the action may be applied to provide the desired service policies. The processing rules may be generated dynamically to implement the specified service policies for each subscriber. Each data bit group may be classified to associate with a subscriber and only the processing rules corresponding to the subscriber may be applied to the data bit group to provide the desired services.

Abstract: An internet service node (ISN) enabling the provision of desired service policies to each subscriber. The ISN may contain multiple processor groups, with each subscriber being assigned to a processor group. The assigned processor group may be configured with the processing rules, which provide the service policies desired, by a subscriber. A port may determine the specific processor group to which received data is to be forwarded. A content addressable memory with masks for individual locations may be implemented to quickly determines the processor group to which received data is to be assigned to. Due to the features of the present invention, an ISN may be able to serve a large number of subscribers efficiently. The ISN may be used at the edge of an access network.

Abstract: A system and method are disclosed for a segmented virtual machine. The segmented virtual machine includes a core VM and a shell VM associated with the core VM. The core VM is configured to perform VM internal execution functionality and the shell VM is configured to perform shell VM functions and communicate with the core VM.

Abstract: An internet service node (ISN) for sending unsolicited web pages only to users agreeing to receive unsolicited web page. An internet service provider (ISP) may charge lower rates to users agreeing to receive unsolicited web pages. For example, an ISP may send an unsolicited web page in response to the first web page request for a user. In general, a user may agree to receive different types of unsolicited web pages under different conditions. An ISN may monitor the data flows related to the user to determine whether any condition is satisfied; and a web server may be used to generate and send the corresponding unsolicited web page.

Abstract: A functional verification system suited for verifying the function of cycle based integrated circuits (IC) design. The IC design is divided into a plurality of combinatorial blocks connecting sequential elements. Truth tables corresponding to the divided blocks are computed and stored in a memory. The output values of the IC design are determined by evaluating the blocks. The evaluation typically entails one memory access as the truth tables are pre-computed and stored in a memory storage. Accordingly the output values are computed quickly. The storage is implemented using random access memories and a XCON is designed to ensure the dependencies are preserved during the evaluations.

Abstract: An internet service node (ISN) enabling the provision of desired service policies to each subscriber. The desired service policies for each subscriber are provided as an input. The desired service policies are translated into processing rules. Each processing rule contains a classifier and associated action. A classifier generally identifies the application data flows to which the action may be applied to provide the desired service policies. The processing rules may be generated dynamically to implement the specified service policies for each subscriber. Each data bit group may be classified to associate with a subscriber and only the processing rules corresponding to the subscriber may be applied to the data bit group to provide the desired services.

Abstract: A functional verification system suited for verifying the function of cycle based integrated circuits (IC) design. The IC design is divided into a plurality of combinatorial blocks connecting sequential elements. Truth tables corresponding the divided blocks are computed and stored in a memory. The output values of the IC design are determined by evaluating the blocks. The evaluation typically entails one memory access as the truth tables are pre-computed and stored in a memory storage. Accordingly the output values are computed quickly. The storage is implemented using random access memories and a XCON is designed to ensure the dependencies are preserved during the evaluations.