Switching Networks: Recent Advances

✍ Scribed by John D. Carpinelli, Hamed Nassar (auth.), Ding Zhu Du, Hung Q. Ngo (eds.)

• Publisher: Springer US
• Year: 2001
• Tongue: English
• Leaves: 362
• Series: Network Theory and Applications 5
• Edition: 1
• Category: Library

✦ Synopsis

This book contains recent developments in switching networks and applications, including classic topics, such as nonblocking and Benes conjecture, and new directions, such as optical switching networks and applications in VLSI designs. It provides the state of the art for researchers in computer networks and applied mathematics.
Audience: Researchers in computer networks and applied mathematics. The book is appropriate for use in graduate courses.

✦ Table of Contents

Front Matter....Pages i-viii
Fault-tolerance for Switching Networks....Pages 1-23
Switching Networks for Generating Random Permutations....Pages 25-61
Optical and Optoelectronic Interconnection Networks....Pages 63-88
Wide-sense Nonblocking for 3-stage Clos Networks....Pages 89-100
Study of Wide-sense Nonblocking Switching Networks from the Approach of Upper Ideals....Pages 101-116
Nonblocking Routing Properties of Clos Networks....Pages 117-141
Supporting Multicast Communication in Clos-Type Switching Networks....Pages 143-178
The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch....Pages 179-189
Periodic Shifting Networks....Pages 191-214
Analysis of Shuffle-Exchange Networks under Permutation Trafic....Pages 215-256
Remarks on Beneš Conjecture....Pages 257-258
Layout complexity of bit-permuting exchanges in multi-stage interconnection networks....Pages 259-276
Multicast Switching Networks....Pages 277-306
Notes on the Complexity of Switching Networks....Pages 307-357

✦ Subjects

Information and Communication, Circuits; Discrete Mathematics in Computer Science; Computer Communication Networks; Theory of Computation; Computer-Aided Engineering (CAD, CAE) and Design