Abstract
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks,we investigate the problem of designing a virtual topology on a physical topology, which consists of finding a set of virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). For particular network: paths,w e give tight bounds on the network capacity (the maximum load of a physical link) as a function of the virtual diameter (the maximum hop count for each connection).
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
W. Aiello, S. N. Bhatt, F. R. K. Chung, A. L. Rosenber, and R. K. Sitaraman. Augmented ring networks. Technical Report UM-CS-1997-036, University of Massachusetts, Amherst, Computer Science, June, 1997.
Becchetti and Gaibisso. Lower bounds for the virtual path layout problem in ATM networks. In Theory and Practice of Informatics, Seminar on Current Trends in Theory and Practice of Informatics, LNCS, volume 24. 1997.
J-C. Bermond, N. Marlin, D. Peleg, and S. Perennes. Directed Virtual Path layout in ATM networks. In Proc. of the 12 th International Conference on Distributed Computing, Andros Greece, 1998. LNCS 1499, pages 75–88.
J-C. Bermond, N. Marlin, D. Peleg, and S. Perennes. Virtual Paths Layout with Low Congestion or Low Diameter in ATM Networks. In 1ére rencontre francophone… ALGOTEL’ 99, Mai 1999.
Pascal Chanas. Dimensionnement de réseaux ATM. PhD thesis, CNET Sophia, Sept. 1998.
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. In 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pages 527–537. Springer-Verlag, 1997.
M. Feighlstein and S. Zaks. Duality in chain ATM virtual path layouts. In 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Monte Verita, Ascona, Switzerland, July 1997.
G. Gauyacq. Routages uniformes duns les graphes sommet-transitifs. PhD thesis, Université Bordeaux I, 1995.
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.
Ornan Gerstel, Israel Cidon, and Shmuel Zaks. Optimal Virtual Path Layout in ATM Networks with Shared Routing Table Switches. Chicago Journal of Theoretical Computer Science, 1996(3), October 1996.
O. Gerstel, A. Wool, and S. Zaks. Optimal Layouts on a Chain ATM Network. In 3rd Annual European Symposium on Algorithms, volume LNCS 979, pages 508–522. Springer Verlag, 1995.
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, pages 508–522, 1995. To appear in Discrete Applied Mathematics.
Ornan Gerstel and Shmuel Zaks. The virtual path layout problem in fast networks. In Symposium on Principles of Distributed Computing (PODC’ 94), pages 235–243, New York, USA, August 1994. ACM Press.
D. Kofman and M. Gagnaire. Rétseaux haut debit, reseaux ATM, reseaux locaux et reseaux tout-optiques. InterEditions-Masson, 1998.
E. Kranakis, D. Krizanc, and A. Pelc. Hop-congestion trade-offs for high-speed networks. International Journal of Foundations of Computer Science, 8:117–126, 1997.
J-C. Meyer, M-C. Heydemann, and D. Sotteau. On Forwarding indices of networks. Discrete Applied Mathematics 23:103–123, 1989.
M. De Pricker. Asynchronous Transfer Mode, Solution for Broadband ISDN. Prentice Hall, August 1995.
L. Stacho and I. Vrt’o. Virtual path layouts in atm networks. In Structure, Information and Communication Complexity, 3rd Colloquium, SIROCCO, pages 2699278. Carleton University Press, 1996.
S. Zaks. Path Layout in ATM Networks — A Survey. In The DIMACS Workshop on Networks in Distributed Computing, DIMACS Center, Rutgers University, Oct. 1997. manuscript.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choplin, S. (2001). Virtual Path Layout in ATM Path with Given Hop Count. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_52
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive