Pmc-sierra, Inc.

Kenneth Evert Sailor

Carl Dietz McCrosky

Andrew Milton Hughes

Winston K Mok

Larrie Simon Carr

Winston Ki-Cheong Mok

Jeffrey Scott Roe

Douglas Konkin

Richard Blake Ryder Wiggs

Paul Edmund Somogyi

James Ames Meacham, Ii

A Forward Propagation Architecture is a novel switch architecture based on well-known unicast switching architectures, and provides two desirable properties: (1) no rearrangement of established calls is ever required and (2) the architecture is strictly non-blocking for multicast, even when multicast destinations are dynamically added to existing calls. These properties (excluding dynamic multicast destination addition) can be provided by standard architectures or Time:Space:Time architectures with speedup proportional to the width of the widest multicast to be supported. The speedup required by the FPA is constant and practical (approximately 4&#xd7; speedup) and at significantly less hardware cost than narchitectures. The key to the FPA's capability is a sequentially doubled fabric with a feedback loop. The FPA requires a routing algorithm for connection setting. The connection-setting algorithm is sufficiently simple to be implemented in hardware.

Efficient strictly non-blocking multicast switch architecture for time division multiplexed traffic

Multicast call blocking is reduced in TST switch fabrics with the aid of an m-entry data structure. Each entry corresponds to one of m timeslots, and has 2n sub-entries corresponding to n input ports and n output ports. An N-cast call X:(y&#x2192;z, z. . . z) is representable by associating a selected entry's yinput sub-entry with z, z, . . . zof the selected entry's output sub-entries. Upon receipt of a call, the data structure entries are sequentially examined to detect the first entry for which a yinput sub-entry is unused and z, z, . . . zoutput sub-entries are unused. If such an entry is detected, the call is scheduled for transmission in the corresponding timeslot. If there is no such entry and if N=1 the call cannot be scheduled; but, if N&#x3e;1 the call is divided into two or more calls and an attempt is made to schedule them as above.

Multicast connection scheduling in time:space:time switching fabrics

A multicast connection scheduling method for a 3-stage switch fabric with nfirst stage, nsecond stage and nthird stage interconnected switching devices. The first and third stage devices are non-blocking for unicast connections. The center stage devices are non-blocking for multicast connections. Load tables are provided for each center stage device, with one row per first and/or third stage device. Each row represents the number of connections being serviced between the first and/or third stage devices, through the center stage device corresponding to the table. By monitoring and updating the tables, the invention derives an approximately optimal connection schedule for an input list of connection requests, such that no input connection load exceeds any center stage device's maximum input connection load capacity and no output connection load exceeds any center stage device's maximum output connection load capacity.

Load balancing multicast connection scheduling in 3-stage TDM fabrics

A method of adding a new connection (c, d) to a time:space:time switch fabric. The fabric has a set I of k input elements, a set M of m switch elements, and a set O of l output elements. Each input element contributes one input to each switch element, and each output element receives one output from each switch element. A state Scharacterizes the switch elements as a set of ordered pairs (i, j), where (i, j) &#x3b5; Sif and only if the joutput element is coupled to the iinput element through one of the switch elements. The range of Sis the set of outputs of Ssuch that if j &#x3b5; range(S) then (i, j) &#x3b5; Sfor some i &#x3b5; I. The domain of Sis the set of inputs of Ssuch that if i &#x3b5; domain(S) then (i, j) &#x3b5; Sfor some j &#x3b5; O.

Bipartite graphical connecting scheduling in time and space switch fabrics

A time:space:time switch fabric incorporating an odd integer number of spatially distributed data switches and a plurality of spatially distributed data serializers. Each data switch has a first plurality of ingress ports, an equal plurality of egress ports, and a space switch for selectably interconnecting any one of the ingress ports to any one of the egress ports. Each data serializer has an input bus for receiving signals to be routed through the switch fabric, an output bus for outputting signals routed through the switch fabric, a plurality of egress ports selectably connectible to any one of the data switch ingress ports, and an equal plurality of ingress ports selectably connectible to any one of the data switch egress ports. The ingress/egress ports are characterized by:

Growing community of inventors

Saskatoon, Canada

Kenneth Evert Sailor