Abstract
This paper studies the problem of configuring a hierarchical network routing system, with the objective to optimize its performance. The problem is concerned with optimally partitioning the network routing system into a hierarchy of routing nodes, which are grouped and distributed onto the underlying network. Obtaining an optimal configuration means the minimization of the processing cost (time, memory space, and inter-node communication). The solution to this problem is dependent on the network type, network topology and routing algorithms, and it can be shown that this problem in general is NP-complete. We first describe a general model for optimal configuration of a hierarchical network routing system. Then we identifying and discuss several basic heuristics for finding a near-optimal configuration. We also report our on-going study of specific network topologies, e.g., the tree-structured topology, for which efficient algorithms may exist for configuring the hierarchical routing nodes to optimality.
| Original language | English |
|---|---|
| Pages (from-to) | 249-254 |
| Number of pages | 6 |
| Journal | Canadian Conference on Electrical and Computer Engineering |
| Volume | 1 |
| Publication status | Published - 1 Dec 1999 |
| Event | 1999 IEEE Canadian Conference on Electrical and Computer Engineering 'Engineering Solutions for the Next Millennium' - Edmonton, Alberta, Canada Duration: 9 May 1999 → 12 May 1999 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering