1. A method comprising:
establishing a first mapping between request attribute sets and a first set of peers in a network;
wherein the peer to which each request attribute set is assigned is responsible for aggregating counter information associated with requests associated with the each request attribute set;
receiving, at a first peer in the first set of peers, a first request associated with a first request attribute set;
wherein the first mapping maps the first request attribute set to a second peer, in the first set of peers;
based, at least in part, on determining that the first request is associated with the first attribute set, the first peer retrieving a first global counter snapshot and a first local increment counter from local storage associated with the first peer;
based, at least in part, on the first global counter snapshot, the first local increment counter and policy information, the first peer determining whether the first peer can service the first request;
in response to determining that the first peer can service the first request:
the first peer servicing the first request; and
the first peer incrementing the first local increment counter to reflect that the first peer serviced the first request;
wherein the method is performed by one or more computing devices.
2. The method of claim 1 further comprising:
determining whether the first local increment counter exceeded a threshold value;
in response to determining that the first local increment counter exceeded the threshold value, transmitting the first local increment counter to the second peer, and resetting the first local increment counter to zero;
in response to the first peer receiving, from the second peer, a first global counter associated with the first global counter snapshot, the first peer updating the first global counter snapshot with the first global counter, and storing the updated first global counter snapshot in the local storage.
3. The method of claim 1, wherein:
the first mapping maps a second identifier to the first peer; and
the first peer is further configured to perform:
receiving update data for one or more local counters snapshots from other peers in the set of peers; and
based on the update data received from the other peers, updating the one or more local counters snapshots.
4. The method of claim 1,
wherein the first request comprises the first identifier, which identifies a first requestor that sent the first request; and
wherein the first mapping comprises one or more partitions, and each partition, from the one or more partitions, corresponds to a peer from the set of peers.
5. The method of claim 1, further comprising:
in response to detecting that a third peer is installed in the network:
modifying the first mapping to represent a new mapping between the identifiers and a new set of peers;
wherein the new set of peers comprises the set of peers and the third peer; and
using the new mapping to determine a particular peer to which transmit updates for the first global counter.
6. The method of claim 4, further comprising:
determining whether the first requestor required provisioning for services offered by the network;
wherein the provisioning of the first requestor comprises determining, for the first requestor, one or more quotas associated with the one or more classifiers; and
wherein the determining whether the first peer can service the first request further comprises determining whether servicing the first request by the first peer could cause exceeding any of the one or more quotas associated with the one or more classifiers for the first requestor.
7. The method of claim 1, further comprising:
establishing a second mapping between the identifiers and a second set of peers in the network;
wherein the second set of peers comprises the peers of the first set of peers except the second peer;
detecting that the second peer is non-responsive;
receiving, at the first peer, a second request associated with the first identifier and the one or more classifiers;
based, at least in part, on the first identifier, the one or more classifiers, and the policy information, the first peer retrieving the first global counter snapshot and the first local increment counter;
based, at least in part, on the first global counter snapshot and the first local increment counter, the first peer determining whether the first peer can service the second request;
in response to determining that the first peer can service the second request:
the first peer servicing the second request;
the first peer updating the first local increment counter to reflect that the first peer serviced the first request;
based on the second mapping, the first peer determining that the first local increment counter is to be sent to a fourth peer;
the first peer transmitting the first local increment counter to the fourth peer and resetting the first local increment counter to zero; and
in response to the first peer receiving, from the fourth peer, a second global counter associated with a second global counter snapshot, the first peer updating the second global counter snapshot with the second global counter, and storing the updated second global counter snapshot in the local storage.
8. The method of claim 1, wherein the second mapping is distributed to the second set of peers.
9. A non-transitory computer-readable storage medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform:
establishing a first mapping between request attribute sets and a first set of peers in a network;
wherein the peer to which each request attribute set is assigned is responsible for aggregating counter information associated with requests associated with the each request attribute set;
receiving, at a first peer in the first set of peers, a first request associated with a first request attribute set;
wherein the first mapping maps the first request attribute set to a second peer, in the first set of peers;
based, at least in part, on determining that the first request is associated with the first attribute set, the first peer retrieving a first global counter snapshot and a first local increment counter from local storage associated with the first peer;
based, at least in part, on the first global counter snapshot, the first local increment counter and policy information, the first peer determining whether the first peer can service the first request;
in response to determining that the first peer can service the first request:
the first peer servicing the first request; and
the first peer incrementing the first local increment counter to reflect that the first peer serviced the first request.
10. The non-transitory computer-readable storage medium of claim 9, wherein the instructions include instructions for:
determining whether the first local increment counter exceeded a threshold value;
in response to determining that the first local increment counter exceeded the threshold value, transmitting the first local increment counter to the second peer, and resetting the first local increment counter to zero; and
in response to the first peer receiving, from the second peer, a first global counter associated with the first global counter snapshot, the first peer updating the first global counter snapshot with the first global counter, and storing the updated first local counter in the local storage.
11. The non-transitory computer-readable storage medium of claim 9, wherein:
the first mapping maps a second identifier to the first peer; and
further comprising instructions which, when executed, cause the one or more processors to perform:
receiving update data for one or more local counters snapshots from other peers in the set of peers; and
based on the update data received from the other peers, updating the one or more local counters snapshots.
12. The non-transitory computer-readable storage medium of claim 9,
wherein the first request comprises the first identifier, which identifies a first requestor that sent the first request; and
wherein the first mapping comprises one or more partitions, and each partition, from the one or more partitions, corresponds to a peer from the set of peers.
13. The non-transitory computer-readable storage medium of claim 9, further comprising instructions which, when executed, cause the one or more processors to perform:
in response to detecting that a third peer is installed in the network:
modifying the first mapping to represent a new mapping between the identifiers and a new set of peers;
wherein the new set of peers comprises the set of peers and the third peer; and
using the new mapping to determine a particular peer to which transmit updates for the first global counter.
14. The non-transitory computer-readable storage medium of claim 9, further comprising instructions which, when executed, cause the one or more processors to perform:
determining whether the first requestor required provisioning for services offered by the network;
wherein the provisioning of the first requestor comprises determining, for the first requestor, one or more quotas associated with the one or more classifiers; and
wherein the determining whether the first peer can service the first request further comprises determining whether servicing the first request by the first peer could cause exceeding any of the one or more quotas associated with the one or more classifiers for the first requestor.
15. The non-transitory computer-readable storage medium of claim 9 further comprising instructions which, when executed, cause the one or more processors to perform:
establishing a second mapping between the identifiers and a second set of peers in the network;
wherein the second set of peers comprises the peers of the first set of peers except the second peer;
detecting that the second peer is non-responsive;
receiving, at the first peer, a second request associated with the first identifier and the one or more classifiers;
based, at least in part, on the first identifier, the one or more classifiers, and the policy information, the first peer retrieving the first global counter snapshot and the first local increment counter;
based, at least in part, on the first global counter snapshot and the first local increment counter, the first peer determining whether the first peer can service the second request;
in response to determining that the first peer can service the second request:
the first peer servicing the second request;
the first peer updating the first local increment counter to reflect that the first peer serviced the first request;
based on the second mapping, the first peer determining that the first local increment counter is to be sent to a fourth peer;
the first peer transmitting the first local increment counter to the fourth peer and resetting the first local increment counter to zero; and
in response to the first peer receiving, from the fourth peer, a second global counter associated with a second global counter snapshot, the first peer updating the second global counter snapshot with the second global counter, and storing the updated second global counter snapshot in the local storage.
16. The non-transitory computer-readable storage medium of claim 9, wherein the second mapping is distributed to the second set of peers.
17. A system comprising a plurality of peers, wherein the plurality of peers comprises a first peer and a second peer, and wherein:
the first peer is configured to perform:
establishing a first mapping between request attribute sets and a first set of peers in a network;
wherein the peer to which each request attribute set is assigned is responsible for aggregating counter information associated with requests associated with the each request attribute set;
receiving, at the first peer in the first set of peers, a first request associated with a first request attribute set;
wherein the first mapping maps the first request attribute set to the second peer, in the first set of peers;
based, at least in part, on determining that the first request is associated with the first attribute set, the first peer retrieving a first global counter snapshot and a first local increment counter from local storage associated with the first peer;
based, at least in part, on the first global counter snapshot, the first local increment counter and policy information, the first peer determining whether the first peer can service the first request;
in response to determining that the first peer can service the first request:
the first peer servicing the first request; and
the first peer incrementing the first local increment counter to reflect that the first peer serviced the first request.
18. The system of claim 17 wherein the first peer is further configured to perform:
determining whether the first local increment counter exceeded a threshold value;
in response to determining that the first local increment counter exceeded the threshold value, transmitting the first local increment counter to the second peer, and resetting the first local increment counter to zero; and
in response to the first peer receiving, from the second peer, a first global counter associated with the first global counter snapshot, the first peer updating the first global counter snapshot with the first global counter, and storing the updated first local counter in the local storage.
19. The system of claim 17,
wherein the first request comprises the first identifier, which identifies a first requestor that sent the first request; and
wherein the first mapping comprises one or more partitions, and each partition, from the one or more partitions, corresponds to a peer from the set of peers.
20. The system of claim 17,
wherein the first request comprises the first identifier, which identifies a first requestor that sent the first request; and
wherein the first mapping comprises one or more partitions, and each partition, from the one or more partitions, corresponds to a peer from the set of peers.
21. The system of claim 17, further comprising a third peer; and wherein the first peer is further configured to perform:
in response to detecting that the third peer is installed in the network:
modifying the first mapping to represent a new mapping between the identifiers and a new set of peers;
wherein the new set of peers comprises the set of peers and the third peer; and
using the new mapping to determine a particular peer to which transmit updates for the first global counter.
22. The system of claim 20, wherein the first peer is further configured to:
determining whether the first requestor required provisioning for services offered by the network;
wherein the provisioning of the first requestor comprises determining, for the first requestor, one or more quotas associated with the one or more classifiers; and
wherein the determining whether the first peer can service the first request further comprises determining whether servicing the first request by the first peer could cause exceeding any of the one or more quotas associated with the one or more classifiers for the first requestor.
23. The system of claim 17, further comprising a fourth peer; and wherein the first peer is further configured to perform:
establishing a second mapping between the identifiers and a second set of peers in the network;
wherein the second set of peers comprises the peers of the first set of peers except the second peer;
detecting that the second peer is non-responsive;
receiving, at the first peer, a second request associated with the first identifier and the one or more classifiers;
based, at least in part, on the first identifier, the one or more classifiers, and the policy information, the first peer retrieving the first global counter snapshot and the first local increment counter;
based, at least in part, on the first global counter snapshot and the first local increment counter, the first peer determining whether the first peer can service the second request;
in response to determining that the first peer can service the second request:
the first peer servicing the second request;
the first peer updating the first local increment counter to reflect that the first peer serviced the first request;
based on the second mapping, the first peer determining that the first local increment counter is to be sent to the fourth peer;
the first peer transmitting the first local increment counter to the fourth peer and resetting the first local increment counter to zero; and
in response to the first peer receiving, from the fourth peer, a second global counter associated with a second global counter snapshot, the first peer updating the second global counter snapshot with the second global counter, and storing the updated second global counter snapshot in the local storage.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of making solid nanoparticles, comprising:
making an oil-in-water microemulsion by heating, the microemulsion comprising:
a liquid nanoparticle matrix material formed by heating a solid matrix material until melted;
a surfactant or a co-surfactant or a mixture thereof, and
a molecule of interest, wherein the molecule is a drug molecule;
wherein the microemulsion is formed essentially spontaneously by heating at a temperature of between about 35\xb0 C. and about 100\xb0 C.; and
cooling the microemulsion while stirring to form solid nanoparticles having a diameter of less than about 300 nanometers, wherein said solid nanoparticles are formed by cooling the microemulsion without aqueous dilution, and where the molecule of interest is either entrapped in or adsorbed to the solid nanoparticles.
2. The method according to claim 1, wherein the nanoparticle matrix material comprises one or more of the following materials: emulsifying wax, polyoxyethylene sorbitan fatty acid esters, polyoxyethylene alkyl ethers, polyoxyethylene stearates, phospholipids, fatty acids or fatty alcohols or their derivatives, or combinations thereof.
3. The method according to claim 1, wherein the liquid nanoparticle matrix material is present in the microemulsion at a concentration from about 0.1 to about 30 mgmL.
4. The method according to claim 1, wherein the microemulsion comprises an oil phase that is present as liquid droplets having a diameter of less than about 100 nanometers.
5. The method according to claim 1, wherein the microemulsion comprises a continuous phase comprising water or an aqueous buffer at a concentration of greater than about 95% ww.
6. The method according to claim 1, wherein the surfactant or co-surfactant comprises polyoxyethylene alkyl ethers, polyoxyethylene sorbitan fatty acid esters, polyoxyethylene stearates, hexadecyltrimethylammonium bromide, fatty alcohol and their derivatives, or combinations, thereof.
7. The method according to claim 1, wherein the surfactant is present at a total concentration of about 1\u20135000 mM.
8. The method according to claim 1, wherein the molecule of interest is present at a total concentration in the range of about 20 \u03bcgmL to about 5 mgmL.
9. The method according to claim 1, wherein the nanoparticle is coated with a cell-specific ligand such as an antibody, carbohydrate, peptide, protein, or derivatives or combinations thereof.
10. The method of claim 1, wherein the nanoparticles and molecule of interest are formulated into a pharmaceutical composition suitable for intravenous, intramuscular or subcutaneous administration.