AMS Bookstore LOGO amslogo
AMS TextbooksAMS Applications-related Books
Robust Communication Networks: Interconnection and Survivability
Edited by: Nathaniel Dean, Rice University, Houston, TX, D. Frank Hsu, Fordham University, Bronx, NY, and R. Ravi, Carnegie Mellon University, Pittsburgh, PA
A co-publication of the AMS and DIMACS.
SEARCH THIS BOOK:

DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
2000; 167 pp; hardcover
Volume: 53
ISBN-10: 0-8218-1546-6
ISBN-13: 978-0-8218-1546-5
List Price: US$45
Member Price: US$36
Order Code: DIMACS/53
[Add Item]

Request Permissions

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.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Readership

Researchers and practitioners working in communications networks.

Table of Contents

  • A. Bley, M. Grötschel, and R. Wessäly -- Design of broadband virtual private networks: Model and heuristics for the B-WiN
  • J. Cohen, P. Fraigniaud, and M. Mitjana -- Minimal contention-free matrices with application to multicasting
  • S. K. Das, S. R. Öhring, and M. Ibel -- Communication aspects of fat-tree-based interconnection networks for multicomputers
  • L. Gao, B. Li, and F. Chen -- Optimal placement of repair servers for reliable multicast
  • P. Krishnan, D. Raz, and Y. Shavitt -- Transparent en-route cache location for regular networks
  • Y. Mansour and D. Peleg -- An approximation algorithm for minimum-cost network design
  • Y. Yang -- Nonblocking and almost nonblocking multicast switching networks
  • S. Q. Zheng -- Constructing optical networks using combinatorial designs
  • S. G. Ziavras and Q. Wang -- Robust interprocessor connections for very-high performance
Powered by MathJax

  AMS Home | Comments: webmaster@ams.org
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia