48 search results - page 1 / 10 » Static and Dynamic Low-Congested Interval Routing Schemes |
ICALP
1998
Springer
13 years 8 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
INFOCOM
2005
IEEE
13 years 10 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...
WG
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
SIROCCO
1998
13 years 5 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...