177 search results - page 5 / 36 » Stackelberg Routing in Arbitrary Networks |
250
Voted
ICDCS
2012
IEEE
13 years 6 months ago
2012
IEEE
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
134
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
127
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
125
Voted
ICPP
1992
IEEE
15 years 7 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
122
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic nature of the infrastructure. In this paper, we d...