Advances in switching networks : DIMACS workshop, July 7-9, 1997
Author(s)
Bibliographic Information
Advances in switching networks : DIMACS workshop, July 7-9, 1997
(DIMACS series in discrete mathematics and theoretical computer science, v. 42)
American Mathematical Society, 1998
Available at 17 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references
Description and Table of Contents
Description
These papers cover a variety of issues related to network switching, including network environment, routing, network topology, switching components, nonblockingness, and optimization.
Table of Contents
Average-case bounds for the complexity of path-search by N. Pippenger Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation by G. W. Richards and F. K. Hwang Constructing nonblocking multicast switching networks with fanout reduction by C.-F. Chan and C.-T. Lea Multirate broadcast switching networks nonblocking in a wide sense by D. S. Kim and D.-Z. Du Repackable networks-The concept and applications by A. Jajszczyk and M. Kubale Modeling the blocking behavior of Clos networks by Y. Yang and N. H. Kessler Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions by J. D. Carpinelli and C. B. Wang Non-blocking multistage interconnection networks with limited depth by I. Busi and A. Pattavina Isomorphism of classical rearrangeable networks by M. D. McIlroy and J. P. Savicki Characterizing bit permutation networks by G. J. Chang, F. K. Hwang, and L.-D. Tong Structure and density of sparse crossbar concentrators by E. Gunduzhan and A. Y. Oruc Non-blocking routing properties of Clos networks by T. T. Lee and P. P. To An algorithm for the construction of concentrators from 2 X 2 sorters by S.-Y. R. Li, G. M. Koo, and H. Li Strictly nonblocking conferencing meshes by Y. Du and G. M. Masson An $O(N^{1.695})$ permutation routing algorithm on augmented data manipulators by E. S. Elmallah and C.-H. Lam Preventing conflicts in input buffering baseline-based ATM switches by H. Cam Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications by D. Huang and K. Kiasaleh Multispace search for quorumcast routing by J. Gu, B. Du, D. H. K. Tsang, and W. Wang On 3-rate rearrangeability of Clos networks by G.-H. Lin, D.-Z. Du, W. Wu, and K. Yoo.
by "Nielsen BookData"