2926 search results - page 68 / 586 » Partially Optimal Routing |
123
click to vote
ISCA
2005
IEEE
15 years 6 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
106
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
115
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
182
Voted
VLDB
2008
ACM
16 years 28 days ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
95
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—We present an interdomain routing protocol for heterogeneous networks employing different queuing service disciplines. Our routing protocol finds optimal interdomain paths with ...