Back off methods and systems
AssigneeLucent Technologies Inc.
InventorChih-Peng Li
Life of this patent
Estimating the term…
Abstract
A Near Optimal Fairness (NOF) algorithm is disclosed for resolving data collisions in a network shared by a plurality of users. The NOF algorithm calculates an optimal back-off or contention window which is broadcast to users competing for system bandwidth. The NOF algorithm handles data contention in cycles and guarantees that each user competing for system bandwidth within a cycle will make a successful reservation before the cycle ends and a new cycle begins. The size of the back-off window is preferably equal to the number of successful reservations in the previous cycle, and functions as an estimate of the number of competing users in the current cycle.
Claims17
A method for resolving data collision in a network shared by a plurality of users, the method comprising:
- calculating a first back-off window based at least in part on an estimate of a number of users on the network;
- sending the first back-off window to a plurality of users of the network;
- calculating a second back-off window based at least in part on a smallest integer equal to or greater than a number, which number results from a product of a number of collisions that occurred within the first back-off window and an average of a number of users in the network involved in a collision;
- and
- sending the second back-off window to one or more of the plurality of users of the network.
A method for resolving data collision in a network shared by a plurality of users, the method comprising:
- sending a first back-off window to a plurality of users of the network;
- calculating a second back-off window based at least in part on a smallest integer equal to or greater than a number, which number results from product of the number of users that collided while attempting to reserve network resources during the first back-off window and an average of number of users in the network involved in a collision;
- sending the second back-off window to one or more of the plurality of users of the network;
- and
- limiting network reservation attempts in the second back-off window to users that collided while attempting to reserve network resources during the first back-off window.
A system for resolving data collisions in a shared network, comprising:
- a plurality of remote devices;
- and an access point in communication with the plurality of remote devices, wherein the access point further comprises:
- a switch for communicating with the plurality of remote devices;
- a transceiver for sending information to and receiving information from the plurality of remote devices;
- and a collision resolution device communicably coupled to the transceiver and the switch, wherein the collision resolution device sends an initial back-off window to the plurality of remote devices;
- wherein the collision resolution device calculates and sends a subsequent back-off window based at least in part on a smallest integer equal to or greater than a number, which number results from a product of a number of collisions that occurred within the within the first back-off window and an average number of users in the network involved in a collision;
- and
- wherein the collision resolution device limits the remote devices that can compete for network resources in the subsequent back-off window to remote devices that unsuccessfully attempted to reserve network resources in the initial back-off window.
Dependencies are inferred from the claim text.