It might be possible to show that a deterministic backoff after successes and a random backoff after failures is the nash equilibrium of a game.
Or maybe the nash equilibrium is a bit more complex: using a random backoff only if the collision resulted from a random backoff. This leads to a quick convergence protocol, a bit unfair by those that not find their place (slot) immediately.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment