in reply to A distributed design challenge

Assumptions:

  1. There are many budgets, each for a different type(*) of request.
  2. All the requests arrive at the same place and are distributed to the 36 boxes via some kind of load-sharing mechanism.
  3. There is some mechanism -- I'm using time/amount below; but a "bid id" or similar, would work as well if not better -- for relating successful bids back to a list of outstanding bids.
  4. Update: also assumes that you do not receive explicit notifications for failed bids -- hence the need to track them.

    When the budget manager is discarding unsuccessful bids, following the receipt of a success, it can use the values of the failures to adjust its bidding strategy.

Solution:

This should allow the mechanism to bid as often as possible, whilst keeping the outstanding bid totals within the specified budget (or budget + wiggle).


With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

The start of some sanity?