Abstract: A service-level specification for information technology services is obtained from a user. The service-level specification is mapped into an information technology specific deployment plan. Information technology specific resources are deployed in accordance with the information technology specific deployment plan to provide the information technology services.

Abstract: One embodiment of the present method and apparatus for efficiently expanding a P2P network includes receiving a search request message from a requesting node and sending a response message to the requesting node on behalf of a node that has the requested data, where the response message originates at an intermediate node. The intermediate node may respond on behalf of the “responding” node, for example, in cases where the responding node is too far away from the requesting node to receive the search request message.

Abstract: A service-level specification for information technology services is obtained from a user. The service-level specification is mapped into an information technology specific deployment plan. Information technology specific resources are deployed in accordance with the information technology specific deployment plan to provide the information technology services.

Abstract: Disclosed are methods and systems for expanding the search space in a Peer-to-Peer (“P2P”) network. In one embodiment, the search space is expanded by increasing the time-to-live value of the search request message. The P2P network may include a plurality of nodes, and the method for increasing the search space in the network includes the steps of receiving a search request message; changing a time-to-live value carried by the message; and forwarding the message to at least one peer node.

Abstract: Method, apparatus and computer program product are configured to perform computer monitoring activities; to collect information regarding computer system status during the computer monitoring activities; to detect a problem in dependence on the information collected during the computer monitoring activities; and to determine whether to launch a diagnostic probe when the problem is detected. The monitoring activities may be performed on a periodic or event-driven basis. The determination whether to launch a diagnostic probe is based on a rule included in a hierarchy of rules. The hierarchy of rules is based on problem tickets; system logs; and computer system configuration information.

Abstract: One embodiment of the present method and apparatus for assisting a peer-to-peer connection between a first node and a second node includes receiving, at a third node, a request for connection assistance from one of the first and second nodes. The third node then connects to both the first node and the second node, receives the data from the first node and delivers the data to the second node. In this manner, data may be transferred between the first and second nodes even if the first and second nodes are unable to directly connect to each other (e.g., due to permanent or temporary limitations).

Abstract: Methods, systems and program storage devices receive actions taken by a user during an interaction with a web resource, wherein the actions cause the web resource to assume a particular state; and save information describing the actions. Other methods, systems and program storage devices retrieve the information; and perform at least one action using the information, causing a graphical user interface to display the web resource in a state in accordance with the action. The particular state can include without limitation a plurality of states assumed sequentially when the web resource is displayed, and the information can describe a sequential series of actions that cause the web resource to assume the sequential series of states. In such variants further operations include receiving a series of commands to step through the sequential states of the web resource; and using the information to display the sequential states. The series of commands can be issued automatically or under user control.

Abstract: A service-level specification for information technology services is obtained from a user. The service-level specification is mapped into an information technology specific deployment plan. Information technology specific resources are deployed in accordance with the information technology specific deployment plan to provide the information technology services.

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

Abstract: The structure attributes and unstructured attributes of a ticket are used to generate a problem signature. For structured attributes, correlation between field values is determined and fields with the highest weight are identified. For unstructured attributes, data mining techniques are applied to generate a plurality of keywords with a ranking for each ticket by identifying keywords, and commonly used acronyms and corpus variances. The set of structured attributes and the plurality of keywords from unstructured attributes form the signature of a given problem ticket.

Abstract: A method, system and program storage device for browsing hyperlinked documents are provided. A method in one aspect may include enabling navigating from a document having a plurality of hyperlinks to a document associated with one of said plurality of hyperlinks; and enabling navigating directly from said document associated with one of said plurality of hyperlinks to another document associated with another one of said plurality of hyperlinks using one or more of a plurality of defined elements. System and program storage device for performing the above methods are also provided.

Abstract: A service-level specification for information technology services is obtained from a user. The service-level specification is mapped into an information technology specific deployment plan. Information technology specific resources are deployed in accordance with the information technology specific deployment plan to provide the information technology services.

Abstract: Methods, apparatus and computer program products implement session-specific URIs for allocating network resources by receiving a request from a user for at least one network resource; assigning a session-specific URI to the at least one network resource for use in identifying the at least one network resource and controlling access to the at least one network resource; updating a network directory service with the session-specific URI; and communicating the session-specific URI to the user. The user communicates the session-specific URI to other participants in the session during which the at least one network resource will be used. After a pre-determined time, the session ends and the at least one network resource is de-allocated by, for example, changing the URI of the at least one network resource. Frequent changes of URIs hinder efforts by unauthorized individuals to gain access to network resources.

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

Abstract: One embodiment of the present method and apparatus for processing a search request message received over a network includes computing a threshold value in accordance with the search request message and returning at least one search result to a user in response to the search request message, if a rank of the at least one search result at least meets the threshold value.

Abstract: In one embodiment, the present invention is a method and apparatus for inferring the read status of instant messages. One embodiment of the inventive method involves displaying the instant message on the receiver's computing device and sending a message to the sender indicating a probability with which the receiver has viewed the instant message. In one embodiment, this probability is based at least in part on an amount of the instant message that is in view on the receiver's computing device and on user input that is received by the receiver's computing device, e.g., from the receiver.

Abstract: One embodiment of the present method and apparatus for reducing spam in peer-to-peer networks includes forming a search message including at least one decoy word and sending the search request message, including the decoy word(s), to one or more nodes in the network. Embodiments of the present invention make it possible to weed out nodes in the network that send spam in response to every search message (e.g., regardless of the search message's content).

Abstract: In one embodiment, the present invention is a method and apparatus for transparent TCP negotiations. In one embodiment, endpoint machines (e.g., clients and servers) negotiate network characteristics through use of TCP header fields, which provide backward capability. Negotiations may be requested or initiated by either endpoint, and if the receiving endpoint is not capable of negotiating, the existing TCP connection will continue to operate as normal.

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

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.