Abstract: A method and system are provided. The method includes defining an application manifest that describes a computing solution for transfer from a cloud site to an on-premises computing appliance at a given premises. The computing solution is executable for a dataset resident at the given premises. The method further includes defining a characterization of a local premises environment in which the computing solution will be executed. The method also includes modifying the application manifest using the characterization of the local premises environment by at least one of adding, removing and modifying at least one component of the application manifest to provide a modified application manifest. The method additionally includes installing the computing solution in a computing appliance at the local premises environment according to the modified application manifest. The computing appliance is for executing the computing solution.

Abstract: Techniques for managing network traffic in a virtual consolidated appliance so as to avoid interruptions in existing network connections during reconfiguration of the virtual consolidated appliance are provided. In one aspect, a method for operating a virtual consolidated appliance having a plurality of servers is provided. The method includes the following steps. An assignment for load balancing is computed based on a status of the virtual consolidated appliance. A reconfiguration of the virtual consolidated appliance is discovered. A new assignment is computed for load balancing based on a new status of the virtual consolidated appliance based on the reconfiguration of the virtual consolidated appliance. Existing network connections are redirected according to the assignment during the reconfiguration of the virtual consolidated appliance. New network connections are served according to the new assignment.

Abstract: Various embodiments execute MapReduce jobs. In one embodiment, at least one MapReduce job is received from one or more user programs. At least one input file associated with the MapReduce job is divided into a plurality of data blocks each including a plurality of key-value pairs. A first unique name is associated with each of the data blocks. Each of a plurality of mapper nodes generates an intermediate dataset for at least one of the plurality of data blocks. A second unique name is associated with the intermediate dataset generated by each of the plurality of mapper nodes. The second unique name is based on at least one of the first unique name, a set of mapping operations performed on the at least one of the plurality of data blocks, and a number associated with a reducer node in a set of reducer nodes assigned to the intermediate dataset.

Abstract: The present disclosure relates generally to the field of efficient name management for named data networking in datacenter networks. In various examples, efficient name management for named data networking in datacenter networks may be implemented in the form of systems, methods and/or algorithms.

Abstract: A method and system are provided. The method includes defining an application manifest that describes a computing solution for transfer from a cloud site to an on-premises computing appliance at a given premises. The computing solution is executable for a dataset resident at the given premises. The method further includes defining a characterization of a local premises environment in which the computing solution will be executed. The method also includes modifying the application manifest using the characterization of the local premises environment by at least one of adding, removing and modifying at least one component of the application manifest to provide a modified application manifest. The method additionally includes installing the computing solution in a computing appliance at the local premises environment according to the modified application manifest. The computing appliance is for executing the computing solution.

Abstract: Various embodiments estimate network load in a wireless communication network. In one embodiment, at least one call detail record associated with a wireless communication network is received. A topology representing the network is analyzed. The topology includes a plurality of nodes each representing a network element within the wireless communication network. The topology also includes a plurality of edges between two or more of the plurality of nodes. Each of the plurality of edges indicates that the two or more plurality of nodes are communicatively coupled to each other within the network. A set of paths is identified between two or more nodes in the plurality of nodes corresponding to a set of call flow information within the at least one call detail record. A state of each network element represented by the two or more nodes in the set of paths is determined based on the call detail record.

Abstract: Various embodiments manage service issues within a wireless communication network. In one embodiment, a one or more call detail records associated with a set of wireless communication devices of a wireless communication network is received. A set of information within each of the one or more call detail records is compared to a baseline statistical model. The baseline statistical model identifies a normal operating state of the wireless communication network. At least one outlier call detail record in the one or more call detail records is identified based on the comparison. The at least one outlier call detail record indicates that at least one wireless communication device associated with the at least one outlier call detail record experienced one or more service issues.

Abstract: The present disclosure relates generally to the field of efficient name management for named data networking in datacenter networks. In various examples, efficient name management for named data networking in datacenter networks may be implemented in the form of systems, methods and/or algorithms.

Abstract: The present disclosure relates generally to the field of proactive data object replication in named data networks. In various examples, proactive data object replication may be implemented in one or more named data networks in the form of systems, methods and/or algorithms.

Abstract: A distributed coordination of a wireless network operating on different channels is provided by dispatching a device on each ‘home’ channel to regularly visit other ‘foreign’ channels to propagate and listen to broadcast information on these channels. The information in the broadcast packets transmitted on the home channel is relayed to the devices on the foreign channels by the dispatched device, as a ‘proxy device’ that operates on behalf of the other devices in the home channel. In a preferred embodiment, various aspects of this proxy process are optimized to reduce overhead and delays. Each channel is configured to distinguish home devices from foreign devices, to avoid contention between home and foreign devices. Acquired beacon slots on foreign channels are reserved to facilitate returning proxy devices. At the home channel, an anchor device alerts other devices of the proxy device's temporary absence and preserves the proxy device's beacon slot on the home channel.

Abstract: A computer-implemented system and computer program product for routing at least one interest packet in a named data network including a plurality of nodes. The system comprises a mapping unit configured for mapping each of a plurality of names of a respective plurality of the data objects to one of a plurality of path labels, wherein each path label uniquely identifies a path between a source node and a destination node; and a node in operative communication with the mapping unit configured for providing an interest packet having both the name of a requested data object and one of the path labels, wherein the path label provided with the interest packet points to the requested data object at the destination node of the path label provided with the interest packet.

Abstract: A computer-based method for processing user data traffic in a RAN in which mobile user equipment can communicate with a RNC through a base station includes the following steps. A flow of data frames to/from mobile user equipment passing between the base station and the RNC are read, wherein one or more of the data frames contain control messages and one or more other of the data frames contain user data. The control messages contained in the data frames are analyzed for channel identification information that indicates whether the data frames that contain user data contain circuit-switched or packet-switched user data. The data frames that contain the circuit-switched user data and the data frames that contain the packet-switched user data are segregated at a transport network layer between the base station and the RNC based on the channel identification information.

Abstract: The present disclosure relates generally to the field of proactive data object replication in named data networks. In various examples, proactive data object replication may be implemented in one or more named data networks in the form of systems, methods and/or algorithms.

Abstract: A method, information processing system, and computer program product manage virtual workspace migration. A set of information associated with a user is analyzed. A future virtual workspace demand associated with the user is predicted based on the analyzing. At least a portion of at least one virtual workspace associated with the user is migrated from a first location to at least a second location based on the future virtual workspace demand that has been predicted.

Abstract: A method for inferring network link topology includes receiving an address of a seed node in a network, initializing a set of links and monitors of the network, refining, iteratively beginning at the seed node, the set of links and monitors of the network, wherein a local topology of links is inferred from routing information of a current node and a remote topology of links is inferred from routing information of the set of monitors, wherein the set of monitors is created from the local topology of links, and outputting the topology of links including the local and remote topology of links as a topology of the network.

Abstract: A method implemented in a computer system for routing at least one interest packet in a named data network including a plurality of nodes is provided. The method comprises: mapping, with the computer system, each of a plurality of names of a respective plurality of data objects to one of a plurality of path labels, wherein each path label uniquely identifies a path between a source node and a destination node; and providing, with the computer system, an interest packet having both the name of a requested data object and one of the path labels, wherein the path label provided with the interest packet points to the requested data object at the destination node of the path label provided with the interest packet.

Abstract: A method for inferring network link topology includes receiving an address of a seed node in a network, initializing a set of links and monitors of the network, refining, iteratively beginning at the seed node, the set of links and monitors of the network, wherein a local topology of links is inferred from routing information of a current node and a remote topology of links is inferred from routing information of the set of monitors, wherein the set of monitors is created from the local topology of links, and outputting the topology of links including the local and remote topology of links as a topology of the network.

Abstract: The present disclosure relates generally to the field of migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility). In various examples, migration (e.g., seamless migration) of a network connection under mobility (e.g., host mobility) may be implemented in the form of methods and/or algorithms.

Abstract: The present disclosure relates generally to the field of identifying network flows (e.g., IP flows) under network address translation. In various examples, identifying network flows (e.g., IP flows) under network address translation may be implemented in the form of methods and/or algorithms.

Abstract: The present disclosure relates generally to the field of identifying network flows (e.g., IP flows) under network address translation. In various examples, identifying network flows (e.g., IP flows) under network address translation may be implemented in the form of systems and/or algorithms.