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

DOI10.1017/S0269964816000097MaRDI QIDQ5358089zbMATH OpenFDO

Authors Olivier Brun

Publication date 19 September 2017

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

Copyright license Creative Commons Attribution 4.0 International

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)

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

Cites work

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

Cited in

(2)

• Improving routing decisions in parallel non-observable queues
• scientific article; zbMATH DE number 1003291 (Why is no real title available?)

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)