24 search results - page 2 / 5 » The maximum latency of selfish routing |
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
ICS
2010
Tsinghua U.
14 years 4 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 ...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
WICON
2008
13 years 8 months ago
2008
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation...