A game-based algorithm for fair bandwidth allocation in Fibre-Wireless access networks

Coimbra, J.; Schütz, G.; Correia, N.

doi:10.1016/j.osn.2012.08.004

Cited by 29 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [149] and [150], the authors applied a repeated game to Fiber-wireless (FiWi) access mesh networks (AMNs). There is a difference between traditional wireless mesh networks (TWMNs) and FiWi access mesh networks (AMNs).…”

Section: B Fiber Wireless Access Networkmentioning

confidence: 99%

Applications of Repeated Games in Wireless Networks: A Survey

Hoang

Niyato

et al. 2015

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.

show abstract

Section: B Fiber Wireless Access Networkmentioning

confidence: 99%

Applications of Repeated Games in Wireless Networks: A Survey

Hoang

Niyato

et al. 2015

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…In order to demonstrate how the presented game theory can be applied to communication networks, a simplified model from [12] will be shown in this section. In order to demonstrate how the presented game theory can be applied to communication networks, a simplified model from [12] will be shown in this section.…”

Section: Algorithm Development In a Communication Network Contextmentioning

confidence: 99%

“…Like in [12], it is assumed that tree structures are already formed as a result from the path selection carried out by a routing algorithm. At the wireless section, every wireless router/gateway wants to send/receive traffic belonging to its users to/from the Internet, through the optical section.…”

Section: Fiber-wireless Access Network Scenariomentioning

confidence: 99%

“…In [12], an algorithm for fair bandwidth allocation, which controls the output queues of wireless routers, is developed with the aid of a repeated game model. Nonetheless, there are also some contributions where game theory is used in communication networks as a framework for algorithm development.…”

Section: Introductionmentioning

confidence: 99%

“…This tutorial also exemplifies, with a simplified model taken from [12], the use of game theory to model a problem, devise an equilibrium strategy, and develop an algorithm that mimics such equilibrium strategy. No prior knowledge on game theory is assumed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Repeated game theory as a framework for algorithm development in communication networks

Coimbra

Correia

2015

Int J Communication

Self Cite

View full text Add to dashboard Cite

This article presents a tutorial on how to use repeated game theory as a framework for algorithm development in communication networks. The article starts by introducing the basis of one-stage games and how the outcome of such games can be predicted, through iterative elimination and Nash equilibrium. In communication networks, however, not all problems can be modeled using one-stage games. Some problems can be better modeled through multi-stage games, as many problems in communication networks consist of several iterations or decisions that need to be made over time. Of all the multi-stage games, the infinite-horizon repeated games were chosen to be the focus in this tutorial, because optimal equilibrium settings can be achieved, contrarily to the suboptimal equilibria achieved in other types of game. With the theoretical concepts introduced, it is then shown how the developed game theoretical model, and devised equilibrium, can be used as a basis for the behavior of an algorithm, which is supposed to solve a particular problem and will be running at specific network devices.of 18 ‡ The symbol 0 0 represents the Cartesian product. Hence, i 2P S i D ® s 1 ; s 2 ; : : : ; s jPj js 1 2 S 1^s2 2 S 2^: : :ŝ jPj 2 S jPj¯.of 18 4

show abstract

Addressing the interdependence in providing fair and efficient bandwidth distribution in hybrid optical‐wireless networks

Sarigiannidis

Nicopolitidis

2015

Int J Communication

View full text Add to dashboard Cite

Summary The convergence of optical and wireless technologies may offer a compelling network access infrastructure because these technologies combine major benefits such as large coverage in the wireless part and huge bandwidth in the optical part of the converged access network. The convergence of the passive optical networks with 4G wireless standards, such as the Worldwide Interoperability for Microwave Access and the Long Term Evolution, constitutes a quite attractive solution to meet the challenges of the modern bandwidth‐hungry access networks. One of the most important objective a modern access network has to address is the adequate bandwidth distribution to the final users. In addition, several other aims are emerged towards this goal, such as fairness and quality of service provisioning. The adversity of designing an efficient bandwidth distribution scheme for hybrid optical‐wireless access networks lies in the interdependence of both domains: the bandwidth distribution in the wireless domain depends on the optical transmission grant opportunities, while the bandwidth coordinator in the optical part has to be aware of the mobile user heterogeneity in the wireless domain. Moreover, the bandwidth decision‐making module in both networks has to be aware of providing a fair allocation independently of the number of mobile users or the traffic requests in the network. In this work, we endeavor to address the aforementioned challenges. A novel, fair, and efficient bandwidth distribution scheme is proposed for hybrid optical‐wireless access networks. By using weighted fairness provisioning techniques, the proposed scheme intends to alleviate the interdependence of the two domains, offering a fair and efficient bandwidth distribution to the mobile users. The weights are properly defined, by utilizing suitable optimization techniques such as the Lagrange multiplies, so as to incorporate the underlying features of each traffic requests, such as the population density and the propagation delay. Extensive simulation results indicate the capability of the proposed scheme, compared with other competitive allocation schemes, in provisioning a more efficient and fair bandwidth distribution in terms of latency, throughput, and packet drop ratio. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

A game-based algorithm for fair bandwidth allocation in Fibre-Wireless access networks

Cited by 29 publications

References 20 publications

Applications of Repeated Games in Wireless Networks: A Survey

Applications of Repeated Games in Wireless Networks: A Survey

Repeated game theory as a framework for algorithm development in communication networks

Addressing the interdependence in providing fair and efficient bandwidth distribution in hybrid optical‐wireless networks

Contact Info

Product

Resources

About