Performance of non-cooperative routing over parallel non-observable queues

DOI10.1017/S0269964816000097zbMATH Open1370.90084MaRDI QIDQ5358089FDOQ5358089

Authors: Olivier Brun 

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Recommendations

• Worst-case analysis of non-cooperative load balancing
• Selfish Traffic Allocation for Server Farms
• Selfish load balancing and atomic congestion games
• Tight bounds for selfish and greedy load balancing
• Noncooperative load balancing in distributed systems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of game theory (91A80) Queueing theory (aspects of probability theory) (60K25) Communication networks in operations research (90B18)

Cites Work

• Algorithmic Game Theory
• The price of anarchy in an exponential multi-server
• A survey on networking games in telecommunications
• Worst-case equilibria
• Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Potential games
• The impact of oligopolistic competition in networks
• To queue or not to queue: equilibrium behavior in queueing systems.
• Worst-case analysis of non-cooperative load balancing
• Capacity allocation under noncooperative routing
• Selfish Traffic Allocation for Server Farms
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• A survey on game theory applications in wireless networks
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Routing into two parallel links: Game-theoretic distributed algorithms
• Penalty-regulated dynamics and robust learning procedures in games
• EquiCast: scalable multicast with selfish users
• A mathematical model for the TCP tragedy of the commons
• Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
• Sensible decisions based on QoS
• Random Neural Networks with Synchronized Interactions

Cited In (2)

• Improving routing decisions in parallel non-observable queues
• Title not available (Why is that?)

This page was built for publication: Performance of non-cooperative routing over parallel non-observable queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358089)