Patent US2723376A successfully refreshed from Google Patents.
Patent US5469432A successfully refreshed from Google Patents.
US5469432A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High-speed digital communications network
Assignee: GARRET FAMILY LIVING TRUST U/D/T DATED SEPTEMBER 27 2004
•
Filing: 1993-08-26
•
Granted: 1995-11-21
•
Expires: 2013-08-26
Abstract
Abstract A digital communications network for digital data comprising packets of a predetermined size. A transmitter and a receiver are connected to a set of buffers which are connected to a microprocessor which controls the data flow into and out of the buffers. The size of the buffers and hence the size of the data packets is relatively large. This allows the processor to perform per-packet operations in software which would otherwise be done in hardware, including routing decisions and error detection and correction. The network allows various topologies, is speed scalable, and simplifies resource allocation.
Inventors
- 👤 Erann Gat
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 13:15
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L; H04L12/00; H04L12/66; H04L49/00; H04L49/10; H04L49/103; H04L49/101; H04L49/25; H04L49/253; H04L49/254
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
202 words
A node of a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said packets being of a predetermined fixed size, the size being no less than 512 bytes, said node comprising: (a) buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (b) transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (c) receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, and (d) processing means electrically connected to said memory buffers, said transmitter means, and said receiver means, said processing means being for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers.
Claim 2
Dependent Claim
202 words
A node of a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said packets being of a predetermined fixed size, the size being no less than 512 bytes, said node comprising: (a) buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (b) transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (c) receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, and (d) processing means electrically connected to said memory buffers, said transmitter means, and said receiver means, said processing means being for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers.
Claim 3
Dependent Claim
27 words
A node according to claim 1 including a host computer interface enabling the transfer of data between the node and a host computer connected to said interface.
Claim 4
Dependent Claim
24 words
A node according to claim 1 wherein said memory buffer means includes at least one multiport random access memory having at least three ports.
Claim 5
Dependent Claim
29 words
A node according to claim 1 wherein the size of a packet is sufficiently large that a maximal-length standard Ethernet packet may be entirely contained in the packet payload.
Claim 6
Dependent Claim
18 words
A node according to claim 1 wherein the size of a packet is an integral power of 2.
Claim 7
Dependent Claim
15 words
A node according to claim 1 wherein the size of a packet is 2048 bytes.
Claim 8
Dependent Claim
38 words
A node according to claim 1 wherein said processing means includes means for managing the memory buffers to minimize the impact of packets lost as a result of there being insufficient memory buffers for storing all incoming packets.
Claim 9
Dependent Claim
30 words
A node according to claim 1 wherein said processing means includes means for determining when a packet has existed beyond a predetermined time and means for discarding such a packet.
Claim 10
Dependent Claim
13 words
A node according to claim 1 including at least one additional transmitter means.
Claim 11
Dependent Claim
37 words
A switch consisting of a node according to claim 9 wherein at least two of the transmitter means are connected to the memory buffers through a switching means, said switching means being controlled by the processing means.
Claim 12
Dependent Claim
14 words
A switch according to claim 10 wherein said switching means is a crossbar switch.
Claim 13
Dependent Claim
63 words
A communications network for packets of digital data comprising a plurality of nodes according to any one of claims 1 or 9 connected together by a plurality of unidirectional transmission media, each unidirectional transmission medium connecting exactly one transmitter means of a first node to exactly one receiver means of a second node, said first and second nodes possibly being the same node.
Claim 14
Dependent Claim
90 words
A communications network according to claim 12 comprising a number of nodes arranged as a ring wherein a transmitter means of a first node is connected through a first unidirectional transmission medium to a receiver means of a second node, a transmitter means of said second node is connected through a second unidirectional transmission medium to a receiver means of a third node, and so on until the transmitter means of a final node is connected through a final unidirectional transmission medium to the receiver means of said first node.
Claim 15
Dependent Claim
19 words
A communications network comprising a plurality of ring-type networks according to claim 13 connected by at least one switch.
Claim 16
Dependent Claim
21 words
A communications network according to claim 14 wherein at least one of the ring-type networks is connected to exactly one switch.
Claim 17
Dependent Claim
33 words
A communications network according to claim 15 wherein at least one of the ring-type networks consists of exactly one node connected to exactly one switch through exactly one pair of unidirectional transmission media.
Claim 18
Dependent Claim
56 words
A communications network according to claim 12 wherein a pair of the unidirectional transmission media are combined into a bidirectional transmission medium which simultaneously connects the transmitter means of a first node to the receiver means of a second node and the transmitter means of said second node to the receiver means of said first node.
Claim 19
Dependent Claim
38 words
A communications network according to claim 12 including at least one external network interface means for enabling the transfer of data between said communications network and a second communications network of a type different from said communications network.
Claim 20
Dependent Claim
18 words
A node according to claim 1 further including software means for controlling the operation of said processing means.
Claim 21
Independent Claim
270 words
A method of designing a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said method comprising the steps of: (a) selecting a fixed size for the packets of data, said size being no less than 512 bytes, and then (b) designing a buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (c) designing a transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (d) designing a receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, (e) designing a processing means for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers, and (f) a step selected from the group consisting of: i) fabricating a device according to the design produced in steps a, b, c, d and e; ii) causing fabrication of a device according to the design produced in steps a, b, c, d and e; or iii) communicating the design produced in steps a, b, c, d and e to enable fabrication of a device according to said design.
Claim 22
Independent Claim
270 words
A method of designing a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said method comprising the steps of: (a) selecting a fixed size for the packets of data, said size being no less than 512 bytes, and then (b) designing a buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (c) designing a transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (d) designing a receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, (e) designing a processing means for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers, and (f) a step selected from the group consisting of: i) fabricating a device according to the design produced in steps a, b, c, d and e; ii) causing fabrication of a device according to the design produced in steps a, b, c, d and e; or iii) communicating the design produced in steps a, b, c, d and e to enable fabrication of a device according to said design.
Claim 23
Independent Claim
201 words
A method of making a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said method comprising the steps of: (a) selecting a fixed size for the packets of data, said size being no less than 512 bytes, and then (b) providing a buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (c) providing a transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (d) providing a receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, and (e) providing a processing means for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers.
Claim 24
Independent Claim
201 words
A method of making a communications network for transporting packets of digital data wherein said packets include a header portion containing data for controlling the transmission of packets through the network, and a payload portion containing data to be transported, said method comprising the steps of: (a) selecting a fixed size for the packets of data, said size being no less than 512 bytes, and then (b) providing a buffer means comprising a plurality of memory buffers, each said memory buffer being of sufficient size to contain a packet in its entirety, (c) providing a transmitter means capable of transmitting in its entirety a packet contained in any one of said plurality of memory buffers onto a first unidirectional transmission medium, (d) providing a receiver means capable of receiving a packet from a second unidirectional transmission medium and storing said packet in its entirety into any one of said plurality of memory buffers, and (e) providing a processing means for: i) controlling the selection of memory buffers from which packets are transmitted by said transmitter means, ii) controlling the selection of memory buffers into which packets are stored by said receiver means, and iii) accessing data contained in said memory buffers.
References Cited (Backward Citations)
US4744078A
Cited
US5090029A
Cited
US4947388A
Cited
US5046065A
Cited
US5103447A
Cited
US5016248A
Cited
US5038347A
Cited
US5020020A
Cited
US5187780A
Cited
US5184346A
Cited
US5113392A
Cited
US5099475A
Cited
US5224096A
Cited
US5241682A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-11-20 | 1999-05-22 | 1999-11-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-11-20 | 2003-05-22 | 2003-11-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-11-20 | 2007-05-22 | 2007-11-21 | $7700.00 | Window Closed / Lapsed |