← Back to Patent Explorer
US5229993A Expired / Lapsed US ⏱️ 0.0 years remaining

Control of access through local carrier sensing for high data rate networks and control of access of synchronous messages through circulating reservation packets

Assignee: Old Dominion University
•
Filing: 1991-02-25
•
Granted: 1993-07-20
•
Expires: 2011-02-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A combination of two new access methods for ring and unidirectional bus networks supports high data rate integrated traffic. The first access method provides access for asynchronous traffic. When a node senses the channel idle, it can begin to transmit. When it senses an incoming signal, it must stop transmitting in order to avoid a collision. But unlike other access protocols which abort the transmission when a collision occurs or is imminent, the process truncates the message in a fashion such that it can be resumed later when the channel again is idle. The system is called Carrier Sensed Multiple Access-Ring Network (CSMA/RN). The second access method provides support for synchronous traffic. This method implements one or more circulating reservation packets which permit a node to have reserved space when the special packet returns. The media access system is called Circulating Reservation Packet (CRP) system. Both access protocols operate simultaneously on the network with minimal interference. The CRP system is preferably used with the CSMA/RN protocol but is applicable to other fixed length, non-corrupting, circulating network structures to enable the nodes in a network to reserve space for synchronous traffic and guaranteed access.

Inventors

  • 👤 Edwin Foudriat
  • 👤 Kurt Maly
  • 👤 C. M. Overstreet
  • 👤 Frank Paterra
  • 👤 Sanjay Khanna

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 04:35
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/0001; H04Q11/0062; H04Q11/0066; H04L; H04L12/00; H04L12/28; H04L12/2852; H04L12/42; H04L12/427; H04L12/433; H04L12/64; H04L12/6418; H04L2012/6445; H04L2012/6448; H04Q11/0005; H04Q2011/0007; H04Q2011/0033; H04Q2011/0064

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 159 words
In a ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting data on said network allowing multiple messages on the network simultaneously, said method being performed by control logic at each of said nodes and comprising the steps of: sensing a carrier on said network to detect the presence of incoming data at the node; if the incoming data is addressed to the node, receiving the data and removing it from said network; if the data is not addressed to the node, retransmitting the data with fixed delay; if the node is transmitting data at the time of receipt of incoming data and the incoming data is not addressed to the node, truncating the data being transmitted and retransmitting the incoming data; if transmitting data at the time of receipt of incoming data addressed to the node, continuing to transmit data while receiving data.
Claim 2
Dependent Claim 159 words
In a ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting data on said network allowing multiple messages on the network simultaneously, said method being performed by control logic at each of said nodes and comprising the steps of: sensing a carrier on said network to detect the presence of incoming data at the node; if the incoming data is addressed to the node, receiving the data and removing it from said network; if the data is not addressed to the node, retransmitting the data with fixed delay; if the node is transmitting data at the time of receipt of incoming data and the incoming data is not addressed to the node, truncating the data being transmitted and retransmitting the incoming data; if transmitting data at the time of receipt of incoming data addressed to the node, continuing to transmit data while receiving data.
Claim 3
Dependent Claim 43 words
The method recited in claim 1 wherein data transmitted on said network is transmitted in a packet including destination and source addresses further comprising the step of checking incoming data for the node's own source address and removing said data from said network.
Claim 4
Dependent Claim 149 words
In a ring or unidirectional bus network comprising a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting both synchronous and asynchronous data on said network, said method comprising the steps of: circulating a plurality of circulating reservation packets on said network; using a predetermined protocol, accessing by control logic at each of the nodes said network to transmit asynchronous data; when synchronous data is to be transmitted by a respective one of said nodes, setting by the node a flag and space required in one of said circulating reservation packets to reserve space behind said one of said circulating reservation packets for said synchronous data; and upon return to the one said node of said one of said circulating reservation packets, resetting said flag and transmitting said synchronous data in space reserved behind said one of said circulating reservation packets.
Claim 5
Dependent Claim 149 words
In a ring or unidirectional bus network comprising a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting both synchronous and asynchronous data on said network, said method comprising the steps of: circulating a plurality of circulating reservation packets on said network; using a predetermined protocol, accessing by control logic at each of the nodes said network to transmit asynchronous data; when synchronous data is to be transmitted by a respective one of said nodes, setting by the node a flag and space required in one of said circulating reservation packets to reserve space behind said one of said circulating reservation packets for said synchronous data; and upon return to the one said node of said one of said circulating reservation packets, resetting said flag and transmitting said synchronous data in space reserved behind said one of said circulating reservation packets.
Claim 6
Dependent Claim 241 words
In a ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting both asynchronous and synchronous data on said network allowing multiple messages on the network simultaneously, said method comprising the steps of: circulating at least one circulating reservation packet on said network; when synchronous data is to be transmitted by a respective one of said nodes, setting by the node a flag in said circulating reservation packet to reserve space behind said circulating reservation packet for said synchronous data; upon return to said one node of said circulating reservation packet, resetting said flag and transmitting said synchronous data in space reserved behind said circulating reservation packet; sensing by control logic at each node a carrier on said network to detect the presence of incoming data to the node; if the incoming data is addressed to the node, receiving the data and removing it from said network by said node; if the data is not addressed to the node, retransmitting by said node the data with fixed delay; if the node is transmitting asynchronous data at the time of receipt of incoming data and the incoming data is not addressed to the node, truncating the asynchronous data being transmitted and retransmitting the incoming data; and if transmitting data at the time of receipt of incoming data addressed to the node, continuing to transmit data while receiving data.
Claim 7
Dependent Claim 241 words
In a ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a method for efficiently transmitting both asynchronous and synchronous data on said network allowing multiple messages on the network simultaneously, said method comprising the steps of: circulating at least one circulating reservation packet on said network; when synchronous data is to be transmitted by a respective one of said nodes, setting by the node a flag in said circulating reservation packet to reserve space behind said circulating reservation packet for said synchronous data; upon return to said one node of said circulating reservation packet, resetting said flag and transmitting said synchronous data in space reserved behind said circulating reservation packet; sensing by control logic at each node a carrier on said network to detect the presence of incoming data to the node; if the incoming data is addressed to the node, receiving the data and removing it from said network by said node; if the data is not addressed to the node, retransmitting by said node the data with fixed delay; if the node is transmitting asynchronous data at the time of receipt of incoming data and the incoming data is not addressed to the node, truncating the asynchronous data being transmitted and retransmitting the incoming data; and if transmitting data at the time of receipt of incoming data addressed to the node, continuing to transmit data while receiving data.
Claim 8
Dependent Claim 43 words
The method recited in claim 4 wherein data transmitted on said network is transmitted in a packet including destination and source addresses further comprising the step of checking incoming data for the node's own source address and removing said data from said network.
Claim 9
Dependent Claim 20 words
The method recited in claim 5 wherein a plurality of circulating reservation packets are made to circulate on said network.
Claim 10
Dependent Claim 169 words
A ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a control logic at each of said nodes for efficiently transmitting data on said network allowing multiple messages on the network simultaneously, said control logic at each of said nodes and comprising: means for sensing a carrier on said network to detect the presence of incoming data to the node; means for receiving the data at the node and removing it from said network if the incoming data is addressed to the node; means for retransmitting the data with fixed delay if the data is not addressed to the node; means for truncating the data being transmitted and retransmitting the incoming data if the node is transmitting data at the time of receipt of incoming data and the incoming data is not addressed the node; means for continuing to transmit data while receiving data if transmitting data at the time of receipt of incoming data addressed to the node.
Claim 11
Dependent Claim 169 words
A ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, a control logic at each of said nodes for efficiently transmitting data on said network allowing multiple messages on the network simultaneously, said control logic at each of said nodes and comprising: means for sensing a carrier on said network to detect the presence of incoming data to the node; means for receiving the data at the node and removing it from said network if the incoming data is addressed to the node; means for retransmitting the data with fixed delay if the data is not addressed to the node; means for truncating the data being transmitted and retransmitting the incoming data if the node is transmitting data at the time of receipt of incoming data and the incoming data is not addressed the node; means for continuing to transmit data while receiving data if transmitting data at the time of receipt of incoming data addressed to the node.
Claim 12
Dependent Claim 42 words
The network recited in claim 7 wherein data transmitted on said network is transmitted in a packet including destination and source addresses further comprising means for checking incoming data for the node's own source address and removing said data from said network.
Claim 13
Dependent Claim 148 words
A ring or unidirectional bus network comprising a plurality of nodes to which are connected a plurality of computer stations, control logic at each of said nodes for efficiently transmitting both synchronous and asynchronous data on said network, said control logic comprising: means for circulating a plurality of circulating reservation packets on said network; means for accessing said network to transmit asynchronous data using a predetermined protocol; means for setting a flag and space required in one of said circulating reservation packets to reserve space behind said one of said circulating reservation packets for said synchronous data when synchronous data is to be transmitted by a respective one of said nodes; and means for resetting said flag and transmitting said synchronous data in space reserved behind said one of said circulating reservation packets upon return to the one said node of said one of said circulating reservation packets.
Claim 14
Dependent Claim 148 words
A ring or unidirectional bus network comprising a plurality of nodes to which are connected a plurality of computer stations, control logic at each of said nodes for efficiently transmitting both synchronous and asynchronous data on said network, said control logic comprising: means for circulating a plurality of circulating reservation packets on said network; means for accessing said network to transmit asynchronous data using a predetermined protocol; means for setting a flag and space required in one of said circulating reservation packets to reserve space behind said one of said circulating reservation packets for said synchronous data when synchronous data is to be transmitted by a respective one of said nodes; and means for resetting said flag and transmitting said synchronous data in space reserved behind said one of said circulating reservation packets upon return to the one said node of said one of said circulating reservation packets.
Claim 15
Dependent Claim 268 words
A ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, control logic at each of said nodes for efficiently transmitting both asynchronous and synchronous data on said network allowing multiple messages on the network simultaneously, said control logic comprising: means for circulating at least one circulating reservation packet on said network; means for setting by a node a flag in said circulating reservation packet to reserve space behind said circulating reservation packet for said synchronous data when synchronous data is to be transmitted by a respective one of said nodes; means for resetting said flag and transmitting said synchronous data in space reserved behind said circulating reservation packet upon return to said node of said circulating reservation packet; means for sensing a carrier on said network to detect the presence of incoming data to the node; means for transmitting asynchronous data on said network if no incoming data is sensed; means for receiving the data and removing it from said network by said node if the incoming data is addressed to the node; means for retransmitting by said node the data with fixed delay if the data is not addressed to the node; means for truncating the asynchronous data being transmitted and retransmitting the incoming data if the node is transmitting asynchronous data at the time of receipt of incoming data and the incoming data is not addressed to the node; and said means for transmitting continuing to transmit data while receiving data if transmitting data at the time of receipt of incoming data addressed to the node.
Claim 16
Dependent Claim 268 words
A ring or unidirectional bus network having a plurality of nodes to which are connected a plurality of computer stations, control logic at each of said nodes for efficiently transmitting both asynchronous and synchronous data on said network allowing multiple messages on the network simultaneously, said control logic comprising: means for circulating at least one circulating reservation packet on said network; means for setting by a node a flag in said circulating reservation packet to reserve space behind said circulating reservation packet for said synchronous data when synchronous data is to be transmitted by a respective one of said nodes; means for resetting said flag and transmitting said synchronous data in space reserved behind said circulating reservation packet upon return to said node of said circulating reservation packet; means for sensing a carrier on said network to detect the presence of incoming data to the node; means for transmitting asynchronous data on said network if no incoming data is sensed; means for receiving the data and removing it from said network by said node if the incoming data is addressed to the node; means for retransmitting by said node the data with fixed delay if the data is not addressed to the node; means for truncating the asynchronous data being transmitted and retransmitting the incoming data if the node is transmitting asynchronous data at the time of receipt of incoming data and the incoming data is not addressed to the node; and said means for transmitting continuing to transmit data while receiving data if transmitting data at the time of receipt of incoming data addressed to the node.
Claim 17
Dependent Claim 42 words
The network recited in claim 10 wherein data transmitted on said network is transmitted in a packet including destination and source addresses further comprising means for checking incoming data for the node's own source address and removing said data from said network.
Claim 18
Dependent Claim 20 words
The network recited in claim 11 wherein a plurality of circulating reservation packets are made to circulate on said network.

References Cited (Backward Citations)

US4383315A Cited
US4445116A Cited
US4516239A Cited
US4566097A Cited
US4549292A Cited
US4819229A Cited
US4707829A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-07-19 1997-01-18 1997-07-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-07-19 2001-01-18 2001-07-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-07-19 2005-01-18 2005-07-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag