Abstract
Multiple classes of traffic with differing and often conflicting requirements arise in an integrated telecommunications environment as users share the limited existing resources. In this paper, a game theoretic perspective is presented and analysed as the appropriate framework for the study of the flow control problem. Using the notion of power as the performance criterion, we compare a network—Pareto optimal solution—with two user optimal solutions—Nash and Stackelberg equilibria. The appropriateness of each solution is discussed given the operating characteristics of the system. A proposed greedy algorithm is shown to converge to the Nash equilibrium.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
