Browsing by Subject "Network routing"
Now showing items 1-5 of 5
-
Article
Facets of the fully mixed nash equilibrium conjecture
(2008)In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the special case of n identical users over two ...
-
Conference Object
Performance and power optimization through data compression in Network-on-Chip architectures
(2008)
-
Article
The price of selfish routing
(2007)We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users
-
Article
Real-time estimation of travel times along the arcs and arrival times at the nodes of dynamic stochastic networks
(2008)Route planning in uncertain and dynamic networks has recently emerged as an active and intense area of research, both due to industry needs and technological advances. This paper investigates methods to predict travel times ...
-
Article
Which is the worst-case Nash equilibrium?
(2003)A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such ...