Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fault tolerant networks with small degree
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Proceedings of the 2003 ACM symposium on Applied computing
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Extremal Graph Theory
Topological optimization of the large-scale data transmission networks
Automation and Remote Control
Multilevel network characterization using regular topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: Topological network design: A survey
Journal of Network and Computer Applications
Minimizing hierarchical routing error
Computer Networks: The International Journal of Computer and Telecommunications Networking
Regular topologies application on multilevel networks
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
| Hi-index | 0.00 |
We present a hierarchical solution method to approximately solve the topological network design problem: given positive integers (n, d, Δ), minimize the number of arcs required to interconnect n nodes, so that the network diameter does not exceed d, the maximum node degree does not exceed Δ, and the network is single node survivable. The method uses dynamic programming to piece together small networks to create larger networks. The method was used to plan two high-speed packet networks at AT&T.