2009
DOI: 10.1007/978-3-642-03819-8_6
|View full text |Cite
|
Sign up to set email alerts
|

Congestion Avoidance Control through Non-cooperative Games between Customers and Service Providers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…Fig. 3 illustrates a classification of the existing approaches into three broad categories based on the interaction between players: users vs. users (non-cooperative [29] - [35] and cooperative [36]), networks vs. users (non-cooperative [37] - [41] and cooperative [42]), and networks vs. networks (non-cooperative [43] - [49] and cooperative [50] - [54]). It is noticeable that most related works formulate the problem as non-cooperative games.…”
Section: Classification Of Game Theory Approachesmentioning
confidence: 99%
See 2 more Smart Citations
“…Fig. 3 illustrates a classification of the existing approaches into three broad categories based on the interaction between players: users vs. users (non-cooperative [29] - [35] and cooperative [36]), networks vs. users (non-cooperative [37] - [41] and cooperative [42]), and networks vs. networks (non-cooperative [43] - [49] and cooperative [50] - [54]). It is noticeable that most related works formulate the problem as non-cooperative games.…”
Section: Classification Of Game Theory Approachesmentioning
confidence: 99%
“…Charilas et al [41] propose a congestion avoidance control mechanism which models the competitive customer-provider scenario as a non-cooperative two-player game. The proposed framework consists of two games, namely the Admission Control (AC) game and the Load Control (LC) game.…”
Section: B Game Players: Network Vs Users 1) Network Vs Users -Nmentioning
confidence: 99%
See 1 more Smart Citation
“…We consider a competitive environment where multiple SPs contract link and node capacities from different InPs. The proposed game was initially introduced in wireless networks by Charilas et al [26] to model the interactions between network providers and customers and to avoid radio link congestion. Let the number of SPs be denoted by n, and the number of InPs be denoted by m. The SP has the choice to lease resources from InP admits (I 1 ) x 11 , y 11 x 12 , y 12 InP rejects (I 2 )…”
Section: Resource Negotiation Gamementioning
confidence: 99%
“…In [7] the authors review popular game theory techniques with regard to the wireless networks' resource management problem and propose a game theoretic framework for optimizing bandwidth allocation and admission control issues in wireless networks. The use of non-cooperative games to model CAC has been proposed in [2] [8], where customers and service providers compete with each other as players, seeking to maximize their own payoff.…”
Section: Introductionmentioning
confidence: 99%