Abstract: A system and method for optimizing the frequency of market information updates in an electronic trading environment are described herein. According to one example embodiment, by optimizing the frequency of market information updates, the burden on the client device to update the graphical user interface may be reduced, while still providing an accurate portrayal of the market to the user. An example method includes associating different precedence levels with messages comprising market information. Messages containing market information related to the inside market may be associated to a higher precedence level. Whereas messages containing market information relating to the quantities at prices outside the inside market may be associated with a lower precedence level. Based on the precedence level associated with a message, a client device may update the graphical user interface or the message may be stored in a data structure until a pre-defined condition is satisfied.

Abstract: A method and system for detecting slow page load is provided. An example system comprises a page request detector, a time-out module, a time-out monitor, and a lightweight page requestor. The page request detector may be configured to detect a request for a web page. The time-out module may be configured to commence a time-out period in response to a request for a web page. The time-out module cooperates with the time-out monitor that may be configured to determine that rendering of a rich version of the requested web page has not commenced at an expiration of the time-out period. The lightweight page requestor may be configured to cause a lightweight version of the requested page to be provided to the client system when the time-out monitor determines that the rendering of a rich version of the requested web page has not commenced at an expiration of the time-out period.

Abstract: Systems, computer program products, and methods are described herein for packet cluster routing using quantum optimization within a distributed network. An example system receives data packets from a source to be transmitted to a target via a cluster of nodes in the distributed network. The example system retrieves information associated with each node in the cluster of nodes. The example system uses a quantum optimization engine to determine an optimal data path from an ingress node to an egress node in the cluster of nodes based on at least the information associated with each node. Upon determining the optimal data path, the example system routes the data packets from the source, via the optimal data path, to the target.

Abstract: This application discloses a traffic sending method and apparatus, and the method includes: A first network device receives first traffic comprising first attribute information, wherein the first attribute information identifies a first traffic type of the first traffic; when a first link from the first network device to a second network device is congested, the first network device adjusts a first cost corresponding to the first traffic type to a second cost, wherein the first link is used to forward the first traffic when the cost corresponding to the first traffic is the first cost; and the first network device sends the first traffic to a third network device via a second link from the first network device to the third network device. In this way, ensuring that all traffic in the network can be effectively forwarded, and improving a traffic forwarding rate.

Abstract: A policy determination apparatus includes an acquisition unit, a metrics generation unit, an evaluation unit, and a policy determination unit. The acquisition unit acquires monitoring data relating to states of facilities on a network. The metrics generation unit generates, based on the monitoring data, time-series data of types of metrics associated with candidates of routing destinations to which a routing control apparatus routes requests. The evaluation unit evaluates the candidates based on the time-series data to generate routing destination evaluation data. The policy determination unit determines, based on the routing destination evaluation data, a policy that the routing control apparatus uses for control of the routing destinations.

Abstract: Methods, apparatus, systems, and computer program products are disclosed for utilizing specially configured machine learning models to generate incremental currency value(s) associated with one or more target merchant data objects. Some embodiments, based on one or more market record sets, identify an actual electronic currency value for a total merchant data object set, and include a counterfactual model configured to generate a counterfactual electronic currency value for use in determining a counterfactual incremental electronic currency impact, and in some embodiments for ranking other models. Embodiments, additionally or alternatively, include an incrementality-trained ensemble model for generating a predictive incremental electronic currency impact. The incrementality-trained ensemble model may be trained to predict based on the rankings of the outputs of the counterfactual model.

Abstract: Aspects of the subject disclosure may include, for example, determining, an application requirement for a server of a data center geographically separated from a central location. A configuration file adapted for the server according to the application requirement is obtained at the central location and a host processor located at the data center is selected according to the application requirement. A static IP address preassigned to an administrative portion of the selected host processor is identified. The selected host processor is initialized remotely over a wide area network via the administrative port without utilizing any software resources pre-existing at the data center. The initializing configures the selected host processor according to the configuration file to service the application requirement. Other embodiments are disclosed.

Abstract: A secure executable container executed by a first endpoint device in a secure peer-to-peer data network detects that a second endpoint device is unavailable for execution of a secure asynchronous transaction with the first endpoint device, and generates a secure request for an assisting device (the second endpoint device or a third network device) requesting an indication once the second endpoint device is available for execution of the secure asynchronous transaction. The secure request does not contain any user-generated data. Upon the secure executable container receiving the indication generated by the assisting device that the second endpoint device is available for the execution of the secure asynchronous transaction, the secure executable container causes autonomic execution for completing the secure asynchronous transaction with the second endpoint device.

Abstract: A system including: a processor; and a memory storing computer program code that controls the processor to: collect real-time business process metrics; collect real-time cluster metrics for a plurality of application clusters indicative of a required allotment of infrastructure resources for a given business process level; estimate a predicted future business process level; based on the estimated predicted future business process level and the real-time cluster metrics, predict a future infrastructure resource requirement of each of the plurality of application clusters; compare the predicted future infrastructure resource requirement of each of the plurality of application clusters to a current dedication of each of the plurality of application clusters; automatically adjust, in real-time and based on the comparison, respective allotments of infrastructure resources for each of the plurality of application clusters; receive an actual business process; and process the business process across the plurality of

Abstract: A switch or other network device may be configured as an ingress edge telemetry node in a telemetry domain. The ingress edge telemetry node may clone certain data units it processes, for example in response to certain telemetry triggers being met. The ingress edge telemetry node may further inject telemetry and/or other data into the cloned data unit. The cloned data unit continues along the same path as the original data unit until it reaches an egress edge telemetry node in the telemetry domain. The second node extracts the telemetry data from the cloned data unit and sends telemetry information based thereon to a telemetry collector, while the original data unit continues to its final destination. Nodes along the path between the first node and the second node may be configured as transit telemetry nodes that insert or otherwise update the telemetry data.

Abstract: In one embodiment, a device computes, for each of a set of points of presence (PoPs) via which traffic for an online application can be sent from a location, application experience metrics predicted for the application over time. The device assigns, for each of the set of PoPs, weights to different time periods, based on measures of uncertainty associated with the predicted application experience metrics. The device generates, based on the weights assigned to the different time periods for each of the set of PoPs, schedules for probing network paths connecting the location to the online application via those PoPs. The device causes the network paths to be probed in accordance with their schedules. Results of this probing are used to select a particular PoP from among the set of PoPs via which traffic for the online application should be sent from the location during a certain time period.

Abstract: Described is a method for estimating throughput between first and second communication devices, the method comprising: determining maximum bottleneck throughput of a communication link between the first communication device and a third communication device, wherein the communication link between the first and third communication devices applies a common access network as between a communication link between the first and second communication devices; determining Round Trip Time (RTT) between the first and second communication devices; transmitting packet by applying User Datagram Protocol (UDP) from the third communication device to the first communication device; measuring packet loss rate associated with the transmitted packet by monitoring sequence number of the packet; and translating measured packet loss rate to Transmission Control Protocol (TCP) throughput according to maximum bottleneck throughput and RTT.

Abstract: A first information handling system may receive a telemetry metric report from a client information handling system. The first information handling system may determine that one or more characteristics of the telemetry metric report do not match one or more predetermined telemetry metric report characteristics. The first information handling system may perform one or more corrective actions based, at least in part, on the determination that the one or more characteristics of the telemetry metric report do not match one or more predetermined telemetry metric report characteristics.

Abstract: A Provider Edge (PE) node includes a plurality of ports including an inter-chassis port to a second PE node, a port connected to a root node, and one or more ports connected to leaf nodes, wherein the plurality of ports are in an Ethernet Tree (E-Tree), and wherein the root node is dual-homed to the PE node and the second PE node; switching circuitry configured to switch traffic between the plurality of ports; and circuitry configured to designate the inter-chassis port as one of a leaf node and a root node in the E-Tree instance, and manage a designation of the inter-chassis port based on a status of the port connected to the root node. The designation is changed in a data plane instead of in a control plane.

Abstract: When a transport is added, degraded, upgraded or lost between a computing device and a dock, peripherals can be moved or have their configurations modified to thereby seamlessly handoff and efficiently share the peripherals' traffic between the available transport(s). A service can be employed on the computing device to determine when a transport is added, degraded, updated or lost and to identify and implement one or more applicable rules to accomplish the handoff and sharing of the peripherals' traffic.

Abstract: A source code and module recommendation system according to the present invention includes: a module assembly including a control module including a function unit including a topology management unit sensing and generating topology information and a plurality of other modules including a different function unit from the control module; a user terminal connected to the module assembly; and a recommendation server connected to the user terminal through a network, storing topology information of the module assembly, and providing information on a recommended source code to the user terminal based on the topology information, in which the topology information may include a connection ranking representing an order in which the plurality of other modules are connected to the control module and the recommendation server may determine the information on the recommended source code based on the connection ranking and transmit the determined information to the user terminal.

Abstract: Systems and methods are provided for managed file transfer. A managed file transfer server may receive a request from a sender to send a file (bulk data) to a recipient and may determine a location server that is closest to the location of the recipient. A server-to-server transfer can be automatically initiated to move the file to the location server that is closest to the location of the recipient.

Abstract: Methods, systems, and apparatus, including computer-readable storage media, optimizing interior gateway protocol (IGP) metrics using reinforcement learning (RL) for a network domain. The system can receive a topology (G) of a network domain, a set of flows (F), and an objective function. The system can optimize, using reinforcement learning, the objective function based on the received topology and the one or more flows F. The system can determine updated IGP metrics based on the optimization of the objective function. The IGP metrics for the metric domain may be updated with the updated IGP metrics.

Abstract: Provided are a service operation method, a service operation device a storage medium and an electronic device. The method includes: determining service information about multiple nodes in a distributed network after determining a link failure in the distributed network, computing a restore path centralizedly for services indicated by the service information about the multiple nodes, and operating the services by using the restore path.

Abstract: According to an aspect of the invention, there is provided a computer comprising a plurality of interconnected processing nodes arranged in a configuration with multiple stacked layers. Each layer comprises four processing nodes connected by respective links between the processing nodes. In end layers of the stack, the four processing nodes are interconnected in a ring formation by two links between the nodes, the two links adapted to operate simultaneously. Processing nodes in the multiple stacked layers provide four faces, each face comprising multiple layers, each layer comprising a pair of processing nodes. The processing nodes are programmed to operate a configuration to transmit data around embedded one-dimensional rings, each ring formed by processing nodes in two opposing faces.

Abstract: Among other things, we describe a method of receiving a portion of metadata from a data source, the portion of metadata describing nodes and edges; generating instances of a data structure representing the portion of metadata, at least one instance of the data structure including an identification value that identifies a corresponding node, one or more property values representing respective properties of the corresponding node, and one or more pointers to respective identification values, each pointer representing an edge associated with a node identified by the corresponding respective identification value; storing the instances of the data structure in random access memory; receiving a query that includes an identification of at least one particular element of data; and using at least one instance of the data structure to cause a display of a computer system to display a representation of lineage of the particular element of data.

Abstract: A method of calculating a new route for a media data traffic flow on a computer network when a device is connected to the network, the network comprising a first and a second network switch connected by a link, the method comprising: determining whether media data traffic already flows between the first and second network switch over the link; applying a weighting to the link whose value is based on whether media data traffic already flows over the link; and determining the new route for media data traffic by using a least cost path generation algorithm using the weighting.

Abstract: The present invention provides a method of selecting an optimal communication routing between a UE and a core network wherein a plurality of differing communication paths are establishable between the UE and the network. Duplicate packets are transmitted over two communication paths and a latency difference determined between the two paths. This latency difference is used to select a communication path for subsequent communication.

Abstract: In general, the disclosure relates to a method for forwarding a packet through a multi-tier network by establishing a routing protocol session with network devices in the multi-tier network, obtaining routing protocol information from network devices of the multi-tier network, determining a group using the routing protocol information, generating an ordered group listing using network device identifiers (NDIs) for the network devices in the group, and programming a network device hardware of a network device of the set of network devices of the multi-tier network using the ordered group listing. The group includes a set of the network devices of the multi-tier network.

Abstract: Embodiments for optimizing a backup operation for a data protection system, by connecting with network devices in a network implementing the backup operation, the backup operation implementing a policy that specifies a plurality of service requirements and that is initiated at a time within a plurality of time windows, and determining a size of dataset to be backed up by the backup operation. The method further monitors a flow of data between a source and a destination of data in the network, compiles historical data of operational parameters for data transfers between the source and destination, and determines an optimum time within the plurality of time windows based on the dataset size and the historical data.

Abstract: Aspects of the subject disclosure may include, for example, determining, an application requirement for a server of a data center geographically separated from a central location. A configuration file adapted for the server according to the application requirement is obtained at the central location and a host processor located at the data center is selected according to the application requirement. A static IP address preassigned to an administrative portion of the selected host processor is identified. The selected host processor is initialized remotely over a wide area network via the administrative port without utilizing any software resources pre-existing at the data center. The initializing configures the selected host processor according to the configuration file to service the application requirement. Other embodiments are disclosed.

Abstract: A method routes packets from a source to a destination across an IP network having a plurality of nodes (including the source and destination), and a plurality of network segments interconnecting the plurality of nodes. The source and destination are configured to use a given service. To those ends, the method receives information relating to the given service, and forms a path between the source and the destination. The path includes a) at least one intermediate node between the source and the destination and b) a plurality of specific network segments extending from the source to the destination. The plurality of specific network segments are a sub-set of the plurality of network segments. To form the path, the method assigns the plurality of specific network segments to the network path between the source and the destination as a function of the information relating to the given service.

Abstract: A method for automatically establishing an address-port mapping table of a switching device in an interconnect fabric uses hardware link-up and link-down processes to build and update the lowest cost (e.g., shortest path) port entries in the mapping table. Traffic loops are precluded by comparing cost values based on the source addresses of the devices in the interconnect fabric, without blocking any particular port.

Abstract: A method to broker events of event-driven application components, within a distributed computing environment and using a mesh broker, is described. The mesh broker is instantiated as several mesh agents, the mesh agents being provisioned to support mediation activities relating to a plurality of computational nodes within the distributed computing environment. The mesh agents are further deployed as a mesh network among the computational nodes of the distributed computing environment. A connectivity catalog stores cost data associated with transmission of an event notification between each of multiple pairs of computational nodes of the computational nodes. Routes across the mesh network are automatically selected, by the mesh agents and using the cost data to determine low-cost routes across the mesh network.

Abstract: Systems and methods are disclosed for determining shared risk link group (SRLG) disjoint paths in a communications network. An original graph representing the communications network can be obtained. The original graph can include vertices and edges corresponding to nodes and communication links in the communication network. The vertices can include a source vertex and a target vertex and each edge can be associated with a set of SRLGs A reduced graph can be generated from the original graph. Generation of the reduced graph can include identification of a first edge of the edges as a dominating edge and removal of the first edge. Two SRLG-disjoint paths can then be identified on the reduced graph.

Abstract: Methods, systems, and apparatus, including computer-readable storage media, optimizing interior gateway protocol (IGP) metrics using reinforcement learning (RL) for a network domain. The system can receive a topology (G) of a network domain, a set of flows (F), and an objective function. The system can optimize, using reinforcement learning, the objective function based on the received topology and the one or more flows F. The system can determine updated IGP metrics based on the optimization of the objective function. The IGP metrics for the metric domain may be updated with the updated IGP metrics.

Abstract: An embodiment generates, responsive to receiving a declarative replication specification, a logical map comprising a plurality of paths to completing a data replication process identified by the replication specification. The embodiment determines, responsive to generating the logical map, an optimal path to completing the data replication process by searching the plurality of paths of the logical map using a cost-directed search algorithm to find the optimal path from among the plurality of paths. The embodiment also performs, responsive to finding the optimal path, a series of data replication operations for replicating source data on a target database. The embodiment also detects, during a runtime of the data replication process, a predetermined change to a runtime environment of the data replication process. The embodiment also determines, responsive to detecting the predetermined change, a revised optimal path for performing the data replication process in the changed runtime environment.

Abstract: A system described herein may provide a technique for the generation of a node map using contraction hierarchy techniques in a manner that accounts for constraints that apply to nodes or links between nodes in the node map. Candidate shortcut links, that represent paths through multiple links in the node map, may be evaluated to determine whether such candidate shortcut links are less restrictive than less costly paths having the same starting and ending nodes as the candidate shortcut links. Candidate shortcut links may be added to the node map in situations where less costly paths are available, but are more restrictive than the shortcut links. At query time, the shortcut links may apply to certain queries having parameters that violate constraints associated with the less costly paths but do not violate any applicable constraints of the shortcut links.

Abstract: A method of routing communication between nodes of a mesh network is provided. The method includes each node of the mesh network advertising a hop distance relative to a head of the mesh network, the hop distance being a measure of how many hops a node of the mesh network is from a head node of the mesh network, the head node being a node of the mesh network that controls all the other nodes of the mesh network.

Abstract: A method for fetching a content from a web server to a client device is disclosed, using tunnel devices serving as intermediate devices. The client device accesses an acceleration server to receive a list of available tunnel devices. The requested content is partitioned into slices, and the client device sends a request for the slices to the available tunnel devices. The tunnel devices in turn fetch the slices from the data server, and send the slices to the client device, where the content is reconstructed from the received slices. A client device may also serve as a tunnel device, serving as an intermediate device to other client devices. Similarly, a tunnel device may also serve as a client device for fetching content from a data server. The selection of tunnel devices to be used by a client device may be in the acceleration server, in the client device, or in both.

Abstract: A system and method for diameter agent load balancing. The method including: receiving a request from a sending diameter node; parsing at least one Attribute-Value Pair (AVP) from the request; determining a partition-identifier (partition-id) from the at least one AVP; determining a receiving diameter node, based on the partition-id; and sending the request to the receiving diameter node. The system including: a message module configured to receive a request from a sending diameter node; a parsing module configured to parse at least one Attribute-Value Pair (AVP) of the message from the request and determine a partition-id from the at least one AVP and a receiving diameter node, based on the partition-id; and a forwarding module configured to send the request to the receiving diameter node.

Abstract: A network device may obtain information concerning a virtual chassis that indicates that the network device and an additional network device are to be included in the virtual chassis. The network device may determine, based on the information concerning the virtual chassis, that the network device is connected to the additional network device, wherein the network device is connected to the additional network device via a link between a network interface of the network device and a network interface of the additional network device. The network device may cause the network interface of the network device to be converted to a virtual chassis interface and the network interface of the additional network device to be converted to a virtual chassis interface to enable the network device and the additional network device to be included in the virtual chassis to allow bootstrapping of the virtual chassis as a single logical device.

Abstract: Methods, apparatus, systems and articles of manufacture to build a storage architecture for graph data are disclosed herein. Disclosed example apparatus include a neighbor identifier to identify respective sets of neighboring vertices of a graph. The neighboring vertices included in the respective sets are adjacent to respective ones of a plurality of vertices of the graph and respective sets of neighboring vertices are represented as respective lists of neighboring vertex identifiers. The apparatus also includes an element creator to create, in a cache memory, an array of elements that are unpopulated. The array elements have lengths equal to a length of a cache line. In addition, the apparatus includes an element populater to populate the elements with neighboring vertex identifiers. Each of the elements store neighboring vertex identifiers of respective ones of the list of neighboring vertex identifiers.

Abstract: Systems, methods and/or computer program products managing momentary increases in resource requirements of microservices within a service mesh using sliced replicas or pre-configured cloud functions. The service mesh tracks incoming API calls of applications requesting use of specific microservice capabilities. Over time capabilities being called are categorized by the service mesh based on call frequency. Service mesh predicts patterns of expected increases in requests for each capability of the microservices. As the increase in the number of API calls for the capability become more than a threshold level predicted by the service mesh, a sliced replica of the microservice is created or a pre-configured cloud function is enabled to handle requests specifically for the capability causing the momentary increase in resource requirements, while the service mesh continues routing API calls for other capabilities to the requested microservice.

Abstract: A method of operating an access control system comprising a plurality of access controls, the method comprising: determining an energy metric of each of the plurality of access controls; determining a latency metric of each of the plurality of access controls; transmitting the energy metric of each of the plurality of access controls; transmitting the latency metric of each of the plurality of access controls; collecting the energy metric and the latency metric at a head node or collecting energy metric at each of the plurality of access controls from a 1-hop transmission distance; and determining a data route through the plurality of access controls in response to the energy metric of each of the plurality of access controls and the latency metric of each of the plurality of access controls.

Abstract: Techniques for improved routing based on network traffic are provided. Telemetry data relating to a first network node of a plurality of network nodes in a locator ID separation protocol (LISP) fabric is received. A first portion of the telemetry data that relates to a first destination of a plurality of destinations is identified. Further, a first routing weight associated with a first interface of the first network node is revised based on the first portion of the telemetry data, where the first interface is associated with the first destination. The revised first routing weight is published to a second plurality of network nodes in the LISP fabric, wherein the second plurality of network nodes route packets to the first network node based in part on the revised first routing weight.

Abstract: In a border network having a plurality of routers, routing tables for the routers can be generated using one or more weighted parameters, such as a price associated with transmission of packets over third-party routers, capacity of the border routers, and performance information (e.g., latency) of the border routers. The routing tables can be repetitively generated to proactively ensure that the border network is operating optimally. The framework described augments a control plane with Availability, Performance, and Cost (APC) telemetry collected from existing services in a cloud environment. Such telemetry can be continuously correlated in a convex optimization framework to maintain the network in its optimal state. As a result, the framework can proactively avoid potential network degradation events (e.g. congestion) and the resulting customer impact, while reducing the cost of routing traffic through upstream peers/transits.

Abstract: In some implementations, a method is provided. The method includes receiving at an origin controller node, a task and determining a destination work node where the task is to be executed, wherein the origin controller node and the destination work node each comprise a receptor node among a plurality of receptor nodes forming a receptor network, and each of the plurality of receptor nodes functions as one or more of a router node, a controller node, and a work node. The method further includes determining a first router node comprising a first hop on an optimal path to the destination work node, the first router node determined from among a set of receptor nodes functioning at least as router nodes. The method further includes transmitting the task to the destination work node via the first router node and performing the task via the destination work node.

Abstract: A method and system for processing media content in Moving Picture Experts Group (MPEG) Network Based Media Processing (NBMP) includes obtaining a list of function repositories, each function repository storing one or more functions for processing the media content, obtaining a descriptor identifying a location of each of the function repositories identified in the list of function repositories, selecting a function repository, from among the function repositories, according to a criterion, and processing the media content using a function included in the selected function repository.

Abstract: Aspects of the subject disclosure may include, for example, determining, an application requirement for a server of a data center geographically separated from a central location. A configuration file adapted for the server according to the application requirement is obtained at the central location and a host processor located at the data center is selected according to the application requirement. A static IP address preassigned to an administrative portion of the selected host processor is identified. The selected host processor is initialized remotely over a wide area network via the administrative port without utilizing any software resources pre-existing at the data center. The initializing configures the selected host processor according to the configuration file to service the application requirement. Other embodiments are disclosed.

Abstract: A method and an apparatus for processing data are provided. The method includes: determining, in response to receiving an access request sent by a client and a target path in a complete binary tree, a time interval between the access request and a last access request as a second time interval, a value of a non-leaf node of the complete binary tree being related to a time interval of latest two access requests received by a metadata server, a leaf node being used to represent a virtual node in a distributed system; determining a change amount of a value of a node in the complete binary tree according to the target path and the second time interval; querying an access result according to the access request, and sending the access result to the client; and sending the change amount to a management server end.

Abstract: Technologies for intelligent traffic optimization include a directional flow server that receives dynamic traffic data from traffic infrastructure devices in a monitored region. The traffic data may include traffic volume data and traffic control status data. The server updates a dynamic layer of a high-definition map based on the dynamic traffic data. The high-definition map also includes a static layer and a directional flow layer. The server optimizes the directional flow in response to updating the dynamic layer. The directional flow layer is indicative of traffic direction associated with roads in the monitored region. The server may optimize each of several sub-regions and then optimize connection roads between the regions. The server may distribute the optimized directional flow layer to consumers such as traffic control devices, autonomous vehicles, and other subscribing devices. Other embodiments are described and claimed.

Abstract: A method is performed by a first front-end node, for supporting data communication. The first front-end node operates in a communications network comprising a pool of front-end nodes for providing access to a database. The pool of front-end nodes includes the first front-end node. The first front-end node receives, from a load balancer node, a first request for data from the database, from a client node. The first front-end node provides, to the client node, a first response to the received first request, the first response including a first indication indicating that the first front-end node is a preferred node for providing a subsequent response to a subsequent request for data from the client node. The subsequent response is allowed to originate from another front-end node in the pool of front-end nodes, different than the preferred node.

Abstract: A method for accelerating transaction execution across geographically dispersed clusters is disclosed. In one embodiment, such a method includes receiving a request to read data in a data replication system comprising a primary storage system and a secondary storage system in a synchronous mirroring relationship with the primary storage system. The method determines whether at least one of the following conditions is true: (1) the secondary storage system is closer from a communication standpoint; and (2) a high speed communication technology is available to communicate with the secondary storage system that is not available to communicate with the primary storage system. In the event either of the conditions is true, the method directs the request to the secondary storage system. In the event neither of the conditions is true, the method directs the request to the primary storage system. A corresponding system and computer program product are also disclosed.

Abstract: A tool may identify and revert changes that caused network hardware components or hardware servers to malfunction. The tool builds and maintains a graph that represents the hardware components and servers in the system and their dependencies. When a change is made to the system, links and weights in the graph are adjusted to account for the changes. When a component or server is reported as malfunctioning, the tool traverses the graph to locate the changes that are the most likely root causes of the malfunction. The tool may then revert the change to resolve the malfunction.