CA2384769C - System and method for persistence-vector-based rate assignment - Google Patents
System and method for persistence-vector-based rate assignment Download PDFInfo
- Publication number
- CA2384769C CA2384769C CA2384769A CA2384769A CA2384769C CA 2384769 C CA2384769 C CA 2384769C CA 2384769 A CA2384769 A CA 2384769A CA 2384769 A CA2384769 A CA 2384769A CA 2384769 C CA2384769 C CA 2384769C
- Authority
- CA
- Canada
- Prior art keywords
- user equipment
- vector
- usage
- usage rate
- rate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
Abstract
In a system including a resource (100) which is shared among a number of users, it is difficult to distribute the available capacity of the resources fairly among the users and still maximize resource utilization. Additionally, it is desirable to allow at least some of the control over usage rates to remain with the users, while at the same time avoiding situations where the resource is overloaded. A system and method are disclosed wherein usage rates are selected from among a set of available rates according to a set of persistence vectors.
Description
,74769-517 SYSTEM AND METHOD FOR PERSISTENCE-VECTOR-BASED
RATE ASSIGNMENT
BACKGROUND OF THE INVENTION
1. Field of the Invention This invention relates to allocation of a limited resource among multiple users. More specifically, this invention relates to the assignment of usage rates based on a set of persistence vectors.
II. Description of Related Art and General Background A shared resource is one which may be used by multiple users. Shared resources which have limited availabilities or capacities include such diverse examples as electric power stations and other energy plants, water sources such as reservoirs and flowing bodies, supply systems for the distribution of goods and/or material, and data communications networks and pathways. Problems associated with allocating the use of a shared resource among multiple users may therefore arise in many different contexts. Regardless of the particular context, however, such resources may be found in many systems in which at least the following conditions hold:
= the capacity or availability of the shared resource may be expressed in terms of a finite rate R of units per measure of time (e.g.
kilowatts/hour, gallons/minute, cartons/week, or bits/second);
= at any particular time, the resource is being used by n different users, where n is a non-negative integer; and = at any particular time, the usage of the i-th user (where 1 S i-< n) may be characterized by a finite usage rate ui of units per measure of time.
A basic model for such a system is shown in FIG. 1, where resource 100 is used by users 120a-d at rates 110a-d, respectively. Depending on the particular implementation, the rate R which characterizes the shared resource may indicate an actual or estimated limit of the capacity of the resource (e.g. in the case of a communications pathway) or, in the altemative, the rate R may be a threshold indicating a maximum safe or permissible load of the resource (e.g.
in the case of a power generation facility or device). Likewise, the usage rates u, may indicate actual use, expected use, or requests or demands for use.
An overload condition arises when the sum of the n usage rates u; at any one time exceeds the value R. With respect to a power plant, for example, an overload condition mav arise when the total current draw exceeds the rated capacity. With respect to a data communications pathway, an overload condition may arise when the total data transfer rate exceeds the pathway's actual capacity, thereby corrupting the data in transmission. In certain situations such as water supply or warehousing of materials, an overload condition may also indicate that although user demands are currently being met, reserve or buffer capacity is being depleted.
Depending on the nature of the resource, the consequences of an overload condition will vary, possibly including the need for an offline period for resource recovery (e.g. cooling of a power generation system or replenishment of a reservoir) or the need to expend present capacity in order to repeat a use that was attempted in the past but failed because of the overload (e.g. retransmission of a data packet corrupted by a collision). The resource may even become temporarily or permanently unable to regain its former capacity. In cases where the sum of the n usage rates ui may exceed the value R, it is desirable to control the usage rates in some fashion so as to avoid overload conditions.
SUMMARY OF THE INVENTION
According to one aspect of the present invention, there is provided a system comprising: a resource having a capacity measure, and a plurality of user equipment, each having a usage rate, a set of persistence vectors, and a set of available rates, wherein each persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used, wherein a use of the resource by each among the plurality of user equipment is determined at least in part by the usage rate of the user equipment, and wherein the usage rate of 2a each among the plurality of user equipment is selected from at least the user equipment's set of available rates, said selection being determined at least in part by one among the set of persistence vectors.
According to another aspect of the present invention, there is provided a method of operating user equipment, comprising: using a shared resource at a rate determined at least in part by a first usage rate; obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
According to still another aspect of the present invention, there is provided a data storage medium, said medium bearing machine-readable code, such code being instructions executable by an array of logic elements, said instructions defining a method comprising: using a shared resource at a rate determined at least in part by a first usage rate; obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
According to yet another aspect of the present invention, there is provided a method of operating user equipment, comprising: assigning a first vector to a first 2b user equipment of a resource shared by multiple user equipment, the first vector containing one or more vector elements, each vector element of the first vector indicating a probability that a corresponding usage rate will be used;
and determining a first usage rate for the first user equipment for a first period, based at least in part, on the first vector.
According to a further aspect of the present invention, there is provided a system comprising: a resource having a finite capacity; multiple user equipment including a first user equipment to share the resource; and a set of vectors each of which contains one or more elements, each element representing a probability that a corresponding usage rate will be used, wherein the first user equipment's usage of the resource during a first interval is determined at least in part based on a vector of said set of vectors assigned to the first user equipment.
According to yet a further aspect of the present invention, there is provided an apparatus to transmit data wirelessly using a shared resource, comprising: a transmitter; a processing unit operably connected to said transmitter; a storage medium operably connected to said processing unit; at least one vector stored on said storage medium; wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; wherein said storage medium comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station;
and wherein an actual said usage rate of the shared resource 2c is selected based on at least one element of at least one vector.
According to still a further aspect of the present invention, there is provided a means to transmit data wirelessly using a shared resource, comprising: a transmitting means; a processing means operably connected to said transmitting means; a storage means operably connected to said processing means; at least one vector stored on said storage means; wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; wherein said storage means comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station;
and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
According to another aspect of the present invention, there is provided a control unit to receive information wirelessly, comprising: a processing unit operably connected to said transmitter; a storage medium operably connected to said processing unit; wherein said storage medium comprises instructions to receive information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; send at least one command to at least one of said 2d user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
According to yet another aspect of the present invention, there is provided a method to receive information wirelessly, comprising: receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and selecting an actual said usage rate of a shared resource based on said set of vector elements.
According to another aspect of the present invention, there is provided a computer program product, comprising: computer-readable medium comprising: code for causing a computer to perform a method to receive information wirelessly in accordance with the above aspect.
According to yet another aspect of the present invention, there is provided a means for receiving information wirelessly, comprising: means for receiving information on usage of a resource by a plurality of user i 1 2e equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and'at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; means for sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and means for selecting an actual said usage rate of the shared resource based on said set of vector elements.
In a system or method according to an embodiment of the invention, a resource is shared among a set of users.
Each user has a usage rate selected from a set of available rates, and each user's use of the resource is determined at least in part by the user's usage rate. Each user also has a set of persistence vectors, each vector element corresponding to a rate among the set of available rates.
Selection of a user's usage rate from the set of available rates is based at least in part on one among the set of persistence vectors.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is an illustration of a system including a resource shared among several users.
FIG. 1A is an illustration of a system according to a first embodiment of the invention.
FIG. 2 shows a flowchart of a method according to a second embodiment of the invention.
2f FIG. 2A shows a flowchart of an alternative embodiment of a method according to a second embodiment of the invention.
FIG. 2B shows a flowchart of another alternative embodiment of a method according to a second embodiment of the invention.
., 74769-517 FIG. 3 shows a flowchart of a method according to a third embodiment of the invention.
FIG. 4 is an illustration of a system including a resource shared among several users and a control unit coupled to the resource and the users.
FIG. 4A is an illustration of a system according to a fourth embodiment of the invention.
FIG. 4B illustrates a wireless network for data communications as one implementation of the system of FIG. 4A.
DETAILED DESCRIPTION OF THE INVENTION
One way to avoid overload conditions while maximizing resource, use is to divide the estimated capacity of the resource into a number of fixed rate allocations, assigning these allocations as the n usage rates u;. In a system where users have changing usage requirements, however, this approach may lead to suboptiznal utilization of the shared resource.
For example, assume in FIG. 1 that resource 100 is a water supply having a capacity of 1200 gallons/minute, and that a permitted usage rate from among a predetermined set of available rates is assigned to each user (where the set of available rates is represented as an m-element vector Y={Yo, Yõ . . . , Y.-,}). In this example, users 120a-d may each use the resource at a rate of Yo = 300, Y, = 600, Y2 = 900, or Y3 = 1200 gallons/minute (i.e. m = 4). If a fair distribution is implemented wherein all of the users are assigned the same fixed rate, then each of the four users 120a-d may be permitted to use the resource at rate Y.
(300 gallons/minute). Such an assignment effectively avoids overloading the resource. However, if fewer than all of the users 120a-d are likely to be using resource 100 at any given time, this approach is also wasteful of resource capacity.
Now consider the case where resource 100 has the same capacity of 1200 gallons/minute and the set of available rates is as above, but where the probability that each user will be using resource 100 at any given time is only 1/4 (we assume that each user's use is uncorrelated with that of each of the other users). In this situation, a more optimal utilization of resource 100 might be obtained by permitting each user to use the resource at rate Y3 (1200 gallons/minute), as only one of the four users is likely to be using the resource at any given time. Of course, use by more than one user at a time may now result in an overload condition.
In a related example, the probability that any of the four users 120a-d will be using resource 100 is %z. In a first scheme under this example, each user ',74769-517 may be permitted to use the resource at rate Y, (600 gallons/minute).
Alternatively, in a second scheme, each user may be permitted to use the resource at a rate of either Yo or Y2 (300 or 900 gallons/minute, respectively) where the probability of being permitted to use each rate is %Z. At any given moment, either such scheme would be expected to maximize resource utilization without resulting in an overload condition. Under the first scheme, however, an overload condition may occur if three users should happen to use the resource at the same time (as the total permitted usage would be 1800 gallons/minute). In a system using the second scheme, it is possible (though unlikely) for three users to use the resource without creating the potential for an overload condition (as the total permitted usage could be as low as 900 gallons/minute).
In a further alternative of this example, the set of available rates is altered or expanded such that each user is permitted to use the resource at a rate of either 200 or 800 gallons/minute, where the probability of using each rate is again %2. At any given moment, the sum of the permitted usage rates of the users 120a-d would be expected to be 1000 gallons/minute (i.e. two users, one having a permitted usage rate of 200 gallons/minute, and the other having a permitted usage rate of 800 gallons/minute), leaving 200 gallons/minute of the capacity of resource 100 unused. Under this scheme, even if three users happen to use the resource at one time, the potential for an overload condition would be expected to arise in only half of such cases (i.e. it is equally likely for the total permitted usage to be 600 or 2400 gallons/minute, and it is also equally likely for the total permitted usage to be 1200 or 1800 gallons/minute).
In an extension of such a scheme to a given application, system values such as the number of users of a resource, the probability of use by each user, and the usage requirements of each user may be either observed or estimated.
These values may then be combined with design parameters such as a number of available usage rates for each user, an acceptable rate of occurrence of overload conditions, and a minimum acceptable average rate of resource utilization to obtain a probabilistic model for system control whereby resource utilization is maximized, and the occurrence of overload conditions is minimized or eliminated.
In a system according to a first embodiment of the invention, as shown in FIG. 1A, each user 120i has a set of persistence vectors 130i and a permitted usage rate 110i taken from a set of available rates. (Note that it is possible for the system to include other users who lack a set of persistence vectors.) The length of each vector in set 130i.may be any integer greater than zero, and each vector element represents a probability of using a particular usage rate or of changing from one usage rate to another. In this embodiment, each vector in set 130i corresponds to at least one member of the set of available rates, although in other embodiments the vectors may correspond to members of a different set 5 instead (e.g. a set of predetermined usage profiles). Set 130i may be unique to each user, or the same set may be assigned to all users in a particular class, or the same set may be assigned to all of the users in the system. Likewise, set 130i may be a permanent aspect of the operation of the user, or it may be updated periodically or otherwise. Other relevant aspects of persistence vector structure, distribution, and use are discussed in the U.S. Patent No.
RATE ASSIGNMENT
BACKGROUND OF THE INVENTION
1. Field of the Invention This invention relates to allocation of a limited resource among multiple users. More specifically, this invention relates to the assignment of usage rates based on a set of persistence vectors.
II. Description of Related Art and General Background A shared resource is one which may be used by multiple users. Shared resources which have limited availabilities or capacities include such diverse examples as electric power stations and other energy plants, water sources such as reservoirs and flowing bodies, supply systems for the distribution of goods and/or material, and data communications networks and pathways. Problems associated with allocating the use of a shared resource among multiple users may therefore arise in many different contexts. Regardless of the particular context, however, such resources may be found in many systems in which at least the following conditions hold:
= the capacity or availability of the shared resource may be expressed in terms of a finite rate R of units per measure of time (e.g.
kilowatts/hour, gallons/minute, cartons/week, or bits/second);
= at any particular time, the resource is being used by n different users, where n is a non-negative integer; and = at any particular time, the usage of the i-th user (where 1 S i-< n) may be characterized by a finite usage rate ui of units per measure of time.
A basic model for such a system is shown in FIG. 1, where resource 100 is used by users 120a-d at rates 110a-d, respectively. Depending on the particular implementation, the rate R which characterizes the shared resource may indicate an actual or estimated limit of the capacity of the resource (e.g. in the case of a communications pathway) or, in the altemative, the rate R may be a threshold indicating a maximum safe or permissible load of the resource (e.g.
in the case of a power generation facility or device). Likewise, the usage rates u, may indicate actual use, expected use, or requests or demands for use.
An overload condition arises when the sum of the n usage rates u; at any one time exceeds the value R. With respect to a power plant, for example, an overload condition mav arise when the total current draw exceeds the rated capacity. With respect to a data communications pathway, an overload condition may arise when the total data transfer rate exceeds the pathway's actual capacity, thereby corrupting the data in transmission. In certain situations such as water supply or warehousing of materials, an overload condition may also indicate that although user demands are currently being met, reserve or buffer capacity is being depleted.
Depending on the nature of the resource, the consequences of an overload condition will vary, possibly including the need for an offline period for resource recovery (e.g. cooling of a power generation system or replenishment of a reservoir) or the need to expend present capacity in order to repeat a use that was attempted in the past but failed because of the overload (e.g. retransmission of a data packet corrupted by a collision). The resource may even become temporarily or permanently unable to regain its former capacity. In cases where the sum of the n usage rates ui may exceed the value R, it is desirable to control the usage rates in some fashion so as to avoid overload conditions.
SUMMARY OF THE INVENTION
According to one aspect of the present invention, there is provided a system comprising: a resource having a capacity measure, and a plurality of user equipment, each having a usage rate, a set of persistence vectors, and a set of available rates, wherein each persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used, wherein a use of the resource by each among the plurality of user equipment is determined at least in part by the usage rate of the user equipment, and wherein the usage rate of 2a each among the plurality of user equipment is selected from at least the user equipment's set of available rates, said selection being determined at least in part by one among the set of persistence vectors.
According to another aspect of the present invention, there is provided a method of operating user equipment, comprising: using a shared resource at a rate determined at least in part by a first usage rate; obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
According to still another aspect of the present invention, there is provided a data storage medium, said medium bearing machine-readable code, such code being instructions executable by an array of logic elements, said instructions defining a method comprising: using a shared resource at a rate determined at least in part by a first usage rate; obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
According to yet another aspect of the present invention, there is provided a method of operating user equipment, comprising: assigning a first vector to a first 2b user equipment of a resource shared by multiple user equipment, the first vector containing one or more vector elements, each vector element of the first vector indicating a probability that a corresponding usage rate will be used;
and determining a first usage rate for the first user equipment for a first period, based at least in part, on the first vector.
According to a further aspect of the present invention, there is provided a system comprising: a resource having a finite capacity; multiple user equipment including a first user equipment to share the resource; and a set of vectors each of which contains one or more elements, each element representing a probability that a corresponding usage rate will be used, wherein the first user equipment's usage of the resource during a first interval is determined at least in part based on a vector of said set of vectors assigned to the first user equipment.
According to yet a further aspect of the present invention, there is provided an apparatus to transmit data wirelessly using a shared resource, comprising: a transmitter; a processing unit operably connected to said transmitter; a storage medium operably connected to said processing unit; at least one vector stored on said storage medium; wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; wherein said storage medium comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station;
and wherein an actual said usage rate of the shared resource 2c is selected based on at least one element of at least one vector.
According to still a further aspect of the present invention, there is provided a means to transmit data wirelessly using a shared resource, comprising: a transmitting means; a processing means operably connected to said transmitting means; a storage means operably connected to said processing means; at least one vector stored on said storage means; wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; wherein said storage means comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station;
and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
According to another aspect of the present invention, there is provided a control unit to receive information wirelessly, comprising: a processing unit operably connected to said transmitter; a storage medium operably connected to said processing unit; wherein said storage medium comprises instructions to receive information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; send at least one command to at least one of said 2d user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
According to yet another aspect of the present invention, there is provided a method to receive information wirelessly, comprising: receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and selecting an actual said usage rate of a shared resource based on said set of vector elements.
According to another aspect of the present invention, there is provided a computer program product, comprising: computer-readable medium comprising: code for causing a computer to perform a method to receive information wirelessly in accordance with the above aspect.
According to yet another aspect of the present invention, there is provided a means for receiving information wirelessly, comprising: means for receiving information on usage of a resource by a plurality of user i 1 2e equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and'at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used; and wherein said information is a request; means for sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and means for selecting an actual said usage rate of the shared resource based on said set of vector elements.
In a system or method according to an embodiment of the invention, a resource is shared among a set of users.
Each user has a usage rate selected from a set of available rates, and each user's use of the resource is determined at least in part by the user's usage rate. Each user also has a set of persistence vectors, each vector element corresponding to a rate among the set of available rates.
Selection of a user's usage rate from the set of available rates is based at least in part on one among the set of persistence vectors.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is an illustration of a system including a resource shared among several users.
FIG. 1A is an illustration of a system according to a first embodiment of the invention.
FIG. 2 shows a flowchart of a method according to a second embodiment of the invention.
2f FIG. 2A shows a flowchart of an alternative embodiment of a method according to a second embodiment of the invention.
FIG. 2B shows a flowchart of another alternative embodiment of a method according to a second embodiment of the invention.
., 74769-517 FIG. 3 shows a flowchart of a method according to a third embodiment of the invention.
FIG. 4 is an illustration of a system including a resource shared among several users and a control unit coupled to the resource and the users.
FIG. 4A is an illustration of a system according to a fourth embodiment of the invention.
FIG. 4B illustrates a wireless network for data communications as one implementation of the system of FIG. 4A.
DETAILED DESCRIPTION OF THE INVENTION
One way to avoid overload conditions while maximizing resource, use is to divide the estimated capacity of the resource into a number of fixed rate allocations, assigning these allocations as the n usage rates u;. In a system where users have changing usage requirements, however, this approach may lead to suboptiznal utilization of the shared resource.
For example, assume in FIG. 1 that resource 100 is a water supply having a capacity of 1200 gallons/minute, and that a permitted usage rate from among a predetermined set of available rates is assigned to each user (where the set of available rates is represented as an m-element vector Y={Yo, Yõ . . . , Y.-,}). In this example, users 120a-d may each use the resource at a rate of Yo = 300, Y, = 600, Y2 = 900, or Y3 = 1200 gallons/minute (i.e. m = 4). If a fair distribution is implemented wherein all of the users are assigned the same fixed rate, then each of the four users 120a-d may be permitted to use the resource at rate Y.
(300 gallons/minute). Such an assignment effectively avoids overloading the resource. However, if fewer than all of the users 120a-d are likely to be using resource 100 at any given time, this approach is also wasteful of resource capacity.
Now consider the case where resource 100 has the same capacity of 1200 gallons/minute and the set of available rates is as above, but where the probability that each user will be using resource 100 at any given time is only 1/4 (we assume that each user's use is uncorrelated with that of each of the other users). In this situation, a more optimal utilization of resource 100 might be obtained by permitting each user to use the resource at rate Y3 (1200 gallons/minute), as only one of the four users is likely to be using the resource at any given time. Of course, use by more than one user at a time may now result in an overload condition.
In a related example, the probability that any of the four users 120a-d will be using resource 100 is %z. In a first scheme under this example, each user ',74769-517 may be permitted to use the resource at rate Y, (600 gallons/minute).
Alternatively, in a second scheme, each user may be permitted to use the resource at a rate of either Yo or Y2 (300 or 900 gallons/minute, respectively) where the probability of being permitted to use each rate is %Z. At any given moment, either such scheme would be expected to maximize resource utilization without resulting in an overload condition. Under the first scheme, however, an overload condition may occur if three users should happen to use the resource at the same time (as the total permitted usage would be 1800 gallons/minute). In a system using the second scheme, it is possible (though unlikely) for three users to use the resource without creating the potential for an overload condition (as the total permitted usage could be as low as 900 gallons/minute).
In a further alternative of this example, the set of available rates is altered or expanded such that each user is permitted to use the resource at a rate of either 200 or 800 gallons/minute, where the probability of using each rate is again %2. At any given moment, the sum of the permitted usage rates of the users 120a-d would be expected to be 1000 gallons/minute (i.e. two users, one having a permitted usage rate of 200 gallons/minute, and the other having a permitted usage rate of 800 gallons/minute), leaving 200 gallons/minute of the capacity of resource 100 unused. Under this scheme, even if three users happen to use the resource at one time, the potential for an overload condition would be expected to arise in only half of such cases (i.e. it is equally likely for the total permitted usage to be 600 or 2400 gallons/minute, and it is also equally likely for the total permitted usage to be 1200 or 1800 gallons/minute).
In an extension of such a scheme to a given application, system values such as the number of users of a resource, the probability of use by each user, and the usage requirements of each user may be either observed or estimated.
These values may then be combined with design parameters such as a number of available usage rates for each user, an acceptable rate of occurrence of overload conditions, and a minimum acceptable average rate of resource utilization to obtain a probabilistic model for system control whereby resource utilization is maximized, and the occurrence of overload conditions is minimized or eliminated.
In a system according to a first embodiment of the invention, as shown in FIG. 1A, each user 120i has a set of persistence vectors 130i and a permitted usage rate 110i taken from a set of available rates. (Note that it is possible for the system to include other users who lack a set of persistence vectors.) The length of each vector in set 130i.may be any integer greater than zero, and each vector element represents a probability of using a particular usage rate or of changing from one usage rate to another. In this embodiment, each vector in set 130i corresponds to at least one member of the set of available rates, although in other embodiments the vectors may correspond to members of a different set 5 instead (e.g. a set of predetermined usage profiles). Set 130i may be unique to each user, or the same set may be assigned to all users in a particular class, or the same set may be assigned to all of the users in the system. Likewise, set 130i may be a permanent aspect of the operation of the user, or it may be updated periodically or otherwise. Other relevant aspects of persistence vector structure, distribution, and use are discussed in the U.S. Patent No.
6,665,272 entitled "SYSTEM AND'METHOD FOR PERSISTENCE-VECTOR-BASED MODIFICATION
OF USAGE RATES", issued to Pankaj et al.
In an Example 1, applied to one of the situations above, each user has the same sef of persistence vectors, which set comprises a vector P=(Põ P2, P3) and wherein the elements Põ P2, and P3 correspond to the rates Y, (600 gallons/minute), Y2 (900 gallons/minute), and Y3 (1200 gallons/minute), respectively. Each element of P indicates a probability that the corresponding rate will be used, and any remaining probability indicates a probability that the lowest rate Yo (300 gallons/minute) will be used. The values of the elements of P may be chosen, for example, to maximize the average collective use of the resource without creating an unsuitably high risk of occurrence of an overload condition.
In this example, the element P2 is set to indicate a probability of %Z, and the other two elements of P are each set to indicate a probability of zero.
Before each use (i.e. for uses that are discontinuous and discrete) and/or periodically during use (i.e. for uses that are continuing over time), each user chooses a permitted usage rate based on the probabilities indicated by the elements of P.
For the values of P indicated in this case, the user will choose rate Y2 (900 gallons/minute) 50% of the time and rate Ya (300 gallons/minute) the remainder of the time. Because the probability that each user will use the resource at any given time is determined to be %4 for this example, on average it may be expected that the fu111200-gallons/ninute capacity of the resource will be utilized and that overload conditions will be avoided. Additionally, the distribution among users is fair in this example because on average all of the permitted usage rates will be equal.
. ,74769-517 In an Example 2, resource 100 is the reverse link of a CDMA
telecommunications system. In this case, each user 120 may comprise: 1) a transmitter, such as a mobile telephone or a WLL (wireless local loop) station, connected to 2) a data-producing device, such as a laptop computer or a point-of-sale terminal, through a PCMCIA card or a similar interface, and outputting data encapsulated in packets over IP or any other suitable protocol. Several generations and versions of CDMA telecommunications systems have already been irnplemented. While most of these CDMA systems have been designed to carry digitized voice communications, however, the system and method herein described are especially well-suited to a network serving users with widely varying transmission rates, such as a data-only network or a mixed voice-data network.
In one particular implementation of Example 2, each user has the same fixed set of available rates, wherein each rate is expressed in kilobits per second (Kb/s) and the set of rates is designed to increment in powers of two. Because a doubling in rate requires a doubling in power to maintain the same ratio of energy per bit to noise power spectral density (Eb/N(,), each rate step thus corresponds to a power step of 3 dB. The available rate values in this example include 4.8, 9.6,19.2, 38.4, 76.8,153.6, and 307.2 kilobits/second (Kb/s).
Although the elements in the set of available rates in Example 1 are related to each other in a linear fashion, and the elements of the set in Example 2 are related in an exponential fashion, no such relation or progression is necessary in a system or method according to an embodiment of the invention.
Likewise, it is not necessary for each user to have the same predetermined set of available rates.
Note that selection of a rate based upon the persistence vector set may indicate permission rather than a requirement to use that rate. The actual rate used may depend upon other factors as well, such as a user's current need and/or ability to use the resource. Likewise, the actual usage rate may or may not be a member of the set of available rates that is used to indicate permission.
If use of the resource is discontinuous (e.g. packet data transmission over a common channel), the set of persistence vectors may be referenced before each use. If resource use is continuous (e.g. transfer of electrical power) or prolonged, then the set of persistence vectors may be referenced and the permitted usage rate adjusted as necessary at predetermined intervals during use or upon the occurrence of some predetermined event or events.
In a more general implementation, each persistence vector in set 130i corresponds to a member of the set of available rates. Note that the set 130i may also be considered as a transition probability matrix wherein, for example, each column comprises one of the persistence vectors and each row corresponds to one among the set of available rates. The particular persistence vector to be referenced at any point may depend, for example, upon the current or most recent actual or permitted usage rate, such that a user's future use may be constrained to some degree by its past usage history.
In a system or method according to the first embodiment, it is also possible for a user to have more than one persistence vector corresponding to each member of the set of available rates, each vector describing a different behavior. For example, one persistence vector may tend to indicate a higher average rate, or a more even distribution of probabilities among the various available rates, than another. In such a situation, the user may choose between its available persistence vectors according to such criteria as:
= time (e.g. time of day, time of year, etc.) as an indicator of such factors as expected system load or behavior or resource capacity;
= anticipated need by the user ;
= quality of service in recent use: for example, how well-conditioned is the supply of electrical power, or how free of impurities is the supply of water.
A reduction in the quality of service may cause a user to change its persistence vector in order to relieve system load ;
= reduction of service in recent use: in a system that may withstand overload conditions without incurring lasting damage, for example, a user may conclude that an overload has occurred when a usage rate is not met or a level of service is otherwise reduced. Such reduction or denial of service may also cause a user to adopt a different persistence vector in an attempt to repair the overload condition.
FIG. 2 illustrates a method according to a second embodiment of the invention. In this method, a user has a set of persistence vectors including an (m-1)-element vector V, wherein V={V, such that 1 S j<_ m-11. (As noted above, the vector V may be chosen from among others in a set of persistence vectors according to the most recent usage rate for this user or some other criteria.) Each element Vi of vector V is a persistence value representing a probability which has a value from 0 to 1 and which corresponds to the rate Y, (where a < b implies Ya < Yb). For example, vector V may (but is not required to) have the form of a probability density function, wherein the sum of its elements (or of the values represented by its elements) is one. In block 210, a counter j is initialized to cause processing to begin at the persistence value V,n_l, which corresponds to the highest permitted usage rate (Y,,).
OF USAGE RATES", issued to Pankaj et al.
In an Example 1, applied to one of the situations above, each user has the same sef of persistence vectors, which set comprises a vector P=(Põ P2, P3) and wherein the elements Põ P2, and P3 correspond to the rates Y, (600 gallons/minute), Y2 (900 gallons/minute), and Y3 (1200 gallons/minute), respectively. Each element of P indicates a probability that the corresponding rate will be used, and any remaining probability indicates a probability that the lowest rate Yo (300 gallons/minute) will be used. The values of the elements of P may be chosen, for example, to maximize the average collective use of the resource without creating an unsuitably high risk of occurrence of an overload condition.
In this example, the element P2 is set to indicate a probability of %Z, and the other two elements of P are each set to indicate a probability of zero.
Before each use (i.e. for uses that are discontinuous and discrete) and/or periodically during use (i.e. for uses that are continuing over time), each user chooses a permitted usage rate based on the probabilities indicated by the elements of P.
For the values of P indicated in this case, the user will choose rate Y2 (900 gallons/minute) 50% of the time and rate Ya (300 gallons/minute) the remainder of the time. Because the probability that each user will use the resource at any given time is determined to be %4 for this example, on average it may be expected that the fu111200-gallons/ninute capacity of the resource will be utilized and that overload conditions will be avoided. Additionally, the distribution among users is fair in this example because on average all of the permitted usage rates will be equal.
. ,74769-517 In an Example 2, resource 100 is the reverse link of a CDMA
telecommunications system. In this case, each user 120 may comprise: 1) a transmitter, such as a mobile telephone or a WLL (wireless local loop) station, connected to 2) a data-producing device, such as a laptop computer or a point-of-sale terminal, through a PCMCIA card or a similar interface, and outputting data encapsulated in packets over IP or any other suitable protocol. Several generations and versions of CDMA telecommunications systems have already been irnplemented. While most of these CDMA systems have been designed to carry digitized voice communications, however, the system and method herein described are especially well-suited to a network serving users with widely varying transmission rates, such as a data-only network or a mixed voice-data network.
In one particular implementation of Example 2, each user has the same fixed set of available rates, wherein each rate is expressed in kilobits per second (Kb/s) and the set of rates is designed to increment in powers of two. Because a doubling in rate requires a doubling in power to maintain the same ratio of energy per bit to noise power spectral density (Eb/N(,), each rate step thus corresponds to a power step of 3 dB. The available rate values in this example include 4.8, 9.6,19.2, 38.4, 76.8,153.6, and 307.2 kilobits/second (Kb/s).
Although the elements in the set of available rates in Example 1 are related to each other in a linear fashion, and the elements of the set in Example 2 are related in an exponential fashion, no such relation or progression is necessary in a system or method according to an embodiment of the invention.
Likewise, it is not necessary for each user to have the same predetermined set of available rates.
Note that selection of a rate based upon the persistence vector set may indicate permission rather than a requirement to use that rate. The actual rate used may depend upon other factors as well, such as a user's current need and/or ability to use the resource. Likewise, the actual usage rate may or may not be a member of the set of available rates that is used to indicate permission.
If use of the resource is discontinuous (e.g. packet data transmission over a common channel), the set of persistence vectors may be referenced before each use. If resource use is continuous (e.g. transfer of electrical power) or prolonged, then the set of persistence vectors may be referenced and the permitted usage rate adjusted as necessary at predetermined intervals during use or upon the occurrence of some predetermined event or events.
In a more general implementation, each persistence vector in set 130i corresponds to a member of the set of available rates. Note that the set 130i may also be considered as a transition probability matrix wherein, for example, each column comprises one of the persistence vectors and each row corresponds to one among the set of available rates. The particular persistence vector to be referenced at any point may depend, for example, upon the current or most recent actual or permitted usage rate, such that a user's future use may be constrained to some degree by its past usage history.
In a system or method according to the first embodiment, it is also possible for a user to have more than one persistence vector corresponding to each member of the set of available rates, each vector describing a different behavior. For example, one persistence vector may tend to indicate a higher average rate, or a more even distribution of probabilities among the various available rates, than another. In such a situation, the user may choose between its available persistence vectors according to such criteria as:
= time (e.g. time of day, time of year, etc.) as an indicator of such factors as expected system load or behavior or resource capacity;
= anticipated need by the user ;
= quality of service in recent use: for example, how well-conditioned is the supply of electrical power, or how free of impurities is the supply of water.
A reduction in the quality of service may cause a user to change its persistence vector in order to relieve system load ;
= reduction of service in recent use: in a system that may withstand overload conditions without incurring lasting damage, for example, a user may conclude that an overload has occurred when a usage rate is not met or a level of service is otherwise reduced. Such reduction or denial of service may also cause a user to adopt a different persistence vector in an attempt to repair the overload condition.
FIG. 2 illustrates a method according to a second embodiment of the invention. In this method, a user has a set of persistence vectors including an (m-1)-element vector V, wherein V={V, such that 1 S j<_ m-11. (As noted above, the vector V may be chosen from among others in a set of persistence vectors according to the most recent usage rate for this user or some other criteria.) Each element Vi of vector V is a persistence value representing a probability which has a value from 0 to 1 and which corresponds to the rate Y, (where a < b implies Ya < Yb). For example, vector V may (but is not required to) have the form of a probability density function, wherein the sum of its elements (or of the values represented by its elements) is one. In block 210, a counter j is initialized to cause processing to begin at the persistence value V,n_l, which corresponds to the highest permitted usage rate (Y,,).
In block 220, a random number x is generated. In an exemplary implementation, x represents a value drawn from a set having a uniform distribution over the range 0 to 1. In block 230, the value of x is tested against the persistence value V;. If x is less than V,, then the rate Y; is selected as the permitted usage rate u; in block 260. Otherwise, the value of j is decremented by one in block 250, and the persistence test is repeated. Ifj reaches the value 1 in block 240, then the lowest rate Yo is chosen by default in block 270. This method may be altered to allow the use of one among many other relations between the values of x and Vi in place of the test condition shown in block 230, depending on the particular characteristics of the values chosen for x and V,.
Note that in the method described above, a user is guaranteed to be permitted to use the resource at no less than the lowest rate. In another implementation of this method, the procedure of assigning a permitted usage rate may be permitted to fail (here, by extending P to include a value Po corresponding to rate Yo and allowing the value of j to reach zero in block 245).
The user may wait until some external event occurs to repeat the rate assignment procedure, or the user may retry the procedure after some predetermined interval. In an exemplary implementation as shown in FIG. 2A, upon failing to establish a permitted usage rate, the user generates a random number z (in block 280), which represents a value between 1 and a predetermined parameter Nbdff. In block 290, the user waits for z time periods to pass before retrying the rate selection procedure. In an implementation using the communications network of Example 2, for example, each time period may represent the duration of one time slot or some other unit of time relevant to the operation of the system.
FIG. 2B shows an implementation in which the actual usage rate may be restricted by other factors as well. For example, a transmitter as in Example may not have enough power to transmit at the rate indicated by the procedure of FIG. 2. Alternatively, the amount of data available for transmission by such a transmitter may not justify using the resource at the permitted usage rate. In such cases, the usage rate may be chosen in block 265 as min(Y;, YPoõ), where Yp,,. represents the highest usage rate possible or otherwise desirable given the user's current characteristics.
Described above are applications in which the length of a persistence vector is equal to either m (i.e. the number of members in the set of available rates) or m-1. Note that cases may also exist in which it is desirable to skip one or more of the available rates (e.g. because the rate is not available or is inapplicable to a particular user). In such cases, a persistence vector need not .74769-517 contain an element corresponding to such a rate or rates, and therefore, its length may have any nonzero value less than or equal to m. Also note that the procedures of FIGs. 2, 2A, and 2B may be modified as necessary to map each element of such a persistence vector to the corresponding element of rate vector Y. By the same token, the process of selecting a particular persistence vector from among a set of persistence vectors may include such a mapping task in cases where, for example, the set of persistence vectors has fewer members than the set of available rates.
In many applications, the set'of available rates may be arranged so that a < b implies Y,, < Y. (as in Examples 1 and 2 above). Likewise, the values of a persistence vector such as V described above may be chosen such that c < d implies that [V~] >[Vd] ([V,] - [Vd]), where [V;] indicates the probability represented by the value of V;. In such a case, the probability that a rate will be chosen increases (does not decrease) as the rates become smaller. However, note that no such relationamong the rates or the persistence values is required to employ a system or method according to an embodiment of the invention.
For example, a particular rate may be disfavored because it is harder to implement than another rate, or because it is less incompatible with a part of the system than another rate, or for some similar reason. In such a case, a persistence vector may be fashioned so that this rate is less likely to be chosen than one or more higher rates (e.g. c < d does not imply [Vj > [Vd] or [Vj - [Vd]).
Similarly, a persistence vector may be fashioned to favor one or more higher rates over lower rates.
Note that although the random number x as generated in block 220 is described as being drawn from a set having a uniform distribution, any other distribution may also be used in a system or method according to an embodiment of the invention. As the selection of a random or pseudorandom value may be computationally intensive, it may be desirable in certain applications to reduce the number of such values to be selected. FIG. 3 shows a method according to a third embodiment of the invention, in which only one random number x is generated (in initialization block 310). In this case, (in-1)-element persistence vector W represents a cumulative density function (CDF), each element Wj representing a probability that some rate Y,, will be assigned, where h is any integer such that 0:5 h<- j, Y,, is a valid assignment for this user, and 05 j- m-2. In the loop of blocks 330, 340, and 350, the maximum value of j is identified for which x > Wj. If the test in block 330 succeeds, rate Y,., may be chosen, or the usage rate may be chosen as min(Y;,, Yp,.,) as in block 365, where YP,. represents the highest usage rate possible given the user's current ,74769-517 characteristics. If the value of j reaches zero in block 340, then the rate Yo is chosen; otherwise, the value of j is decremented in block 350. Note that this method also may be modified to incorporate a wait-and-repeat scheme as in FIG. 2A. This method may be altered to allow the use of one among many other 5 relations between the values of x and W, in place of the test condition shown in block 330, depending on the particular characteristics of the values chosen for x and W,.
Even in a case where a persistence vector is not originally presented as a CDF, it is possible for the user to generate a CDF from such a vector, and 10 thereby reduce the number of random number generations for each rate assignment procedure to only one. First, a probability density function (PDF) vector F may be constructed from a persistence vector V as:
Fõ-, = [VR-, ];
,*I
F, =[v]rl (1-[V,]),iE {1,2,3....n-2};
Fo=rj (1-[V]) ,:n-I
Next, the PDF vector F is converted to a CDF vector Z by the following procedure or its equivalent:
~-1 Z, Fj.
A persistence vector is then constructed such that its elements represent the elements of Z. For example, a vector W suitable for use in the implementation of FIG. 3 described above may be constructed according to the relation W, =1-Z,, such that an element of W having a value of 1 represents a probability of zero, and an element of W having a value of 0 represents a probability of 1. Many other relations may be chosen to exist between the elements of a persistence vector and the probabilities which those elements represent, depending on the design of a particular implementation.
If and when an overload condition arises in a system according to FIG. 1 or FIG. 1A, the users 120 may not be aware that an overload has occurred, especially if the resource is consuming reserve capacity in order to meet user demands. Even in a case where the overload condition causes the resource's availability to a user to drop below a user's expectation or demand, the user may still be unable to verify whether the shortcoming is due to a resource overload or to the failure of another component in the supply path. Moreover, in certain applications such as wireless data communications, it is possible that no feedback mechanism exists whereby a user may obtain timely notification of an overload. Therefore, the user may continue to use the resource, unaware of the problem.
It is desirable in such a situation for the system to include a capability for notifying the users of the overload condition so that they may modify their uses (for example, by adopting a different persistence vector). Such feedback capability may also be useful in other, non-overload situations where it is desired to distribute information relating to the resource to one or more users (e.g. to indicate the availability of additional capacity or a reduction in resource capacity).
FIG. 4 shows an example of such a system with such capability, wherein control unit 460 receives information related to usage of resource 400 by users 420a-d (for example, current rate of use by one or more users, history of use by one or more users, reserve capacity available, predicted capacity, status of the resource, information relating to scheduled or unscheduled events that may affect resource capacity or status, etc.). Control unit 460 may issue commands based on this (and possibly other) information to users 420a-d over respective communications pathways 440a-d, such that these commands influence at least in part the respective permitted usage rates 410a-d of the users. Note that it is possible for control unit 460 to be implemented within the resource 400 or, alternatively, as a part of one or more of the users 420a-d.
If a user becomes aware of an overload condition, the possibility exists for user-driven remediation. If at least some of the users are able to communicate with each other, then a solution such as a reduction in usage rate may be negotiated between them. In many instances, however, such communication between users may be unavailable, impractical, or.undesirable, and it may be desirable for a centralized feedback mechanism such as control unit 460 not only to convey information relating to the resource but also to exert some degree of control over the permitted usage rates (for example, control unit 460 may issue commands that contain or relate to changes in one or more persistence vectors).
If complete knowledge of the future usage requirements of the users were available, then it would be theoretically possible to construct an optimal usage schedule that would satisfy the users' requirements as much as possible while completely avoiding all overload conditions. In many practical systems, however, a user's future needs will be unknown even to the user itself. One way to prevent overload conditions in such systems would be on the basis of current usage requirements: for example, by granting usage rate allocations to .74769-517 users only on a request basis. In order to convey the usage requests from the users back to the control unit, however, such a scheme would require an upstream communication pathway which might not otherwise be necessary.
Moreover, additional costs and delays would be incurred in receiving, processing and responding to such requests.
In order to avoid some of the disadvantages of a request/grant scheme, it is possible to issue rate allocations based on users' past usages. Suitable schemes of usage rate selection and assignment and rate allocation include those described in the U.S. Patent No. 6,665,272, entitled "SYSTEM AND
METHOD FOR PERSISTENCE-VECTOR-BASED MODIFICATION OF
USAGE RATES", and U.S. Patent No. 6,324,172, entitled "METHOD OF
RATE ALLOCATION IN A DATA COMMUNICATIONS NETWORK".
Such schemes enable the control unit to share control with the users, allowing the users to control the details of their own usage to some extent while the control unit concentrates on system-wide issues such as the prediction and avoidance of overload conditions.
FIG. 4A shows a system according to a fourth embodiment of the invention, wherein control unit 462 receives information related to usage of resource 400 by users 422a-d, and each user 422i has a set of persistence vectors 432i. In this example, the permitted usage rate 412i of each user 422i is influenced at least in part by commands received from control unit 462 over respective communications pathways 442a-d (for example, such commands may contain or relate to changes in one or more persistence vectors). Note that it is possible for control unit 462 to be implemented within the resource 400 or, alternatively, as a part of one or more of the users 422i. An exemplary application of a system according to FIG. 4A to a communications network such as the one described in Example 2 above is shown in FIG. 4B, wherein users 520a-d are data producers, each having a set of persistence vectors 530a-d;
resource 500 is a common transmission channel linking the producers with data consumer 550; and control unit 560 receives usage information from (and may be incorporated into) the consumer 550. Producers 520i use resource 500 by transmitting data to consumer 550 as allowed by permitted usage rates 510a-d, respectively, and they receive respective signals 540a-d from the control unit.
Consumer 550 and control unit 560 may be parts of a base station, and control signals 540 may be carried over a forward link of the communications channel.
Any of the methods described or suggested in FIGs. 2, 2A, or 2B or in the text above may be applied to a system according to the embodiments illustrated in FIGs. 4A and 4B. If the procedure is successful, the user uses the resource at a rate not greater than the selected rate. The rate assignment procedure may be repeated when, for example, a persistence vector is updated, some scheduled or unscheduled event occurs (expiration of a timer, triggering of an alarm event such as a low-power warning, etc.) or a predetermined time delay has elapsed.
At any particular time, a user's use of the resource conforms to a particular permitted usage rate among the user's set of available rates. It is not necessary for all users to have the same set of available rates, but the set for each user should be known to control unit 462 (560) so that it may reliably predict the state of resource use and issue control signals appropriately. It is also possible for each user's set of available rates to be updated or otherwise modified according to a command issued by control unit 462 (560) whether such a command is issued periodically or according to another scheme.
The set of persistence vectors may be a permanent aspect of the operation of the user, or it may be issued by control unit 462 (560), in which case one or more of its members may be updated periodically or otherwise.
Situations in which a new set of persistence vectors may be issued are not limited to overload conditions. For example, a persistence vector.set may be issued to a mobile unit at channel assignment and again upon handoff. Other situations that may cause the control unit to send a new or updated persistence vector set to one or more users include the following:
= A user first requests usage of the resource.
= The control unit wishes to reserve a portion of the resource's capacity.
= The control unit wishes to deny resource use to one or more users.
= The control unit wishes to maximize the number of users able to use the resource at one time.
= The control unit responds to a request from a user (or to requests from a number of users).
= The control unit responds to detected or communicated user characteristics (e.g. recent usage rate).
= In a wireless data communications network, the number of connections between the producer (mobile station) and the ground network (base stations) changes.
Persistence vector updates may also be used as a means to pass control over usage rates between the control unit and the users. For example, the control unit may prevent users from using the maximum usage rate (or any other rate) by setting the probability for that rate to zero and/or by modifying the persistence vector(s) corresponding to that rate. Alternatively, the control unit may cause one or more users to use only the lowest rate by setting the probabilities for all other rates to zero. Such action might occur in an emergency situation, for example, where it becomes desirable to support as many connections as possible or to reserve a portion of the capacity for priority use without terminating service to other users. On the other hand, the control unit may effectively transfer control over resource usage to the users by setting the probability for the maximum rate to one, thereby permitting each user to select its own permitted usage rate.
In a method according to a fifth embodiment of the invention, the occurrence of persistence vector assignments and updates is reduced by using correction vector sets. In a basic implementation, one set of persistence vectors is shared by all users, and a set of correction vectors is transmitted to a user or users for whom a different set of persistence vectors is desired. Each element of each correction vector corresponds to and modifies an element of a corresponding persistence vector, and the user applies a correction vector to the appropriate persistence vector by, for example, adding or multiplying the two vectors. The user then uses the resulting modified persistence vector or vectors to establish its permitted usage rate according to one of the methods described or suggested herein.
Implementation of correction vectors reduces control traffic while allowing a system to appropriately accommodate users having different usage behaviors or profiles (e.g. premium vs. economy, commercial vs. individual, scheduled or automatic use vs. use on demand, etc.). In a variation of the basic implementation described above, the set of correction vectors has fewer members than the set of persistence vectors, each such member corresponding to and modifying one among a predetermined subset of the set of persistence vectors. For example, correction vectors may be supplied only for those persistence vectors most likely to be referenced by the user. Alternatively or in addition to this variation, one or more among the set of correction vectors may have fewer elements than the corresponding persistence vector. Such variations, which reduce the volume of control traffic even further, may be used to concentrate control information by restricting the corrections to those persistence vectors (or elements thereof) which are likely to have the greatest effect on resource usage.
The foregoing description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention.
Various modifications to these embodiments are possible, and the generic principles presented herein may be applied to other embodiments. For example, the invention may be implemented in part or in whole as hard-wired circuits, as circuit configurations fabricated into application-specific integrated circuits, or as firmware programs loaded into non-volatile storage or software programs loaded from or into data storage media as machine-readable code, 5 such code being instructions executable by arrays of logic elements such as microprocessors or other digital signal processing units. Thus, the present invention is not intended to be limited to the embodiments shown above but rather is to be accorded the widest scope consistent with the principles and novel features disclosed in any fashion herein.
What is claimed is:
Note that in the method described above, a user is guaranteed to be permitted to use the resource at no less than the lowest rate. In another implementation of this method, the procedure of assigning a permitted usage rate may be permitted to fail (here, by extending P to include a value Po corresponding to rate Yo and allowing the value of j to reach zero in block 245).
The user may wait until some external event occurs to repeat the rate assignment procedure, or the user may retry the procedure after some predetermined interval. In an exemplary implementation as shown in FIG. 2A, upon failing to establish a permitted usage rate, the user generates a random number z (in block 280), which represents a value between 1 and a predetermined parameter Nbdff. In block 290, the user waits for z time periods to pass before retrying the rate selection procedure. In an implementation using the communications network of Example 2, for example, each time period may represent the duration of one time slot or some other unit of time relevant to the operation of the system.
FIG. 2B shows an implementation in which the actual usage rate may be restricted by other factors as well. For example, a transmitter as in Example may not have enough power to transmit at the rate indicated by the procedure of FIG. 2. Alternatively, the amount of data available for transmission by such a transmitter may not justify using the resource at the permitted usage rate. In such cases, the usage rate may be chosen in block 265 as min(Y;, YPoõ), where Yp,,. represents the highest usage rate possible or otherwise desirable given the user's current characteristics.
Described above are applications in which the length of a persistence vector is equal to either m (i.e. the number of members in the set of available rates) or m-1. Note that cases may also exist in which it is desirable to skip one or more of the available rates (e.g. because the rate is not available or is inapplicable to a particular user). In such cases, a persistence vector need not .74769-517 contain an element corresponding to such a rate or rates, and therefore, its length may have any nonzero value less than or equal to m. Also note that the procedures of FIGs. 2, 2A, and 2B may be modified as necessary to map each element of such a persistence vector to the corresponding element of rate vector Y. By the same token, the process of selecting a particular persistence vector from among a set of persistence vectors may include such a mapping task in cases where, for example, the set of persistence vectors has fewer members than the set of available rates.
In many applications, the set'of available rates may be arranged so that a < b implies Y,, < Y. (as in Examples 1 and 2 above). Likewise, the values of a persistence vector such as V described above may be chosen such that c < d implies that [V~] >[Vd] ([V,] - [Vd]), where [V;] indicates the probability represented by the value of V;. In such a case, the probability that a rate will be chosen increases (does not decrease) as the rates become smaller. However, note that no such relationamong the rates or the persistence values is required to employ a system or method according to an embodiment of the invention.
For example, a particular rate may be disfavored because it is harder to implement than another rate, or because it is less incompatible with a part of the system than another rate, or for some similar reason. In such a case, a persistence vector may be fashioned so that this rate is less likely to be chosen than one or more higher rates (e.g. c < d does not imply [Vj > [Vd] or [Vj - [Vd]).
Similarly, a persistence vector may be fashioned to favor one or more higher rates over lower rates.
Note that although the random number x as generated in block 220 is described as being drawn from a set having a uniform distribution, any other distribution may also be used in a system or method according to an embodiment of the invention. As the selection of a random or pseudorandom value may be computationally intensive, it may be desirable in certain applications to reduce the number of such values to be selected. FIG. 3 shows a method according to a third embodiment of the invention, in which only one random number x is generated (in initialization block 310). In this case, (in-1)-element persistence vector W represents a cumulative density function (CDF), each element Wj representing a probability that some rate Y,, will be assigned, where h is any integer such that 0:5 h<- j, Y,, is a valid assignment for this user, and 05 j- m-2. In the loop of blocks 330, 340, and 350, the maximum value of j is identified for which x > Wj. If the test in block 330 succeeds, rate Y,., may be chosen, or the usage rate may be chosen as min(Y;,, Yp,.,) as in block 365, where YP,. represents the highest usage rate possible given the user's current ,74769-517 characteristics. If the value of j reaches zero in block 340, then the rate Yo is chosen; otherwise, the value of j is decremented in block 350. Note that this method also may be modified to incorporate a wait-and-repeat scheme as in FIG. 2A. This method may be altered to allow the use of one among many other 5 relations between the values of x and W, in place of the test condition shown in block 330, depending on the particular characteristics of the values chosen for x and W,.
Even in a case where a persistence vector is not originally presented as a CDF, it is possible for the user to generate a CDF from such a vector, and 10 thereby reduce the number of random number generations for each rate assignment procedure to only one. First, a probability density function (PDF) vector F may be constructed from a persistence vector V as:
Fõ-, = [VR-, ];
,*I
F, =[v]rl (1-[V,]),iE {1,2,3....n-2};
Fo=rj (1-[V]) ,:n-I
Next, the PDF vector F is converted to a CDF vector Z by the following procedure or its equivalent:
~-1 Z, Fj.
A persistence vector is then constructed such that its elements represent the elements of Z. For example, a vector W suitable for use in the implementation of FIG. 3 described above may be constructed according to the relation W, =1-Z,, such that an element of W having a value of 1 represents a probability of zero, and an element of W having a value of 0 represents a probability of 1. Many other relations may be chosen to exist between the elements of a persistence vector and the probabilities which those elements represent, depending on the design of a particular implementation.
If and when an overload condition arises in a system according to FIG. 1 or FIG. 1A, the users 120 may not be aware that an overload has occurred, especially if the resource is consuming reserve capacity in order to meet user demands. Even in a case where the overload condition causes the resource's availability to a user to drop below a user's expectation or demand, the user may still be unable to verify whether the shortcoming is due to a resource overload or to the failure of another component in the supply path. Moreover, in certain applications such as wireless data communications, it is possible that no feedback mechanism exists whereby a user may obtain timely notification of an overload. Therefore, the user may continue to use the resource, unaware of the problem.
It is desirable in such a situation for the system to include a capability for notifying the users of the overload condition so that they may modify their uses (for example, by adopting a different persistence vector). Such feedback capability may also be useful in other, non-overload situations where it is desired to distribute information relating to the resource to one or more users (e.g. to indicate the availability of additional capacity or a reduction in resource capacity).
FIG. 4 shows an example of such a system with such capability, wherein control unit 460 receives information related to usage of resource 400 by users 420a-d (for example, current rate of use by one or more users, history of use by one or more users, reserve capacity available, predicted capacity, status of the resource, information relating to scheduled or unscheduled events that may affect resource capacity or status, etc.). Control unit 460 may issue commands based on this (and possibly other) information to users 420a-d over respective communications pathways 440a-d, such that these commands influence at least in part the respective permitted usage rates 410a-d of the users. Note that it is possible for control unit 460 to be implemented within the resource 400 or, alternatively, as a part of one or more of the users 420a-d.
If a user becomes aware of an overload condition, the possibility exists for user-driven remediation. If at least some of the users are able to communicate with each other, then a solution such as a reduction in usage rate may be negotiated between them. In many instances, however, such communication between users may be unavailable, impractical, or.undesirable, and it may be desirable for a centralized feedback mechanism such as control unit 460 not only to convey information relating to the resource but also to exert some degree of control over the permitted usage rates (for example, control unit 460 may issue commands that contain or relate to changes in one or more persistence vectors).
If complete knowledge of the future usage requirements of the users were available, then it would be theoretically possible to construct an optimal usage schedule that would satisfy the users' requirements as much as possible while completely avoiding all overload conditions. In many practical systems, however, a user's future needs will be unknown even to the user itself. One way to prevent overload conditions in such systems would be on the basis of current usage requirements: for example, by granting usage rate allocations to .74769-517 users only on a request basis. In order to convey the usage requests from the users back to the control unit, however, such a scheme would require an upstream communication pathway which might not otherwise be necessary.
Moreover, additional costs and delays would be incurred in receiving, processing and responding to such requests.
In order to avoid some of the disadvantages of a request/grant scheme, it is possible to issue rate allocations based on users' past usages. Suitable schemes of usage rate selection and assignment and rate allocation include those described in the U.S. Patent No. 6,665,272, entitled "SYSTEM AND
METHOD FOR PERSISTENCE-VECTOR-BASED MODIFICATION OF
USAGE RATES", and U.S. Patent No. 6,324,172, entitled "METHOD OF
RATE ALLOCATION IN A DATA COMMUNICATIONS NETWORK".
Such schemes enable the control unit to share control with the users, allowing the users to control the details of their own usage to some extent while the control unit concentrates on system-wide issues such as the prediction and avoidance of overload conditions.
FIG. 4A shows a system according to a fourth embodiment of the invention, wherein control unit 462 receives information related to usage of resource 400 by users 422a-d, and each user 422i has a set of persistence vectors 432i. In this example, the permitted usage rate 412i of each user 422i is influenced at least in part by commands received from control unit 462 over respective communications pathways 442a-d (for example, such commands may contain or relate to changes in one or more persistence vectors). Note that it is possible for control unit 462 to be implemented within the resource 400 or, alternatively, as a part of one or more of the users 422i. An exemplary application of a system according to FIG. 4A to a communications network such as the one described in Example 2 above is shown in FIG. 4B, wherein users 520a-d are data producers, each having a set of persistence vectors 530a-d;
resource 500 is a common transmission channel linking the producers with data consumer 550; and control unit 560 receives usage information from (and may be incorporated into) the consumer 550. Producers 520i use resource 500 by transmitting data to consumer 550 as allowed by permitted usage rates 510a-d, respectively, and they receive respective signals 540a-d from the control unit.
Consumer 550 and control unit 560 may be parts of a base station, and control signals 540 may be carried over a forward link of the communications channel.
Any of the methods described or suggested in FIGs. 2, 2A, or 2B or in the text above may be applied to a system according to the embodiments illustrated in FIGs. 4A and 4B. If the procedure is successful, the user uses the resource at a rate not greater than the selected rate. The rate assignment procedure may be repeated when, for example, a persistence vector is updated, some scheduled or unscheduled event occurs (expiration of a timer, triggering of an alarm event such as a low-power warning, etc.) or a predetermined time delay has elapsed.
At any particular time, a user's use of the resource conforms to a particular permitted usage rate among the user's set of available rates. It is not necessary for all users to have the same set of available rates, but the set for each user should be known to control unit 462 (560) so that it may reliably predict the state of resource use and issue control signals appropriately. It is also possible for each user's set of available rates to be updated or otherwise modified according to a command issued by control unit 462 (560) whether such a command is issued periodically or according to another scheme.
The set of persistence vectors may be a permanent aspect of the operation of the user, or it may be issued by control unit 462 (560), in which case one or more of its members may be updated periodically or otherwise.
Situations in which a new set of persistence vectors may be issued are not limited to overload conditions. For example, a persistence vector.set may be issued to a mobile unit at channel assignment and again upon handoff. Other situations that may cause the control unit to send a new or updated persistence vector set to one or more users include the following:
= A user first requests usage of the resource.
= The control unit wishes to reserve a portion of the resource's capacity.
= The control unit wishes to deny resource use to one or more users.
= The control unit wishes to maximize the number of users able to use the resource at one time.
= The control unit responds to a request from a user (or to requests from a number of users).
= The control unit responds to detected or communicated user characteristics (e.g. recent usage rate).
= In a wireless data communications network, the number of connections between the producer (mobile station) and the ground network (base stations) changes.
Persistence vector updates may also be used as a means to pass control over usage rates between the control unit and the users. For example, the control unit may prevent users from using the maximum usage rate (or any other rate) by setting the probability for that rate to zero and/or by modifying the persistence vector(s) corresponding to that rate. Alternatively, the control unit may cause one or more users to use only the lowest rate by setting the probabilities for all other rates to zero. Such action might occur in an emergency situation, for example, where it becomes desirable to support as many connections as possible or to reserve a portion of the capacity for priority use without terminating service to other users. On the other hand, the control unit may effectively transfer control over resource usage to the users by setting the probability for the maximum rate to one, thereby permitting each user to select its own permitted usage rate.
In a method according to a fifth embodiment of the invention, the occurrence of persistence vector assignments and updates is reduced by using correction vector sets. In a basic implementation, one set of persistence vectors is shared by all users, and a set of correction vectors is transmitted to a user or users for whom a different set of persistence vectors is desired. Each element of each correction vector corresponds to and modifies an element of a corresponding persistence vector, and the user applies a correction vector to the appropriate persistence vector by, for example, adding or multiplying the two vectors. The user then uses the resulting modified persistence vector or vectors to establish its permitted usage rate according to one of the methods described or suggested herein.
Implementation of correction vectors reduces control traffic while allowing a system to appropriately accommodate users having different usage behaviors or profiles (e.g. premium vs. economy, commercial vs. individual, scheduled or automatic use vs. use on demand, etc.). In a variation of the basic implementation described above, the set of correction vectors has fewer members than the set of persistence vectors, each such member corresponding to and modifying one among a predetermined subset of the set of persistence vectors. For example, correction vectors may be supplied only for those persistence vectors most likely to be referenced by the user. Alternatively or in addition to this variation, one or more among the set of correction vectors may have fewer elements than the corresponding persistence vector. Such variations, which reduce the volume of control traffic even further, may be used to concentrate control information by restricting the corrections to those persistence vectors (or elements thereof) which are likely to have the greatest effect on resource usage.
The foregoing description of the preferred embodiments is provided to enable any person skilled in the art to make or use the present invention.
Various modifications to these embodiments are possible, and the generic principles presented herein may be applied to other embodiments. For example, the invention may be implemented in part or in whole as hard-wired circuits, as circuit configurations fabricated into application-specific integrated circuits, or as firmware programs loaded into non-volatile storage or software programs loaded from or into data storage media as machine-readable code, 5 such code being instructions executable by arrays of logic elements such as microprocessors or other digital signal processing units. Thus, the present invention is not intended to be limited to the embodiments shown above but rather is to be accorded the widest scope consistent with the principles and novel features disclosed in any fashion herein.
What is claimed is:
Claims (80)
1. A system comprising:
a resource having a capacity measure, and a plurality of user equipment, each having a usage rate, a set of persistence vectors, and a set of available rates, wherein each persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used, wherein a use of the resource by each among the plurality of user equipment is determined at least in part by the usage rate of the user equipment, and wherein the usage rate of each among the plurality of user equipment is selected from at least the user equipment's set of available rates, said selection being determined at least in part by one among the set of persistence vectors.
a resource having a capacity measure, and a plurality of user equipment, each having a usage rate, a set of persistence vectors, and a set of available rates, wherein each persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used, wherein a use of the resource by each among the plurality of user equipment is determined at least in part by the usage rate of the user equipment, and wherein the usage rate of each among the plurality of user equipment is selected from at least the user equipment's set of available rates, said selection being determined at least in part by one among the set of persistence vectors.
2. The system according to claim 1, wherein each element of each vector among the set of persistence vectors corresponds to one among the set of available rates.
3. The system according to claim 2, wherein each element of the persistence vector of at least one among the plurality of user equipment represents a probability of using a rate at least as high as the corresponding one among the set of available rates.
4. The system according to claim 2, wherein each vector among the set of persistence vectors corresponds to one among the set of available rates.
5. The system according to claim 1, said selection being determined at least in part by a previous usage rate of the user equipment.
6. The system according to claim 2, wherein each element of each vector among the set of persistence vectors corresponds to one among the set of available rates.
7. The system according to claim 6, wherein the value of at least one member of a user equipment's set of available rates is substantially equal to 19,200x2i bits/second, wherein i is an integer.
8. The system according to claim 6, wherein in the set of available rates of at least one among the plurality of user equipment, the value of at least one member of the set is substantially equal to double the value of another member of the set.
9. The system according to claim 6, wherein the usage rate of at least one among the plurality of user equipment is a null usage rate.
10. The system according to claim 6, wherein an actual use of the resource by at least one among the plurality of user equipment is not greater than the user equipment's usage rate.
11. The system according to claim 6, wherein at least one among the set of persistence vectors represents a cumulative density function vector.
12. The system according to claim 11, wherein said cumulative density function vector is based at least in part from one among the set of persistence vectors.
13. The system according to claim 6, wherein each vector among the set of persistence vectors corresponds to one among the set of available rates.
14. The system according to claim 13, wherein each among the plurality of user equipment has the same set of available rates.
15. The system according to claim 6, wherein each among the plurality of user equipment has a pseudo random number, and wherein said selection is based at least in part on a relation between the pseudo random number and at least one of the elements of a vector in the user equipment's set of persistence vectors.
16. The system according to claim 15, wherein the pseudo random number of each among the plurality of user equipment is drawn from a set having a uniform distribution.
17. The system according to claim 15, wherein said selection is based at least in part on a relation between the pseudo random number and at least one of the elements of a selected vector in the user equipment's set of persistence vectors, and wherein said selected vector corresponds to the previous usage rate of the user equipment.
18. The system according to claim 15, wherein each among the plurality of user equipment comprises a data producer, and each among the usage rates comprises a rate of data production.
19. The system according to claim 18, wherein the resource is a wireless channel for data communications; and wherein use of the resource comprises transmitting data over the wireless channel.
20. The system according to claim 18, wherein the resource is the reverse link of a wireless CDMA channel for data communications.
21. The system according to claim 15, wherein at least one among the set of persistence vectors represents a cumulative density function vector.
22. The system according to claim 21, wherein said cumulative density function vector is based at least in part from one among the set of persistence vectors.
23. The system according to claim 15, further comprising a control unit, wherein the control unit receives information relating to the resource, and wherein the control unit supplies at least a portion of the set of persistence vectors of at least one among the plurality of user equipment.
24. The system according to claim 15, further comprising a control unit, wherein the control unit receives information relating to the resource, and wherein the control unit modifies at least a portion of the set of persistence vectors of at least one among the plurality of user equipment at least indirectly.
25. The system according to claim 23, wherein at least one among the set of persistence vectors represents a cumulative density function vector.
26. The system according to claim 25, wherein said cumulative density function vector is based at least in part from one among the set of persistence vectors.
27. The system according to claim 23, wherein at least one vector is a member of the set of persistence vectors of each among the plurality of user equipment.
28. The system according to claim 23, wherein at least one among the set of persistence vectors of at least one among the plurality of user equipment is based at least in part on (1) another among the user equipment's set of persistence vectors and (2) a correction vector.
29. The system according to claim 23, wherein at least a portion of one among the set of persistence vectors of at least one among the plurality of user equipment is based on a product of (1) at least a portion of another among the user equipment's set of persistence vectors and (2) a correction vector.
30. The system according to claim 29, wherein the control unit issues the correction vector to at least one among the plurality of user equipment.
31. A method of operating user equipment, comprising:
using a shared resource at a rate determined at least in part by a first usage rate;
obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
using a shared resource at a rate determined at least in part by a first usage rate;
obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
32. A data storage medium, said medium bearing machine-readable code, such code being instructions executable by an array of logic elements, said instructions defining a method comprising:
using a shared resource at a rate determined at least in part by a first usage rate;
obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
using a shared resource at a rate determined at least in part by a first usage rate;
obtaining a pseudo random number; and using the shared resource at a rate determined at least in part by a second usage rate, said second usage rate being determined at least in part by comparing the pseudo random number to at least one element of a persistence vector, wherein the persistence vector includes at least one element, wherein the element indicates a probability that a particular usage rate will be used.
33. A method of operating user equipment, comprising:
assigning a first vector to a first user equipment of a resource shared by multiple user equipment, the first vector containing one or more vector elements, each vector element of the first vector indicating a probability that a corresponding usage rate will be used; and determining a first usage rate for the first user equipment for a first period, based at least in part, on the first vector.
assigning a first vector to a first user equipment of a resource shared by multiple user equipment, the first vector containing one or more vector elements, each vector element of the first vector indicating a probability that a corresponding usage rate will be used; and determining a first usage rate for the first user equipment for a first period, based at least in part, on the first vector.
34. The method of claim 33 wherein the first vector is predetermined.
35. The method of claim 33 wherein the first vector is dynamically constructed.
36. The method of claim 33 wherein the first usage rate is chosen from a set of usage rates available to the first user equipment based on one or more elements of the first vector.
37. The method of claim 33 further comprising:
determining a second usage rate for the first user equipment for a second period, based at least in part, on the first vector.
determining a second usage rate for the first user equipment for a second period, based at least in part, on the first vector.
38. The method of claim 33 wherein the first vector is selected from a set of vectors available to the first user equipment based on one or more criteria.
39. The method of claim 38 wherein the one or more criteria include a criterion corresponding to a time which is indicative of a pattern of usage by the first user equipment.
40. The method of claim 38 wherein the one or more criteria include a criterion corresponding to a usage requirement of the first user equipment.
41. The method of claim 38 wherein the one or more criteria include a criterion corresponding to a quality of service with respect to a recent use of the resource.
42. The method of claim 38 wherein the one or more criteria include a criterion corresponding to a reduction of service with respect to a recent use of the resource.
43. The method of claim 38 wherein the one or more criteria include a criterion corresponding to a most recent usage rate for the first user equipment.
44. The method of claim 37 wherein determining the second usage rate includes:
obtaining a pseudo random number; and selecting the second usage rate from the set of usage rates available to the first user equipment, based at least in part, on the pseudo random number.
obtaining a pseudo random number; and selecting the second usage rate from the set of usage rates available to the first user equipment, based at least in part, on the pseudo random number.
45. The method of claim 44 wherein the second usage rate is selected based on a comparison between the pseudo random number and one of vector elements.
46. A system comprising:
a resource having a finite capacity;
multiple user equipment including a first user equipment to share the resource; and a set of vectors each of which contains one or more elements, each element representing a probability that a corresponding usage rate will be used, wherein the first user equipment's usage of the resource during a first interval is determined at least in part based on a vector of said set of vectors assigned to the first user equipment.
a resource having a finite capacity;
multiple user equipment including a first user equipment to share the resource; and a set of vectors each of which contains one or more elements, each element representing a probability that a corresponding usage rate will be used, wherein the first user equipment's usage of the resource during a first interval is determined at least in part based on a vector of said set of vectors assigned to the first user equipment.
47. The system of claim 46 wherein the first user equipment's usage of the resource during the first interval is represented by a first usage rate which is selected from a set of available usage rates based on the vector assigned to the first user equipment.
48. The system of claim 47 wherein the first user equipment's usage of the resource during a second interval is determined, based at least in part, on a pseudo random number.
49. The system of claim 48 wherein the first user equipment's usage of the resource during the second interval is represented by a second usage rate which is selected based on a comparison between the pseudo random number and one of the elements in the vector assigned to the first user equipment.
50. The system of claim 46 wherein the vector assigned to the first user equipment is selected based on a set of criteria.
51. The system of claim 50 wherein the set of criteria includes a criterion corresponding to a time which is indicative of a pattern of usage by the first user equipment.
52. The system of claim 50 wherein the set of criteria includes a criterion corresponding to a usage requirement of the first user equipment.
53. The system of claim 50 wherein the set of criteria includes a criterion corresponding to a quality of service with respect to a recent use of the resource.
54. The system of claim 50 wherein the set of criteria includes a criterion corresponding to a reduction of service with respect to a recent use of the resource.
55. The system of claim 50 wherein the set of criteria includes a criterion corresponding to a most recent usage rate for the first user equipment.
56. An apparatus to transmit data wirelessly using a shared resource, comprising:
a transmitter;
a processing unit operably connected to said transmitter;
a storage medium operably connected to said processing unit;
at least one vector stored on said storage medium;
wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
wherein said storage medium comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on at least one element of the at least one vector.
a transmitter;
a processing unit operably connected to said transmitter;
a storage medium operably connected to said processing unit;
at least one vector stored on said storage medium;
wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
wherein said storage medium comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on at least one element of the at least one vector.
57. The apparatus according to claim 56, wherein the shared resource comprises a channel for wireless data communications.
58. The apparatus according to claim 56, wherein the shared resource is divided into a number of fixed rate allocations.
59. The apparatus according to claim 56, wherein the usage rate is based on past usage.
60. The apparatus according to claim 56, wherein the usage rate is based on said user equipment's current characteristics.
61. The apparatus according to claim 56, whereby said usage rate is granted so that an overload condition is avoided.
62. A means to transmit data wirelessly using a shared resource, comprising:
a transmitting means;
a processing means operably connected to said transmitting means;
a storage means operably connected to said processing means;
at least one vector stored on said storage means;
wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
wherein said storage means comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
a transmitting means;
a processing means operably connected to said transmitting means;
a storage means operably connected to said processing means;
at least one vector stored on said storage means;
wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
wherein said storage means comprises instructions to request a grant of said usage rate among said set of available usage rates;
wherein each said usage rate is a data transmission rate for a user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
63. The means to transmit data wirelessly using a shared resource according to claim 62, wherein the shared resource comprises a channel for wireless data communications.
64. The means to transmit data wirelessly using a shared resource according to claim 62, wherein the shared resource is divided into a number of fixed rate allocations.
65. The means to transmit data wirelessly using a shared resource according to claim 62, wherein the usage rate is based on past usage.
66. The means to transmit data wirelessly using a shared resource according to claim 62, wherein the usage rate is based on said user equipment's current characteristics.
67. The means to transmit data wirelessly using a shared resource according to claim 62, whereby said usage rate is granted so that an overload condition is avoided.
68. A control unit to receive information wirelessly, comprising:
a processing unit operably connected to said transmitter;
a storage medium operably connected to said processing unit; wherein said storage medium comprises instructions to receive information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
send at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates;
wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
a processing unit operably connected to said transmitter;
a storage medium operably connected to said processing unit; wherein said storage medium comprises instructions to receive information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
send at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates;
wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and wherein an actual said usage rate of the shared resource is selected based on the set of vector elements.
69. The control unit of claim 68, wherein the control unit further comprises an instruction to periodically update said at least one user equipment's said usage rate.
70. The control unit of claim 68, wherein the control unit further comprises an instruction to modify at least one vector of said at least one user equipment.
71. The control unit according to claim 68, whereby said usage rate is granted so that an overload condition is avoided.
72. A method to receive information wirelessly, comprising:
receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and selecting an actual said usage rate of a shared resource based on said set of vector elements.
receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and selecting an actual said usage rate of a shared resource based on said set of vector elements.
73. The method of claim 72, further comprising a step of periodically updating said at least one user equipment's said usage rate.
74. The method of claim 72, further comprising a step of modifying at least one vector of said at least one user equipment.
75. The method of claim 72, whereby said usage rate is granted so that an overload condition is avoided.
76. A computer program product, comprising:
computer-readable medium comprising:
code for causing a computer to perform a method of any one of claims 72 to 75.
computer-readable medium comprising:
code for causing a computer to perform a method of any one of claims 72 to 75.
77. A means for receiving information wirelessly, comprising:
means for receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
means for sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and means for selecting an actual said usage rate of the shared resource based on at least one element of at least one vector.
means for receiving information on usage of a resource by a plurality of user equipment, each said user equipment having at least one vector, wherein said at least one vector comprises at least one element corresponding to a usage rate among a set of available usage rates, and at least one element that indicates a probability that a particular usage rate among said set of available usage rates will be used;
and wherein said information is a request;
means for sending at least one command to at least one of said user equipment, wherein said command is a grant of said usage rate among a set of available usage rates; and wherein each said usage rate is a data transmission rate for said at least one user equipment to transmit said data to a base station; and means for selecting an actual said usage rate of the shared resource based on at least one element of at least one vector.
78. The means for receiving information wirelessly of claim 77, further comprising means for periodically updating said at least one user equipment's usage rate.
79. The means for receiving information wirelessly of claim 77, further comprising means for modifying at least one vector of said at least one user equipment.
80. The means for receiving information wirelessly of claim 77, whereby said usage rate is granted so that an overload condition is avoided.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/410,199 US6535523B1 (en) | 1999-09-30 | 1999-09-30 | System and method for persistence vector based rate assignment |
| US09/410,199 | 1999-09-30 | ||
| PCT/US2000/026625 WO2001024005A2 (en) | 1999-09-30 | 2000-09-27 | System and method for persistence-vector-based rate assignment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2384769A1 CA2384769A1 (en) | 2001-04-05 |
| CA2384769C true CA2384769C (en) | 2010-02-16 |
Family
ID=23623690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2384769A Expired - Lifetime CA2384769C (en) | 1999-09-30 | 2000-09-27 | System and method for persistence-vector-based rate assignment |
Country Status (19)
| Country | Link |
|---|---|
| US (2) | US6535523B1 (en) |
| EP (3) | EP1222541B1 (en) |
| JP (2) | JP4727881B2 (en) |
| KR (1) | KR100756566B1 (en) |
| CN (2) | CN100524222C (en) |
| AT (1) | ATE417313T1 (en) |
| AU (1) | AU777032B2 (en) |
| BR (1) | BR0014395A (en) |
| CA (1) | CA2384769C (en) |
| DE (1) | DE60041077D1 (en) |
| ES (1) | ES2316385T3 (en) |
| HK (2) | HK1049901B (en) |
| IL (3) | IL148530A0 (en) |
| MX (1) | MXPA02003113A (en) |
| NO (1) | NO328364B1 (en) |
| RU (1) | RU2265881C2 (en) |
| TW (1) | TW563066B (en) |
| UA (1) | UA72269C2 (en) |
| WO (1) | WO2001024005A2 (en) |
Families Citing this family (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6721957B1 (en) * | 1999-08-16 | 2004-04-13 | Georgia Tech Research Corporation | System and method for maximizing bandwidth efficiency in a digital video program stream |
| US7596098B2 (en) * | 1999-09-30 | 2009-09-29 | Qualcomm Incorporated | System and method for persistence-vector-based rate assignment |
| US6535523B1 (en) * | 1999-09-30 | 2003-03-18 | Qualcomm Incorporated | System and method for persistence vector based rate assignment |
| US6850530B1 (en) * | 2000-02-04 | 2005-02-01 | Cisco Technology, Inc. | Methods and apparatus for providing and obtaining resource usage information |
| EP1186125B1 (en) * | 2000-04-10 | 2006-08-16 | Samsung Electronics Co., Ltd. | Method for measuring confusion rate of a common packet channel in a cdma communication system |
| US6842428B2 (en) * | 2001-01-08 | 2005-01-11 | Motorola, Inc. | Method for allocating communication network resources using adaptive demand prediction |
| KR100800884B1 (en) | 2001-03-29 | 2008-02-04 | 삼성전자주식회사 | Transmission controlling method of reverse rink in mobile communication system |
| US6904462B1 (en) * | 2001-07-06 | 2005-06-07 | Ciena Corporation | Method and system for allocating protection path resources |
| US8014305B1 (en) | 2001-09-07 | 2011-09-06 | Qualcomm Atheros, Inc. | Wireless LAN using transmission monitoring |
| US7369510B1 (en) | 2002-05-06 | 2008-05-06 | Atheros Communications, Inc. | Wireless LAN using RSSI and BER parameters for transmission rate adaptation |
| US7293091B2 (en) * | 2002-05-30 | 2007-11-06 | Intel Corporation | Method and apparatus for disruption sensitive network data management |
| US7596089B2 (en) * | 2002-06-04 | 2009-09-29 | Alcatel-Lucent Usa Inc. | Scheduler method and apparatus for communication systems |
| US20040128382A1 (en) * | 2002-12-31 | 2004-07-01 | Marion Shimoda | Method and apparatus for adjusting resource availability based on power availability |
| US7327716B2 (en) * | 2003-03-06 | 2008-02-05 | Nortel Networks Limited | Reverse link enhancement for CDMA 2000 Release D |
| US7677182B2 (en) * | 2004-05-27 | 2010-03-16 | Steelcase Development Corporation | Two person work environment |
| KR100619873B1 (en) * | 2004-06-29 | 2006-09-14 | 엘지전자 주식회사 | Method for controlling transmission speed of reverse traffic channel in high data rate system |
| GB0622830D0 (en) * | 2006-11-15 | 2006-12-27 | Cambridge Silicon Radio Ltd | Transmission rate selection |
| GB0622829D0 (en) * | 2006-11-15 | 2006-12-27 | Cambridge Silicon Radio Ltd | Transmission rate selection |
| US20090077248A1 (en) * | 2007-09-14 | 2009-03-19 | International Business Machines Corporation | Balancing access to shared resources |
| CN103988178B (en) * | 2011-11-24 | 2017-09-12 | 飞思卡尔半导体公司 | Data handling system and the method for controlling the access to shared memory cell |
| CN104866408B (en) * | 2014-02-20 | 2017-12-22 | 阿里巴巴集团控股有限公司 | The capacity prediction methods and device of a kind of application system |
| CN106685515B (en) * | 2017-01-05 | 2019-10-22 | 清华大学 | The distribution method and device of Information Network Satellite resource |
| US10557886B2 (en) * | 2017-04-28 | 2020-02-11 | Advantest Corporation | Test system supporting multiple users using different applications |
| US10659112B1 (en) | 2018-11-05 | 2020-05-19 | XCOM Labs, Inc. | User equipment assisted multiple-input multiple-output downlink configuration |
| US10432272B1 (en) | 2018-11-05 | 2019-10-01 | XCOM Labs, Inc. | Variable multiple-input multiple-output downlink user equipment |
| US10812216B2 (en) | 2018-11-05 | 2020-10-20 | XCOM Labs, Inc. | Cooperative multiple-input multiple-output downlink scheduling |
| US10756860B2 (en) | 2018-11-05 | 2020-08-25 | XCOM Labs, Inc. | Distributed multiple-input multiple-output downlink configuration |
| US11063645B2 (en) | 2018-12-18 | 2021-07-13 | XCOM Labs, Inc. | Methods of wirelessly communicating with a group of devices |
| US10756795B2 (en) | 2018-12-18 | 2020-08-25 | XCOM Labs, Inc. | User equipment with cellular link and peer-to-peer link |
| US11330649B2 (en) | 2019-01-25 | 2022-05-10 | XCOM Labs, Inc. | Methods and systems of multi-link peer-to-peer communications |
| US10756767B1 (en) | 2019-02-05 | 2020-08-25 | XCOM Labs, Inc. | User equipment for wirelessly communicating cellular signal with another user equipment |
| CN110486766B (en) * | 2019-08-23 | 2020-09-15 | 宁波方太厨具有限公司 | Automatic coding method for range hood of central flue system |
| CN110618840B (en) * | 2019-08-23 | 2021-12-17 | 宁波方太厨具有限公司 | Automatic matching method for address code of range hood of central flue system |
| CN112004248B (en) * | 2020-08-10 | 2022-09-02 | 中国联合网络通信集团有限公司 | Method and device for determining channel resource load distribution state |
Family Cites Families (66)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5338157B1 (en) * | 1992-09-09 | 1999-11-02 | Sims Deltec Inc | Systems and methods for communicating with ambulat |
| US5935099A (en) * | 1992-09-09 | 1999-08-10 | Sims Deltec, Inc. | Drug pump systems and methods |
| US6241704B1 (en) * | 1901-11-22 | 2001-06-05 | Sims Deltec, Inc. | Drug pump systems and methods |
| US3837339A (en) * | 1972-02-03 | 1974-09-24 | Whittaker Corp | Blood glucose level monitoring-alarm system and method therefor |
| US4146029A (en) * | 1974-04-23 | 1979-03-27 | Ellinwood Jr Everett H | Self-powered implanted programmable medication system and method |
| DE2758467C2 (en) * | 1977-12-28 | 1985-04-04 | Siemens AG, 1000 Berlin und 8000 München | Device for the pre-programmable infusion of liquids |
| DE2758368C2 (en) * | 1977-12-28 | 1985-10-17 | Siemens AG, 1000 Berlin und 8000 München | Device for the pre-programmable infusion of liquids |
| US4559037A (en) * | 1977-12-28 | 1985-12-17 | Siemens Aktiengesellschaft | Device for the pre-programmable infusion of liquids |
| US4360019A (en) * | 1979-02-28 | 1982-11-23 | Andros Incorporated | Implantable infusion device |
| US4373527B1 (en) * | 1979-04-27 | 1995-06-27 | Univ Johns Hopkins | Implantable programmable medication infusion system |
| US4731051A (en) * | 1979-04-27 | 1988-03-15 | The Johns Hopkins University | Programmable control means for providing safe and controlled medication infusion |
| US4619653A (en) * | 1979-04-27 | 1986-10-28 | The Johns Hopkins University | Apparatus for detecting at least one predetermined condition and providing an informational signal in response thereto in a medication infusion system |
| US4692147A (en) * | 1980-04-02 | 1987-09-08 | Medtronic, Inc. | Drug administration device |
| CA1169323A (en) * | 1980-06-03 | 1984-06-19 | Anthony M. Albisser | Insulin infusion device |
| AU546785B2 (en) * | 1980-07-23 | 1985-09-19 | Commonwealth Of Australia, The | Open-loop controlled infusion of diabetics |
| DE3035670A1 (en) * | 1980-09-22 | 1982-04-29 | Siemens AG, 1000 Berlin und 8000 München | DEVICE FOR INFUSING LIQUIDS IN HUMAN OR ANIMAL BODIES |
| US4529401A (en) * | 1982-01-11 | 1985-07-16 | Cardiac Pacemakers, Inc. | Ambulatory infusion pump having programmable parameters |
| US4494950A (en) * | 1982-01-19 | 1985-01-22 | The Johns Hopkins University | Plural module medication delivery system |
| US4515584A (en) * | 1982-07-06 | 1985-05-07 | Fujisawa Pharmaceutical Co., Ltd. | Artificial pancreas |
| US4447224A (en) * | 1982-09-20 | 1984-05-08 | Infusaid Corporation | Variable flow implantable infusion apparatus |
| EP0107150B2 (en) * | 1982-10-18 | 1992-04-15 | Siemens Aktiengesellschaft | Medicine-delivering apparatus |
| IT1170375B (en) * | 1983-04-19 | 1987-06-03 | Giuseppe Bombardieri | Implantable device for measuring body fluid parameters |
| US5135479A (en) * | 1983-08-18 | 1992-08-04 | Drug Delivery Systems, Inc. | Programmable control and mounting system for transdermal drug applicator |
| US4826810A (en) * | 1983-12-16 | 1989-05-02 | Aoki Thomas T | System and method for treating animal body tissues to improve the dietary fuel processing capabilities thereof |
| CA1254091A (en) * | 1984-09-28 | 1989-05-16 | Vladimir Feingold | Implantable medication infusion system |
| US4810243A (en) * | 1985-01-18 | 1989-03-07 | Intelligent Medicine, Inc. | Device and method for effecting application of a therapeutic agent |
| US4714462A (en) * | 1986-02-03 | 1987-12-22 | Intermedics Infusaid, Inc. | Positive pressure programmable infusion pump |
| US4731726A (en) * | 1986-05-19 | 1988-03-15 | Healthware Corporation | Patient-operated glucose monitor and diabetes management system |
| EP0290683A3 (en) * | 1987-05-01 | 1988-12-14 | Diva Medical Systems B.V. | Diabetes management system and apparatus |
| EP0317705B1 (en) * | 1987-11-25 | 1992-09-30 | Siemens Aktiengesellschaft | Device for the controlled dosage and infusion of liquids from a reservoir into the body |
| IT1231916B (en) * | 1989-05-29 | 1992-01-15 | Ampliscientifica S R L | WEARABLE ARTIFICIAL PANCREAS |
| NZ239283A (en) * | 1990-08-23 | 1994-09-27 | Ericsson Telefon Ab L M | Mobile cellular radio: handoff between half rate and full rate channels according to estimated received signal quality |
| US5376070A (en) * | 1992-09-29 | 1994-12-27 | Minimed Inc. | Data transfer system for an infusion pump |
| US5897493A (en) * | 1997-03-28 | 1999-04-27 | Health Hero Network, Inc. | Monitoring system for remotely querying individuals |
| US5364838A (en) * | 1993-01-29 | 1994-11-15 | Miris Medical Corporation | Method of administration of insulin |
| SE9300281D0 (en) * | 1993-01-29 | 1993-01-29 | Siemens Elema Ab | IMPLANTABLE MEDICAL DEVICE AND EXTRACORPORAL PROGRAMMING AND MONITORING DEVICE |
| AU7323994A (en) * | 1993-07-13 | 1995-02-13 | Sims Deltec, Inc. | Medical pump and method of programming |
| US5368562A (en) * | 1993-07-30 | 1994-11-29 | Pharmacia Deltec, Inc. | Systems and methods for operating ambulatory medical devices such as drug delivery devices |
| ZA946674B (en) | 1993-09-08 | 1995-05-02 | Qualcomm Inc | Method and apparatus for determining the transmission data rate in a multi-user communication system |
| WO1995008882A1 (en) | 1993-09-20 | 1995-03-30 | CODEX CORPORATION, a subsidiary company of MOTOROLA, INC. | Dynamic rate adjustment for overload control in communication networks |
| FI110042B (en) * | 1993-10-04 | 2002-11-15 | Nokia Corp | Cellular radio system |
| US5497772A (en) * | 1993-11-19 | 1996-03-12 | Alfred E. Mann Foundation For Scientific Research | Glucose monitoring system |
| US5544661A (en) * | 1994-01-13 | 1996-08-13 | Charles L. Davis | Real time ambulatory patient monitor |
| FR2716286A1 (en) * | 1994-02-16 | 1995-08-18 | Debiotech Sa | Installation of remote monitoring of controllable equipment. |
| US5536249A (en) * | 1994-03-09 | 1996-07-16 | Visionary Medical Products, Inc. | Pen-type injector with a microprocessor and blood characteristic monitor |
| EP0672427A1 (en) * | 1994-03-17 | 1995-09-20 | Siemens-Elema AB | System for infusion of medicine into the body of a patient |
| US5569186A (en) * | 1994-04-25 | 1996-10-29 | Minimed Inc. | Closed loop infusion pump system with removable glucose sensor |
| US5569187A (en) * | 1994-08-16 | 1996-10-29 | Texas Instruments Incorporated | Method and apparatus for wireless chemical supplying |
| US5665065A (en) * | 1995-05-26 | 1997-09-09 | Minimed Inc. | Medication infusion device with blood glucose data input |
| US6238338B1 (en) * | 1999-07-19 | 2001-05-29 | Altec, Inc. | Biosignal monitoring system and method |
| US5619492A (en) * | 1995-06-16 | 1997-04-08 | Unisys Corporation | CDMA communication system in which bit rates are dynamically allocated |
| US5729542A (en) * | 1995-06-28 | 1998-03-17 | Motorola, Inc. | Method and apparatus for communication system access |
| WO1997027829A1 (en) * | 1996-01-31 | 1997-08-07 | The Trustees Of The University Of Pennsylvania | Remote control drug delivery device |
| FI118509B (en) * | 1996-02-12 | 2007-12-14 | Nokia Oyj | A method and apparatus for predicting blood glucose levels in a patient |
| FR2749462B1 (en) * | 1996-06-04 | 1998-07-24 | Ela Medical Sa | AUTONOMOUS DEVICE, IN PARTICULAR ACTIVE IMPLANTABLE MEDICAL DEVICE, AND ITS EXTERNAL PROGRAMMER WITH SYNCHRONOUS TRANSMISSION |
| US5885245A (en) * | 1996-08-02 | 1999-03-23 | Sabratek Corporation | Medical apparatus with remote virtual input device |
| US5807336A (en) * | 1996-08-02 | 1998-09-15 | Sabratek Corporation | Apparatus for monitoring and/or controlling a medical device |
| US5895371A (en) * | 1996-08-27 | 1999-04-20 | Sabratek Corporation | Medical treatment apparatus and method |
| US5735887A (en) * | 1996-12-10 | 1998-04-07 | Exonix Corporation | Closed-loop, RF-coupled implanted medical device |
| US6270455B1 (en) * | 1997-03-28 | 2001-08-07 | Health Hero Network, Inc. | Networked system for interactive communications and remote monitoring of drug delivery |
| US6558320B1 (en) * | 2000-01-20 | 2003-05-06 | Medtronic Minimed, Inc. | Handheld personal data assistant (PDA) with a medical device and method of using the same |
| US6336900B1 (en) * | 1999-04-12 | 2002-01-08 | Agilent Technologies, Inc. | Home hub for reporting patient health parameters |
| US6669663B1 (en) * | 1999-04-30 | 2003-12-30 | Medtronic, Inc. | Closed loop medicament pump |
| US6535523B1 (en) * | 1999-09-30 | 2003-03-18 | Qualcomm Incorporated | System and method for persistence vector based rate assignment |
| US6681003B2 (en) * | 1999-10-05 | 2004-01-20 | Lifecor, Inc. | Data collection and system management for patient-worn medical devices |
| US6418346B1 (en) * | 1999-12-14 | 2002-07-09 | Medtronic, Inc. | Apparatus and method for remote therapy and diagnosis in medical devices via interface systems |
-
1999
- 1999-09-30 US US09/410,199 patent/US6535523B1/en not_active Expired - Lifetime
-
2000
- 2000-09-27 EP EP00965491A patent/EP1222541B1/en not_active Expired - Lifetime
- 2000-09-27 CN CNB008134030A patent/CN100524222C/en not_active Expired - Lifetime
- 2000-09-27 EP EP06122878A patent/EP1760589B1/en not_active Expired - Lifetime
- 2000-09-27 MX MXPA02003113A patent/MXPA02003113A/en active IP Right Grant
- 2000-09-27 JP JP2001526707A patent/JP4727881B2/en not_active Expired - Lifetime
- 2000-09-27 ES ES00965491T patent/ES2316385T3/en not_active Expired - Lifetime
- 2000-09-27 AT AT00965491T patent/ATE417313T1/en not_active IP Right Cessation
- 2000-09-27 AU AU76200/00A patent/AU777032B2/en not_active Ceased
- 2000-09-27 RU RU2002111563/09A patent/RU2265881C2/en active
- 2000-09-27 CA CA2384769A patent/CA2384769C/en not_active Expired - Lifetime
- 2000-09-27 UA UA2002031861A patent/UA72269C2/en unknown
- 2000-09-27 DE DE60041077T patent/DE60041077D1/en not_active Expired - Lifetime
- 2000-09-27 EP EP07106449A patent/EP1832979A3/en not_active Withdrawn
- 2000-09-27 IL IL14853000A patent/IL148530A0/en active IP Right Grant
- 2000-09-27 WO PCT/US2000/026625 patent/WO2001024005A2/en active Application Filing
- 2000-09-27 KR KR1020027004119A patent/KR100756566B1/en active IP Right Grant
- 2000-09-27 BR BR0014395-2A patent/BR0014395A/en not_active Application Discontinuation
- 2000-09-27 CN CN2007101026456A patent/CN101043420B/en not_active Expired - Lifetime
- 2000-12-11 TW TW089120373A patent/TW563066B/en not_active IP Right Cessation
-
2002
- 2002-03-05 IL IL148530A patent/IL148530A/en not_active IP Right Cessation
- 2002-03-26 NO NO20021506A patent/NO328364B1/en not_active IP Right Cessation
-
2003
- 2003-02-20 US US10/370,995 patent/US6965613B2/en not_active Expired - Lifetime
- 2003-03-24 HK HK03102106.4A patent/HK1049901B/en not_active IP Right Cessation
-
2007
- 2007-05-16 IL IL183267A patent/IL183267A0/en not_active IP Right Cessation
- 2007-06-07 JP JP2007151306A patent/JP4746011B2/en not_active Expired - Lifetime
- 2007-08-22 HK HK07109148.5A patent/HK1104627A1/en not_active IP Right Cessation
Also Published As
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2384769C (en) | System and method for persistence-vector-based rate assignment | |
| US7599329B2 (en) | System and method for persistence vector based rate assignment | |
| US6665272B1 (en) | System and method for persistence-vector-based modification of usage rates | |
| CN117793207A (en) | Mine water information processing method and device based on micro-service request |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20200928 |