Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
Please make all selections above before adding to cart
Advances in Switching Networks
A co-publication of the AMS and DIMACS
Available Formats:
Hardcover ISBN: 978-0-8218-0831-3
Product Code: DIMACS/42
List Price: $97.00
MAA Member Price: $87.30
AMS Member Price: $77.60
Electronic ISBN: 978-1-4704-4000-8
Product Code: DIMACS/42.E
List Price: $91.00
MAA Member Price: $81.90
AMS Member Price: $72.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
Click above image for expanded view
Advances in Switching Networks
A co-publication of the AMS and DIMACS
Available Formats:
| Hardcover ISBN: | 978-0-8218-0831-3 |
| Product Code: | DIMACS/42 |
| List Price: | $97.00 |
| MAA Member Price: | $87.30 |
| AMS Member Price: | $77.60 |
| Electronic ISBN: | 978-1-4704-4000-8 |
| Product Code: | DIMACS/42.E |
| List Price: | $91.00 |
| MAA Member Price: | $81.90 |
| AMS Member Price: | $72.80 |
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
-
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.
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
-
-
Request Review Copy
- Book Details
- Table of Contents
-
- Request Review Copy
Volume: 42; 1998; 333 pp
MSC: 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.
Readership
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
Please select which format for which you are requesting permissions.