366 search results - page 1 / 74 » A new model for selfish routing |
TCS
2008
13 years 4 months ago
2008
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 ...
CAAN
2007
Springer
13 years 8 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...
CONEXT
2008
ACM
13 years 6 months ago
2008
ACM
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
JOIN
2006
13 years 4 months ago
2006
Reputation mechanisms for detecting and punishing free-riders in ad hoc networks depend on the local detection of selfish behavior. Although naive selfish strategies based on drop...