摘要 |
A system and method which integrates a greedy allocation for consumer admission control with a Lagrangian allocation to compute flow rates and which links the results of the two approaches to allow a tradeoff between consumer admission control and flow rates. The Lagrangian Rates, Greedy Populations (hereinafter, “LRGP”) solution is a scalable and efficient distributed solution for maximizing the total utility in an event-driven distributed infrastructure. The greedy population, consumer portion generates prices used in the LaGrangian rate flow approach. The method is iterative including a regular exchange of information for ongoing optimization, dynamically adjusting producer rates in response to changes to consumer service and dynamically adjusting the service to consumer populations in response to changes in the producer rates.
|