Path Switching - A Quasi-Static Routing Scheme for Large-Scale ATM Packet Switches

A quasi-static routing scheme called path switching for large-scale ATM packet switch systems is proposed. Previously the Clos network has been used as the model for many large-scale ATM switch architectures, in which the most difficult issue is path and bandwidth assignment for each connection request. The static routing scheme, such as multirate circuit switching, does not fully exploit the statistical multiplexing gain. In contrast, the dynamic routing scheme, such as straight matching, requires slot-by-slot computation of route assignment. Path switching is a compromise of these two routing schemes. It uses a predetermined periodical connection pattern in the central stage, look-ahead selection in the input stage, and output queueing in the last stage. The scheduling of path switching consists of capacity assignment and route assignment. The capacity assignment is constrained by the quality of service of connection requests. The route assignment is based on the timespace interleaving of the coloring of bipartite multigraphs. We show that path switching can handle multirate and multimedia traffic effectively in the Clos network.

[1]  Leon S. Lasdon,et al.  Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems , 1978 .

[2]  Anthony S. Acampora,et al.  The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching , 1987, IEEE J. Sel. Areas Commun..

[3]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[4]  Mark J. Karol,et al.  A growable packet (ATM) switch architecture: design principles and applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[5]  B. Grigelionis,et al.  On the Convergence of Sums of Random Step Processes to a Poisson Process , 1963 .

[6]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[7]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[8]  Robin J. Wilson.  Introduction to Graph Theory , 1974 .

[9]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[10]  Alan Huang,et al.  Starlite: a wideband digital switch , 1991 .

[11]  Jean C. Walrand,et al.  Resource Management in Wide-Area ATM Networks Using Effective Bandwiths , 1995, IEEE J. Sel. Areas Commun..

[12]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[13]  Kai Y. Eng,et al.  A growable packet (ATM) switch architecture: design principles and application , 1992, IEEE Trans. Commun..

[14]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[15]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[16]  Robert J. McEliece,et al.  Introduction to Discrete Mathematics , 1989 .

[17]  Jonathan S. Turner,et al.  Nonblocking multirate distribution networks , 1993, IEEE Trans. Commun..

[18]  David G. Cantor,et al.  On non-blocking switching networks , 1971, Networks.

[19]  San-qi Li,et al.  On the convergence of traffic measurement and queueing analysis: a Statistical-MAtch Queueing (SMAQ) tool , 1995, Proceedings of INFOCOM'95.

[20]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[21]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .