Abstract
This paper studies the average hop count measure for virtual path layouts of ATM and optical networks.Routing in the ATM and optical network models is based on covering the network with simple virtual paths, under some constraints on the allowed load (i.e., the number of paths that can share an edge).The hop count is the number of edges along the virtual path.
Two basic results are established concerning the average hop count parameter. The first concerns comparing the maximum and average hop count measures assuming uniform all-to-all communication requirements. We develop a rather general connection between the two measures for virtual path layouts with bounded maximum load.This connection allows us to extend known lower bounds on the maximum hop count into ones on the average hop count for network families satisfying certain conditions, termed non-condensingly contractable (NCC) graph families. Using this characterization, we establish tight lower bounds on the average hop count of virtual path layouts with bounded maximum load for paths, cycles, and trees.
Our second result is an algorithm for designing a virtual path layout of minimum average hop count for a given tree network with general (weighted) one-to-all requirements.
Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, 76100 Israel. peleg@wisdom.weizmann.ac.il.Supp orted in part by a grant from the Israel Ministry of Science and Art.
Department of Mathematics and Computer Science, Bar Ilan University, Ramat Gan 52900, Israel. uripinch@macs.biu.ac.il
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, A. Bar-Noy, N. Linial and D. P eleg, Compact distributed data structures for adaptive routing, Proc. 21st ACM Symp. on Theory ofComputing, Seattle, Washington, pp.479–489, May 1989.
B. Awerbuch and D. Peleg, Routing with polynomial communication-space tradeoff, SIAM Journal on Discrete Mathematics, Vol.5, No.2, pp.151–162, 1992.
S. Ahn, R.P. Tsang, S.R. Tong and D.H.C. Du, Virtual path layout design on ATM networks, Proc. IEEE INFOCOM’94, pp.192–200, 1994.
L. Becchetti, P. Bertolazzi, C. Gaibisso and G. Gambosi, On the design of efficient ATM routing schemes, manuscript 1997.
J. Burgin and D. Dorman, Broadband ISDN resource management: The role of virtual paths, IEEE Communications Magazine, 29, 1991.
J.C. Bermond, N. Marlin, D. Peleg and S. Perennes, Directed Virtual Path Layouts in ATM networks, Proc. 12th Int. Symp. on Distributed Computing,, Andros, Greece, pp.75–88, Oct. 1998.
P. Chanas and O. Goldschmidt, Conception de réseau de VP de diamétre minimum pour les réseaux ATM, Road-f’98, pp.38–40, 1998.
I Cidon, O. Gerstel and S. Zaks, A scalable approach to routing in ATM networks, Proc. 8th Int. Workshop on Distributed Algorithms (WDAG), LNCS 857, Springer Verlag, Terschelling, The Netherlands, pp.209–222, October 1994.
R. Cohen and A. Segall, Connection management and rerouting in ATM networks, Proc. IEEE INFOCOM’94, pp.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, Proc. 24th Int. Colloq. on Automata, Languages and Programming (ICALP), LNCS 1256, Springer-Verlag, pp.527–537, 1997.
M. Feighlstein and S. Zaks, Duality in chain ATM virtual path layouts, Proc. 4th Int. Colloq. on Structural Information and Communication Complexity (SIROCCO), Monte Verita, Ascona, Switzerland, July 1997.
O. Gerstel, The Virtual Path Design in ATM Networks, PhD thesis, Department of Computer Science, Technion, Haifa, Israel, December 1995.
O. Gerstel, I. Cidon and S. Zaks, The layout of virtual path in ATM networks, IEEE Transactions on Networking, 4(6):873–884, 1996.
O. Gerstel, A. Wool and S. Zaks, Optimal layouts on a chain ATM network, Discrete Applied Mathematics, 83:157–178, 1998.
O. Gerstel and S. Zaks, The virtual path layout problem in fast networks, Proc. 13th ACM Symp. on Principles ofDistribute d Computing (PODC), Los Angeles, CA, U.S.A., pp. 235–243, August 1994.
R. Händler and M.N. Huber, Integrated Broadland Networks: an introduction to ATM-based networks, Adisson-Wesley, 1991.
ITU recommendation, I series (B-ISDN), Blue Book, November 1990.
E. Kranakis, D. Krizanc and A. Pelc, Hop-congestion tradeoffs for high-speed networks, Int. Journal ofF oundations ofComputer Science, 8, 1997.
F.Y.S. Lin and K.T. Cheng, Virtual path assignment and virtual circuit routing in ATM networks, Proc. IEEE GLOBECOM’93, pp.436–441, 1993.
C. Partridge, Gigabit Networking, Adisson Wesley, 1994.
K.I. Sato, S. Ohta and I. Tokizawa, Broadband ATM network architecture based on virtual paths, IEEE Transactions on Communications, Vol.38, No.8, pp.1212–1222, August 1990.
Y. Sato and K.I. Sato, Virtual path and link capacity design for ATM networks, IEEE, Journal ofSele cted Areas in Communications, Vol.9, 1991.
S. Zaks, Path Layout in ATM networks-a survey, The DIMACS Workshop on Networks in Distributed Computing, DIMACS Center, Rutgers University, October 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D., Pincas, U. (2001). The Average Hop Count Measure For Virtual Path Layouts. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_18
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive