Expanders obtained from affine transformations
Combinatorica - Theory of Computing
Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Handbook of theoretical computer science (vol. A)
Three-stage generalized connectors
SIAM Journal on Discrete Mathematics
Superconcentrators of depths 2 and 3; odd levels help (rarely)
Journal of Computer and System Sciences
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Optical networks: a practical perspective
Optical networks: a practical perspective
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fault-tolerant routing and multicasting in butterfly networks
Proceedings of the 1999 ACM symposium on Applied computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Computing with Very Weak Random Sources
SIAM Journal on Computing
Wavelength requirements for multicasting in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Strictly non-blocking WDM cross-connects
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Nonblocking WDM Multicast Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
The Mathematical Theory of Nonblocking Switching Networks
The Mathematical Theory of Nonblocking Switching Networks
Storing information with extractors
Information Processing Letters
A proof of alon's second eigenvalue conjecture
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Extractors from Reed-Muller Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Blocking behaviors of crosstalk-free optical Banyan networks on vertical stacking
IEEE/ACM Transactions on Networking (TON)
WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Optical switching networks with minimum number of limited-range wavelength converters
IEEE/ACM Transactions on Networking (TON)
Explicit constructions of linear size superconcentrators
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Terabit switching: a survey of techniques and current products
Computer Communications
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We formulate a graph model called [w, f]-distributors which is useful in analyzing the structures and comparing the quantitative complexities and qualitative features of optical multicast cross-connects. Using the formulation we show that two strictly nonblocking multicast optical cross-connects under two different request models are equivalent topologically, even though one request model is much less restrictive than the other. We then investigate the tradeoff between the depth and the complexity of an optical multicast cross-connect using the graph model. Upper and lower complexity bounds are proved. In the process, we also give a generic recursive construction that can be used to construct optimal and near-optimal [w, f]-distributors. The recursive construction can also be used to construct cost-effective optical multicast cross-connects. Another important result that follows is the exact asymptotic behavior of the size of optimal [w, f]-connectors, the unicast version of [w, f]-distributors.