96 search results - page 6 / 20 » On a selfish caching game |
SIROCCO
2004
13 years 9 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
TWC
2008
13 years 7 months ago
2008
Abstract-- Multiuser diversity gains can be achieved by assigning channels to users with better channel quality in multiuser systems. To avoid the extensive information exchange re...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
We introduce a new channel, which consists of an interference channel (IC) in parallel with an interference relay channel (IRC), to analyze the interaction between two selfish and...
TCS
2008
13 years 7 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...