Selfish Users and Fair Sharing of Bandwidth in Distributed Medium Access

Selfish Users and Fair Sharing of Bandwidth in Distributed Medium Access

Ratan K. Guha, Sudipta Rakshit
Copyright: © 2006 |Pages: 17
DOI: 10.4018/jeis.2006040103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Fair sharing of bandwidth in distributed systems is considered. The inherently contention-based medium access in distributed systems is modelled as a non-cooperative game: “Access Game”. It is shown that the Nash Equilibrium (NE) for incomplete information games is usually inefficient compared to the NE of complete information games. Consequently, simple mechanisms to approximate an incomplete information scenario as a complete information scenario are proposed. For complete information games, it is shown that the NE usually does not result in fairness. Therefore, we compute the Constrained Nash Equilibrium (CNE) of the “Access Game” with the fairness criteria as the constraints. It is shown that the CNE is unique.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2023)
Volume 18: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing