Abstract: A method, computer system, and computer readable product for trajectory data compression are disclosed. In embodiments, the method comprises generating spatial data for one or more moving objects; projecting the data onto a network comprised of a plurality of trajectories, the network constraining movement of the one or more moving objects; and storing the projected data in a data store. In embodiments of the invention, the method further comprises translating updates and queries to the spatial data, using specified data of the network, into links to the data store, and using the links to update and query the data store. In embodiments of the invention, the specified data of the network are stored in a network store. In embodiments of the invention, each of the trajectories includes one or more sub-trajectories, and the projecting the spatial data onto a network includes projecting the spatial data onto the sub-trajectories.

Abstract: According to one exemplary embodiment, a method for time-shifted uploading of a data file through a backhaul network to a backend provider is provided. The method may include intercepting an upload request from an originating user located at a network edge. The method may include caching the data file associated with the upload request upstream of the backhaul network. This method may include uploading a placeholder file to the backend provider. The method may include receiving a file ID from the backend provider. The method may include mapping the received file ID to the cached data file. The method may include intercepting a request to access the data file by a requesting user. The method may include sending the requesting user the cached data file. The method may include uploading a copy of the data file to the backend provider based on a backhaul utilization policy.

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: A method, computer system, and computer readable product for trajectory data compression are disclosed. In embodiments, the method comprises generating spatial data for one or more moving objects; projecting the data onto a network comprised of a plurality of trajectories, the network constraining movement of the one or more moving objects; and storing the projected data in a data store. In embodiments of the invention, the method further comprises translating updates and queries to the spatial data, using specified data of the network, into links to the data store, and using the links to update and query the data store. In embodiments of the invention, the specified data of the network are stored in a network store. In embodiments of the invention, each of the trajectories includes one or more sub-trajectories, and the projecting the spatial data onto a network includes projecting the spatial data onto the sub-trajectories.

Abstract: Systems, methods and computer program products for aliasing of named data objects (in named data networks) and entities for named data networks (e.g., named graphs for named data networks). In various examples, aliasing of named data objects may be implemented in one or more named data networks in the form of systems, methods and/or algorithms. In other examples, named graphs may be implemented in one or more named data networks in the form of systems, methods and/or algorithms.

Abstract: Methods, systems, and apparatus for providing airtime fairness in a telecommunications network are disclosed. In one aspect a method includes determining, by an access point, respective transmission rates of multiple stations configured to wirelessly communicate with the access point; determining, by the access point and for each of the multiple stations, a weight of the station that is proportional to the respective transmission rate of the station; and transmitting, wirelessly by the access point and to each of the multiple stations, one or more packets to the station during an airtime allocation to the station, wherein the amount of one or more packets transmitted during the airtime allocation corresponds to the weight of the station and a size of queued packets for the station.

Abstract: A request may be received to join one or more attributes of at least two independent sets of data into a data structure. The one or more attributes may include a time attribute. The two independent sets of data may be included within a data store. It may be determined that there are one or more null values associated with the join to the data structure. In response to at least the determining that there are one or more null values associated with the join, one or more values may be imputed into one or more fields corresponding to the one or more null values, wherein there are no null values in the one or more fields subsequent to the imputing.

Abstract: A request may be received to join one or more attributes of at least two independent sets of data into a data structure. The one or more attributes may include a time attribute. The two independent sets of data may be included within a data store. It may be determined that there are one or more null values associated with the join to the data structure. In response to at least the determining that there are one or more null values associated with the join, one or more values may be imputed into one or more fields corresponding to the one or more null values, wherein there are no null values in the one or more fields subsequent to the imputing.

Abstract: A request may be received to join one or more attributes of at least two independent sets of data into a data structure. The one or more attributes may include a time attribute. The two independent sets of data may be included within a data store. It may be determined that there are one or more null values associated with the join to the data structure. In response to at least the determining that there are one or more null values associated with the join, one or more values may be imputed into one or more fields corresponding to the one or more null values, wherein there are no null values in the one or more fields subsequent to the imputing.

Abstract: Techniques for network state-aware and network scheduling policy-aware task scheduling are provided. In one aspect, a method for scheduling tasks in a distributed computing network includes the steps of: collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predicting a performance of each of the candidate resources in performing the given task based on both i) a state and ii) a scheduling policy of the distributed computing network; and selecting a best candidate resource for the given task based on the performance. A system for scheduling tasks in a distributed computing network is also provided which includes a task scheduler; and a network scheduler, wherein the task scheduler is configured to schedule the tasks in the distributed computing network based on both i) the state and ii) the scheduling policy of the distributed computing network.

Abstract: A path computing method, system, and computer program product, include extracting unpleasant data from a database to create a multi-variate spatio-temporal density function, collecting a tolerance level of a user, and computing a path for the user based on the tolerance level and the density function.

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 provide adaptive monitoring of a wireless communication network. In one embodiment, a first set of network data generated for a wireless communication network is analyzed. The first set of network data is a set of historical network data for the wireless communication network. A baseline for at least one operating characteristic associated with the wireless communication network is determined based on the analyzing. A second set of network data generated for the wireless communication network is received. The second set of call detail records that has been received is utilized to determine if the at least one operating characteristic corresponds to the baseline. A set of monitoring operations performed by a network management system with respect to the wireless communication network is dynamically adjusted based on the at least one operating characteristic failing to correspond to the baseline.

Abstract: A method, computer system, and computer readable product for trajectory data compression are disclosed. In embodiments, the method comprises generating spatial data for one or more moving objects; projecting the data onto a network comprised of a plurality of trajectories, the network constraining movement of the one or more moving objects; and storing the projected data in a data store. In embodiments of the invention, the method further comprises translating updates and queries to the spatial data, using specified data of the network, into links to the data store, and using the links to update and query the data store. In embodiments of the invention, the specified data of the network are stored in a network store. In embodiments of the invention, each of the trajectories includes one or more sub-trajectories, and the projecting the spatial data onto a network includes projecting the spatial data onto the sub-trajectories.

Abstract: Techniques for network state-aware and network scheduling policy-aware task scheduling are provided. In one aspect, a method for scheduling tasks in a distributed computing network includes the steps of: collecting a pool of candidate resources in the distributed computing network for performing a given one of the tasks; predicting a performance of each of the candidate resources in performing the given task based on both i) a state and ii) a scheduling policy of the distributed computing network; and selecting a best candidate resource for the given task based on the performance. A system for scheduling tasks in a distributed computing network is also provided which includes a task scheduler; and a network scheduler, wherein the task scheduler is configured to schedule the tasks in the distributed computing network based on both i) the state and ii) the scheduling policy of the distributed computing 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: A method for aliasing of named data objects (in named data networks) and entities for named data networks (e.g., named graphs for named data networks). In various examples, aliasing of named data objects may be implemented in one or more named data networks in the form of systems, methods and/or algorithms. In other examples, named graphs may be implemented in one or more named data networks in the form of systems, methods and/or algorithms.

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: Embodiments include computer-implemented method, systems and computer program products for route planning utilizing a Global Positioning System (GPS) device to determine an accessible route of a person travelling in a vehicle. The computer-implemented method includes generating, by at least one processor of the GPS device utilizing a map database, a route and retrieving a vehicle profile identifying operable conditions of the vehicle. Information from a route condition database relating to conditions along the route is retrieved and it is determined based upon the conditions along the route and the operable conditions of the vehicle if the route is an authorized, passable route for the vehicle. In response to determining if the route is an authorized, passable route for the vehicle, the route is presented on a display screen.

Abstract: Various embodiments manage service issues in a wireless communication network. In one embodiment, a plurality of call detail records associated with a wireless communication network is received. The plurality of call detail records is analyzed. At least one pattern from the plurality of call detail records is identified based on analyzing the plurality of call detail records. The at least one pattern indicates at least one service issue occurred during a set of calls associated with each of the plurality of call detail records. A location associated with the at least one service issue that has occurred is identified based on identifying the at least one pattern.