Abstract: The present invention broadly contemplates addressing QoS concerns in overlay design to account for the last mile problem. In accordance with the present invention, a simple queuing network model for bandwidth usage in the last-mile bottlenecks is used to capture the effects of the asymmetry, the contention for bandwidth on the outgoing link, and to provide characterization of network throughput and latency. Using this characterization computationally inexpensive heuristics are preferably used for organizing end-systems into a multicast overlay which meets specified latency and packet loss bounds, given a specific packet arrival process.

Abstract: A method and system architecture to manage system resources in such a way as to provide service time guarantees to various classes of work using the system. In the case that the system resources are not sufficient to provide the specified service time guarantees, a method and system architecture is provided to limit work into the system such that the guarantees are satisfied and the revenue derived from the system is maximized.

Abstract: One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where “unknown” means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint.

Abstract: A method, computer readable media, and apparatus of hierarchical-based communication session and data distribution management that indexes client's communication preferences and network attribute information. Indexing is used to generate dynamic group membership lists that map into communication groups. Indexing is replicated at control nodes in the network overlay to allow distributed management of group membership. Send/receive operations are decoupled through data distribution and the indexing structure. Senders and receivers register their group communication interests to a parent node in the hierarchy. The session control structure aggregates client interest and dynamically updates replicas at control nodes which are selected according to the changes in registered client interest. The indexing structure has self-managing properties for automatic clustering based on client session and data interests, and dynamic partitioning of the session/data interest attribute space.

Abstract: Managing application performance on a network. A network graph is generated from a set of application endpoints on the network. The network graph is annotated by associating one or more of the application endpoints with at least one of a corresponding latency annotation or a corresponding available bandwidth annotation. An end to end plan is formulated from the annotated network graph, wherein the plan maps one or more application requirements onto the plurality of paths in accordance with one or more end to end control adjustments including at least one of a server selection adjustment, an internet service provider (ISP) selector, or an overlay routing adjustment.

Abstract: In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.

Abstract: A system and method for scalable status change detection in a network of nodes includes embedding node coordinate positions into a virtual map environment. A cluster of nodes are represented with a representative node to form a hierarchy of nodes and clusters where changes in a status of the representative node imply a status change in the nodes of the cluster. By selectively monitoring the representative nodes for the changes in status, the representative nodes create a capability for scalable monitoring of the network.

Abstract: A system and method for monitoring liveliness includes a management device which has an application layer where applications are executed. A connection monitor is located other than on the application layer, and the connection monitor is configured to receive requests from clients and deliver the requests to components on the application layer. The components include a generic application monitor which responds to liveliness monitor requests from the clients for all applications monitored, and one or more applications which response to requests to that application.

Abstract: A method (and system) for managing a distributed-memory parallel application running on multiple servers, includes dynamically moving a plurality of executable program components, where each of the plurality of executable program components are running on one of a plurality of virtual machines, using migration of the virtual machines between physical servers. The load balancing is operated based on a workload of each of the virtual machines and servers, where a virtual machine, or a plurality of virtual machines, are transferred to balance the workload between each of the servers.

Abstract: A method (and system) which provides virtual machine migration with filtered network connectivity and control of network security of a virtual machine by enforcing network security and routing at a hypervisor layer at which the virtual machine partition is executed, and which is independent of guest operating systems.

Abstract: In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.

Abstract: A method of, and system for, configuring a network infrastructure, which includes representing the network infrastructure as a composition of a predetermined number of functional building blocks, configuring a network blue print based on the predetermined number of functional building blocks, and mapping the predetermined number of functional building blocks onto available physical resources of the network infrastructure, such that network configuration can be automated for a wide set of services representing network configuration as a functional composition of elemental blocks.

Abstract: A solution for managing a computer infrastructure is provided. In particular, the solution can generate a set of tentative recovery segments for the computer infrastructure based on a related resource graph and a set of partition rules. The related resource graph can be generated based on a managed resource graph, which includes resource type information for each node in the managed resource graph. The set of tentative recovery segments can be used to manage the computer infrastructure and/or a set of recovery segments, which includes recovery characteristic(s) for each segment can be generated based on the set of tentative recovery segments and a set of recovery segment templates. In any event, the invention provides a solution that fully and/or partially automates the identification of recovery segments within a computer infrastructure, thereby enabling a more effective management of the computer infrastructure.

Abstract: A system and method for monitoring liveliness includes a management device which has an application layer where applications are executed. A connection monitor is located other than on the application layer, and the connection monitor is configured to receive requests from clients and deliver the requests to components on the application layer. The components include a generic application monitor which responds to liveliness monitor requests from the clients for all applications monitored, and one or more applications which response to requests to that application.

Abstract: One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where “unknown” means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint.

Abstract: A system and method for scalable status change detection in a network of nodes includes embedding node coordinate positions into a virtual map environment. A cluster of nodes are represented with a representative node to form a hierarchy of nodes and clusters where changes in a status of the representative node imply a status change in the nodes of the cluster. By selectively monitoring the representative nodes for the changes in status, the representative nodes create a capability for scalable monitoring of the network.

Abstract: A method of generating an annotated network topology of a network is described. The method includes determining available bandwidth “B” of a network on a network path connecting a pair of endpoints by performing Transfer Control Protocol (TCP) flows between the pair of endpoints, the network having a plurality of network paths, identifying a bottleneck link in the network path, and annotating all edges in a network path, wherein available bandwidth annotation of links inside the network is determined using end-to-end network measurements. A system for generating the annotated network topology of a network is also described.

Abstract: A method (and system) for managing a distributed-memory parallel application running on multiple servers, includes dynamically moving a plurality of executable program components, where each of the plurality of executable program components are running on one of a plurality of virtual machines, using migration of the virtual machines between physical servers. The load balancing is operated based on a workload of each of the virtual machines and servers, where a virtual machine, or a plurality of virtual machines, are transferred to balance the workload between each of the servers.

Abstract: The present invention provides a method, computer program product, and data processing system for efficiently recovering state and performing failover of a network offload engine. The present invention distinguishes between the hard state and the soft state of a protocol. Hard state is state information that, when lost, leads to incorrect protocol behavior. Soft state is state information that may be lost or become inconsistent without loss of correctness. The present invention ensures correctness by always being able to recover the hard state of the protocol. A preferred embodiment of the present invention performs a failover of a network offload engine by temporarily blocking the reception of network packets, recovering hard state from host information, resuming network operation using a substitute network offload engine, and recovering soft state from the subsequent network activity.

Abstract: The present invention broadly contemplates addressing QoS concerns in overlay design to account for the last mile problem. In accordance with the present invention, a simple queuing network model for bandwidth usage in the last-mile bottlenecks is used to capture the effects of the asymmetry, the contention for bandwidth on the outgoing link, and to provide characterization of network throughput and latency. Using this characterization computationally inexpensive heuristics are preferably used for organizing end-systems into a multicast overlay which meets specified latency and packet loss bounds, given a specific packet arrival process.