168 search results - page 18 / 34 » The price of selfish routing |
SAC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
89
Voted
DAC
2009
ACM
15 years 2 months ago
2009
ACM
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
78
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
60
Voted
AAIM
2006
Springer
15 years 3 months ago
2006
Springer
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...