Dynamic machine-to-machine communications and scheduling
First Claim
1. A method comprising:
- obtaining, by a device, traffic loading and resource utilization information associated with a network for a network time domain;
obtaining, by the device, machine-to-machine resource requirements for machine-to-machine tasks using the network;
receiving, by the device, a target resource utilization value indicative of a network resource limit for the network time domain;
calculating, by the device, a probability for assigning each machine-to-machine task to the network time domain, wherein the probability is based on a difference between the target resource utilization value and the traffic loading and resource utilization associated with the network;
calculating, by the device, a uniformly-distributed probability density function based on an independent and identically distributed random variable;
generating, by the device, a schedule of execution of the machine-to-machine tasks with respect to the network time domain based on the probabilities associated with the machine-to-machine tasks and the uniformly-distributed probability density function; and
providing, by the device to other devices, the schedule of execution of the machine-to-machine tasks.
1 Assignment
0 Petitions
Accused Products
Abstract
A method may include obtaining traffic loading and resource utilization information associated with a network for the network time domain; obtaining machine-to-machine resource requirements for machine-to-machine tasks using the network; receiving a target resource utilization value indicative of a network resource limit for the network time domain; calculating a probability for assigning each machine-to-machine task to the network time domain, wherein the probability is based on a difference between the target resource utilization value and the traffic loading and resource utilization associated with the network; calculating a probability density function based on an independent and identically distributed random variable; generating a schedule of execution of the machine-to-machine tasks within the network time domain based on the probabilities associated with the machine-to-machine tasks and the probability density function; and providing the schedule of execution of the machine-to-machine tasks.
-
Citations
20 Claims
-
1. A method comprising:
-
obtaining, by a device, traffic loading and resource utilization information associated with a network for a network time domain; obtaining, by the device, machine-to-machine resource requirements for machine-to-machine tasks using the network; receiving, by the device, a target resource utilization value indicative of a network resource limit for the network time domain; calculating, by the device, a probability for assigning each machine-to-machine task to the network time domain, wherein the probability is based on a difference between the target resource utilization value and the traffic loading and resource utilization associated with the network; calculating, by the device, a uniformly-distributed probability density function based on an independent and identically distributed random variable; generating, by the device, a schedule of execution of the machine-to-machine tasks with respect to the network time domain based on the probabilities associated with the machine-to-machine tasks and the uniformly-distributed probability density function; and providing, by the device to other devices, the schedule of execution of the machine-to-machine tasks. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A device comprising:
-
a communication interface; a memory to store instructions; and a processor to execute the instructions to; obtain traffic loading and resource utilization information associated with a network for a network time domain; obtain machine-to-machine resource requirements for machine-to-machine tasks using the network; receive a target resource utilization value indicative of a network resource limit for the network time domain; calculate a probability for assigning each machine-to-machine task to the network time domain, wherein the probability is based on a difference between the target resource utilization value and the traffic loading and resource utilization associated with the network; calculate a probability density function based on an independent and identically distributed random variable; generate a schedule of execution of the machine-to-machine tasks within a time period of the network time domain based on the probabilities associated with the machine-to-machine tasks and the probability density function; and provide, via the communication interface, the schedule of execution of the machine-to-machine tasks to one or more other devices. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory computer-readable medium storing instructions executable by at least one processor, the non-transitory computer-readable medium storing instructions to:
-
obtain traffic loading and resource utilization information associated with a network for a network time domain; obtain machine-to-machine resource requirements for machine-to-machine tasks using the network; receive a target resource utilization value indicative of a network resource limit for the network time domain; calculate a probability for assigning each machine-to-machine task to the network time domain, wherein the probability is based on a difference between the target resource utilization value and the traffic loading and resource utilization associated with the network; calculate a probability density function; generate a schedule of execution of the machine-to-machine tasks within the network time domain based on the probabilities associated with the machine-to-machine tasks and the probability density function; and provide the schedule of execution of the machine-to-machine tasks to one or more devices. - View Dependent Claims (18, 19, 20)
-
Specification