Robust Communication Networks: Interconnection and Survivability ( DIMACS - Series in Discrete Mathematics and Theoretical Computer Science )

Publication series :DIMACS - Series in Discrete Mathematics and Theoretical Computer Science

Author: Nathaniel Dean;D. Frank Hsu;R. Ravi  

Publisher: American Mathematical Society‎

Publication year: 2017

E-ISBN: 9781470440114

P-ISBN(Paperback): 9780821815465

Subject: O1 Mathematics

Keyword: 暂无分类

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Robust Communication Networks: Interconnection and Survivability

Description

This volume contains the proceedings of a DIMACS Workshop on Robust Communication Networks held as part of the Special Year on Networks. Theoreticians and practitioners presented papers on the roles of architectural interconnection and survivability in the design, construction, operation, and application of robust communication networks. Due to the advent of VSLI and fiber optics technologies, it has become possible and feasible to design and construct large scale, high performance, high speed wireline and wireless communication networks that are also robust. This opens many challenging issues and problems for both the theory community and practitioners. Of particular interest is how these technological advances lead the way to new and challenging mathematical frontiers and set the direction for future research on and implementation of robust communication networks. The nine papers chosen for this volume represent the state of the art from a variety of perspectives.

Chapter

Title page

Contents

Foreword

Preface

Design of broadband virtual private networks: Model and heuristics for the B-WiN

Minimal contention-free matrices with application to multicasting

Communication aspects of fat-tree-based interconnection networks for multicomputers

Optimal placement of repair servers for reliable multicast

Transparent en-route cache location for regular networks

An approximation algorithm for minimum-cost network design

Nonblocking and almost nonblocking multicast switching networks

Constructing optical networks using combinatorial designs

Robust interprocessor connections for very-high performance

Back Cover

The users who browse this book also browse