Path switching - A quasi-static routing scheme for large-scale ATM packet switches

IEEE Journal on Selected Areas in Communications

Volumn 15, Issue 5, 1997, Pages 914-924

  Lee, T T ^a   Lam, C H ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NONE

Author keywords

Asynchronous transfer mode; Bipartite multigraph; Clos network; Multimedia; Quality of service; Quasi static; Statistical multiplexing gain; Switching; Time space interleaving

Indexed keywords

MULTIPLEXING; PACKET NETWORKS; QUALITY CONTROL; SCHEDULING; SWITCHES; SWITCHING;

PATH SWITCHING;

ASYNCHRONOUS TRANSFER MODE;

EID: 0031169829     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.594852     Document Type: Article

References (25)

1. D. Anick, D. Mitra, and M. M. Sondhi, "Stochastic theory of a datahandling system with multiples sources," Bell Syst. Tech. J., vol. 61, pp. 1871-1894, 1982.
2. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
3. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
4. D. G. Cantor, "On non-blocking switching networks," Networks, vol. 1, pp. 367-377, Winter 1971.
5. C. Clos, "A study of non-blocking switching networks," Bell Syst. Tech. J., vol. 32, pp. 406-424, Mar. 1953.
6. K. Y. Eng, M. J. Karol, and Y. S. Yen, "A growable packet (ATM) switch architecture: Design principles and applications," in Proc. IEEE GLOBECOM'89.
7. M. Frank and P. Wolfe, "An algorithm for quadratic programming," Nav. Res. Logist. Quart., vol. 3, pp. 95-110, 1956.
8. B. V. Gredenko, The Theory of Probability, 4th ed. New York: Chelsea, 1967, pp. 425-432.
9. B. Grigelionis, "On the convergence of sums of step stochastic processes to a poisson process," Theory Prob. Appl., vol. 8, no. 2, 1963.
10. R. Guérin, H. Ahmadi, and M. Naghshineh, "Equivalent capacity and its application to bandwidth allocation in high-speed networks," IEEE J. Select. Areas Commun., vol. 9, pp. 968-981, Sept. 1991.
11. F. S. Hillier and G. J. Lieberman, Introduction to Operations Research, 5th ed. New York: McGraw-Hill, 1990.
12. A. Huang and S. Knauer, "Starlite: A wideband digital switch," in Proc. IEEE GLOBECOM'84, pp. 121-125.
13. C. L. Hwang and S. Q. Li, "On the convergence of traffic measurement and queueing analysis: A statistical-match queueing (SMAQ) tool," in Proc. IEEE INFOCOM'95, 1995, pp. 602-612.
14. J. Y. Hui, "Resource allocation for broadband networks," IEEE J. Select. Areas Commun., vol. 6, pp. 358-368, Dec. 1988.
15. S. Karlin and H. M. Taylor, A First Course in Stochastic Processes, 2nd ed. New York: Academic, 1975, pp. 221-226.
16. A. Kershenbaum, Telecommunications Network Design Algorithm. New York: McGraw-Hill, 1993.
17. L. S. Lasdon and A. D. Warren, "Generalized reduced gradient software for linearly and nonlinearly constrained problems," in Design and Implementation of Optimization Software. Alphen aan den Rijn, The Netherlands: Sijthoff and Noordhoff, 1978.
18. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes. Los Altos, CA: Morgan Kaufmann, 1992.
19. T. T. Lee and S. Y. Liew, "Parallel algorithm for benes networks," in Proc. IEEE INFOCOM'96.
20. R. J. McEliece, R. B. Ash, and C. Ash, Introduction to Discrete Mathematics. New York: McGraw-Hill, 1989.
21. R. Melen and J. S. Turner, "Nonblocking multirate distribution networks," IEEE Trans. Commun., vol. 41, pp. 362-369, Feb. 1993.
22. Traffic Management Specification, ATM Forum, Ver. 4.0, 1995.
23. G. de Veciana, G. Kesidis, and J. Walrand, "Resource management in wide-area ATM networks using effective bandwidths," IEEE J. Select. Areas Commun., vol. 13, pp. 1081-1090, Aug. 1995.
24. R. J. Wilson, Introduction to Graph Theory. New York: Academic, 1972.
25. Y. S. Yeh, M. G. Hluchyj, and A. S. Acampora, "The knockout switch: A simple architecture for high-performance packet switching," IEEE J. Select. Areas Commun., vol. SAC-5, pp. 1274-1283, Oct. 1987.