摘要:
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.
摘要:
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.
摘要:
A detectibility service for a storage infrastructure manager (SIM) operating on a storage area network (SAN) is disclosed directed to addressing a situation where there may be multiple sources of duplicate or contradictory information to the SIM about the presence and condition of an element in the SAN. The service can account for both authoritative as well as nonauthoritative sources of information in a SAN, which participate in the discovery process scanning for SAN elements. Both authoritative and nonauthoritative sources of information can be used to report a given SAN element during a probe, taking advantage of the more efficient processing of information from authoritative sources to override information from nonauthoritative sources regardless of the order in which the various scans may occur.
摘要:
A method and system are disclosed for re-using, across plural customer accounts, information generated as part of technical solution designs by a service provider for delivering Information Technology (IT) outsourcing services to customers. The method comprises the step of providing a set of standard service elements and a set of standard service designs. The method comprises the further steps of customizing one or more of the standard service designs to generate customized service designs, generating custom service elements, and generating custom service designs associated with them. The custom service elements and service designs, and the customized service designs are stored in a tool-specific metadata repository that is accessed to promote reuse of the customizations across plural customer accounts. Usage statistics are utilized to identify when non-standard service elements and designs should be promoted to standard ones, and data mining techniques are used to infer policies associated with the non-standard service designs.
摘要:
An apparatus, system, and method are disclosed for detecting entity changes in a storage area network. A discovery module probes a plurality of entities of the storage area network to detect an event in response to a policy, stores attributes of the probed entities, and reports the event with a probe event reference. A monitor module receives a self-announced event reference of the event if an entity communicates the event. A configuration module records the event as an initiated event reference if the event is initiated by an administrator. An event manager synthesizes a report of the event from the event references.
摘要:
A system, method and computer program product for use in a server cluster having plural server nodes implementing a server tier in a client-server computing architecture in order to determine which of two or more partitioned server subgroups has a quorum. A determination is made of relative priorities of the subgroups and a quorum is awarded to the subgroup having a highest relative priority. The relative priorities are determined by policy rules that evaluate comparative server node application state information. The server node application state information may include one or more of client connectivity, application priority, resource connectivity, processing capability, memory availability, and input/output resource availability, etc. The policy rules evaluate the application state information for each subgroup and can assign different weights to different types of application state information. An interface may be provided for receiving policy rules specified by a cluster application.
摘要:
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.
摘要:
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. Application-specific, developer-defined criteria may be used in the cache invalidation determination.
摘要:
A method, system, and article for resolving a silent error is disclosed. A primary program copy runs on a primary host, and a secondary program copy runs on a secondary host. The primary and secondary copies communicate to maintain synchronized execution. A third copy of the data is stored on a storage device as a write operations log and maintained in memory on the primary host while the program is running. The primary copy is synchronized with the secondary copy by computing a first checksum of data on the primary host in response to a read operation local to the primary host, computing a second checksum of data on the secondary host in response to a read operation local to the secondary host, and periodically communicating the first checksum to the secondary host, and resolving any discrepancies between the first and second checksum of data reflecting a silent data error.
摘要:
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.