AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Advances in Switching Networks
About this Title
Ding-Zhu Du, University of Minnesota, Minneapolis, MN and Frank K. Hwang, National Chiao Tung University, Hsinchu, Taiwan, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1998; Volume 42
ISBNs: 978-0-8218-0831-3 (print); 978-1-4704-4000-8 (online)
DOI: https://doi.org/10.1090/dimacs/042
MathSciNet review: MR1630356
MSC: Primary 94-06; Secondary 68M10, 94C10
ReadershipTable of Contents
Front/Back Matter
Chapters
- Average-case bounds for the complexity of path-search
- Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
- Constructing nonblocking multicast switching networks with fanout reduction
- Multirate broadcast switching networks nonblocking in a wide sense
- Repackable networks–The concept and applications
- Modeling the blocking behavior of Clos networks
- Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions
- Non-blocking multistage interconnection networks with limited depth
- Isomorphism of classical rearrangeable networks
- Characterizing bit permutation networks
- Structure and density of sparse crossbar concentrators
- Non-blocking routing properties of Clos networks
- An algorithm for the construction of concentrators from 2 x 2 sorters
- Strictly nonblocking conferencing meshes
- An $O(N^{1.695})$ permutation routing algorithm on augmented data manipulators
- Preventing conflicts in input buffering baseline-based ATM switches
- Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications
- Multispace search for quorumcast routing
- On 3-rate rearrangeability of Clos networks