204
click to vote
CAAN
16 years 9 days 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...
190
click to vote
CAAN
16 years 9 days ago
2004 Springer 
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
173
click to vote
CAAN
15 years 10 months ago
2004 Springer
It is well known that the selfish behavior of users in a network can be regulated through the imposition of the so-called optimal taxes on the network edges. Any traffic equilibriu...
168
click to vote
CAAN
16 years 9 days ago
2004 Springer 
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
161
click to vote
CAAN
16 years 9 days ago
2004 Springer 
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
|
Discrete Geometry