UID:
almahu_9949218782302882
Umfang:
1 online resource (xi, 333 p. : ill.)
Ausgabe:
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
ISBN:
9781470440008 (online)
Serie:
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, v. 42
Anmerkung:
Average-case bounds for the complexity of path-search
,
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation
,
Constructing nonblocking multicast switching networks with fanout reduction
,
Multirate broadcast switching networks nonblocking in a wide sense
,
Repackable networks-The concept and applications
,
Modeling the blocking behavior of Clos networks
,
Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions
,
Non-blocking multistage interconnection networks with limited depth
,
Isomorphism of classical rearrangeable networks
,
Characterizing bit permutation networks
,
Structure and density of sparse crossbar concentrators
,
Non-blocking routing properties of Clos networks
,
An algorithm for the construction of concentrators from 2 x 2 sorters
,
Strictly nonblocking conferencing meshes
,
An $O(N^{1.695})$ permutation routing algorithm on augmented data manipulators
,
Preventing conflicts in input buffering baseline-based ATM switches
,
Routing strategy and performance evaluation of multiple-ring ShuffleNet topology for high speed wavelength-division multiplexed optical communications
,
Multispace search for quorumcast routing
,
On 3-rate rearrangeability of Clos networks
,
Mode of access : World Wide Web
Weitere Ausg.:
Print version: Advances in switching networks : ISSN 1052-1798 ISBN 9780821808313
Sprache:
Englisch
Bookmarklink
