2013 · 33 citations · 14 references
Social SciencesMathematicsGame TheoryNegotiationOptimizationMulti-objective OptimizationMultiobjective OptimizationNash EquilibriumNoncooperative Game TheoryOptimization TheoryGame-theoretic OptimizationPareto Optimal SolutionProblem Statement Formulation
In this paper, we study the tradeoff between two important traffic engineering objectives: load balance and energy efficiency. Although traditional commonly used multi-objective optimization methods can yield a Pareto efficient solution, they need to construct an aggregate objective function (AOF) or model one of the two objectives as a constraint in the optimization problem formulation. As a result, it is difficult to achieve a fair tradeoff between these two objectives. Accordingly, we induce a Nash bargaining framework which treats the two objectives as two virtual players in a game theoretic model, who negotiate how traffic should be routed in order to optimize both objectives. During the negotiation, each of them announces its performance threat value to reduce its cost, so the model is regarded as a threat value game. Our analysis shows that no agreement can be achieved if each player sets its threat value selfishly. To avoid such a negotiation break-down, we modify the threat value game to have a repeated process and design a mechanism to not only guarantee an agreement, but also generate a fair solution. In addition, the insights from this work are also useful for achieving a fair tradeoff in other multi-objective optimization problems.
14
John F. Nash · Econometrica · 1950 · 7.9K citations
Internet traffic engineering by optimizing OSPF weights
Bernard Fortz, Mikkel Thorup · 2002 · 1.1K citations
MPLS and traffic engineering in IP networks
D.O. Awduche · IEEE Communications Magazine · 1999 · 363 citations
Power-Aware Speed Scaling in Processor Sharing Systems
Adam Wierman, Lachlan L. H. Andrew, Ao Tang · 2009 · 261 citations · Full text
On selfish routing in internet-like environments
Lili Qiu, Yang Richard Yang, Yin Zhang⋆ et al. · 2003 · 216 citations