Atomic routing in a deterministic queuing model

@inproceedings{Werth2014AtomicRI,
  title={Atomic routing in a deterministic queuing model},
  author={Thomas L. Werth and Michael Holzhauser and Sven Oliver Krumke},
  year={2014}
}
The issue of selfish routing through a network has received a lot of attention in recent years. We study an atomic dynamic routing scenario, where players allocate resources with load dependent costs only for some limited time. 
1
Twitter Mention

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

A ug 2 01 7 Routing Games over Time with FIFO policy

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Routing Games over Time with FIFO policy

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Selfish Routing on Dynamic Flows

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Nash equilibrium and the price of anarchy in priority based network routing

  • IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers