Abstract: A source site employs a source server and a source storage system, and a target site employs a target server and a target storage system. The source server manipulates data that is stored within a source logical unit of the source storage system. The target server generates a flashcopy of a replica volume and performs a recovery of the flashcopy of the replica volume in response to the replica volume being a replication of a storage volume received by the target storage system from the source storage system. The target server further exports data of the recovered flashcopy of the replica volume whereby the recovered flashcopy of the replica volume is made available to a client.

Abstract: The present invention provides a method for automatically updating bookmarks stored by a web browser when the bookmarked URL is invalid and a redirect to an alternate URL is specified. In accordance with the present invention, a web page author places redirect markups in the HTML or XML file associated with a particular URL. When this redirect markup in the HTML or XML file is received by the web browser, the user of the browser is given the option of replacing the existing bookmarked original URL with the redirect URL. Further, if desired, the bookmark, now containing the redirect URL, may also be modified to include the bookmarked original URL, so that, if desired, the user of the browser can try to reach the original URL if the redirect URL is no longer functional.

Abstract: The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

Abstract: When multiple copies of a software program reside on a single machine and need to cooperate with each other to coordinate certain aspects of their execution, an election process is conducted to elect one of the copies as a master or supervisor copy, with the non-elected copies becoming slave or subordinate copies. Since only one of the programs can succeed in being assigned the supervisor port number, the first program to have its socket assigned to the supervisor port number becomes the supervisor (e.g., the master) program; the other programs respond to the failure of their request by assuming the role of a subordinate (e.g., a slave) program.

Abstract: A method, system, and computer program for managing network connectivity between a host and a server cluster. The invention helps reduce network traffic bottlenecks at the server cluster by instructing the host to modify its network mapping such that messages sent by the host to the server cluster reach a selected server cluster member without passing through a dispatching node.

Abstract: There is provided a method for running anti-virus software for a file system that is accessible by a client through a server. The method includes (a) creating a current point-in-time copy (PiTC) of the file system, (b) determining whether a file in the file system is changed, based on a difference between the current PiTC and an earlier PiTC of the file system, and (c) determining whether the file is to be examined by the anti-virus software, based on whether the file is changed.

Abstract: A method, system, and computer program product for caching dynamically generated content (including, but not limited to, dynamically generated Web pages), as well as determining when the cached content should be invalidated or purged. Rather than caching the generated datastream (i.e. the end result of the computations used in the dynamic generation process) as in the prior art, the interim results of computations (such as a generated bean instance or object, where the interim results may be stored using properties and methods) are cached according to the present invention. The input properties used to generate the bean or object, along with the input property values, are used to distinguish among cached instances and thereby identify when a cached instance may be used to respond to a subsequent request for the same content. Re-execution of the business logic of the bean or object may then be avoided, using the cached bean's or object's output properties to generate the content response.

Abstract: A method and system for running application code originally developed as simple Java Beans, in an Enterprise Java Bean (EJB) environment, without modifying the original application code is described. This is accomplished by running one or more original Java beans in an EJB environment based on control from an external program, using at least the steps of defining a single generic EJB and installing the single generic EJB in an EJB container; generating EJB support code for each of the one or more original Java beans, and executing the EJB support code to drive the generic EJB to perform the functions of the one or more original Java beans in an EJB environment.

Abstract: This invention is a method and system for running application code originally developed as simple Java Beans, in an Enterprise Java Bean (EJB) environment, without modifying the original application code. This is accomplished by running one or more original Java beans in an EJB environment based on control from an external program, using at least the steps of defining a single generic EJB and installing the single generic EJB in an EJB container; generating EJB support code for each of the one or more original Java beans, and executing the EJB support code to drive the generic EJB to perform the functions of the one or more original Java beans in an EJB environment.

Abstract: A method, system, and computer program product for facilitating data transfers from a source node group to a target node group. In one embodiment of the invention, a source node selection request is sent to the source node group. The node selection request includes a data transfer session identifier. A source master node belonging to the source node group is configured to route the node selection request to a sending node using a predefined source node selection policy. A target node selection request is sent from the data sending node to the target node group. A target master node belonging to the target node group is configured to route the request to a receiving node using a predefined target node selection policy. The selection policies may include choosing the least loaded node in the data receiving node group.

Abstract: When multiple copies of a software program reside on a single machine and need to cooperate with each other to coordinate certain aspects of their execution, an election process is conducted to elect one of the copies as a master or supervisor copy, with the non-elected copies becoming slave or subordinate copies. In a preferred embodiment the election process depends on the presence of a TCP/IP protocol stack on the machine, and depends on its capability to enforce the restriction that only one copy of the program (an operating system process) can create a binding between a TCP socket and a given TCP port number. Each program creates the TCP socket, and requests the TCP/IP stack to bind the socket to the same configured port number, referred to herein as the “supervisor port number”. Since only one of the programs can succeed in being assigned the supervisor port number, the first program to have its socket assigned to the supervisor port number becomes the supervisor (e.g.

Abstract: The present invention provides a method for automatically bookmarking a URL specified by a web author when a user of a web browser attempts to bookmark a different page or when a process updates bookmarks based on either the HTTP 301 return code or the HTML meta refresh markup. In accordance with the present invention, a web page author places an “alternate bookmark directive” in the page (HTML or XML format) associated with a particular URL. When this “alternate bookmark directive” in the HTML or XML file is received by the web browser or by a process updating bookmarks, and the user of the browser attempts to bookmark the URL being viewed or the process is verifying a bookmark, then either the browser is instead directed to bookmark the alternate URL from the tag or the process modifies the bookmark being verified using the alternate URL from the tag.

Abstract: The present invention provides a method for automatically updating bookmarks stored by a web browser when the bookmarked URL is invalid and a redirect to an alternate URL is specified. In accordance with the present invention, a web page author places redirect markups in the HTML or XML file associated with a particular URL. When this redirect markup in the HTML or XML file is received by the web browser, the user of the browser is given the option of replacing the existing bookmarked original URL with the redirect URL. Further, if desired, the bookmark, now containing the redirect URL, may also be modified to include the bookmarked original URL, so that, if desired, the user of the browser can try to reach the original URL if the redirect URL is no longer functional.

Abstract: In order to more fully support the need to interconnect dissimilar networks, methods and apparatus are set forth which allow a transport gateway between a native (SNA/APPN) network and a mixed or non-native network to preserve the dynamic functions of the native network. The functions of fully dynamic directory and route selection are supported, in addition to the ability to use parallel gateways when connecting a native network to a mixed network. The ability to route information through a gateway from a dependent LU requester in a non-native network to a dependent LU server in a SNA/APPN network is also demonstrated. This allows concatenation of native and non-native networks while maintaining the addressability and accessibility of the native network.

Abstract: A multiprotocol transport network (MPTN) gateway provides transparent interconnection of two or more SPTNs running different transport layer protocols to form an integrated heterogeneous MPTN. The MPTN gateway of the present invention has no dependencies on the particular transport protocols running on the SPTNs being interconnected as it utilizes a common transport provider (a Gateway Services Protocol Boundary (GSPB)) between the SPTN transport protocols and the gateway components. The MPTN gateway supports connections between end systems across multiple intermediate networks. The MPTN gateway provides automatic routing based on dynamic participation in the routing protocols of the interconnected SPTNs so that any number of gateways may be interconnected and in any topology desired. As the MPTN gateway has a general architecture and acquires routing information automatically, it supports not only other MPTN nodes and gateways but also non-MPTN nodes and gateways.

Abstract: The present invention is a general solution to the problem address incompatibility between application programs and transport services. The invention may be embodied in a method for mapping the application program address (program address) to the transport services address (transport Provider address). According to the method, a program address is registered in the network so that it becomes available to other programs that understand the address, even if they are running over a transport protocol that does not understand the address format. When a request is made that a connection be established between a program and a program partner or that a datagram be sent therebetween, the program address is mapped to the transport Provider address (if necessary). The program address is then conveyed to the program partner so that it knows who it is talking to.

Abstract: Disclosed are a method and a system for transmitting a message or data packet from a single sender (21) to a plurality, i.e. a group of receivers, usually called multicasting, within a conventional unicast transmission network, i.e. a network basically not equipped to handle such multicast transmissions, consisting of a plurality of subnetworks (22-24). The nodes or gateways (25-29) connecting the subnetworks maintain tables of multicast receiving stations (or groups of such) and the header of each message includes information defining the groups of the addressed multicast receiving stations.

Abstract: A Transport Layer Protocol Boundary (TLPB) architecture is described which will permit an application program to run over a non-native transport protocol without first generating a protocol compensation package tailored to the transport protocols assumed by the program's application programming interface and by the available transport provider. All transport functions required by the program are converted to standardized or TLPB representations. When a connection between the first application program and a second remote application is requested, the individual required TLPB transport functions are compared to corresponding functions supported by the transport provider. Compensations are invoked only where there is a mismatch. The node on which the remote application program runs is informed of the compensations so that necessary de-compensation operations can be performed before the data is delivered to the remote application program.