Back to results
US 6,307,852 B1Granted
Rotator switch data path structures
AssigneeNortel Networks Limited
InventorsDavid Anthony Fisher, Michel Langevin
Life of this patent
Estimating the term…
Abstract
Several rotator switch architectures are provided that enhance performance of a basic rotator switch. The rotator switches having double buffered tandem nodes, multiplexing two or more sources onto each tandem node, partitioning the rotator into two or more parallel space switches, two or more rotator planes multiplexing front/to source and destination nodes to provide data path redundancy, priority queueing on source nodes scheduled locally or globally, or redundancy in the schedulers are shown.
Claims4
A rotator switch having a rotation cycle and comprising:
- a plurality of source nodes, each source node having an output;
- a first commutator;
- a plurality of intermediate nodes, each said intermediate node including two sets of memory locations, the first one for being written to, the second for being read from during each rotation cycle;
- means for swapping said first and second memories of a particular tandem at a same point in the rotation cycle relative to a particular source or destination, such that selecting unoccupied memory locations is independent of allocations made in the previous cycle of rotation, a second commutator and a plurality of destination nodes, whereby the output from the memories are written via the second commutator and the plurality of destination nodes.
1 more element
A rotator switch comprising:
- a plurality of source nodes, each source node having an output;
- a first rotator plane including a first commutator including a first plurality of switches each of said first plurality of switches connected to at least some of the source node outputs;
- a first plurality of intermediate nodes each intermediate node connected to each of said first plurality of switches of the first commutator;
- a second commutator including a second plurality of switches each of said second plurality of switched connected to each of the plurality intermediate nodes;
- a second rotator plane including a third commutator including a third plurality of switches each of said third plurality of switches connected to at least some of the source node outputs;
- a second plurality of intermediate nodes each intermediate node connected to each of said third plurality of switches of the third commutator;
- a fourth commutator including a fourth plurality of switches each of said fourth plurality of switched connected to each of the second plurality intermediate nodes;and
- a plurality of destination nodes, each destination node having an input connected to one of the second and fourth plurality of switches,
- wherein on arrival at a source information units are sorted and queued by destination and each destination queue is further subdivided into one queue per priority such that a source to tandem matching process is extended to include a reservation process wherein for each priority in turn starting with the highest all sources are matched to a particular tandem in advance of its cycle of rotation, and in place of information unit transfer the source secures a reservation for transfer in a future rotation such that the second priority queues see the residue of the tandem availability after one cycle of reservations has been made to the highest priority and so such that after all K4 priorities have been matched against successive cycles of the rotator tandem the information unit is transferred in the K4th+1 cycle in accordance with the reservations and wherein each priority matching process being conducted concurrently so that at each phase of the rotation cycle there are K4 availability vectors passed from the tandem to the source each representing the residue after reservations have been made in earlier cycles to higher priorities.
6 more elements
Dependencies are inferred from the claim text.