Summary. In this paper we introduce and analyze two new cost measures related to the communication overhead and the space requirements associated with virtual path layouts in ATM networks, that is the edge congestion and the node congestion. Informally, the edge congestion of a given edge e at an incident node u is defined as the number of VPs terminating at or starting from u and using e, while the node congestion of a node v is defined as the number of VPs having v as an endpoint. We investigate the problem of constructing virtual path layouts allowing to connect a specified root node to all the others in at most h hops and with maximum edge or node congestion c, for two given integers h and c. We first give tight results concerning the time complexity of the construction of such layouts for both the two congestion measures, that is we exactly determine all the tractable and intractable cases. Then, we provide some combinatorial bounds for arbitrary networks, together with optimal layouts for specific topologies such as chains, rings and grids.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 1997 / Accepted: August 2000
Rights and permissions
About this article
Cite this article
Flammini, M., Nardelli, E. & Proietti, G. ATM layouts with bounded hop count and congestion. Distrib Comput 14, 65–73 (2001). https://doi.org/10.1007/PL00008929
Issue Date:
DOI: https://doi.org/10.1007/PL00008929