No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Methods for the connection of signalling units to switching networks
Electronics Letters
Abstract
Two methods for the connection of signalling units to digital switching networks are presented. The proposed methods make it possible to connect singalling units without affecting the traffic characteristics of networks.
... Since nonblocking multiconnection networks require expansion in the first stage and concentration in the last one we can form various expansion and concentration modules made of square switches (available DSMs are usually square) by using the method proposed in [8]. In some practical applications other approaches to multiconnections may be justified [11], [15]. Throughout the paper we assumed that each rectangular switch has the fan-in and fan-out properties. ...
In the paper we study the conditions under which multiconnection networks are nonblocking. A multiconnection network deals with the connections of pairs {( T 1 , T 2 )} where T 1 is a subset of the input terminals and T 2 is a subset of the output terminals. We investigate networks composed of digital switching matrices. Such networks can be treated as a very general case encompassing many kinds of networks used in practice as well as studied theoretically.
We present four routing strategies and then develop conditions under which multiconnection networks are nonblocking when each of these strategies is used. We also show that the obtained conditions reduce to known results for some values of network parameters.
This paper describes the design concepts and system features of the FETEX-150 digital switching system for central offices that has been developed to serv as the node machine of a digital telephone network and future Integrated Services Digital Network (ISDN). The design is based on a modular and technology-independent organization which facilitates the introduction of further technological advances.
In the paper, four theorems describing conditions under which a three-stage multiconnection network is nonblocking for different routing strategies are formulated and proved. These theorems hold for any values of the structural parameters of a network. For some networks having a small number of outer stage switches, these theorems give significantly lower numbers of required middle stage switches than theorems currently known. Copyright © 1986 by The Institute of Electrical and Electronics Engineers. Inc.
Significant advances in semiconductor technology make it possible to construct new components called digital symmetrical matrices, which mix in the same integrated circuit, time and space switching. In this paper, structures of multistage nonblocking networks composed of such matrices are described. The condition under which the network will be nonblocking is formulated, and the relationship between the maximal capacity of the network and the number of switching stages is discussed. Formulas for designing optimal threeand five-stage networks are derived. It is shown that general multistage networks should have as few stages as possible for minimizing the cost.