238 search results - page 1 / 48 » Efficient Methods for Selfish Network Design |
ICALP
2009
Springer
13 years 9 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are so...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
In this work we define and study a new model for the caching problem in a heterogeneous wireless network under a flash-crowd scenario. Using non-cooperative game theory, we cast t...
JCP
2008
13 years 5 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
MONET
2006
13 years 5 months ago
2006
Wireless sensor networks consist of energy-constrained sensor nodes operating unattended in highly dynamic environments. In this paper, we advocate a systematic decentralized appro...