Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
Purchase Benefits
What is included with this book?
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 | |
Table of Contents provided by Publisher. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.