US3582560A  Multistage telephone switching system for different priority users  Google Patents
Multistage telephone switching system for different priority users Download PDFInfo
 Publication number
 US3582560A US3582560A US3582560DA US3582560A US 3582560 A US3582560 A US 3582560A US 3582560D A US3582560D A US 3582560DA US 3582560 A US3582560 A US 3582560A
 Authority
 US
 Grant status
 Grant
 Patent type
 Prior art keywords
 stage
 switching
 plurality
 stages
 middle
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Expired  Lifetime
Links
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04Q—SELECTING
 H04Q3/00—Selecting arrangements
 H04Q3/0008—Selecting arrangements using relay selectors in the switching stages
 H04Q3/0012—Selecting arrangements using relay selectors in the switching stages in which the relays are arranged in a matrix configuration
Abstract
Description
United States Patent Inventors Ralph D. Banks New York. N.Y.;
David M. Mandelbaum Clifton. NJ.
Appl No 749.852
Filed Aug. 2, 1968 Patented June 1, I971 Assignee Communications & Systems, Inc.
Paramus, NJ.
MULTISTAGE TELEPHONE SWITCHING SYSTEM FOR DIFFERENT PRIORITY USERS 6 Claims, 10 Drawing Figs.
US. Cl 179/18,
l79/l 8(GE) Int. Cl li04m 3/38 Field of Search 179/22,
INPUT LINES INPUT LINES [56] References Cited UNITED STATES PATENTS 3.410.962 12/1968 Basset et a]. i. l79/22 33 1 3,888 4/1967 Ohno .i 179/22 3,214.524 10/1965 Warman 179/22 Primary ExaminerKathleen H. C laffy Assistant ExaminerThomas W. Brown AttorneyHopgood and Calimafde "fit REMOVED PATENTED Jun H971 SHEET 2 BF 3 I'STAGE FIG. 4
Has
"I INPUT LINES TS Ts ZWE 3W5 u um n m IL L I 2 NF FIGi6 FIG. 7
DINVENTORS A KS EL AUM .RAL
PH DAVID MAN nrr'onnsvs PATENTYEYDI'JUN 1 ISYI SHEET 3 OF 3 2: N w }a i 5 fl ff)?" "N O y vq l FIGS SWHING INTER SWITCHING J smce p smses sue: T 2 Q 1m 2 a F 3 2 I :4 g [:1 E1
scmmn cmcurr //9 12 CONTROL cmcun CALLING cause LINE LING meum'v IDENTITY 1 INVENTORS RALPH o. anuns DAVID v MANOELBAUM 4 rromve Y5 MULTISTAGE TELEPHONE SWITCHING SYSTEM FOR DIFFERENT PRIORITY USERS I. INTRODUCTION This invention relates to a switching array in a telephone system, and more particularly, relates to a switching system for connecting different priority users.
Switching arrays having nonblocking capabilities are well known in the art. The two main classes of switching arrays are:
I. totally nonblocking arrays; and
2. those with a nonzero probability.
In these arrays, the switching arrays were of a symmetrical nature and all subscriber lines were afforded the same degree of blocking probability.
For purposes of definition, a totally nonblocking array denotes an array in which any two idle subscribers can always be connected together regardless of the other traffic through the array. Therefore, a subscriber having maximum priority of access, must have totally nonblocking probability.
For example, for a square array having N inputs and N outputs, the number of crosspoints C equals N Therefore, N connections can be made without blocking between inputs and outputs. The number of switching stages, sis I, so that the number of crosspoints C is:
A crosspoint is used herein to mean a switching crosspoint, or crosspoint sets located at the verticalhorizontal locations. An array is nonblocking for so long as there remains an idle outlet for which any input may have unimpeded access to it upon demand, and a particular crosspoint is unique to each inputoutput connection.
A crosspoint (or crosspoint switch) may be mechanical, electronic, etc., well known in the art, to electrically connect a horizontal and vertical line.
For reasons well known, single stage nonblocking arrays are economically impractical for large subscriber systems and require large numbers of crosspoints, and intermediary stages have been used as discussed in Clos, A Study of Nonblocking Switching Networks," Bell Sys. Tech. 1., Vol. 32, PP. 406 424, Mar. 1953; Bowers, Blocking in SStage Folded Switching Arrays, IEEE Trans. Communication Technology, Vol. COMl3, pp. l437, Mar. 1965; Zarouni, Switching System," U.S. Pat. No. 3,041,409, June 26, 1962; as well as our article Partitioned Switching Arrays," IEEE Transactions on Communication Technology, Vol. Coml 5, No. 6, Dec. 1967.
The use of intermediary stages is common. In most practical switching arrays handling more than I lines or trunks, multistage arrays are utilized. Many modern blocking telephone switches utilize fouror eightstage arrays. For nonblocking and partitioned arrays, three, IIV, and sevenstage arrays are most common. These arrays, however, prove to be not as efficient at above 250 lines, 1,500 lines, and several thousand lines, respectively.
For reasons discussed in Bowers and clos, twostage switching arrays are never completely nonblocking and the threestage array has been developed using an intermediate matrix. In general, the folded threestage switching array has been utilized in which a large group of trunks requiring individual access to one another are switched on a both way" basis, and Bowers and Zarouni have described such systems.
We recognize that the ideal solution for insuring good service through an array under emergency conditions when traffic increases, is to use the totally nonblocking array. But this system gives totally nonblocking service to all users, nonpriority as well as priority.
For a few hundred or more subscriber lines in a folded threestage system, the number of crosspoints needed for a totally nonblocking array is considerably greater than for an array with a nonzero blocking probability. For nonblocking switches handling more than 500 lines, the number of crosspoints increases at a rapid rate.
Lli
An object of this invention is to provide a simple and economical system for connecting the subscriber having different levels of priority of use.
Another object of this invention is to provide a switching array in which a priority is accorded to the users terminal.
A further object of this invention is to accommodate users with several precedence levels, as well as to provide an efficient switching system affording several grades of service.
A further object of this invention is to provide a partitioned switching array in which a subset of the subscribers are served in a nonblocking manner and the remainder with an assigned nonzero blocking probability for an assumed switch link traffic loading.
A still further object of this invention is to provide a minimum number of crosspoints in an array serving N subscribers at a blocking probability of P and another set of subscribers having a blocking probability of P Still another object of this invention is to minimize the number of crosspoints used in a space division switching array. I
Yet, a further object is to accomplish a crosspoint savings while retaining nonblocking service to high priority users and providing plural, different blocking grades of service according to other users and according to priority.
Briefly, in our invention, the switching system provides different grades of service to priority and nonpriority users. User terminals are assigned different grades of priority according to use. A folded array is utilized in which the middle stages of the array are partitioned into subsections having independent functions for the different priority users involved.
ll. PARTITIONED THREESTAGE SWITCHING ARRAY WITH TWO GRADES OF SERVICE A nonblocking threestage folded switching array serving N subscribers is described herein. By deleting certain portions of a number of middle stage matrices, a subset of subscribers N will still be afforded nonblocking service while the remaining subscribers will be afforded service at a nonzero probability of blocking. For a specified number of total subscribers and a limited percentage of nonblocking service subscribers, the number of crosspoints in the resulting partitioned switching array is significantly less than the number of crosspoints needed for the original totally nonblocking switching array.
The abovementioned and other features and objects of this invention and the manner of attaining them will become more apparent and the invention itself will be best understood by reference to the following description of the embodiments of the invention taken in conjunction with the accompanying drawings, wherein:
FIG. la is a diagram ofa threestage folded switching array;
FIG. Ibis a diagram ofthe middle stage matrix;
FIG. 2 is a diagram of the two priority versions of the three stage folded partitioned array ofour invention;
FIG. 3 is a diagram of the Clos nonblocking threestage ary;
FIG. 4 is a diagram of a folded nonblocking fivestage array;
FIG. 5 is a diagram of the preferred embodiment of a two priority partitioned fivestage folded array;
FIG. 6 is a diagram illustrating the ratio of crosspoints in a partitioned fivestage array to those in comparable nonblocking fivestage array;
FIG. 7 is a diagram of a partitioned threestage array with three grades of service;
FIG. 8 is a diagram of the middle stage matrix of the multigradc partitioned array; and
FIG. 9 is a diagram ofa switching system in accordance with our invention illustrating control circuitry therefor.
FIG. la shows a threestage folded switching array which is known in the art. All first and third stage matrices are similar. Corresponding input lines on the first and third stage matrices are connected together as shown. It is known that the threestage folded array will be totally nonblocking when the number of middle stage matrices is equal to the number of input lines entering any one first or third stage matrix As a result all matrices are square and therefore there is no concentration introduced in the first or third stage matrices In this folded array it is noticed that the higher numbered first and third stage matrices are connected to the lower righthand portions of the middle stage matrices by the internal links between stages. Therefore. removal of these portions of some second stage matrices will cause the service afforded to these lines to change from nonblocking to blocking.
Assume that it is desired that a subset N of the N subscribers served by this array be provided nonblocking service while the remainder be provided service with some nonzero probability of blocking. Assume also that each primary stage switch serves y subscribers.
FIG. lb shows a square middle stage matrix. The incoming links from the first stage matrices are shown entering the matrix on the bottom. Link 1 comes from the first (top) matrix in the first stage, link i comes from the ith matrix in the first stage, and so on. The links from the third stage appear on the righthand side of this matrix. Link I comes from the first (top) matrix in the third stage, LlNKj comes from the jth matrix in the third stage, and so on. A crosspoint in any middle matrix will be identified by the coordinates (j) meaning it can connect the jth link from the first stage with the jth link of the third stage. [See FIG. 1b.]
There are a total of N/y links from all first stage matrices and N/y links from all third stage matrices to each second stage matrix. Therefore, there are (N/yth 2 crosspoints in each second stage matrix to give nonblocking connections between these two sets oflinks.
Now consider the middle matrix crosspoints needed in the connection of any link to the third stage with a link coming from any one of the first N,/y first stage matrices. These serve the subscribers labeled l, 2,..., N We assume that N, is a multiple ofy. These crosspoints are then given by (Lj) where l i N /y and l sjfiNl y. This set of crosspoints forms a rectangle containing N /yX Ni/ NNi/ crosspoints. It has height N/y and width N ly. This rectangle lies on the lefthand side of the matrix.
Likewise, the crosspoints used in connecting any link from the first stage to any link from one of the first N ly third stage matrices is given by the set of crosspoints (i, j) where l j N,/y and l$i$N/y. This set forms a rectangle lying on the top portion of the second stage matrix. It has a height N,/y and width N/y. These two rectangles overlap in a N,/yXN,/y
square. This square is composed of those crosspoints given by (i117, l i,j$Ni/y. Thus, the set ofcross points involved in any connection involving one of the first N,/y first or third stage matrices is given by (i,j) where either i or] (or both) is less than or equal to N,/y. The integer his defined by h=N,y. Also k is defined by k=N /y, where N=N +N is the total number of subscriber lines serviced by the array. It is assumed that N is a multiple ofy.
Consider the crosspoints in the second stage involved in a connection between a link originating from one of the last k first stage matrices and any other link; that is, a connection from any link to one of the first stage matrices labeled h+l, h+2, h+kl, h+k. These matrices serve the last N; subscribers; that is, those labeled N,+l, N,+2, N l, N The set of crosspoints in all second stage matrices involved in this connection is given bythe coordinates(i,j) where N /y iSN/y and l jN/y. Likewise the set of coordinates involved in a connection between any link from the last k third stage matrices to any other link to the first stage involves the set of second stage crosspoints given by (i, j) where Ni/y j N/y. and for lsisN/y.
It is therefore seen that links connecting the last k matrices in the first stage with the last k matrices in the third stage use the set of coordinates in any second stage matrix given by (i',j)
where N v i.j N/ r: or equivalently Ii i,js/i+k. This set of crosspoints forms a, square of side k crosspoints lying in the lower righthand side of each second stage matrix. This square contains k =N /y crosspoints.
To summarize, FIG 2 shows a second (middle) stage matrix partitioned into four sections. These sections perform independent path switching functions. Section 1 contains the crosspoints given by the coordinates (11 where l si,j$li= N /y. These crosspoints are used exclusively for connecting the links between the first N /y matrices of the first and third stages. These matrices serve the first N, subscribers. Section 2 is composed of crosspoints whose coordinates are given by (i, j) where l$i$/1=N and h j h+l where k=N v. These crosspoints serve exclusively the connections between t he first N,/y first stage matrices serving the first N1 subscribers and the last N /y third stage matrices serving the last N subscribers. Similarly, the crosspoints of section 3 are given by the coordinates (i, j) where l1 i h+k and lsjsh. Then these crosspoints serve exclusively to connect links between the last N /y first stage matrices and the first N /y third stage matrices. Section 4 contains crosspoints giyen by the coordinates (i,j) where h i, 'h+k. These crosspoints serve exclusively to connect links between the last NQ/y matrices serving the last N subscribers ofboth the first and third stages.
Therefore, it is seen that the removal of some of the section 4 squares consisting each of k crosspoints will only affect and diminish the service for calls wholly between the last N2=N N subscribers. Of course, if all such squares are removed from all middle stage switches, then the blocking probability is one so that no call can be established among subscribers within this latter group. It is seen that nonblocking service is retained for calls between a subscriber from the first N subscribers and a subscriber from the last N subscribers. This is because sections 2 and 3 are retained and only the crosspoints therein are involved in such calls.
The number of crosspoints in the original nonblocking threestage folded array is:
F =Ny+Y(N/Y) =2Ny+N /Y i where N is the total number of subscriber lines and Y the number of lines entering a first or third stage matrix and also the total number of middle matrices.
The number of crosspoints Ff, F =F ,[crosspoints removed], in a partitioned threestage folded array formed by removing ym squares ofdimension kXk is:
TABLE 1 Crosspoint comparison for partitioned threestage array with varying number of lines receiving nonblocking service and other lines receiving PL= R01 blocking service (worst case) Total Percent Actual number age of value of of crosscross Ni N2 lated Y 1! used h k m points points l 1 Relative to nonblocking case (Nz=0).
F =2Ny+N"/y(ym )k y+ y)( /y The parameter m is the number of middle stage matrices without crosspoints removed and is determined by the blocking probability desired for traffic among only the group of N lines.
To determine m approximately, P is the blocking probability. The probability of blocking on each link is assigned the same value a, which is assumed equal to one half the assigned access line occupancy of this array It can be shown that log P,,=m log (Zna") or number of crosspoints we find the minimum of F;,* with respect to variable y.
EXAMPLE I A 300 subscriber line threestage folded partitioned switching array was considered for an overall blocking probability P of 0.0l and an internal switch link loading a of0.l Erlangs. The number m of middle stage matrices that were to be left intact was determined to be 3 by (4). For several different values N, of subscriber terminals to be given nonblocking service, the number of lines entering a first stage matrix v was determined for a minimal crosspoint configuration. The percentage of crosspoints needed for a partitioned array compared to that used for a similar totally nonblocking array is given in Table l. v
Note that in the previous calculations, the value of m used was based upon the use of the blocking probability between two terminals on the same first stage matrix since this case given us the worst case probability of a call being blocked. This probability is given by:
However, the great majority of calls in practice will be between terminals on different first stage matrices. The blocking probability in this case will be:
P l( la) Thus, for Example I, the majority of calls (those between terminals on different primary matrices) will be blocked with a probability of 0.0001 or the square ofthe worst case probability.
ALTERNATE APPROACHES It can be noticed that all middle stage matrix crosspoints with coordinates (i, 1') connect links only between matrices serving the same group of y subscribers. Thus, if the diagonal crosspoints (i,i) that were originally removed on every second stage matrix are replaced, nonblocking service between subscribers served by the same first or third stage matrix is restored. This restores this type of service to N users on the same first stage matrix. This type of nonblocking service between terminals on the same first stage matrix has always existed for the N, group since they receive totally nonblocking service.
III. PARTITIONED FIVESTAGE SWITCHING ARRAY WITH TWO LEVELS OF SERVICE Since all middle stage matrices in the threestage folded array described in Section II are square and therefore nonblocking, the middle stage switches can each be replaced by a threestage. nonfolded, nonblocking switching array to produce a fivestage, folded. nonblocking switching array. The middle three stages are composed of a Clostype nonblocking switching array. In this smaller Clos array all first and third stage matrices are similar and the number of middle stage matrices is equal to .Zzl where z is the number of input lines entering a first stage matrix or the number of output lines leaving a third stage matrix. Such an array is shown in FIG. 3.
The fivestage, nonblocking. folded array resulting from the union of these above two arrays is shown in FIG. 4. All subscriber lines are served by nonblocking service. Indeed, the array is symmetrical with respect to all lines.
A partitioned fivestage array with two levels of service is shown in FIG. 5. The first (top) N, lines are those given nonblocking service by the array. The remaining .v' lines receive a specified nonzero blocking service. The number of input or output lines to each first or last stage matrix is given by y. The parameter z is the number of input links to each individual second or fourth stage matrix and the corresponding number of output links from the matrix is 2zThe Clos threestage array for nonblocking requires 2zl middle stage matrices. In the array of FIG. 5, this criterion will be satisfied only for the N, group of lines. Certain crosspoints in the middle matrices used exclusively for connection of the N line group among themselves will be omitted to reduce the service on these lines from nonblocking to the desired level of blocking. Again the middle stage matrices are divided into four sections. A number of subsections of the middle matrices are omitted from the totally nonblocking version of the array to increase the probability of blocking for connections among the N terminals from O to the desired level.
The total number of crosspoints in the partitioned fivestage array is determined by the number of middle stage square sections omitted. The size of these sections is Nz/YZ XNzlyz crosspoints. This is because there are now y Clos threestage arrays acting as middle stages for the original threestage folded array yielding the fivestage nonblocking array. Therefore, MI is the total number of links entering each Clos threestage array in the middle three stages and N ly of these links receive blocking service. Thus, the middle three stages will form y partitioned Clos arrays.
The total number of crosspoints is then minimized by varying the parameters y and z. The number of crosspoints in a partitioned fivestage folded array is given by:
5* a*) where is the number of crosspoints in the partitioned threestage Clos array and N=N,+N Now using Clos, and subtracting the omitted sections from the unmodified close array,
where (2zlm) gives the number of squares of size Ng/yz N2AYZ to be discarded from center stage matrices.
Therefore,
The parameter m, which is the number of middle stage square subsections involved exclusively in making connections among the N group of subscribers is determined from the required probability of blocking and the estimated loading on each link.
A method of determining m for a five'stage folded array is described in our aforementioned article.
To illustrate the crosspoint savings over the totally nonblocking case, calculations were made for certain values of N, and N The ratio of crosspoints needed in the partitioned array to that for the totally nonblocking array are shown in FIG. 6 for I500 terminals receiving blocking service and various values of N, of nonblocking terminals. It is seen that savings are significant for low values of N, with respect to N The value for N was chosen as I500 since it is known that fivestage nonblocking arrays are economical when the number of terminals is in this range.
Similar methods of those outlined in the foregoing can be applied to the case of all nonblocking switching arrays, having any odd number ofstages.
IV. MULTIGRADE OF SERVICE PARTITIONED SWITCHING ARRAYS 0) while the blocking probabilities fl, P for the N and N groups are such thatf g fl. A number of squares of size N ly will be removed from the second stage matrices. The number of such removed squares is ym where v is the number of middle stage matrices and m is the number ofmatrices left intact. As before.
log (2aa') where u is the blocking probability assumed on each internal link. The result ofthis operation leaves the v group with nonblocking service while the most that this group requires is service with a blocking probability of P Therefore. the crosspoints servicing calls among the N group and between the N and N groups can be removed from a number ym of middle stage matrices. These crosspoints form a square of dimension N 2/ yXNzly and two rectangles each of dimension Nz/Y N ly. The number m; which is the number of middle stage matrices keeping all crosspoints that serve N users is given by the least integer, such that:
log P m2: log (2aa Therefore. the total number of crosspoints in the resulting partitioned threestage folded array is given by:
This is interpreted as removing squares of size (N +N /y crosspoints from vm middle stage matrices to give both the N and N group a blocking probability of R but adding back a square having Nf/y crosspoints and two rectangles having NgNa/y" crosspoints in VIMI713 middle stage matrices to give the N group a lesser blocking probability than the N group, equal to P2. Fig 8 illustrates the middle stage of a 3stage folded array. serving it groups of lines, each requiring a different level of service. It is assumed that the probability of blocking P, for the members of the ith group oflines. numbering N is such that P, P P,,. As a consequence, varying sized squares are removed from the middle stage matrices. Moving down from the top, that is. from the N, to the N, group of lines, the size of the squares removed is monotonically nondecreasing. That is. they either stay the same or get larger.
It is seen that connection between lines ofone of the groups, say the N group, with all groups N Jzi, uses a certain segment in a middle stage matrix. This segment is composed of two rectangles meeting at a right angle. Each rectangle has a width ofN /y crosspoints and a height of crosspoints These two rectangles overlap to form a square with N,/y crosspoints on each side which makes each connection between lines ofthe N, group.
EXAMPLE 2 Consider a threestage folded array serving a total of 300 lines, of which 10 lines are to be afforded nonblocking service, are to be afforded service with a blocking probability of 0.0l ,and the remainder with a blocking probability of 0.05. The loading on each switch link is assumed to be 0.l Erlangs.
It is determined that the number of center stage sections m needed for the group of 20 lines is two. and the number m for the groups of 270 lines is one.
The number of crosspoints is the partitioned array is given by:
where N2=20 and N3=270.
The last term in parentheses represents the squares and rectangles that must be added back into the equation to give the N line group a blocking service of 0.0l rather than 0.05.
To find a minimum of F;.* with respect to y. again differentiate F; with respect to v and set the resulting expression to zero. This results in the following cubic equation:
The solution to the nearest integer is 7. Since it is advantageous that y divide into N the total number of lines evenly (for manufacturing convenience). v is chosen to be 6. The resulting total number of crosspoints is F ,*=6658 which is 44 percent ofthe number for the totally nonblocking case.
The same method of partitioning and removing certain portions of middle stage matrices can be applied to fivestage arrays and other symmetric arrays having an odd number of stages.
The foregoing partitioned arrays may be utilized in a switching system of the type shown by Zarouni. FIG. 9 is intended to illustrate our invention in conjunction with the specific circuitry shown in the prior art systems. such as Zarouni. It will be understood by those skilled in the art that any of the partitioned arrays as described previously. may be used in conjunction with conventional systems or the system of FIG. 9. In FIG. 9, while we have shown schematically a threestage system, it will also be understood that a multistage system may be used as explained previously as well as a multigrade system. In the five or greater stage system, the intermediate stages are nonblocking Clos type arrays with the center stage partitioned.
In FIG. 9 there is illustrated a switching system comprising two end switching stages designated the primary frame and the tertiary frame. There is also shown diagrammatically an interstage comprising a plurality of secondary frames having subframes, and it will be understood that lines as illustrated in FIGS. 2 and 5 terminate in both end switching stages to provide the folding character. In addition, in FIG. 9 there is illustrated interstage link selecting circuitry and the common control circuitry associated therewith.
The common control circuitry provides registration of the electrical indicia in connection with the vertical locations of the calling and called lines, and includes means for scanning or seeking among the links for an idle interstage link for interconnecting the preferred pair of terminations. The rectangles l0 and 11 merely show a suitable source of calling and called lines. The rectangle 12 represents circuitry for directing the sequence and manner in which one of a plurality of calling lines may be interconnected to one ofa plurality of called line terminations. Details as to the operation and circuit connections have been described in the Zarouni patent and need not be discussed any further here.
In our invention, we have included a switching system comprising a plurality of switching stages, a plurality of lines, and each line having at least one line termination in each of at least two stages. These two stages may be identified by the extreme left and extreme right or end stages, the primary stage or the tertiary stage, as the case may be, or the primary stage and the nth stage. Any pair of line terminations may be obtained through different connections of the crosspoints and it will appear that there are variable numbers or permutative pairs of such interconnections. In the threestage array, one middle bank of a plurality of interstage links are employed, but it will be understood that in any odd array there are a plurality of interstage links. However. the number of crosspoints connecting the interstage links are less than that required for nonblocking service as set forth previously. Electrical circuit means are employed including conventional link seeking means operable to seek an available appropriate link capable of connecting a particular permutative pair. The availability of particular pairs are determined as has been explained previously. The two end switching stages have an equal plurality of similarly numbered substages, and as stated previously, a plurality of called and calling lines;Each substage has an equal plurality of similarly numbered line terminals, and each line has a line termination in one line terminal of one substage ofa first stage and another line termination in the similarly numbered line terminal of the similarly numbered substage of the last stage. There are associated a plurality of interstage links divided into subgroups of links including different groups serving different pairs of substages taking one substage from each stage, and a number of the crosspoints interconnecting such interstage links are reduced by the factor set forth in order to provide a partitioned interstage arrangement.
There has thus been set forth an innovation in which the middle stages or intermediary stages are partitioned into subsections which have independent functions for the different priority users involved. This allows efficient arrays to be designed to afford different grades of service to the users according to priority. The middle switches may be divided into a first section which are used for connections among the high priority lines, second and third sections for use with any connection between a high priority line in a first group, and a second line in a low priority group, and a fourth section is used for connections only among the low priority lines. The partially blocking system obtained thereby affords substantial savings in switches while retaining essentially effective operation.
While the foregoing description sets forth the principles of the invention in connection with specific apparatus, it is to be understood that this description is made only by way of example and not as a limitation of the scope of the invention as set forth in the objects thereof and in the accompanying claims:
We claim:
1. A switching system comprising: an oddnumbered plurality of switching stages including end stages and a middle stage, each of said end stages comprising a plurality of similar matrices, a plurality of links coupling said end stages to said middle stage and defining a plurality of crosspoints a first plurality N, of input lines given a substantially nonblocking probability, and a second plurality N of input lines having a predetermined degree of nonzero blocking probability, coupled to selected matrices in said end stages, said middle stage being partitioned into a plurality of switching sections, each performing an independent switching function, each of said switching sections having a different number corresponding the the values of N predetermined number of matrices.
2. The system of claim 1 in which said system is a threestage system.
3. The system of claim 1 in which said system includes five stages in which three middle stages are a Clos folded threestage array, the middle stage of said Clos being partitioned.
4. A switching system comprising a plurality of switching stages, a plurality of lines, each ofsaid lines having at least one line termination in each of at least two of said stages, the primary stage and the end stage, a middle switching stage coupled to said at least two stages and defining a plurality of crosspoints, any pair of line terminations being obtained through different connections of the cross'points, at least one middle bank of a plurality of interstage links, the number of crosspoints connecting the interstage links being less than that required for nonblocking service,
electrical circuit means including link seeking means operable to seek an available permutative pair,
said at least two switching stages having an equal plurality of similarly numbered matrix substages,
a plurality ofcalled and calling lines,
each substage having an equal plurality of similarly numbered line terminals, and each line having a line terminatron in one line terminal of one substage of a first stage and another line termination in the similarly numbered line terminal of the similarly numbered substage of a last stage,
a plurality of interstage links divided into subgroups of links including different groups serving different pairs of substages taking one substage from each stage,
said middle stage being partitioned into subsections which have independent switching functions for the different priority users involved, thereby allowing efficient arrays to be designed to afford different grades of service to the users according to priority.
5. The system of claim 4 in which said middle switching stage is divided into a first section used for connections among the high priority lines, second and third sections for use with connection between a high priority line in a first group and a second line in a low priority group, and a fourth section used for connections only among the low priority lines.
6. The system of claim 4, having at least five of said switching stages, the intermediate ones of said switching stages being nonblocking Clos type arrays with the center stage being partitioned.
of crosspoints and N and having a
Claims (6)
Priority Applications (1)
Application Number  Priority Date  Filing Date  Title 

US74985268 true  19680802  19680802 
Publications (1)
Publication Number  Publication Date 

US3582560A true US3582560A (en)  19710601 
Family
ID=25015482
Family Applications (1)
Application Number  Title  Priority Date  Filing Date 

US3582560A Expired  Lifetime US3582560A (en)  19680802  19680802  Multistage telephone switching system for different priority users 
Country Status (1)
Country  Link 

US (1)  US3582560A (en) 
Cited By (16)
Publication number  Priority date  Publication date  Assignee  Title 

US3863035A (en) *  19720620  19750128  Lynch Communication Systems  Call concentrator switching matrix 
US4811333A (en) *  19860401  19890307  Stc Plc  Substantially nonblocking space switching arrangement 
US4983961A (en) *  19880129  19910108  Ant Nachrichtentechnik Gmbh  Three stage nonblocking switching array 
US5198808A (en) *  19880920  19930330  Nec Corporation  Matrix switch apparatus with a diagnosis circuit having standby ports and reduced size matrix switching elements 
US5303383A (en) *  19910501  19940412  Ncr Corporation  Multiprocessor computer system 
US5451936A (en) *  19910620  19950919  The Johns Hopkins University  Nonblocking broadcast network 
US6412002B1 (en)  19991115  20020625  Ncr Corporation  Method and apparatus for selecting nodes in configuring massively parallel systems 
US6418526B1 (en)  19991115  20020709  Ncr Corporation  Method and apparatus for synchronizing nodes in massively parallel systems 
US6519697B1 (en)  19991115  20030211  Ncr Corporation  Method and apparatus for coordinating the configuration of massively parallel systems 
US6745240B1 (en)  19991115  20040601  Ncr Corporation  Method and apparatus for configuring massively parallel systems 
US20080143473A1 (en) *  20061219  20080619  Kevin Wilson  Digital CrossConnect Path Selection Method 
US20080150651A1 (en) *  20061220  20080626  Kevin Wilson  Spectral Predictive Switching Device Activation 
US20080151910A1 (en) *  20061220  20080626  Kevin Wilson  Matrix Expansion Lattice 
WO2008079744A3 (en) *  20061219  20080821  Ninh Nguyen  Switch matrix expansion lattice 
US9008510B1 (en) *  20110512  20150414  Google Inc.  Implementation of a largescale multistage nonblocking optical circuit switch 
US20150146569A1 (en) *  20131122  20150528  Georg Rauh  TwoStage Crossbar Distributor and Method for Operation 
Citations (3)
Publication number  Priority date  Publication date  Assignee  Title 

US3214524A (en) *  19601221  19651026  Ass Elect Ind  Sectionalized automatic switching system 
US3313888A (en) *  19620515  19670411  Hitachi Ltd  Splitswitch crossbar trunking system 
US3410962A (en) *  19640710  19681112  Int Standard Electric Corp  Multiselectors employing crossbar switches having split horizontals or selection levels 
Patent Citations (3)
Publication number  Priority date  Publication date  Assignee  Title 

US3214524A (en) *  19601221  19651026  Ass Elect Ind  Sectionalized automatic switching system 
US3313888A (en) *  19620515  19670411  Hitachi Ltd  Splitswitch crossbar trunking system 
US3410962A (en) *  19640710  19681112  Int Standard Electric Corp  Multiselectors employing crossbar switches having split horizontals or selection levels 
Cited By (28)
Publication number  Priority date  Publication date  Assignee  Title 

US3863035A (en) *  19720620  19750128  Lynch Communication Systems  Call concentrator switching matrix 
US4811333A (en) *  19860401  19890307  Stc Plc  Substantially nonblocking space switching arrangement 
US4983961A (en) *  19880129  19910108  Ant Nachrichtentechnik Gmbh  Three stage nonblocking switching array 
US5198808A (en) *  19880920  19930330  Nec Corporation  Matrix switch apparatus with a diagnosis circuit having standby ports and reduced size matrix switching elements 
US20060013207A1 (en) *  19910501  20060119  Mcmillen Robert J  Reconfigurable, fault tolerant, multistage interconnect network and protocol 
US5303383A (en) *  19910501  19940412  Ncr Corporation  Multiprocessor computer system 
US7706361B2 (en)  19910501  20100427  Teradata Us, Inc.  Reconfigurable, fault tolerant, multistage interconnect network and protocol 
US5522046A (en) *  19910501  19960528  Ncr Corporation  Communication system uses diagnostic processors and master processor module to identify faults and generate mapping tables to reconfigure communication paths in a multistage interconnect network 
US5872904A (en) *  19910501  19990216  Ncr Corporation  Computer system using a master processor to automatically reconfigure faulty switch node that is detected and reported by diagnostic processor without causing communications interruption 
US6243361B1 (en)  19910501  20010605  Ncr Corporation  Multistage interconnect network uses a master processor to perform dynamic configuration for all switch nodes based on a predetermined topology 
US7058084B2 (en)  19910501  20060606  Ncr Corporation  Multistage interconnect network combines back channel replies received from destinations into a single result and transmits to the source 
US5451936A (en) *  19910620  19950919  The Johns Hopkins University  Nonblocking broadcast network 
US6745240B1 (en)  19991115  20040601  Ncr Corporation  Method and apparatus for configuring massively parallel systems 
US6418526B1 (en)  19991115  20020709  Ncr Corporation  Method and apparatus for synchronizing nodes in massively parallel systems 
US6412002B1 (en)  19991115  20020625  Ncr Corporation  Method and apparatus for selecting nodes in configuring massively parallel systems 
US6519697B1 (en)  19991115  20030211  Ncr Corporation  Method and apparatus for coordinating the configuration of massively parallel systems 
US20080143473A1 (en) *  20061219  20080619  Kevin Wilson  Digital CrossConnect Path Selection Method 
EP2095583A4 (en) *  20061219  20110216  Kevin Wilson  Matrix expansion lattice 
WO2008079744A3 (en) *  20061219  20080821  Ninh Nguyen  Switch matrix expansion lattice 
EP2095583A2 (en) *  20061219  20090902  Kevin Wilson  Matrix expansion lattice 
US20080151910A1 (en) *  20061220  20080626  Kevin Wilson  Matrix Expansion Lattice 
US7804825B2 (en)  20061220  20100928  Kevin Wilson  Matrix expansion lattice 
US20080150651A1 (en) *  20061220  20080626  Kevin Wilson  Spectral Predictive Switching Device Activation 
US7956668B2 (en)  20061220  20110607  Kevin Wilson  Spectral predictive switching device activation 
US9008510B1 (en) *  20110512  20150414  Google Inc.  Implementation of a largescale multistage nonblocking optical circuit switch 
US9210487B1 (en)  20110512  20151208  Google Inc.  Implementation of a largescale multistage nonblocking optical circuit switch 
US20150146569A1 (en) *  20131122  20150528  Georg Rauh  TwoStage Crossbar Distributor and Method for Operation 
US9614787B2 (en) *  20131122  20170404  Siemens Aktiengesellschaft  Twostage crossbar distributor and method for operation 
Similar Documents
Publication  Publication Date  Title 

US4866701A (en)  Packet switch with dynamic allocation of inputs  
Hluchyj et al.  Queueing in highperformance packet switching  
US4893304A (en)  Broadband packet switch with combined queuing  
US5689500A (en)  Multistage network having multicast routing congestion feedback  
US4829227A (en)  High speed data link  
US5331631A (en)  N+K sparing in a telecommunications switching environment  
Lee  A modular architecture for very large packet switches  
US5408231A (en)  Connection path selection method for crossconnect communications networks  
US3956593A (en)  Time space time (TST) switch with combined and distributed state store and control store  
US6590899B1 (en)  System for consolidating telecommunications traffic onto a minimum number of output paths  
US4914429A (en)  Switch components and multiple data rate nonblocking switch network utilizing the same  
US4785446A (en)  Distributed bit switching of a multistage interconnection network  
US5809129A (en)  Resource separation in a call and connection separated network  
US3912873A (en)  Multiple fault tolerant digital switching system for an automatic telephone system  
US5317561A (en)  Method for switching ATM message cell streams having a high bit rate via a switching equipment having a lower bit rate  
Barry et al.  On the number of wavelengths and switches in alloptical networks  
US5197064A (en)  Distributed modular packet switch employing recursive partitioning  
US5884297A (en)  System and method for maintaining a table in content addressable memory using hole algorithms  
US5801641A (en)  Controller for a nonblocking broadcast network  
US5179552A (en)  Crosspoint matrix switching element for a packet switch  
US7023797B2 (en)  Flexible aggregation of output links  
US6473501B1 (en)  Concurrent hunt group searching methods and arrangements  
US4005272A (en)  Time folded TST (time space time) switch  
US5384840A (en)  Telecommunications system SS7 signaling interface with signal transfer capability  
US8170040B2 (en)  Fully connected generalized butterfly fat tree networks 