Latest revision as of 20:37, 28 January 2021

Abstract

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.

Original document

The different versions of the original document can be found in:

• http://www.cse.buffalo.edu/tech-reports/2012-02a.pdf

• http://xplorestaging.ieee.org/ielx7/6556116/6566708/06566829.pdf?arnumber=6566829,

http://dx.doi.org/10.1109/infcom.2013.6566829

• https://dblp.uni-trier.de/db/conf/infocom/infocom2013.html#ZhaoWXWGQ13,

https://ieeexplore.ieee.org/document/6566829,

https://ubir.buffalo.edu/xmlui/handle/10477/34633,

https://academic.microsoft.com/#/detail/1995699326