Patent US3702008A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3702008A Expired / Lapsed US ⏱️ 0.0 years remaining

Program for polling party line data stations for message pickups

Assignee: AT&T Inc
•
Filing: 1970-12-07
•
Granted: 1972-10-31
•
Expires: 1990-12-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Data stations on multistation lines are polled for messages in accordance with a program which directly varies the number of times each station is polled during a polling round with the quantity of messages available at the station, as determined by responses to prior pollings. Initially, all stations are polled and the identities of those having available messages are placed in a data pattern defining an alternate poll code sequence. The alternate sequence is then utilized for subsequent polling rounds during which the data pattern is modified by wiping out the identities of stations no longer having messages. After a predetermined number of alternate rounds or after all the messages are collected, whichever occurs first, the initial polling round is again sent and the process repeated. Data processing is provided by a programmed general purpose computer.

Inventors

  • 👤 George Stephen Groth

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 15:15
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/403; G; G06; G06F; G06F13/00; G06F13/14; G06F13/20; G06F13/22

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 77 words
A method of processing a pattern defining a sequence of polling codes which are transmitted in the sequence by a controller to a multistation line to obtain responses from the several line stations indicating whether messages are available thereat, comprising the step of: modifying the sequence by directly varying the number of times the polling codes appear in the pattern with the quantity of message traffic available at the corresponding several stations as determined from the responses.
Claim 2
Independent Claim 77 words
A method of processing a pattern defining a sequence of polling codes which are transmitted in the sequence by a controller to a multistation line to obtain responses from the several line stations indicating whether messages are available thereat, comprising the step of: modifying the sequence by directly varying the number of times the polling codes appear in the pattern with the quantity of message traffic available at the corresponding several stations as determined from the responses.
Claim 3
Dependent Claim 41 words
A method of processing a pattern of polling codes in accordance with claim 1 wherein the step of modifying the sequence includes adding a polling code to the pattern when a response indicates that the corresponding station has a message thereat.
Claim 4
Dependent Claim 41 words
A method of processing a pattern of polling codes in accordance with claim 1 wherein the step of modifying the sequence includes removing a polling code from the pattern when a response indicates that messages are unavailable at the corresponding station.
Claim 5
Independent Claim 83 words
A method of forming a sequence of polling codes which are initially all transmitted in a main sequence to stations on a multistation line to obtain responses from the several stations indicating whether messages are available thereat comprising the steps of: storing a data pattern in a memory defining an alternate sequence of polling codes, and modifying the alternate sequence by varying the number of times the several polling codes appear in the pattern in accordance with the responses from the several stations.
Claim 6
Independent Claim 83 words
A method of forming a sequence of polling codes which are initially all transmitted in a main sequence to stations on a multistation line to obtain responses from the several stations indicating whether messages are available thereat comprising the steps of: storing a data pattern in a memory defining an alternate sequence of polling codes, and modifying the alternate sequence by varying the number of times the several polling codes appear in the pattern in accordance with the responses from the several stations.
Claim 7
Dependent Claim 41 words
A method of forming a sequence of polling codes in accordance with claim 4 wherein the step of modifying the alternate sequence includes inserting data defining the polling code of each station whose response indicates that a message is available thereat.
Claim 8
Dependent Claim 41 words
A method of forming a sequence of polling codes in accordance with claim 4 wherein the step of modifying the alternate sequence includes wiping out data defining the polling code of each station whose response indicates that messages are unavailable thereat.
Claim 9
Independent Claim 106 words
A method of polling stations, on a multistation line, utilizing a plurality of stored polling codes to obtain responses from the several stations indicating whether messages are available thereat comprising the steps of: transmitting to the line a main sequence of the stored polling codes, forming a data pattern in the memory to define an alternate sequence of polling codes by varying the number of times the several polling codes appear in the pattern in accordance with the responses by the several stations to the main sequence, and transmitting to the line the stored polling codes in the alternate sequence as defined in the data pattern.
Claim 10
Independent Claim 106 words
A method of polling stations, on a multistation line, utilizing a plurality of stored polling codes to obtain responses from the several stations indicating whether messages are available thereat comprising the steps of: transmitting to the line a main sequence of the stored polling codes, forming a data pattern in the memory to define an alternate sequence of polling codes by varying the number of times the several polling codes appear in the pattern in accordance with the responses by the several stations to the main sequence, and transmitting to the line the stored polling codes in the alternate sequence as defined in the data pattern.
Claim 11
Dependent Claim 37 words
A method of polling stations, in accordance with claim 7, wherein the step of forming the data pattern includes inserting data defining the polling code of each station whose response indicates that a message is available thereat.
Claim 12
Dependent Claim 61 words
A method of polling stations, in accordance with claim 7, including the additional steps of: modifying the data pattern to change the defined alternate sequence of polling codes in accordance with the responses by the several staTions to the alternate sequence, and transmitting to the line the stored polling codes in the alternate sequence as defined in the modified data pattern.
Claim 13
Dependent Claim 37 words
A method of polling stations, in accordance with claim 9, wherein the step of modifying the data pattern includes wiping out data defining the polling code of each station whose response indicates that messages are unavailable thereat.
Claim 14
Dependent Claim 36 words
A method of polling stations, in accordance with claim 10, wherein the step of modifying the data pattern is repeated each time the alternate sequence defined by the modified data pattern is transmitted to the line.
Claim 15
Dependent Claim 32 words
A method of polling stations, in accordance with claim 11, wherein the step of transmitting the main sequence is initiated after a predetermined plurality of alternate sequences are transmitted to the line.
Claim 16
Dependent Claim 34 words
A method of polling stations, in accordance with claim 11, wherein the step of transmitting the main sequence is initiated when all data defining polling codes is wiped out of the modified data pattern.

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) 1975-10-31 1976-05-01 1976-10-31 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-10-31 1980-05-01 1980-10-31 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-10-31 1984-05-01 1984-10-31 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag