SIGN IN
SIGN UP
Rearrangeable and nonblocking [w, f] -distributors
Full Text:
Pdf
Buy this Article
Authors:
Hung Q. Ngo
Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY
Yang Wang
Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY
Dazhen Pan
Microsoft, Redmond, WA and Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 17 Issue 3, June 2009
Pages 990-1001
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2008.2001728
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 91
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
complexity
design
distributors
graph algorithms
modeling methodologies
multicast
optimal connectors
performance
performance attributes
routing protocols
wdm optical cross-connects
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder