Abstract: Data migrations are not able to be identified or traced through a switched network to their originating hub, because the corresponding TCP/IP data stream goes through a plurality of optimized differential switches and the originating IP in the packet header gets replaced at each switch. The present invention provides a mechanism to introduce a lag or a jitter into the IP to label the migrated data. The labeled data are able to be traced and identified through multiple managed hubs and/or switches.

Abstract: A set of internal information technology (IT) architecture is received and the internal IT architecture is controlled by a service provider. A set of exogenous IT architecture is received and the exogenous IT architecture is not controlled by the service provider. A set of service level agreement (SLA) requirements, agreed upon by the service provider and a service user, are received. A set of sensor data, from sensors monitoring environmental conditions which may affect at least one of the internal IT architecture or the exogenous IT architecture, is received. A set of heuristic data relating to the internal IT architecture and the exogenous IT architecture is received. A risk metric based on the set of internal IT architecture, the set of exogenous IT architecture, the set of SLA requirements, the set of sensor data, and the set of heuristic data is determined.

Abstract: A method and associated systems for caching linked queries for optimized compliance management. A user requests that a local application perform an operation upon a local dataset. The processor, in response, determines that the operation requires access to remote auxiliary data that is managed by a remote application. The processor reads from a local cache a set of provisional links that identify past sources of the auxiliary information, and displays information associated with those links to the user, clearly identifying the links and associated information as being provisional. If the user requires direct access to the auxiliary information, the system obtains from the remote application updated, verified versions of the links, replaces the provisional links in the cache with the verified links, and displays to the user the verified links and updated versions of the associated information, clearly identifying the links and information as being verified.

Abstract: A method and associated systems for caching linked queries for optimized compliance management. A user requests that a local application perform an operation upon a local dataset. The processor, in response, determines that the operation requires access to remote auxiliary data that is managed by a remote application. The processor reads from a local cache a set of provisional links that identify past sources of the auxiliary information, and displays information associated with those links to the user, clearly identifying the links and associated information as being provisional. If the user requires direct access to the auxiliary information, the system obtains from the remote application updated, verified versions of the links, replaces the provisional links in the cache with the verified links, and displays to the user the verified links and updated versions of the associated information, clearly identifying the links and information as being verified.

Abstract: A computer-implemented method includes: receiving, by a computing device, information identifying a user's activity; determining, by the computing device, the user's tasks based on the information identifying the user's activity; determining, by the computing device, the user's context switches based on the user's tasks; receiving, by the computing device, biometrics data associated with the user via an application programming interface (API); determining, by the computing device, the user's stress levels at various times based on the biometrics data; storing, by the computing device, information linking the user's stress level with the user's context switches; and outputting, by the computing device, the information linking the user's stress level with the user's context switches.

Abstract: A computer-implemented method sizes a Storage Area Network (SAN) storage migration. One or more processors determine Input/output Operations Per Second (IOPS) and throughput of hardware devices operatively coupled to a target Storage Area Network (SAN) prior to a SAN migration from a source SAN to the target SAN. One or more processors determine an estimated time and size of the SAN migration based on the IOPS and the throughput of the hardware devices. One or more processors then configure transmission resources available to the source SAN to comport with the estimated time and size of the SAN migration.

Abstract: A method and associated systems for identifying hardcoded network addresses. A network-migration tool requests from a network certain types of data that may identify IP addresses used by the network and receives a subset of the requested data. The system infers from the manner in which received data characterizes IP addresses which of those addresses are likely to be hardcoded. If the system receives a list of server affinities, it infers that an IP address used for communication between servers in a same affinity group is hardcoded if that address is not listed by an associated DNS server. If a received ARP cache lists an IP address as having been resolved to a MAC address, the system infers that the IP address cannot be hardcoded. If a received TCP trace log lists an address without a corresponding hostname the system infers that the address is hardcoded.

Abstract: A computer-implemented method includes accessing a user database, accessing a transport database, and generating a global recommended travel plan. The user database includes travel preferences and a metric preference for each user. The travel preferences include an origin, and a destination. The transport database includes transport data. The global recommended travel plan includes, for each user, a recommended route from the user's origin to the user's destination, a recommended mode, and a recommended start time. Generating the global recommended travel plan includes simultaneously optimizing each user's metric preference based on the transport data and the travel preferences. The computer-implemented method further includes returning each user's recommended route, recommended mode, and recommended start time. A corresponding computer program product and computer system are also disclosed.

Abstract: A method and associated systems for using complexity probability to plan a physical datacenter relocation. One or more processors receive descriptions of each entity to be relocated, each of which is identified by a classification and by a tier that is associated with a level of complexity. Normalized random numbers are generated for each classification/tier combination and are each associated with a relocation scenario in which random complexity has a distinct amount of effect on the duration of time needed to relocate entities of the corresponding classification and tier. These numbers are then used to identify probable relocation times, each associated with one scenario, one classification, and one amount of complexity effect. These probable relocation times are then organized by classification so as to identify complexity-compensated probabilities that relocating all entities of a particular classification will require a specific duration of time.