US 4,730,305 AGranted

Fast assignment technique for use in a switching arrangement

AssigneeAmerican Telephone and Telegraph Company, AT&T Bell Laboratories

InventorsAnthony Acampora, Kai Y. Eng

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present invention relates to a fast packet assignment technique, and a TDMA or FDMA multi-port switching arrangement for implementing such technique. In the present technique, the total traffic in a two-dimensional traffic matrix (T) from and to each of N remote service areas, regardless of destination or origination, is totaled to form separate input (R) and output (S) traffic vectors, respectively. Non-conflicting assignments are then made from these vectors for each packet or channel available during a predetermined time period while also providing the capability of substantially reducing multi-path or antenna sidelobe interference. An M.times.M switch (16) is designed to implement such technique which directs C input packets from M inputs (20.sub.1-M) into separate memory locations (Z.sub.ij). During the time period of the next C input packets, the M.times.M switch directs the presently stored packets to the proper ones of M outputs (27.sub.1-M) at the appropriate time for transmission in the proper packet or channel to the destined remote service areas. In accordance with the present technique and switch, the M packets concurrently directed from memory to the M output ports can comprise more than one packet from a particular service area to other separate service areas.

Claims10

Dependent claims

A switching arrangement comprising:

a plurality of M input ports (20.sub.1 -20.sub.M) for receiving M separate input signals, each input signal comprising a plurality of C separate packets of information formatted in a first arrangement of C channels received during a predetermined period of time;
a plurality of M output ports (27.sub.1 -27.sub.M);
a memory comprising a first and a second section (23.sub.iA and 23.sub.iB), each section including a plurality of C-by-M memory locations;
a distribution arrangement (18,21,22,24-26, FIG. 1;
18,26,40-42,43-44, FIG. 7) for directing the C separate packets of information received at each input during sequential ones of the predetermined periods of time alternately into the first section and then the second section of the memory, while concurrently directing the C-by-M separate packets of information stored in the first or second memory section during an immediately prior predetermined time period to the M output ports in a predetermined sequence of M concurrent packets for formatting each of the M output signals in a second arrangement of C channels, the M concurrent packets being capable of including more than one packet of information from a particular input port for transmission to separate ones of the M output ports;
a plurality of M receivers (12), each receiver including an output terminal connected to a separate one of the M input ports and an input terminal;
and
an N-by-M switching means for directing N input signals concurrently received during each predetermined time period to the input terminals of the plurality of M receivers, each input signal comprising C packets of information, and the N-by-M switching means comprises a plurality of separate P-by-Q switches (14) with each P-by-Q switch receiving a separate group of P of the N input signals and directing the packets of information received in the associated P input signals to the input terminals of a separate group of Q receivers forming part of the plurality of M separate receivers, where N>P and Q is dependent on the number of C packets of information included in the group of associated P input signals during the predetermined period of time and is equal to or less than P.

5 more elements

A switching arrangement comprising:

a plurality of M input ports for receiving M separate input signal, each input signal comprising a plurality of C separate packets of information formatted in a first arrangement of C channels received during a predetermined period of time;
a plurality of M output ports;
a memory comprising a first and a second section, each section including a plurality of C-by-M memory locations;
a distribution arrangement for directing the C separate packets of information received at each input during sequential ones of the predetermined periods of time alternately into the first section and then the second section of the memory, while concurrently directing the C-by-M separate packets of information stored in the first or second memory section during an immediately prior predetermined time period to the M output ports in a predetermined sequence of M concurrent packets of information for formatting each of the M output signals in a second arrangement of C channels, the M concurrent packets being capable of including more than one packet of information from a particular input port for transmission to separate ones of the M output ports;
a plurality of M transmitters, each transmitter including an input terminal connected to a separate one of the M output ports and an output terminal;
and
an M-by-N switching means for directing concurrent outputs appearing at the output terminals of the plurality of M transmitters to predetermined ones of a plurality of N output signals, each output from a transmitter output terminal comprising packets of information in the second arrangement of C channels, and the M-by-N switching means comprises a plurality of separate Q-by-P switches, each Q-by-P switch receiving a separate group of Q signals from the output terminals of an associated group of Q transmitters forming part of the plurality of M transmitters and directing the associated group of Q signals to P separate output signals forming part of the plurality of N output signals, where N>P and Q is dependent on the number of C packets of information included in the group of Q output signals during the predetermined period of time and is equal to or less than P.

4 more elements

A method of assigning the non-uniform traffic requirements between each of the grouped pairs of of a plurality of N remote service areas to each of a plurality of M inputs and outputs of a switching arrangement, where M<N and each of the M inputs and outputs of the switching arrangement comprises a plurality of C packets of information in a predetermied period of time, the method comprising the steps of:

(a) representing the system traffic requirements by an N-by-N matrix having the form ##EQU6## where the individual elements t.sub.ij in the matrix represent units of traffic originating in service area i and destined for service area j;
(b) summing each of the rows and columns of the traffic matrix of step (a) to form N separate input elements, R, and N separate output elements, S, respectively, of a respective overall input and output vector such that ##EQU7## (c) subdividing the plurality of N input elements and N output elements into subgroups of P input and output elements, each subgroup being associated with a separate number Q of the plurality of M inputs or M outputs of the switching arrangement depending on the total of C units of traffic associated with each subgroup of the input or output elements, where Q is equal to or less than P;
(d) removing Q associated units of traffic from each of the subgroups of the input or output elements, including those elements which equal C, regardless of orientation or destination, and assigning the Q units of traffic to separate ones of the Q associated inputs or outputs, respectively, of the switching arrangement during a predetermined subperiod of the predetermined period of time;
(e) reducing each of the input elements or output elements from which a unit of traffic was taken in step (d) by one unit;
and
(f) reiterating steps (d) and (e) C-1 times wherein the value of C used in the reiteration of step (d) shall equal C-x, where x is the number of times step (d) is reiterated.

3 more elements

Dependencies are inferred from the claim text.