Interconnection Networks - 1st Edition - ISBN: 9780444893420, 9781483295275

Interconnection Networks, Volume 5

1st Edition

Editors: J.-C. Bermond
eBook ISBN: 9781483295275
Imprint: North Holland
Published Date: 21st August 1992
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

New (&Dgr;D) Graphs Discovered by Heuristic Search. Transmitting in the n-Dimensional Cube. A Survey of Integrity. Connections between Two Cycles - A New Design of Dense Processor Interconnection Networks (INs). Design and Analysis of Fault-Tolerant Multibus INs. Dense Group Networks. Graphs with Small Diameter After Edge Deletion. New Methods for Using Cayley Graphs in INs. Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems. The Forwarding Index of Communication Networks with Given Connectivity. Examples of Products Giving Large Graphs with Given Degree and Diameter. Connectivity of Consecutive-d Digraphs. Generalized Degrees and Menger Path Systems. A New Look at the de Bruijn Graph. Connectivity, Persistence and Fault Diagnosis of INs based on Ok and 2Ok Graphs. Graphs on Alphabets as Models for Large INs. Analysis of Minimal Path Routing Schemes in the Presence of Faults. Changing and Unchanging the Diameter of a Hypercube. The Connectivity of Hierarchical Cayley Digraphs. Perfect Latin Squares. Forwarding Indices of k-Connected Graphs. Broadcasting and Spanning trees in the de Bruijn and Kautz Networks. Nonblocking Self-Routing Switching networks. An Improved Upper Bound for the Subarray Partial Concentrators. Diameters of Cubic Graphs. Some Large Trivalent Graphs having Small Diameters. Cost-Performance Tradeoffs for INs. Broadcasting in DMA-Bound Bounded Degree Graphs. Minimum Broadcast Digraphs. Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs. The Asymptotic Optimality of Spider-Web Networks. Heuristics for the Steiner Problem in Graphs. Product Shuffle-Networks: Towards Reconciling Shuffles and Butterflies. Generating the States of a Binary Stochastic System. The Covering Radius of Hadamard Codes in Odd Graphs. Super Edge-Connectivity of Dense Digraphs and Graphs. The Underlying Graphs of a Line Digraph. Efficient Fault-Tolerant Fixed Routing


Most of the articles in this book deal with static or point-to-point Interconnection Networks. In particular, new constructions are proposed based on different tools from discrete mathematics. Many new records have been established in the table of the maximum number of vertices of graphs with maximum degree &Dgr; and diameter D. Properties of these networks (and of more classical ones) are analyzed in many of the other papers. About 40% of the articles deal with fault tolerance or vulnerability properties using either combinatorial tools or probabilistic ones.


© North Holland 1992
North Holland
eBook ISBN:


@qu:...I would particularly recommend the book to researchers in Parallel Computing where it should find many applications. @source:European Mathematical Society Newsletter

Ratings and Reviews

About the Editors

J.-C. Bermond Editor

Affiliations and Expertise

i3S, CNRS, URA 1376, bat 4, rue A. Einstein, Sophia-Antipolis, F-06560 Valbonne, France