Abstract
In this paper we consider two new cost measures related to the communication overhead and the space requirements associated to 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 or starting from e at u, 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, grids and tori. Extensions to d-dimensional grids and tori with d > 2 are also discussed.
Work supported by the EU TMR Research Training Grant N. ERBFMBICT960861, by the EU ESPRIT Long Term Research Project ALCOM-IT under contract N. 20244 and by the Italian MURST 40% project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Alm, R.P. Tsang, S.R. Tong, and D.H.C. Du. Virtual path layout designon ATM networks. In INFOCOM'94, pages 192–200, 1994.
J. Burgin and D. Dorman. Broadband ISDN resource management: The role of virtual paths. IEEE Communicatons Magazine, 29, 1991.
I. Cidon, O. Gerstel, and S. Zaks. A scalable approach to routing in ATM networks. In G. Tel and P.M.B. Vitányi, editors, 8th International Workshop on Distributed Algorithms (LNCS 857), pages 209–222, Terschelling, The Netherlands, October 1994. Submitted for publication in IEEE/ACM Trans. on Networking.
R. Cohen and A. Segall. Connection management and rerouting in ATM networks. In INFOCOM'94, pages 184–191, 1994.
T. Eilam, M. Flammini, and S. Zaks. A complete characterization of the path layout construction problem for ATM networks with given hop count and load. To appear in the Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP), 1997.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
O. Gerstel, I. Cidon, and S. Zaks. The layout of virtual paths in ATM networks. IEEE/ACM Transactions on Networking, 4(6):873–884, 1996.
O. Gerstel, A. Wool, and S. Zaks. Optimal layouts on a chain ATM network. In 3rd Annual European Symposium on Algorithms (ESA), (LNCS 979), Corfu, Greece, September 1995, pages 508–522. To appear in Discrete Applied Mathematics.
O. Gerstel and S. Zaks. The virtual path layout problem in fast networks. In 13th ACM Symp. on Principles of Distributed Computing, pages 235–243, Los Angeles, USA, August 1994.
R. Händler and M.N. Huber. Integrated Broadband Networks: an introduction to ATM-based networks. Addison-Wesley, 1991.
ITU recommendation. I series (B-ISDN), Blue Book, November 1990.
F.Y.S. Lin and K.T. Cheng. Virtual path assignment and virtual circuit routing in ATM networks. In GLOBCOM'93, pages 436–441, 1993.
C. Partridge. Gigabit Networking. Addison Wesley, 1994.
K.I. Sato, S. Ohta, and I. Tokizawa. Broad-band ATM network architecture based on virtual paths. IEEE Transactions on Communications, 38(8):1212–1222, August 1990.
Y. Sato and K.I. Sato. Virtual path and link capacity design for ATM networks. IEEE Journal of Selected Areas in Communications, 9, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flammin, M., Nardelli, E., Proietti, G. (1997). ATM layouts with bounded hop count and congestion. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030675
Download citation
DOI: https://doi.org/10.1007/BFb0030675
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63575-8
Online ISBN: 978-3-540-69600-1
eBook Packages: Springer Book Archive