![]() |
Volumn 261, Issue 2, 2001, Pages 323-328
|
Lower bounds for wide-sense nonblocking Clos network
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
CONGESTION CONTROL (COMMUNICATION);
INTERCONNECTION NETWORKS;
TELECOMMUNICATION TRAFFIC;
THEOREM PROVING;
CLOS NETWORKS;
WIDE-SENSE NONBLOCKING NETWORKS;
MULTIPROCESSING SYSTEMS;
|
EID: 0034922064
PISSN: 03043975
EISSN: None
Source Type: Journal
DOI: 10.1016/S0304-3975(00)00147-X Document Type: Conference Paper |
Times cited : (15)
|
References (8)
|