Patent US2780277A successfully refreshed from Google Patents.
US4096355A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Common channel access method for a plurality of data stations in a data transmission system and circuit for implementing the method
Assignee: International Business Machines Corp
•
Filing: 1977-10-13
•
Granted: 1978-06-20
•
Expires: 1997-10-13
Abstract
Abstract A method is disclosed by which several data stations which use a single communication channel, and which are simultaneously ready to transmit a data packet, can send a request for channel allocation, and will be granted the channel each for one data packet transmission, all within one time frame without central control, polling, or collisions. Addresses of all data stations desiring channel allocation are interleaved and superimposed in a specific manner for transmitting the requests, and by observing the resulting common signal, each data station determines when it can send its data packet. An arrangement for a data station is also disclosed which comprises the means necessary for transmitting address characters in an interactive procedure simultaneously with other stations, and for determining the allocated packet time slot.
Inventors
- 👤 Ernst Hans Rothauser
- 👤 Daniel Wild
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-22 19:55
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/407; H04L12/417
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
304 words
A method by which a plurality of data stations in a data transmission system can access a common transmission channel in a predetermined sequence thereby eliminating any possibility of contention, said stations each being provided with a plural character address selected from an ordered set of plural character addresses and comprising the steps of: at each said station requiring transmission capacity, transmitting a unique indicia of its first address character in a first fixed length time slot immediately following receipt of a first unique multi-bit flag character; thereafter each said station requiring transmission capacity transmitting a unique indicia of its second address character in one time slot of a second group of fixed length time slots as a function of the total number of unique indicias transmitted and received in the said first fixed length time slot and the order position of its first address characters; following transmission and receipt of said second group of fixed length time slots each station requiring transmission capacity transmitting a unique indicia of its third address character in one time slot of a third group of fixed length time slots as a function of the total number of unique indicia transmitted and received in each of the time slots of the second group of fixed length time slots and the order position of its said second address character, the above described sequence continuing for as many times as the stations have address characters until all stations requiring transmission capacity have transmitted a unique indicia for each character in the station address whereby the indicia transmitted in the first fixed length time slot and in the succeeding groups of time slots identify the stations requiring transmission capacity; and, thereafter at each station requiring transmission capacity transmitting a data packet in an ordered sequence indicated by the unique address indicia.
Claim 2
Independent Claim
304 words
A method by which a plurality of data stations in a data transmission system can access a common transmission channel in a predetermined sequence thereby eliminating any possibility of contention, said stations each being provided with a plural character address selected from an ordered set of plural character addresses and comprising the steps of: at each said station requiring transmission capacity, transmitting a unique indicia of its first address character in a first fixed length time slot immediately following receipt of a first unique multi-bit flag character; thereafter each said station requiring transmission capacity transmitting a unique indicia of its second address character in one time slot of a second group of fixed length time slots as a function of the total number of unique indicias transmitted and received in the said first fixed length time slot and the order position of its first address characters; following transmission and receipt of said second group of fixed length time slots each station requiring transmission capacity transmitting a unique indicia of its third address character in one time slot of a third group of fixed length time slots as a function of the total number of unique indicia transmitted and received in each of the time slots of the second group of fixed length time slots and the order position of its said second address character, the above described sequence continuing for as many times as the stations have address characters until all stations requiring transmission capacity have transmitted a unique indicia for each character in the station address whereby the indicia transmitted in the first fixed length time slot and in the succeeding groups of time slots identify the stations requiring transmission capacity; and, thereafter at each station requiring transmission capacity transmitting a data packet in an ordered sequence indicated by the unique address indicia.
Claim 3
Dependent Claim
51 words
A method according to claim 1 characterized in that if a plurality of data stations have transmitted an identical unique address character in the same slot each transmits its next unique address character together with the other data stations of said plurality in a common time slot of a subsequent group.
Claim 4
Dependent Claim
57 words
A method according to claim 1 characterized in that the address characters are digits of a number base n, which are represented in a 1-out-of-n code, and that each time slot comprises n bit positions so that if v different address characters are inserted in one time slot, v bit positions are marked in that time slot.
Claim 5
Dependent Claim
85 words
A method according to claim 1 further characterized in that communication over the transmission channel is effected in frames of incrementally variable length, a plurality of time slots of equal length for communicating address characters following after receipt of the first flag and that after a second flag is received a plurality of time slots following each for communicating one data packet, and that the frame is ended thereafter by the receipt of a said first flag which marks the beginning of the next frame.
Claim 6
Dependent Claim
28 words
A method according to claim 4 in which each station monitors the channel and transmits the first and second flag characters in accordance with the criteria set forth.
Claim 7
Dependent Claim
288 words
A data transmission system for providing data transmission between a plurality of data stations connected to each other by a common transmission channel, said transmissions being conducted in time spaced frames delimited by first unique flag signals and including a first portion having a variable number of fixed length address time slots within which data stations may insert indicia corresponding to their address and a second portion separated from said first portion by a second unique flag and having a variable number of data packet slots equal in number to the number of stations requiring transmission capacity, each of said data stations including: means for receiving data signals from said common channel and for distinguishing address time slot intervals after receipt of a said first flag; means for separately transmitting unique indicia of address characters which are assigned to the respective data station, in selected address time slots; means for distinguishing level intervals, each corresponding to the position of the currently transmitted unique indicia of the address characters within their addresses; counting means for separately counting in each level interval, until transmission of the data station unique indicia address character, the different unique indicia address characters detected in the received signal, and for decreasing the respective count value by one unit with the occurrence of each address time slot interval within the next following level interval; and control means for enabling transmission of a first unique indicia of the address character during a first address time slot interval after receipt of a said first flag (F1), and transmission of one further unique indicia of the address character in each of the following level intervals, when the remaining count of the previous level interval has reached a given value.
Claim 8
Dependent Claim
288 words
A data transmission system for providing data transmission between a plurality of data stations connected to each other by a common transmission channel, said transmissions being conducted in time spaced frames delimited by first unique flag signals and including a first portion having a variable number of fixed length address time slots within which data stations may insert indicia corresponding to their address and a second portion separated from said first portion by a second unique flag and having a variable number of data packet slots equal in number to the number of stations requiring transmission capacity, each of said data stations including: means for receiving data signals from said common channel and for distinguishing address time slot intervals after receipt of a said first flag; means for separately transmitting unique indicia of address characters which are assigned to the respective data station, in selected address time slots; means for distinguishing level intervals, each corresponding to the position of the currently transmitted unique indicia of the address characters within their addresses; counting means for separately counting in each level interval, until transmission of the data station unique indicia address character, the different unique indicia address characters detected in the received signal, and for decreasing the respective count value by one unit with the occurrence of each address time slot interval within the next following level interval; and control means for enabling transmission of a first unique indicia of the address character during a first address time slot interval after receipt of a said first flag (F1), and transmission of one further unique indicia of the address character in each of the following level intervals, when the remaining count of the previous level interval has reached a given value.
Claim 9
Dependent Claim
92 words
A data transmission system according to claim 6 characterized in that second counting means are provided for counting the total number of detected different indicia corresponding to address characters in the received signal within each level interval, and for decreasing the respective count value by one unit with the occurrence of each address time slot interval within the next following level interval; and that said means for distinguishing level intervals are responsive to control signals which occur each time when one of the counting values in the second counting means reaches zero.
Claim 10
Dependent Claim
75 words
A data transmission system according to claim 7 characterized in that means are provided for distinguishing data packet slot intervals after receipt of a second flag; and that further means are provided for decreasing the count value of the last level interval by one unit with the occurrence of each packet slot interval, and for issuing a control signal (P3=1) which enables transmission of a data packet when the count value reaches a given number.
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) | 1981-06-19 | 1981-12-19 | 1982-06-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-06-19 | 1985-12-19 | 1986-06-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-06-19 | 1989-12-19 | 1990-06-20 | $7700.00 | Window Closed / Lapsed |