995 search results - page 22 / 199 » Minimizing Congestion in General Networks |
IOR
2007
13 years 8 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
INFOCOM
1996
IEEE
14 years 10 days ago
1996
IEEE
We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term ...
CAAN
2004
Springer
14 years 1 months ago
2004
Springer
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
IPTPS
2004
Springer
14 years 1 months ago
2004
Springer
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...