177 search results - page 5 / 36 » Stackelberg Routing in Arbitrary Networks |
ICDCS
2012
IEEE
11 years 10 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...
SPAA
2005
ACM
14 years 1 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...
INFOCOM
2009
IEEE
14 years 2 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-...
ICPP
1992
IEEE
13 years 11 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...
INFOCOM
2009
IEEE
14 years 2 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...