Marianne F Paker

US Patent:

53295242, Jul 12, 1994

Filed:

Oct 20, 1992

Appl. No.:

7/963975

Inventors:

Marianne F. Paker - West Chicago IL
Robert L. Pawelski - Lisle IL
William A. Payne - Glen Ellyn IL

Assignee:

AT&T Bell Laboratories - Murray Hill NJ

International Classification:

H04J 1408

US Classification:

370 581

Abstract:

A time-division multiplexed circuit switch (100) handles different-size time-division multiplex frames (30, 40, 50) in a single, shared, time-space-time switching fabric. Both time slot interchange stages (131,141) and a time-multiplexed space stage (120) of the switching fabric receive a plurality of overlapping different-size frames in each incoming superframe (30) of a succession of superframes and interleave switching of the different-size frames through the switching fabric to create a succession of outgoing superframes each one of which also has a plurality of the time-division-multiplex frames of different-sizes but from a plurality of incoming superframes. Switching of every individual received frame of any size commences as soon as the entire individual frame is received.

US Patent:

53454413, Sep 6, 1994

Filed:

Oct 20, 1992

Appl. No.:

7/964224

Inventors:

Marianne F. Paker - West Chicago IL
Robert L. Pawelski - Lisle IL
William A. Payne - Glen Ellyn IL
Gaylord W. Richards - Lisle IL

Assignee:

AT&T Bell Laboratories - Murray Hill NJ

International Classification:

H04J 1408
H04Q 1104
H04L 1252

US Classification:

370 54

Abstract:

In a time-space-time switching network that provides connections at a hierarchy of data rates, a path-hunt arrangement effects establishment of a switched connection of a given bandwidth as a collection of a plurality of connections of smaller bandwidths of different sizes. Connections are first found at the highest rate of the hierarchy to satisfy as much of the given bandwidth as possible. Then, connections are found at the lower rates to satisfy any remaining unsatisfied bandwidth. The path-hunt uses a hierarchy of status tables, corresponding to the hierarchy of rates, for each time-switching element of the network. The tables have entries that define availability of time slots--representing bandwidth of the tables' corresponding rates--between that time-switching element and a space-switching stage of the network. Connections are provided at the highest rate by finding matching idle time-slot entries in the high rate status tables for the two time-switching elements involved in the connection. Connections are provided at a lower rate by finding matching partially-full time-slot entries in the highest rate status tables for the two time-switching elements and then finding matching idle time-slot entries in the corresponding lower-rate status tables.