Linearly Solvable Mean-Field Traffic Routing Games.
Takashi TanakaEhsan NekoueiAli Reza PedramKarl Henrik JohanssonPublished in: IEEE Trans. Autom. Control. (2021)
Keyphrases
- traffic load
- traffic engineering
- network layer
- ip traffic
- traffic conditions
- special case
- computer games
- medium access control
- routing algorithm
- game theory
- markov random field
- routing protocol
- network traffic
- ip addresses
- np complete
- closed form
- game playing
- routing problem
- shortest path
- nash equilibria
- internet traffic
- ip networks
- intermediate nodes
- road segments
- linear complexity
- free energy
- game play
- dynamic routing
- traffic flow
- educational games
- network topology
- np hard
- em algorithm
- real time
- network resources
- nash equilibrium
- wavelength division multiplexing
- packet switching
- link failure
- end to end
- video games
- road network
- ad hoc networks
- belief networks
- statistical mechanics
- quality of service
- anomaly detection
- inter domain
- packet forwarding
- route discovery
- bayesian inference
- posterior distribution
- markov networks