- ホーム
- > 洋書
- > 英文書
- > Computer / General
Full Description
Suitable for researchers and graduate students in computer science, electrical engineering, and applied mathematics, this book presents a concise yet complete account of the most significant results in interconnection network theory. The authors give a mathematical classification and characterization of the key interconnection functions of networks and establish their switching factor complexities using combinatorial methods. The text leads readers through the historical development, covering major contributions from Shannon, Clos, Benes, Cantor, Pinsker, and Margulis. It also explores recent results, such as quantum switching networks.
Contents
Complexity of Interconnection Networks-Claude Shannon's Influence. Three-Stage Networks-Charles Clos's Intuition. Heterogeneous Nonblocking Networks-David G. Cantor's Brilliance. Optimal Nonblocking Networks-Mark S. Pinsker's Genius. Expanders-Gregory Margulis's Mathematical Rigor. Building Paths in Interconnection Networks. Packet Switching in Interconnection Networks.
