Optimal clustering structures for hierarchical topological design of large computer networks

DOI10.1002/net.3230100305zbMath0448.68001OpenAlexW2001518046MaRDI QIDQ3894945

Leonard Kleinrock, Farouk Kamoun

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100305

zbMATH Keywords

hierarchical clusteringhierarchical networkcomputer networksdata communicationhierarchical topological designpacket switching computer networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (6)

Communication aspects of networks based on geometric incidence relations ⋮ The complexity of routing in~hierarchical PNNI networks ⋮ Optimal layouts on a chain ATM network ⋮ Compact and localized distributed data structures ⋮ Optimal layouts on a chain ATM network ⋮ Interval routing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• An Efficient Heuristic Procedure for Partitioning Graphs

This page was built for publication: Optimal clustering structures for hierarchical topological design of large computer networks