9780792369530 - Switching Networks: Recent Advances (Network Theory and Applications, Band 5) (4 Ergebnisse)

Zustand: New. In.

Gebunden. Zustand: New. Foreword. Fault-tolerance for Switching Networks J.D. Carpinelli, H. Nassar. Switching Networks for Generating Random Permutations A. Czumaj, et al. Optical and Optoelectronic Interconnection Networks S. Sahni. Wide-sense Nonblocking of 3-stage Clos .

Zustand: New. Contains various developments in switching networks and applications, including classic topics, such as nonblocking and Benes conjecture, and different directions, such as optical switching networks and applications in VLSI designs. This title provides the advances for researchers in computer networks and applied mathematics. Series: Network Theory and Applications. Num Pages: 357 pages, biography. BIC Classification: PBV; UT. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 20. Weight in Grams: 1530. . 2001. Hardback. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Neuware - The switching net.work is an important. classic research area in t.ele communication and comput.er net.works. It.s import.ancc st.ems from both theory and practice. In fact, some open problems, such as Benes conjec ture on shuffle-exchange networks and Chung-Rmis conjecture on multi rate rearrangeability, still attract many researchers and the further de velopment in optical networks requires advanced technology in optical switching networks. In 1997, we had a workshop in switching networks held in NSF Sci ence and Technology Center in Discrete Mathematics and Theoretical Computer Science (DIMACS), at Princeton University. This workshop was very successful. Many participants wished to have a similar activity every two or three years. This book is a result of such a wish. We are putting together SOllle important developments in this area during last. several years, including articles ill fault-tolerance, rearrang{~ability. non blocking, optical networks. random permutation generat.ioll. and layout complexity. SOlllC of thos(~ art ides are research papers alld SOIllC an' sur veys. All articles were reviewed. We would like to uWlItioll two special problems studied in those articles.