Premium
On the construction of balanced switching networks
Author(s) -
Hwang F. K.,
Lin S.
Publication year - 1979
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230090402
Subject(s) - computer science , construct (python library) , class (philosophy) , lan switching , channel (broadcasting) , label switching , multistage interconnection networks , topology (electrical circuits) , mathematics , computer network , routing (electronic design automation) , multiprotocol label switching , combinatorics , burst switching , transmission delay , quality of service , artificial intelligence , network packet
A balanced switching network is a multistage switching network where all channel graphs G(α, β) (the union of all paths from the input switch α to the output switch β) are isomorphic. In this paper we: (1) derive some necessary conditions for the existence of balanced switching networks realizing various types of channel graphs, (2) solve completely the problem of the construction of 3‐stage balanced switching networks, and (3) give a recursive procedure to construct a class of balanced switching networks with more than three stages.