15 search results - page 2 / 3 » Routing in undirected graphs with constant congestion |
102
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
113
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
113
Voted
SIROCCO
2007
15 years 2 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
106
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
116
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...