A Loop-Structured Switching Network
- 1 May 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (5) , 450-455
- https://doi.org/10.1109/tc.1984.1676462
Abstract
This paper describes a novel loop-structured switching network (LSSN) intended for highly parallel processing architectures. With L loops, it can connect up to N = L* log2 L pairs of transmitting and receiving devices using only N/2 two-by-two switching elements; thus, it is very cost-effective in terms of its component count. Its topology resembles that of the indirect binary n-cube network, but a much higher device-to-switch ratio is achieved because all the links between the switches could be used as both transmitting and receiving stations. It has the advantage of incremental extensibility, and-it could avoid store-and-forward deadlocks (SFD) which prevail in other recirculating packet-switched networks. Our simulation studies show that the average throughput rate and delay of LSSN are close to that of other designs despite its relatively low component count.Keywords
This publication has 6 references indexed in Scilit:
- Star: A Local Network System for Real-Time Management of Imagery DataIEEE Transactions on Computers, 1982
- Packet Switching Interconnection Networks for Modular SystemsComputer, 1981
- Design and Validation of a Connection Network for Many-Processor Multiprocessor SystemsComputer, 1981
- On a Class of Multistage Interconnection NetworksIEEE Transactions on Computers, 1980
- Packet switching in banyan networksPublished by Association for Computing Machinery (ACM) ,1979
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977