177 search results - page 17 / 36 » Stackelberg Routing in Arbitrary Networks |
ICNP
2000
IEEE
14 years 2 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
SIGECOM
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
ANCS
2010
ACM
13 years 8 months ago
2010
ACM
: Ensemble Routing For Datacenter Networks Mike Schlansker, Yoshio Turner, Jean Tourrilhes, Alan Karp HP Laboratories HPL-2010-120 Networks, Ethernet, Multipath, Switching, Fault ...
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...