In this paper we deal with the problem of designing virtual path, layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbi-trary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in planax graphs and graphs with bounded treewidth.
展开▼
