| Hardcover ISBN: | 978-0-8218-0831-3 |
| Product Code: | DIMACS/42 |
| List Price: | $102.00 |
| MAA Member Price: | $91.80 |
| AMS Member Price: | $81.60 |
| eBook ISBN: | 978-1-4704-4000-8 |
| Product Code: | DIMACS/42.E |
| List Price: | $96.00 |
| MAA Member Price: | $86.40 |
| AMS Member Price: | $76.80 |
| Hardcover ISBN: | 978-0-8218-0831-3 |
| eBook: ISBN: | 978-1-4704-4000-8 |
| Product Code: | DIMACS/42.B |
| List Price: | $198.00 $150.00 |
| MAA Member Price: | $178.20 $135.00 |
| AMS Member Price: | $158.40 $120.00 |
| Hardcover ISBN: | 978-0-8218-0831-3 |
| Product Code: | DIMACS/42 |
| List Price: | $102.00 |
| MAA Member Price: | $91.80 |
| AMS Member Price: | $81.60 |
| eBook ISBN: | 978-1-4704-4000-8 |
| Product Code: | DIMACS/42.E |
| List Price: | $96.00 |
| MAA Member Price: | $86.40 |
| AMS Member Price: | $76.80 |
| Hardcover ISBN: | 978-0-8218-0831-3 |
| eBook ISBN: | 978-1-4704-4000-8 |
| Product Code: | DIMACS/42.B |
| List Price: | $198.00 $150.00 |
| MAA Member Price: | $178.20 $135.00 |
| AMS Member Price: | $158.40 $120.00 |
-
Book DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 42; 1998; 333 ppMSC: Primary 05
The articles collected in this book were presented at the DIMACS Workshop on Network Switching, held in July 1997 at Princeton University. These papers cover a variety of issues related to network switching, including network environment, routing, network topology, switching components, nonblockingness, and optimization.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
ReadershipResearch mathematicians and graduate students interested in discrete math and graph theory; computer scientists; electronic engineers.
-
Table of Contents
-
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
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
The articles collected in this book were presented at the DIMACS Workshop on Network Switching, held in July 1997 at Princeton University. These papers cover a variety of issues related to network switching, including network environment, routing, network topology, switching components, nonblockingness, and optimization.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Research mathematicians and graduate students interested in discrete math and graph theory; computer scientists; electronic engineers.
-
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
