STD switching in an ATD environment

The author examines some of the dimensioning problems encountered when using an asynchronous time-division network, to carry synchronous traffic. The basic switch is built around a memory, buffering the frames to be processed. The incoming flows are to be emitted on the output trunks in some order depending on external constraints, so the buffers play in fact the role of a reordering stage; the authors calculates their size, so that the rejection probability meets the grade-of-service criteria. He compares briefly two memory organizations for synchronous time-division switches, namely, common memory and full partitioning.<>