US5412646A — Asynchronous transfer mode switch architecture

Claim 1

Independent Claim 167 words

An expansion module for use in a packet switch, said expansion module comprising: means for receiving a data cell via one of n inputs and for dividing said data cell into j sequential segments as it is being received, where j>1 and n>1, means for supplying said segments to respective ones of a plurality of concentrator units based on the sequential order of said segments, each of said concentrator units including k concentrator logic units and means for supplying a received segment to each of said k concentrator logic units, one of said concentrator logic units accepting the segment for storage therein based on routing information contained in the associated data cell, where k>1, and means for unloading, in a prescribed order, the segments forming said cell from the concentrator logic units in which said segments are stored and recombining said segments to form said cell and then supplying the fortned cell to an associated one of k outputs selected as a function of said routing information.

Claim 2

Dependent Claim 167 words

An expansion module for use in a packet switch, said expansion module comprising: means for receiving a data cell via one of n inputs and for dividing said data cell into j sequential segments as it is being received, where j>1 and n>1, means for supplying said segments to respective ones of a plurality of concentrator units based on the sequential order of said segments, each of said concentrator units including k concentrator logic units and means for supplying a received segment to each of said k concentrator logic units, one of said concentrator logic units accepting the segment for storage therein based on routing information contained in the associated data cell, where k>1, and means for unloading, in a prescribed order, the segments forming said cell from the concentrator logic units in which said segments are stored and recombining said segments to form said cell and then supplying the fortned cell to an associated one of k outputs selected as a function of said routing information.

Claim 3

Dependent Claim 36 words

The switch of claim 1 wherein each of said concentrator logic units comprises k memories arranged in parallel, and means for storing segments as they are accepted in individual ones of said memories in robin-robin fashion.

Claim 4

Dependent Claim 19 words

The switch of claim 2 wherein each of the k memories is a First In, First Out (FIFO) memory.

Claim 5

Dependent Claim 186 words

A packet switch comprising: means for slicing a data cell received via one of n inputs into j segments and supplying the segments to respective ones of k concentrator units, each of the concentrator units having k groups of memories, in which the memories of each group are arranged in parallel and selected in a predetermined sequence, where j>1, k>1 and n>1, means contained in each of said concentrator units for accepting the respective one of said segments at one of the associated k groups of memories based on a destination assigned to the associated data cell and temporarily storing the accepted segment in a selected one of the memories of said one of the associated k groups of memories, and means associated with each of said groups of memories for unloading in said predetermined sequence the segments stored in the memories of the associated group, combining unloaded segments from differents ones of said groups to form the respective data cell and then forwarding the data cell to its intended destination via one of a plurality of outputs selected as a function of the assigned destination.

Claim 6

Dependent Claim 186 words

A packet switch comprising: means for slicing a data cell received via one of n inputs into j segments and supplying the segments to respective ones of k concentrator units, each of the concentrator units having k groups of memories, in which the memories of each group are arranged in parallel and selected in a predetermined sequence, where j>1, k>1 and n>1, means contained in each of said concentrator units for accepting the respective one of said segments at one of the associated k groups of memories based on a destination assigned to the associated data cell and temporarily storing the accepted segment in a selected one of the memories of said one of the associated k groups of memories, and means associated with each of said groups of memories for unloading in said predetermined sequence the segments stored in the memories of the associated group, combining unloaded segments from differents ones of said groups to form the respective data cell and then forwarding the data cell to its intended destination via one of a plurality of outputs selected as a function of the assigned destination.

Claim 7

Dependent Claim 17 words

The switch of claim 4 wherein each of said memories is a First In, First Out memory.

Claim 8

Dependent Claim 13 words

The switch of claim 4 wherein said predetermined sequence is a round-robin sequence.

Claim 9

Dependent Claim 167 words

A packet switch comprising k packet switch modules each having n/k outputs for forwarding data packets received via individual ones of n inputs to said switch to their intended destinations, where k>1 and n>1; an expansion module interposed between said inputs and said packet switch modules, said expansion module comprising, means for dividing each of the data packets received via said inputs into a sequence of segments and supplying the segments to respective concentrator units based on their sequential order, each of said concentrator units having k inputs and including means for supplying a received segment to each of the k inputs and temporarily storing a received segment at one of the k inputs selected as a function of the destination of the associated data packet, and means for combining associated segments temporarily stored in respective concentrator units and supplying the resulting data packet to an associated one of said k packet switch modules so that the resulting data packet may be forwarded to its intended destination.

Claim 10

Dependent Claim 167 words

A packet switch comprising k packet switch modules each having n/k outputs for forwarding data packets received via individual ones of n inputs to said switch to their intended destinations, where k>1 and n>1; an expansion module interposed between said inputs and said packet switch modules, said expansion module comprising, means for dividing each of the data packets received via said inputs into a sequence of segments and supplying the segments to respective concentrator units based on their sequential order, each of said concentrator units having k inputs and including means for supplying a received segment to each of the k inputs and temporarily storing a received segment at one of the k inputs selected as a function of the destination of the associated data packet, and means for combining associated segments temporarily stored in respective concentrator units and supplying the resulting data packet to an associated one of said k packet switch modules so that the resulting data packet may be forwarded to its intended destination.

Claim 11

Independent Claim 158 words

A method of operating a packet switch comprising: responsive to receipt of data cells via individual ones of n inputs, dividing each of the received cells into a plurality of sequential segments, where n>1, supplying each of the segments to respective ones of j concentrator units based on the segments sequential order in their associated data cell, where j>1, within each concentrator unit, supplying a received segment to each of associated inputs and controlling the inputs so that only one of them accepts the received segment for temporary storage, in which such acceptance is based on routing information contained in an associated segment, unloading associated segments in the order that they were stored in different ones of the j concentrator units and combining the segments in the order that were unloaded to form the associated data cell, and supplying the formed data cell to one of k outputs identified as a function of said routing information, where k>1.

Claim 12

Independent Claim 158 words

A method of operating a packet switch comprising: responsive to receipt of data cells via individual ones of n inputs, dividing each of the received cells into a plurality of sequential segments, where n>1, supplying each of the segments to respective ones of j concentrator units based on the segments sequential order in their associated data cell, where j>1, within each concentrator unit, supplying a received segment to each of associated inputs and controlling the inputs so that only one of them accepts the received segment for temporary storage, in which such acceptance is based on routing information contained in an associated segment, unloading associated segments in the order that they were stored in different ones of the j concentrator units and combining the segments in the order that were unloaded to form the associated data cell, and supplying the formed data cell to one of k outputs identified as a function of said routing information, where k>1.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1998-05-01	1998-10-31	1999-05-02	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2002-05-01	2002-10-31	2003-05-02	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2006-05-01	2006-10-31	2007-05-02	$7700.00	Window Closed / Lapsed

Asynchronous transfer mode switch architecture

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag