Efficient CSMA/CD-Based Protocols for Multiple Priority Classes
IEEE Transactions on Computers
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Stability and Optimal Control of the Packet Switching Broadcast Channel
Journal of the ACM (JACM)
Distributed fair scheduling in a wireless LAN
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
TCP Performance in Wireless Multi-hop Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The designer's perspective to noncooperative networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
IEEE Transactions on Mobile Computing
Distributed self-organizing bandwidth allocation for priority-based bus communication
Concurrency and Computation: Practice & Experience
| Hi-index | 14.98 |
Fair sharing of bandwidth remains an unresolved issue for distributed systems. In this paper, the users of a distributed LAN are modeled as selfish users with independence to choose their individual strategies. With these selfish users, the contention-based distributed medium access scenario is modeled as a complete-information, noncooperative game, designated the "Access Game.驴 A novel MAC strategy based on p-persistent CSMA is presented to achieve fairness in the "Access Game.驴 It is proven that there are an infinite number of Nash Equilibria for the "Access Game,驴 but they do not result in fairness. Therefore, it may be beneficial for the selfish users to adhere to a set of constraints that result in fairness in a noncooperative fashion. This leads to the formulation of a constrained "Access Game驴 with fairness represented as a set of algebraic constraints. It is proven that the solution of the constrained game, the Constrained Nash Equilibrium, is unique. Further, it is shown that, in addition to achieving fairness, this solution also optimizes the throughput. Finally, these results are extended to a more realistic incomplete-information scenario by approximating the incomplete-information scenario as a complete-information scenario through information gathering and dissemination.