Advances in Switching Networks

Inbunden, Engelska, 1998

1 519 kr

Tillfälligt slut

These papers cover a variety of issues related to network switching, including network environment, routing, network topology, switching components, nonblockingness, and optimization.

Produktinformation

Utgivningsdatum1998-01-01
Vikt822 g
FormatInbunden
SpråkEngelska
SerieSeries in Discrete Mathematics & Theoretical Computer Science
FörlagAmerican Mathematical Society
ISBN9780821808313

Du kanske också är intresserad av

Mathematical Support for Molecular Biology

Mathematical Support for Molecular Biology

1 329 kr

Randomization Methods in Algorithm Design

Randomization Methods in Algorithm Design

1 499 kr

Graphs and Discovery

Graphs and Discovery

2 089 kr

SPIN Verification System

SPIN Verification System

1 069 kr

Network Threats

Network Threats

669 kr

Satisfiability Problem

Satisfiability Problem

Ding-Zhu Du, Jun Gu, P. M. Pardalos

3 159 kr

On-line Algorithms

On-line Algorithms

719 kr

Parallel Algorithms

Parallel Algorithms

Sandeep N. Bhatt

979 kr

Data Structures, Near Neighbor Searches and Methodology

Data Structures, Near Neighbor Searches and Methodology

1 669 kr

Logic and Random Structures

Logic and Random Structures

669 kr

Tillhör följande kategorier

Topologi inom Naturvetenskap och teknik
Nätverk och kommunikation inom Data och it
Talteori inom Naturvetenskap och teknik
Algebra inom Naturvetenskap och teknik
Beräkning och matematisk analys inom Naturvetenskap och teknik

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.