Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution

Authors:
A. Jajszczyk
Affiliations:
AGH University of Science and Technology
Venue:
IEEE Communications Magazine
Year:
2003

Citing 0
Cited 10

Siamese-Twin: A Dynamically Fault-Tolerant Fat-Tree

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Economics and scalability of QoS solutions

BT Technology Journal
Throughput and QoS optimization in nonuniform multichannel wireless mesh networks

Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
Exploring pattern-aware routing in generalized fat tree networks

Proceedings of the 23rd international conference on Supercomputing
A performance analysis framework for routing lookup in scalable routers

ICOIN'09 Proceedings of the 23rd international conference on Information Networking
A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers

IEEE Transactions on Communications
A QoS optical packet switching system: architectural design and experimental demonstration

IEEE Communications Magazine
LBSR: a load-balanced semiminimal routing algorithm in cellular routers

ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Distributed adaptive routing for big-data applications running on data center networks

Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Fast pattern-specific routing for fat tree networks

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.25

Visualization

Abstract

The article gives an overview of major theoretical issues associated with a switching network structure proposed by C. Clos (1953). The concepts of strict-sense and wide-sense nonblocking as well as repackable and rearrangeable networks are described, showing the development of major research areas. A taxonomy of Clos switching networks and some important results for the basic network structure are given and discussed. Other research issues are enumerated.