Abstract: A network function optimization method, system, and computer program product include optimizing network function chain components of a software by modifying a structure of the network function chain components by removing a function of the network function chain components.

Abstract: A network function optimization method, system, and computer program product include optimizing network function chain components of a software by modifying a structure of the network function chain components by removing a function of the network function chain components.

Abstract: A network function optimization method, system, and computer program product, include optimizing network function chain components by modifying a structure of the network function chain components by removing one of the functions of the network function chain components in response to a constraint according to a policy requirement.

Abstract: A network function optimization method, system, and computer program product, include optimizing network function chain components by modifying a structure of the network function chain components by removing one of the functions of the network function chain components in response to a constraint according to a policy requirement.

Abstract: A network function modification method, system, and computer program product, include terminating the connection-oriented session between a client and a server via at least two proxies, running a multipath connection-oriented session between the at least two proxies, if an insertion request is received, establishing a first multipath subflow with the new multipath subflow traversing the network function of the insertion request, and if a removal request is received, establishing a second multipath subflow with the new multipath subflow not traversing the network function of the removal request.

Abstract: A network function optimization method, system, and computer program product, include optimizing network function chain components by modifying a structure of the network function chain components by removing one of the functions of the network function chain components in response to a constraint according to a policy requirement.

Abstract: A network function optimization method, system, and computer program product, include annotating network functions by providing constraints on a placement of different virtual network function chain components and optimizing the network function chain by modifying a structure of the network function chain based on the constraints in the annotating.

Abstract: A network function modification method, system, and computer program product, include terminating the connection-oriented session between a client and a server via at least two proxies, running a multipath connection-oriented session between the at least two proxies, if an insertion request is received, establishing a first multipath subflow with the new multipath subflow traversing the network function of the insertion request, and if a removal request is received, establishing a second multipath subflow with the new multipath subflow not traversing the network function of the removal request.

Abstract: A network function modification method, system, and computer program product, include terminating the connection-oriented session between a client and a server via at least two proxies, running a multipath connection-oriented session between the at least two proxies, if an insertion request is received, establishing a first multipath subflow with the new multipath subflow traversing the network function of the insertion request, and if a removal request is received, establishing a second multipath subflow with the new multipath subflow not traversing the network function of the removal request.

Abstract: A network function modification method, system, and computer program product, include terminating the connection-oriented session between a client and a server via at least two proxies, running a multipath connection-oriented session between the at least two proxies, if an insertion request is received, establishing a first multipath subflow with the new multipath subflow traversing the network function of the insertion request, and if a removal request is received, establishing a second multipath subflow with the new multipath subflow not traversing the network function of the removal request.

Abstract: A network function optimization method, system, and computer program product, include annotating network functions by providing constraints on a placement of different virtual network function chain components and optimizing the network function chain by modifying a structure of the network function chain based on the constraints in the annotating.

Abstract: The increasing number of Internet users and innovative new services such as e-commerce are placing new demands on Web servers. It is becoming essential for Web servers to provide performance isolation, have fast recovery times, and provide continuous service during overload at least to preferred customers. The invention describes a kernel-based architecture for content-aware service differentiation that protects Web servers against overload by controlling the amount and rate of work entering the system. We have invented a mechanism that provides admission control and service differentiation based on connection and application level information. The application header-based connection control uses application-level information (such as URIs and cookies for HTTP) to define different service differentiation actions. The present invention provides the kernel mechanisms that are more efficient and scalable than application level controls implemented in current Web servers.

Abstract: A computer-implemented method, apparatus, and computer usable program code are disclosed for migrating a virtual adapter from a source physical adapter to a destination physical adapter in a data processing system where multiple host computer systems share multiple adapters and communicate with those adapters through a PCI switched-fabric bus. The virtual adapter is first caused to stop processing transactions. All in-flight transactions that are associated with the virtual adapter are then captured. The configuration information that defines the virtual adapter is moved from the source physical adapter to the destination physical adapter. The in-flight transactions are then restored to their original locations on the destination virtual adapter. The virtual adapter is then restarted on the destination physical adapter such that the virtual adapter begins processing transactions.

Abstract: A computer-implemented method, apparatus, and computer program product are disclosed in a data processing environment that includes host computer systems that are coupled to adapters utilizing a switched fabric for routing packets between the host computer systems and the adapters. A unique destination identifier is assigned to one of the host computer systems. A portion of a standard format packet destination address is selected. Within a particular packet, the portion is set equal to the unique identifier that is assigned to the host computer system. The particular packet is then routed through the fabric to the host computer system using the unique destination identifier.

Abstract: A computer-implemented method, apparatus, and computer program product are disclosed for routing error messages in a multiple host computer system environment to only those host computer systems that are affected by the error. The environment includes multiple host computer systems that share multiple devices utilizing a switched fabric. An error is detected in one of the devices. Routing tables that are stored in fabric devices in the fabric are used to identify ones of the host computer systems that are affected by the error. An error message that identifies the error is routed to only the identified ones of the host computer systems.

Abstract: A method is provided for creating and managing tables for routing packets through an environment that includes multiple hosts and shared PCI switches and adapters. A Destination Identification (DID) field in the PBA is appended to a transaction packet dispatched through the PCI switches, wherein a particular DID is associated with a particular host or system image, and thus identifies the physical or virtual end point of its packet. In one embodiment, packets are routed through PCI switches in a distributed computer system comprising multiple root nodes, wherein each root node includes one or more hosts. The embodiment includes the step of creating a table or like data structure in a specified one of the switches. When a particular host of one of the root nodes becomes connected to the specified switch, a PCI Configuration Master (PCM), residing in one of the root nodes, is operated to enter a destination identifier or DID into the table.

Abstract: A PCI control manager provides address translation protection tables in switches in a PCI fabric. The PCI control manager discovers the fabric and provides a virtual tree for each root complex. A system administrator may then remove endpoints that do not communicate with the root complex to configure the PCI fabric. The PCI control manager then provides updated ATPT tables to the switches. When a host or adapter is added, the master PCM goes through the discovery process and the ATPT tables and adapter routing tables are modified to reflect the change in configuration. The master PCM can query the ATPT tables and adapter routing tables to determine what is in the configuration. The master PCM can also destroy entries in the ATPT tables and adapter routing tables when a device is removed from the configuration and those entries are no longer valid.

Abstract: In a distributed computer system having multiple root nodes, a challenge protocol is provided, for use in determining or confirming the root node in which a PCI Configuration Manager (PCM) actually resides. This node is referred to as the master node. The challenge procedure is activated whenever the identity of the PCM, which is determined by the root node in which it resides, appears to be uncertain. The challenge procedure resolves this uncertainty, and enables the PCM to continue to configure routings throughout the system. In a useful embodiment, a method is directed to a distributed computer system of the above type which is further provided with PCI switches and with adapters that are available for sharing by different nodes. The method includes the steps of selecting a first one of the root nodes to be master root node, and operating the first root node to query the configuration space of a particular one of the PCI switches.

Abstract: Method and system for address routing in a distributed computing system, such as a distributed computing system that uses PCI Express protocol to communicate over an I/O fabric. A destination identifier is provided to identify a physical or virtual host or end point. When a physical or virtual host or end point receives a PCI data packet it compares a list of source identifiers with destination identifiers to determine if a source identifier included in the transaction packet is associated with a destination identifier included in the transaction packet to determine if the transaction packet has a valid association. If the transaction packet has a valid association, it is routed to the target device. The present invention enables each host that attaches to PCI bridges or switches and shares a set of common PCI devices to have its own PCI 64-bit address space and enables the routing of PCI transaction packets between multiple hosts and adapters, through a PCI switched-fabric bus using a destination identifier.

Abstract: System and method for managing routing of data in a distributed computing system, such as a distributed computing system that uses PCI Express protocol to communicate over an I/O fabric. A physical tree that is indicative of a physical configuration of the distributed computing system is determined, and a virtual tree is created from the physical tree. The virtual tree is then modified to change an association between at least one source device and at least one target device in the virtual tree. A validation mechanism validates the changed association between the at least one source device and the at least one target device to enable routing of data from the at least one source device to the at least one target device.