Reliability of computer and communication networks : proceedings of a DIMACS Workshop, December 2-4, 1989
著者
書誌事項
Reliability of computer and communication networks : proceedings of a DIMACS Workshop, December 2-4, 1989
(DIMACS series in discrete mathematics and theoretical computer science, v. 5)
American Mathematical Society : Association for Computing Machinery, 1991
- : AMS
- : ACM
大学図書館所蔵 全20件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
Reliability problems arise with increasing frequency as our systems of telecommunications, information transmission, transportation, and distribution become more and more complex. In December 1989 at DIMACS at Rutgers University, a Workshop on Reliability of Computer and Communication Networks was held to examine the discrete mathematical methods relevant to these problems. There were nearly ninety participants, including theoretical mathematicians, computer scientists, and electrical engineers from academia and industry, as well as network practitioners, engineers, and reliability planners from leading companies involved in the use of computer and communications networks. This volume, published jointly with the Association for Computing Machinery, contains the proceedings from this Workshop. The aim of the Workshop was to identify the latest trends and important open problems, as well as to survey potential practical applications.The Workshop explored questions of computation of reliability of existing systems and of creating new designs to insure high reliability, in addition to the closely related notion of survivability. Redundancy, single stage and multistage networks, interconnected networks, and fault tolerance were also covered. The Workshop emphasized practical applications, with many invited speakers from a variety of companies which are dealing with practical network reliability problems. The success of the Workshop in fostering many new interactions among researchers and practitioners is reflected in the proceedings, which provide an exciting look at some of the major advances at the forefront of this important field of research.
目次
Robust design of dynamic routing networks by G. R. Ash Graph searching, path-width, tree-width and related problems (A survey) by D. Bienstock On residual connectedness network reliability by F. Boesch, A Satyanarayana, and C. Suffel Survivable fiber network design by R. H. Cardwell Decomposable probabilisitic influence diagrams by C. C. Chyu Bounding network parameters by approximating graphs by C. J. Colbourn and E. I. Litvak The optimal multiterminal cut problem by W. H. Cunningham Polyhedral approaches to network survivability by M. Grotschel, C. Monma, and M. Stoer A survey on double loop networks by F. K. Hwang Quantitative reliability analysis of redundant multistage interconnection networks by N. M. Kini, A. Kumar, and D. P. Agrawal An axiomatic characterization of the reliability polynomial by R. P. McLean and D. H. Blair Fault-tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties) by D. K. Pradhan The use of binomial moments for bounding network reliability by A. Prekopa, E. Boros, and K.-W. Lih Boolean decomposition schemes and the complexity of reliability computations by J. S. Provan On dynamic full access in multistage interconnection networks by C. S. Raghavendra and M. A. Sridhar Algebraic methods for bounding network reliability by D. R. Shier.
「Nielsen BookData」 より