Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Inefficiency of Nash equilibria
Mathematics of Operations Research
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Computational study of state-of-the-art path-based traffic assignment algorithms
Mathematics and Computers in Simulation
Improved Results for Stackelberg Scheduling Strategies
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
INFORMS Journal on Computing
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Selfish routing
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Traffic engineering with traditional IP routing protocols
IEEE Communications Magazine
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
A self-organizing group management middleware for mobile ad-hoc networks
Computer Communications
Eliciting Coordination with Rebates
Transportation Science
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Service engineering for inter-domain overlay networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
TCP throughput adaptation in WiMax networks using replicator dynamics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
From optimization to regret minimization and back again
SysML'08 Proceedings of the Third conference on Tackling computer systems problems with machine learning techniques
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Unicast QoS routing in overlay networks
Network performance engineering
Hi-index | 0.00 |
A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments based on realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefits come at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable.