Interconnection Networks

J.-C. Bermond

• Publisher: North Holland
• Year: 2016
• Print ISBN: 9780444893420
• eBook ISBN: 9781483295275
• Topic: Matematica
• Subtopic: Matematica discreta

Most of the articles in this book deal with static or point-to-pointInterconnection Networks. In particular, new constructions are proposed basedon different tools from discrete mathematics. Many new records have beenestablished in the table of the maximum number of vertices of graphs withmaximum degree &Dgr; and diameter D. Properties of thesenetworks (and of more classical ones) are analyzed in many of the otherpapers. About 40% of the articles deal with fault tolerance orvulnerability properties using either combinatorial tools or probabilisticones.

Table of contents

• Front Cover
• Interconnection Networks
• Copyright Page
• Table of Contents
• Foreword
• Chapter 1. New (Δ, D) graphs discovered by heuristic search
• Chapter 2. Transmitting in the n-dimensional cube
• Chapter 3. A survey of integrity
• Chapter 4. Connections between two cycles –a new design of dense processor interconnection networks
• Chapter 5. Design and analysis of fault-tolerant multibus interconnection networks
• Chapter 6. Dense group networks
• Chapter 7. Graphs with small diameter after edge deletion
• Chapter 8. New methods for using Cayley graphs in interconnection networks
• Chapter 9. Stirling networks: a versatile combinatorial topology for multiprocessor systems
• Chapter 10. The forwarding index of communication networks with given connectivity
• Chapter 11. Examples of products giving large graphs with given degree and diameter
• Chapter 12. Connectivity of consecutive-d digraphs
• Chapter 13. Generalized degrees and Menger path systems
• Chapter 14. A new look at the de Bruijn graph
• Chapter 15. Connectivity, persistence and fault diagnosis of interconnection networks based Ok and 2Ok graphs
• Chapter 16. Graphs on alphabets as models for large interconnection networks
• Chapter 17. Analysis of minimal path routing schemes in the presence of faults
• Chapter 18. Changing and unchanging the diameter of a hypercube
• Chapter 19. The connectivity of hierarchical Cayley digraphs
• Chapter 20. Perfect latin squares
• Chapter 21. Forwarding indices of k-connected graphs
• Chapter 22. Broadcasting and spanning trees in de Bruijn and Kautz networks
• Chapter 23. Nonblocking self-routing switching networks
• Chapter 24. An improved upper bound for the subarray partial concentrators
• Chapter 25. Diameters of cubic graphs
• Chapter 26. Some large trivalent graphs having small diameters
• Chapter 27. Cost-performance tradeoffs for interconnection networks
• Chapter 28. Broadcasting in DMA-bound bounded degree graphs
• Chapter 29. Minimum broadcast digraphs
• Chapter 30. Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
• Chapter 31. The asymptotic optimality of spider-web networks
• Chapter 32. Heuristics for the Steiner problem in graphs
• Chapter 33. Product-shuffle networks: toward reconciling shuffles and butterflies
• Chapter 34. Generating the states of a binary stochastic system
• Chapter 35. The covering radius of Hadamard codes in odd graphs
• Chapter 36. Super edge-connectivity of dense digraphs and graphs
• Chapter 37. The underlying graph of a line digraph
• Chapter 38. Efficient fault-tolerant fixed routings on (k+ 1)-connected digraphs
• Chapter 39. Application of coding theory to interconnection networks
• Chapter 40. Chordal rings as fault-tolerant loops
• Chapter 41. Table of large (Δ, D)-graphs
• Author Index