US4866701A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet switch with dynamic allocation of inputs
Assignee: Nytell Software LLC
•
Filing: 1988-09-02
•
Granted: 1989-09-12
•
Expires: 2008-09-02
Abstract
Abstract A novel packet switch architecture is disclosed. In the novel packet switch, inputs are dynamically allocated between newly arriving and recirculating packets to make maximum use of available bandwidth while simultaneously resolving output port conflicts.
Inventors
- 👤 James N. Giacopelli
- 👤 Walter D. Sincoskie
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 13:59
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/00; H04L49/10; H04L49/104; H04L49/105; H04L49/106; H04L49/15; H04L49/1553; H04L49/1561; H04L49/25; H04L49/253; H04L49/255; H04L49/256; H04L49/258; H04L2012/5603; H04L2012/5609; H04L2012/561; H04L2012/5629; H04L2012/5631; H04L2012/5638; H04L2012/5646; H04L2012/5649; H04L2012/5651; H04L2012/5652
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
104 words
A recirculation arrangement for use in a packet switch having a plurality of inputs and a plurality of outputs, said recirculation arrangement serving to route data packets which cannot be routed to said outputs back to said inputs, said recirculation arrangement comprising means for generating steering packets containing input addresses, means for combining said steering packets and said data packets to be routed back to said inputs so that said addresses in said steering packets form headers for said data packets to be routed back to said inputs, and a self-routing network for routing said data packets to said inputs based on said headers.
Claim 2
Dependent Claim
104 words
A recirculation arrangement for use in a packet switch having a plurality of inputs and a plurality of outputs, said recirculation arrangement serving to route data packets which cannot be routed to said outputs back to said inputs, said recirculation arrangement comprising means for generating steering packets containing input addresses, means for combining said steering packets and said data packets to be routed back to said inputs so that said addresses in said steering packets form headers for said data packets to be routed back to said inputs, and a self-routing network for routing said data packets to said inputs based on said headers.
Claim 3
Dependent Claim
35 words
The arrangement of claim 1 wherein said routing network is a banyan network and said recirculation arrangement further includes a concentrator network for concentrating said steering packets before they are combined with said data packets.
Claim 4
Dependent Claim
140 words
A packet switch comprising a plurality of input port controllers for receiving newly arriving and recirculating data packets synchronously in time slots, a plurality of output port controllers, conflict resolving means for resolving conflicts among data packets containing the same destination address so as to indicate which packets are to be routed to said output port controllers so that they can exit from said switch and to indicate which packets are to be recirculated to said input port controllers, routing means for routing packets indicated as exiting by said conflict resolution means to said output port controllers, and recirculating means for recirculating packets indicated as recirculating by said conflict resolution means back to said input port controllers, said recirculating means serving to allocate said input port controllers between said newly arriving packets and said recirculating packets on a slot-by-slot basis.
Claim 5
Dependent Claim
140 words
A packet switch comprising a plurality of input port controllers for receiving newly arriving and recirculating data packets synchronously in time slots, a plurality of output port controllers, conflict resolving means for resolving conflicts among data packets containing the same destination address so as to indicate which packets are to be routed to said output port controllers so that they can exit from said switch and to indicate which packets are to be recirculated to said input port controllers, routing means for routing packets indicated as exiting by said conflict resolution means to said output port controllers, and recirculating means for recirculating packets indicated as recirculating by said conflict resolution means back to said input port controllers, said recirculating means serving to allocate said input port controllers between said newly arriving packets and said recirculating packets on a slot-by-slot basis.
Claim 6
Dependent Claim
14 words
The switch of claim 3 wherein said conflict resolution means comprises a trap network.
Claim 7
Dependent Claim
13 words
The switch of claim 3 wherein said routing means comprises a banyan network.
Claim 8
Dependent Claim
24 words
The switch of claim 3 wherein said routing means comprises a plurality of routing networks to provide multiple paths to each output port controller.
Claim 9
Dependent Claim
50 words
The switch of claim 3 wherein said recirculating means comprises means for combining said recirculating packets with steering packets to provide said recirculating packets with headers containing the addresses of input port controllers and routing means for routing said recirculating packets to the input port controllers indicated by the headers.
Claim 10
Dependent Claim
98 words
A packet switch for synchronously routing data packets in time slots between a plurality of inputs and a plurality of outputs, said switch comprising: means for resolving conflicts among data packets occupying the same time slot and containing the same output address to indicate which of said packets is to be recirculated to said inputs and which of said packets is to be routed to said outputs, and recirculating means for allocating said inputs on a slot-by-slot basis between newly arriving data packets and recirculating packets to enable said recirculating packets to be routed back to said inputs.
Claim 11
Dependent Claim
98 words
A packet switch for synchronously routing data packets in time slots between a plurality of inputs and a plurality of outputs, said switch comprising: means for resolving conflicts among data packets occupying the same time slot and containing the same output address to indicate which of said packets is to be recirculated to said inputs and which of said packets is to be routed to said outputs, and recirculating means for allocating said inputs on a slot-by-slot basis between newly arriving data packets and recirculating packets to enable said recirculating packets to be routed back to said inputs.
Claim 12
Dependent Claim
16 words
The switch of claim 8 wherein said address is a logical address or a physical address.
Claim 13
Independent Claim
98 words
A method for synchronously routing data packets in time slots between a plurality of inputs and a plurality of outputs of a packet switch comprising the steps of: resolving conflicts among data packets occupying the same time slot and containing the same output address to indicate which of said packets is to be recirculated to said inputs and which of said packets is to be routed to said outputs, and allocating said inputs on a slot-by-slot basis between newly arriving data packets and recirculating data packets to enable said recirculating packets to be routed back to said inputs.
Claim 14
Independent Claim
98 words
A method for synchronously routing data packets in time slots between a plurality of inputs and a plurality of outputs of a packet switch comprising the steps of: resolving conflicts among data packets occupying the same time slot and containing the same output address to indicate which of said packets is to be recirculated to said inputs and which of said packets is to be routed to said outputs, and allocating said inputs on a slot-by-slot basis between newly arriving data packets and recirculating data packets to enable said recirculating packets to be routed back to said inputs.
Claim 15
Dependent Claim
31 words
The method of claim 10 wherein said method further comprises the step of delaying each newly arriving data packet at an input for a duration in excess of one time slot.
Claim 16
Independent Claim
134 words
A method for routing packets in a packet switch comprising the steps of: determining whether each of a plurality of inputs of said switch will submit a newly arriving data packet to said switch in a particular subsequent time slot, generating a steering packet at each input that will not submit a newly arriving data packet to said switch in said subsequent time slot, said steering packets containing the addresses of the inputs issuing them, combining said steering packets with recirculating data packets to provide said recirculating packets with the addresses of inputs that will not submit a newly arriving packet in said subsequent time slot, and routing said recirculating packets to the inputs indicated by said addresses so that said recirculating packets can be resubmitted to said switch in said subsequent time slot.
Claim 17
Independent Claim
134 words
A method for routing packets in a packet switch comprising the steps of: determining whether each of a plurality of inputs of said switch will submit a newly arriving data packet to said switch in a particular subsequent time slot, generating a steering packet at each input that will not submit a newly arriving data packet to said switch in said subsequent time slot, said steering packets containing the addresses of the inputs issuing them, combining said steering packets with recirculating data packets to provide said recirculating packets with the addresses of inputs that will not submit a newly arriving packet in said subsequent time slot, and routing said recirculating packets to the inputs indicated by said addresses so that said recirculating packets can be resubmitted to said switch in said subsequent time slot.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-09-11 | 1993-03-13 | 1993-09-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-11 | 1997-03-13 | 1997-09-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-11 | 2001-03-13 | 2001-09-12 | $7700.00 | Window Closed / Lapsed |