1578 search results - page 7 / 316 » Direct Routing: Algorithms and Complexity |
IADIS
2003
13 years 10 months ago
2003
The key features of the principal interior routing protocols for large systems are considered and compared, and the major weaknesses of the open standards noted. A proposal is giv...
ICMCS
2000
IEEE
14 years 29 days ago
2000
IEEE
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
ISPD
2003
ACM
14 years 1 months ago
2003
ACM
Design rules in advanced IC manufacturing processes are increasingly problematic for modern router architectures and algorithms. This paper first reviews types and causes of “d...
TON
2008
13 years 8 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
CAL
2004
13 years 8 months ago
2004
We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most...