The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Providing public intradomain traffic matrices to the research community
ACM SIGCOMM Computer Communication Review
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
A survey on networking games in telecommunications
Computers and Operations Research
Wardrop equilibria and price of stability for bottleneck games with splittable traffic
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications
PEMP: peering equilibrium multipath routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Peering equilibrium multipath routing: a game theory framework for internet peering settlements
IEEE/ACM Transactions on Networking (TON)
Taming traffic dynamics: Analysis and improvements
Computer Communications
Minimum delay load-balancing via nonparametric regression and no-regret algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more variable and unpredictable traffic patterns. By providing origin-destination pairs with several possible paths, load-balancing has proved itself an excellent tool to face this uncertainty. In particular, mechanisms where routers greedily minimize a path cost function (thus requiring minimum coordination) have been studied from a game-theoretic perspective in what is known as a Routing Game (RG). The contribution of this paper is twofold. We first propose a new RG specifically designed for elastic traffic, where we maximize the total utility through load-balancing only. Secondly, we consider several important RGs from a TE perspective and, using several real topologies and traffic demands, present a thorough comparison of their performance. This paper brings insight into several RGs, which will help one in choosing an adequate dynamic load-balancing mechanism. The comparison shows that the performance gain of the proposed game can be important.