39 search results - page 1 / 8 » A New Look at Selfish Routing |
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
TCS
2008
13 years 4 months ago
2008
GLVLSI
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper describes a new design for a hardware accelerator to support grid-based Maze Routing. Based on the direct mapped approach of Breuer and Shamsa [3], this work refines th...
DIMVA
2004
13 years 6 months ago
2004
: The fact that security is a critical problem when implementing mobile ad hoc networks (MANETs) is widely acknowledged. One of the different kinds of misbehavior a node may exhibi...
CAAN
2007
Springer
13 years 9 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...