✦ LIBER ✦

On the construction of balanced switching networks

✍ Scribed by F. K. Hwang; S. Lin

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 919 KB
Volume: 9
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230090402

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

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.

📜 SIMILAR VOLUMES

On the Construction of Balanced and Part

On the Construction of Balanced and Partially Balanced Ternary Design

✍ Dr. Kishore Sinha; Dr. G. M. Saha 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

On the properties of directed switching

On the properties of directed switching networks

✍ Min-You Wu; Shu-Park Chan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 947 KB

The theory of directed switching networks is developed. After the fundamental concepts are defined, the rank of the path matrix of a Directed Single-Contact (Di-SC) network is discussed. The theorem which gives the essential relationship between the SC and Di-SC networks is proved. Then the Odd-Addi

On the construction of minimal broadcast

On the construction of minimal broadcast networks

✍ Luisa Gargano; Ugo Vaccaro 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 729 KB

On construction of partially balanced n-

On construction of partially balanced n-ary designs

✍ B.L Misra 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 264 KB

A new method of constructing a series of partially balanced ternary (PBT) designs is presented. In the method, we have added the corresponding rows of incidence matrices of a BIB design and a PBIB design, both obtained from single initial block with at least one element in common between them. The B

On the number of classes of (n,k) switch

On the number of classes of (n,k) switching networks

✍ Michael A. Harrison 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 588 KB

An (n,k) switching network is defined as all n-input, k-output network such that associated with each output is a Boolean transmission function of the n-inputs. If we allow a group @ on the inputs and a group ~ on the outputs, then the family of networks is decomposed into equivalence classes. In th

Impact of node switching capabilities on

Impact of node switching capabilities on the performance of wavelength routed networks

✍ Andriolli, Nicola ;Valcarenghi, Luca ;Castoldi, Piero 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract Performance of wavelength routed optical networks (WRONs), which consist of circuit switched all‐optical connections, namely lightpaths, heavily depends on network node capabilities. Advanced network node switching capabilities might improve WRON performance but they often imply an incr