SIGN IN
SIGN UP
On noninterruptive rearrangeable networks
Full Text:
Pdf
Buy this Article
Authors:
Frank K. Hwang
Department of Applied Mathematics, National Chiao Tung University, HsinChu, Taiwan, R.O.C.
Wen-Dar Lin
Institute of Information Science, Academia Sinica, Taipei NanKang, Taiwan, R.O.C.
Vadim Lioubimov
Almipa Inc., Concord, ON, Canada
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 14 Issue 5, October 2006
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2006.882846
2006 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 16
· Citation Count: 1
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
clos network
design
design studies
doubled path
network architecture and design
noninterruptive rearrangeable
output -divertability
paull's matrix
rearrangeably nonblocking
strictly nonblocking
wide-sense nonblocking
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