Abstract: According to the present invention, policies are prepared for a plurality of resources residing in a computer system comprising a storage system for copying data from a copy source volume to a copy target volume, and an evaluation is carried out for an evaluation-target resource of the plurality of resources for determining whether or not to execute a predefined action based on the policy of this evaluation-target resource. A policy corresponding to a resource related to copying of the plurality of resources is determined based on a time period related to the copying.

Abstract: A computerized system and method for processing network content associated with multiple virtual domains. The processing may include anti-malware scanning and/or content filtering. The content associated with multiple domains may be processed in the same daemon process. In response to connection requests from virtual domains, the service process creates separate sockets to communicate with each virtual domain. A global configuration management module is used to provide configuration parameters for each session to the service process. A logging manager processes both the global logs and the logs from each virtual domain. Alternatively, the service process may initiate other service processes to handle incoming connections from one or more virtual domains, in order to better utilize resources in a multiple-CPU environment.

Abstract: This invention is a system and method for managing provisioning of resources for one or more data storage networks using a new architecture.

Abstract: A plurality of landmarks selected from a source weighed graph on which a path search is performed; and the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices are calculated, and are stored in a memory device so as to be later referable. Routines for calculating upper and lower limits of the shortest path length corresponding to two vertices v and w are prepared by using expressions derived from quadrangle inequalities formed of the two vertices v and w as well as two landmarks adjacent to the respective vertices v and w. In response to a call from an A* search program, these routines return the upper limit or the lower limit of the shortest path length corresponding to v and w by referring to the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices, which have been previously stored in the memory device.

Abstract: A system for clearing content displayed in the live session display area of an instant messaging system. The system enables a session participant to clear the content currently visible to each other participant in the session, either immediately, or in response to a criteria such as elapsed time or elapsed time since active in the session. The content that is cleared from the live session display area is not permanently lost, but is only temporarily hidden from the live session display area. The system further enables a local participant to recall such temporarily hidden content back into the live session display area.

Abstract: A method of locking exclusive access to a divided computer resource that may be access by more than one different is disclosed. A computer resource that is divided into more than one piece may require exclusive access to all the individual portions before the computer resource may be used. If more than one client system attempts to access such a divided computer resource, a deadlock situation may occur. To prevent such a deadlock situation, each client that attempts to access the divided resource will issue a globally unique identifier to the divided resource. If more than one client system attempts to access portions of the same computer resource then the globally unique identifier will be used to arbitrate disputes and thus prevent deadlock.

Abstract: The subject matter described herein includes methods and systems for providing accidental stack join protection. According to one embodiment, a method includes connecting stacking ports of a first switch that is a member of a first stack and a second switch that is a member of a second stack and thereby joining the first and second stacks. The configurations of the first stack and of the second stack are detected and it is determined whether the detected configurations indicate a configuration mismatch between the first and second stacks. In response to determining that the detected configurations relate to a mismatch, the automatic joining of the first and second stacks is inhibited and the first and second stacks are allowed to continue switching traffic with their existing configurations.

Abstract: An Ajax proxy indirection technique enables a local, front-end proxy server to handle Ajax requests from an Ajax client that must be serviced by an external Ajax server in an external domain, instead of a local Ajax back-end server exposing itself to the external domain. The front-end proxy server accepts the Ajax client's request and forwards it to the local Ajax back-end server. The proxy server asks the local AJAX server for the credentials to be used in the “external” AJAX request. The local Ajax back-end server then responds to the proxy server with meta-data for the external domain request that the proxy will make to the external domain. The proxy server uses the credentials of the “external” AJAX request to make the external request to the external Ajax server in the external domain. The proxy server performs any authentication and necessary domain mapping with the external Ajax server before sending a response from the external Ajax server back to the client.

Abstract: A pin-hole firewall network communications device that includes a first port configured to communicate data packets over a packet network and a first counter module in communication with the first port. A pin-hole firewall module may be in communication with the first counter module. A call control module may be in communication with the first counter module and the pin-hole firewall function. A second counter module may be in communication with the pin-hole firewall function and the call control module. A second port may in communication with the second counter module and the packet network and be configured to communicate data packets over a second node segment of the packet network.

Abstract: A method and apparatus for processing message is described. In one embodiment, an application programming interface is configured for receiving and sending messages. A building block layer is coupled to the application programming interface. A channel layer is coupled to the building block layer. A transport protocol stack is coupled to the channel layer for implementing properties specified by the channel layer. The transport protocol stack has a concurrent stack consisting of an out of band thread pool and a regular thread pool. The transport protocol layer is to process messages from each sender in parallel with the corresponding channel for each sender.

Abstract: A method, system and computer product for analyzing a Voice-over-IP (VoIP) network composed of a plurality of components are disclosed. The method comprises the method comprises the steps of representing selected ones of the plurality of components, providing a mapping between a plurality of first events and a plurality of second events occurring in selected ones of the components; and determining at least one first event based on at least one of the plurality of second events by determining a measure between each of a plurality of values associated with the plurality of first events and the plurality of second events.

Abstract: A method, system, and program for managing on-demand email storage are provided. An email service provider allocates a predetermined amount of storage space to an intended recipient. When an email is received for the intended recipient at the email service provider, the email service provider determines whether the predetermined storage space has sufficient capacity for storage of the email. If the predetermined storage space is insufficient for storage of the email, then the email service provider allocates on-demand storage space to the intended recipient. The email service provider then stores the email in the on-demand storage space, such that the email is stored, rather than discarded, when the predetermined storage space reaches full capacity. Before allocating on-demand storage space, the email service provider may compare the email characteristics with predefined criteria set by the intended recipient for emails to be stored in on-demand storage space.