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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Enterprise Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.