Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
99 words
A method for controlling digital signals in a communications system, said system including a communications loop, a plurality of stations, at least two of said stations being respectively coupled to a first and a second signal path of said loop, said method including the steps of writing a first packet signal on said first path and reading a second packet signal from said second path and characterized in that said method further comprising the steps of reading a third packet signal from said first path and avoiding a collision on said communications loop in response to said third packet.
Claim 2
Independent Claim
99 words
A method for controlling digital signals in a communications system, said system including a communications loop, a plurality of stations, at least two of said stations being respectively coupled to a first and a second signal path of said loop, said method including the steps of writing a first packet signal on said first path and reading a second packet signal from said second path and characterized in that said method further comprising the steps of reading a third packet signal from said first path and avoiding a collision on said communications loop in response to said third packet.
Claim 3
Dependent Claim
47 words
The method defined in claim 1 wherein said collision avoiding step further comprises the step of overwriting a busy control field of a third packet on said first path with a signal for indicating that a station has a first packet to transmit on said first path.
Claim 4
Dependent Claim
88 words
The method defined in claim 2 wherein said collision avoiding step further comprises the steps of reading a busy control field of said third packet, said third packet busy control field having been read prior to its having been overwritten, and responsive to said priorly read busy control field indicating that said first path is not busy and responsive to said station having said first packet to transmit, writing said first packet on said first path, said first packet thereby overwriting said third packet on said first path.
Claim 5
Dependent Claim
94 words
The method defined in claim 2 wherein said collision avoiding step further comprises the steps of reading a busy control field of said third packet, said third packet busy control field having been read prior to its having been overwritten, and responsive to said priorly read busy control field indicating that said first path is busy, writing a request control field in said thrid packet on said first path for indicating that a station has a packet to transmit but that said station could not transmit the packet because said first path is busy.
Claim 6
Dependent Claim
112 words
The method defined in claim 2 wherein said collision avoiding step further comprising the steps of: reading a busy control field of said third packet, said third packet busy control field having been read prior to its having been overwritten, reading a request control field of a second packet on said second path, and responsive to said priorly read busy control field indicating that said first path is not busy and responsive to said second packet request control field indicating that no station on said loop was unable to transmit a packet, writing said first packet on said first path, said first packet thereby overwriting said third packet on said first path.
Claim 7
Dependent Claim
98 words
The method defined in claim 2 wherein said collision avoiding step further comprises the steps of reading a request control field of a second packet on said second path and responsive to said second packet request control field indicating that no station on said loop was unable to transmit a packet, initiating a start cycle packet on said loop, said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which a station on the loop may be initialized to transmit a packet.
Claim 8
Dependent Claim
93 words
The method defined in claim 1 wherein said collision avoiding step further comprises the steps of: reading a busy control field of a second packet on said second path, and responsive to said second packet busy control field indicating that said first path is not busy, initiating a start cycle packet on said loop, said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which a station on the loop may be initialized to transmit a packet.
Claim 9
Dependent Claim
133 words
A communications system comprising a communications loop, said loop including a first and a second signal path, said signal paths being oppositely directed, a plurality of stations, each of at least two of said stations being coupled to both said first and said second signal paths, a station including means for writing a first packet signal on said first path and means for reading a second packet signal from said second path and characterized in that said system further comprises: means for reading a third packet signal from said first path, means for said first path reading means to be coupled to said first path in a manner electrically preceding said first path writing means, and means responsive to said first, second and third packet signals for avoiding collisions on said communications loop.
Claim 10
Dependent Claim
133 words
A communications system comprising a communications loop, said loop including a first and a second signal path, said signal paths being oppositely directed, a plurality of stations, each of at least two of said stations being coupled to both said first and said second signal paths, a station including means for writing a first packet signal on said first path and means for reading a second packet signal from said second path and characterized in that said system further comprises: means for reading a third packet signal from said first path, means for said first path reading means to be coupled to said first path in a manner electrically preceding said first path writing means, and means responsive to said first, second and third packet signals for avoiding collisions on said communications loop.
Claim 11
Dependent Claim
104 words
The system defined in claim 8 wherein each of said first, second and third signals includes a predetermined packet format, said packet format including a packet field and a plurality of control fields and wherein said collision avoiding means further comprises: means for reading the contents of said control fields of said second and third signals and means for writing the contents of said control fields of said first signal onto said first path, said first signal overwriting predetermined field(s) of said third signal whereby said overwritten third signal may be extended along said first path to said second path as said second signal.
Claim 12
Dependent Claim
51 words
The system defined in claim 8 wherein said collision avoiding means further comprises: means for writing first contents in a busy control field of said third signal, said first contents for indicating that said station has a packet to transmit, and means for overwriting said third signal with said first signal.
Claim 13
Dependent Claim
47 words
The system defined in claim 10 wherein said collision avoiding means further comprises: means responsive to second contents of said busy control field of said third signal for writing a packet on said first path, said second contents for indicating that said first path is not busy.
Claim 14
Dependent Claim
122 words
The system defined in claim 10 wherein said collision avoiding means further comprises: means for reading contents of a busy control field of said third signal, said third signal busy control field having been read prior to its having been overwritten with said first contents, means for reading contents of a request control field of said second signal, and means, responsive to said priorly read third signal busy control field indicating that said first path is not busy and responsive to said second signal packet request control field indicating that no station on said loop was unable to transmit a packet, for writing said first signal on said first path, said first signal thereby overwriting said third signal on said first path.
Claim 15
Dependent Claim
45 words
The system defined in claim 8 wherein said collision avoiding means further comprises: means responsive to contents of a busy control field of said third signal for writing a packet on said first path, said contents for indicating that said first path is not busy.
Claim 16
Dependent Claim
82 words
The system defined in claim 8 wherein said collision avoiding means further comprises: means responsive to first contents of a busy control field of said third signal for writing second contents in a request control field of said first signal, said first signal thereby overwriting a request control field of said third signal with said second contents, said first contents for indicating that said first path is busy and said second contents for indicating that said station has a packet to transmit.
Claim 17
Dependent Claim
95 words
The system defined in claim 8 wherein said collision avoiding means further comprises: means responsive to contents of a request control field of said second signal for initiating a start cycle packet on said first path, said contents for indicating that no station on said first path was unable to transmit a packet and said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which a station on said loop may be initialized and permitted to transmit a packet.
Claim 18
Dependent Claim
92 words
The system defined in claim 8 wherein said collision avoiding means further comprises: means for reading contents of a busy control field of said second signal, and means responsive to said second signal busy control field indicating that said first path is not busy for initiating a start cycle packet on said loop, said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which a station on the loop may be initialized to transmit a packet.
Claim 19
Dependent Claim
119 words
Station apparatus for controlling digital signals, said station adapted to be coupled to a communications loop, said loop including a first and a second signal path, said signal paths being oppositely directed, said station including means for writing a first packet signal on said first path and means for reading a second packet signal from said second path and characterized in that said station further comprises: means for reading a third packet signal from said first path, means for said first path reading means to be coupled to said first path in a manner electrically preceding said first path writing means, and means responsive to said first, second and third packet signals for avoiding collisions on said communications loop.
Claim 20
Dependent Claim
119 words
Station apparatus for controlling digital signals, said station adapted to be coupled to a communications loop, said loop including a first and a second signal path, said signal paths being oppositely directed, said station including means for writing a first packet signal on said first path and means for reading a second packet signal from said second path and characterized in that said station further comprises: means for reading a third packet signal from said first path, means for said first path reading means to be coupled to said first path in a manner electrically preceding said first path writing means, and means responsive to said first, second and third packet signals for avoiding collisions on said communications loop.
Claim 21
Dependent Claim
104 words
The station defined in claim 17 wherein each of said first, second and third signals includes a predetermined packet format, said packet format including a packet field and a plurality of control fields and wherein said collision avoiding means further comprises: means for reading the contents of said control fields of said second and third signals and means for writing the contents of said control fields of said first signal onto said first path, said first signal overwriting predetermined field(s) of said third signal whereby said overwritten third signal may be extended along said first path to said second path as said second signal.
Claim 22
Dependent Claim
51 words
The station defined in claim 17 wherein said collision avoiding means further comprises: means for writing first contents in a busy control field of said third signal, said first contents for indicating that said station has a packet to transmit, and means for overwriting said third signal with said first signal.
Claim 23
Dependent Claim
47 words
The station defined in claim 19 wherein said collision avoiding means further comprises: means responsive to second contents of said busy control field of said third signal for writing a packet on said first path, said second contents for indicating that said first path is not busy.
Claim 24
Dependent Claim
122 words
The station defined in claim 19 wherein said collision avoiding means further comprises: means for reading contents of a busy control field of said third signal, said third signal busy control field having been read prior to its having been overwritten with said first contents, means for reading contents of a request control field of said second signal, and means, responsive to said priorly read third signal busy control field indicating that said first path is not busy and responsive to said second signal packet request control field indicating that no station on said loop was unable to transmit a packet, for writing said first signal on said first path, said first signal thereby overwriting said third signal on said first path.
Claim 25
Dependent Claim
45 words
The station defined in claim 17 wherein said collision avoiding means further comprises: means responsive to contents of a busy control field of said third signal for writing a packet on said first path, said contents for indicating that said first path is not busy.
Claim 26
Dependent Claim
82 words
The station defined in claim 17 wherein said collision avoiding means further comprises: means responsive to first contents of a busy control field of said third signal for writing second contents in a request control field of said first signal, said first signal thereby overwriting a request control field of said third signal with said second contents, said first contents for indicating that said first path is busy and said second contents for indicating that said station has a packet to transmit.
Claim 27
Dependent Claim
94 words
The station defined in claim 17 wherein said collision avoiding means further comprises: means responsive to contents of a request control field of said second signal for initiating a start cycle packet on said first path, said contents for indicating that no station on said first path was unable to transmit a packet and said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which station on said loop may be initialized and permitted to transmit a packet.
Claim 28
Dependent Claim
90 words
The station defined in claim 17 wherein said collision avoiding means further comprises: means for reading a busy control field of said second signal, and means responsive to said second signal busy control field indicating that said first path is not busy for initiating a start cycle packet on said loop, said start cycle packet being transmitted by a head station on said first path and said start cycle packet including a start cycle field responsive to which a station on the loop may be initialized to transmit a packet.