US5031174A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Node device
Assignee: Sumitomo Electric Industries Ltd
•
Filing: 1989-02-07
•
Granted: 1991-07-09
•
Expires: 2009-02-07
Abstract
Abstract This invention relates to a node device which, in the case of a plurality of different types of networks are connected to one another, is able to relay and transmit a packet from a conventional type (e.g., ethernet) LAN to a FDDI LAN. The node device has a MAC sublayer for supporting the conventional LAN and a FDDI MAC sublayer for supporting the FDDI LAN. The FDDI MAC sublayer has a queue provided by a FIFO memory, a transmitting/receiving unit for transmitting, receiving and erasing a packet and a comparator. When a packet issued from a node of the conventional LAN is transmitted to the FDDI LAN via the node device, the queue stores the source address of the packet by a FIFO method. When the transmitting/receiving unit receives a packet, it compares in the comparator the source address of the received packet with the source address read from the queue. When the comparator finds the source addresses are the same each as other, the transmitting/receiving unit erases the packet without relaying and brings the source addresses in the queue up to date. In this way, a packet issued from a node of the conventional LAN is transmitted to the FDDI LAN with the address of the node of the conventional LAN. In this case, the address is used as a source address and the packet makes one round trip on the ring of the FDDI LAN to be erased in the node device.
Inventors
- 👤 Akihiro Natsume
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 04:22
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/74; H04L45/742; H04L12/00; H04L12/28; H04L12/46; H04L12/4604; H04L12/462; H04L12/4625
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
270 words
A node device for use in a token LAN wherein a plurality of node devices are interconnected in a ring by a data path, along which packet data, including a source address which indicates a node device transmitting the packet data, are transmitted in one direction, wherein when one of the node devices captures a token, said one node device obtains priority for transmitting packet data along the data path, and wherein when said one node device finishes transmitting of packet onto the data path, said one node device releases the token onto the data path, the node device for use in the token LAN being interconnectable in the ring by the data path and comprising: memory means for storing in FIFO order, a source address of packet data which is transmitted by the node device when the node device possesses transmission priority; comparator means for comparing the source address of packet data received from the data path with a source address read out from the memory means in FIFO order; and means for relaying the received packet data to a another node device along the data path when the comparator means determines that the source address of the received packet data and the source address read out from the memory means according to FIFO order do not agree with each other, and for erasing the received packet data and the compared source address in the memory means to update the memory means when the comparator means determines that the source address of the received packet data and the source address read out from the memory agree with each other.
Claim 2
Dependent Claim
270 words
A node device for use in a token LAN wherein a plurality of node devices are interconnected in a ring by a data path, along which packet data, including a source address which indicates a node device transmitting the packet data, are transmitted in one direction, wherein when one of the node devices captures a token, said one node device obtains priority for transmitting packet data along the data path, and wherein when said one node device finishes transmitting of packet onto the data path, said one node device releases the token onto the data path, the node device for use in the token LAN being interconnectable in the ring by the data path and comprising: memory means for storing in FIFO order, a source address of packet data which is transmitted by the node device when the node device possesses transmission priority; comparator means for comparing the source address of packet data received from the data path with a source address read out from the memory means in FIFO order; and means for relaying the received packet data to a another node device along the data path when the comparator means determines that the source address of the received packet data and the source address read out from the memory means according to FIFO order do not agree with each other, and for erasing the received packet data and the compared source address in the memory means to update the memory means when the comparator means determines that the source address of the received packet data and the source address read out from the memory agree with each other.
Claim 3
Dependent Claim
21 words
A node device according to claim 1, wherein the memory means is provided by a queue means comprising a shift register.
Claim 4
Dependent Claim
20 words
A node device according to claim 1, wherein the memory means is provided by a queue means comprising a RAM.
Claim 5
Dependent Claim
323 words
A node device for use in a token LAN wherein a plurality of node devices are interconnected in a ring by a first data path along which packet data, including a source address which indicates a node device transmitting the packet data, are transmitted in one direction, wherein when one of the node devices captures a token, said one node device obtains priority for transmitting packet data along the data path; and wherein when said one node device finishes transmitting of packet data onto the data path, said one node device releases the token onto the first data path, the node device for use in the token LAN being interconnectable in the ring by the first data path and comprising: terminal means for connecting the node device with a second data path by which the node device is also interconnected in another ring along which packet data are transmitted in one direction; memory means for storing in FIFO order, the source address of packet data transmitted onto the first data path by any node device interconnected in the first data path and possessing transmission priority therein; comparing means which, after its node device transmits packet data while possessing priority, compares the source address of packet data received from the first data path with a source address read from the memory means in FIFO order; and means for relaying the received packet data to another node device along the first data path when the comparator means determines that the source address of the received packet data and the source address read out by the memory means according to FIFO order do not agree with each other, and for erasing the received packet data and the compared source address in the memory means to update the memory means when the comparator means determines that the source address of the received packet data and the source address read out from the memory agree with each other.
Claim 6
Dependent Claim
323 words
A node device for use in a token LAN wherein a plurality of node devices are interconnected in a ring by a first data path along which packet data, including a source address which indicates a node device transmitting the packet data, are transmitted in one direction, wherein when one of the node devices captures a token, said one node device obtains priority for transmitting packet data along the data path; and wherein when said one node device finishes transmitting of packet data onto the data path, said one node device releases the token onto the first data path, the node device for use in the token LAN being interconnectable in the ring by the first data path and comprising: terminal means for connecting the node device with a second data path by which the node device is also interconnected in another ring along which packet data are transmitted in one direction; memory means for storing in FIFO order, the source address of packet data transmitted onto the first data path by any node device interconnected in the first data path and possessing transmission priority therein; comparing means which, after its node device transmits packet data while possessing priority, compares the source address of packet data received from the first data path with a source address read from the memory means in FIFO order; and means for relaying the received packet data to another node device along the first data path when the comparator means determines that the source address of the received packet data and the source address read out by the memory means according to FIFO order do not agree with each other, and for erasing the received packet data and the compared source address in the memory means to update the memory means when the comparator means determines that the source address of the received packet data and the source address read out from the memory agree with each other.
Claim 7
Dependent Claim
21 words
A node device according to claim 4, wherein the memory means is provided by a queue means comprising a shift register.
Claim 8
Dependent Claim
20 words
A node device according to claim 4, wherein the memory means is provided by a queue means comprising a RAM.
Claim 9
Dependent Claim
33 words
A node device according to claim 4, wherein the memory means stores at least a source address of packet data received from the second data path and transmitted along the first data path.
Claim 10
Dependent Claim
47 words
A node device according to claim 4, wherein the memory means stores source addresses of packet data received from the second data path and transmitted onto the first data path, and source addresses of packet data issued by the node device itself onto the first data path.
Claim 11
Dependent Claim
24 words
A node device according to claim 3, wherein the memory means stores data including at least the source address of the received packet data.
Claim 12
Dependent Claim
123 words
A node device according to claim 3 wherein the memory means comprises a first memory for storing in FIFO order a source address of packet data received from the second data path and transmitted onto the first data path, and a second memory for storing a source address of packet data issued by the node device itself onto the first data path; and wherein the comparator means compares the source address of packet data received from the first data path with the source addresses read-out from the first and second memories in FIFO order to determine whether the source address of the packet data received from the first data path is identical to the source addresses read-out from the first and second memories.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-08 | 1995-01-07 | 1995-07-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-08 | 1999-01-07 | 1999-07-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-08 | 2003-01-07 | 2003-07-09 | $7700.00 | Window Closed / Lapsed |