Please use this identifier to cite or link to this item:
Title: Optimal configuration in hierarchical network routing
Authors: Cao, J 
Zhang, F
Issue Date: 1999
Publisher: IEEE
Source: Canadian Conference on Electrical and Computer Engineering, 1999, v. 1, p. 249-254 How to cite?
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.
Description: 1999 IEEE Canadian Conference on Electrical and Computer Engineering 'Engineering Solutions for the Next Millennium', Edmonton, Alberta, Can, 9-12 May 1999
ISSN: 0840-7789
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 13, 2018

Page view(s)

Last Week
Last month
Citations as of Dec 9, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.