177 search results - page 31 / 36 » Stackelberg Routing in Arbitrary Networks |
ICDCS
2003
IEEE
14 years 1 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
INFOCOM
1997
IEEE
13 years 12 months ago
1997
IEEE
— This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can efficiently support lightpaths (connections) between nod...
IPTPS
2003
Springer
14 years 28 days ago
2003
Springer
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
OPODIS
2010
13 years 5 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...