Skip to search formSkip to main contentSkip to account menu

Clos network

Known as: Clos, Beneš network, Benes network 
In the field of telecommunications, a Clos network is a kind of multistage circuit switching network, first formalized by Charles Clos in 1952, which… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Circuit switchingCrossbar switchFat treeHall's marriage theorem

Broader (2)

Network topologyNetworking hardware

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Concurrent round-robin dispatching scheme in a clos-network switch
A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching… 
Review
1998
Review
1998
Architectural choices in large scale ATM switches
The rapid development of Asynchronous Transfer Mode technology in the last 10-15 years has stimulated renewed interest in the… 
Review
1995
Review
1995
Control and Performance in Packet, Circuit, and ATM Networks [Book Review]
From the Publisher: Control and Performance in Packet, Circuit, and ATM Networks combines queuing theory, with static-flow… 
1994
1994
Proposal for a monotonic multiple inheritance linearization
Previous studies concerning multiple inheritance convinced us that a better analysis of conflict resolution mechanisms was… 
1992
1992
An object-oriented refinement calculus with modular reasoning
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
1990
1990
Fault-tolerant routing in MIN-based supercomputers
The authors study methods for routing data in supercomputers that use multistage interconnection networks (MINs) in the presence… 
1988
1988
The common Lisp object system metaobject kernel: a status report
The metaobject kernel of the Common Lisp Object System (CLOS) comprises the classes and methods that define and implement the… 
1987
1987
Rearrangeability of multistage shuffle/exchange networks
In this paper we study the rearrangeability of multistage shuffle/exchange networks. Although a theoretical lower bound of (2 log… 
Highly Cited
1985
Highly Cited
1985
On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks
For any parallel computer systems which consist of many processing elements and memories, interconnection networks provide… 
Highly Cited
1972
Highly Cited
1972
Rearrangeability of multi-connection three-stage clos networks
switches, m rec tangular (r x 2: ) middle switches, and r rectangular (m X n output switches. There i s exac t ly one l i n k… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)