24 search results - page 3 / 5 » The maximum latency of selfish routing |
98
Voted
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
90
Voted
PODC
2005
ACM
15 years 4 months ago
2005
ACM
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
ISCA
2009
IEEE
15 years 5 months ago
2009
IEEE
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
We define a proximity overlay network (PON) which allow to realize DHT systems whose aim is to combine routing efficiency – i.e. an optimal degree/diameter tradeoff – and pr...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...