US5265094A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Channel accessing process for a local transmission network configured as a bus system
Assignee: Individual
•
Filing: 1990-09-10
•
Granted: 1993-11-23
•
Expires: 2010-09-10
Abstract
Abstract A process is disclosed whereby each of a plurality of stations, transmitting messages segmented into multiple sequential packets, is able to access a transmission channel of a local communications network. A residual packet number is associated with each message representing the number of packets remaining in the message after the instant packet has been transmitted. The number of packet collisions on the transmission channel is reduced by employing a resolution phase, which may be divided into several time intervals. Stations transmit messages with certain residual packet numbers during predetermined time intervals of the resolution phase. A station transmits its next packet after the end of the ongoing transmission if its residual packet number is smaller than the residual packet number of the ongoing message transmission.
Inventors
- 👤 Leonhard Schmickler
- 👤 Klaus Scholten
- 👤 Friedrich Schreiber
- 👤 Carmelita Gorg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 00:45
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/4013; H04L12/40136; H04L12/407; H04L12/413
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
176 words
A method for accessing a transmission channel of a local communications network by each of a plurality of stations connected to said transmission channel, said stations being configured in a bus system without central control and transmitting messages segmented into a plurality of sequential packets, comprising the steps of: (A) associating a residual packet number with each message, said residual packet number representing the number of packets remaining in said message after the instant packet is transmitted, said residual packet number being indicated in every packet transmitted from the message; (B) transmitting in response to an idle state on said transmission channel, a packet from a first message from a first station; (C) interrupting the transmission of packets remaining in said first message if a collision with a packet from a second message transmitted from a second station occurs on said transmission channel; (D) determining which packet involved in said collision of step (C) has the highest residual packet number; and (E) retransmitting said packet determined in step (D) to have the highest residual packet number.
Claim 2
Independent Claim
176 words
A method for accessing a transmission channel of a local communications network by each of a plurality of stations connected to said transmission channel, said stations being configured in a bus system without central control and transmitting messages segmented into a plurality of sequential packets, comprising the steps of: (A) associating a residual packet number with each message, said residual packet number representing the number of packets remaining in said message after the instant packet is transmitted, said residual packet number being indicated in every packet transmitted from the message; (B) transmitting in response to an idle state on said transmission channel, a packet from a first message from a first station; (C) interrupting the transmission of packets remaining in said first message if a collision with a packet from a second message transmitted from a second station occurs on said transmission channel; (D) determining which packet involved in said collision of step (C) has the highest residual packet number; and (E) retransmitting said packet determined in step (D) to have the highest residual packet number.
Claim 3
Dependent Claim
66 words
The method of claim 1, further comprising the steps of: (F) segmenting time, starting with the end of said collision of step (C), into a plurality of segments; (G) associating at least one predetermined residual packet number with each of said time segments of step (F); and (H) retransmitting said first and said second packets of step (C) in said predetermined time segment of step (G).
Claim 4
Dependent Claim
36 words
The method of claim 1, further comprising the step of: (I) selecting from multiple messages present in each of said stations, the message with the lowest residual packet number for transmission from each of said stations.
Claim 5
Dependent Claim
33 words
The method of claim 1, wherein step (A) further comprises: (J) reducing by one of the residual packet number associated with each message at every successful transmission of a packet from the message.
Claim 6
Dependent Claim
59 words
The method of claim 4, further comprising the step of: (K) transmitting upon detection of an ongoing transmission on said transmission channel, a packet from each station with a message to be transmitted, if the residual packet number of said message is at least equal to the residual packet number of the next expected packet of said ongoing transmission.
Claim 7
Dependent Claim
17 words
The method of claim 5, wherein transmission of said packet begins after said ongoing transmission has ended.
Claim 8
Dependent Claim
22 words
The method of claim 2, wherein each of said plurality of time segments is assigned to a range of residual packet numbers.
Claim 9
Dependent Claim
20 words
The method of claim 7, wherein the first said time segment is assigned to a residual packet number of 1.
Claim 10
Dependent Claim
27 words
The method of claim 2, wherein the number of said time segments in step (F) is set in accordance with the traffic load of said transmission channel.
Claim 11
Dependent Claim
36 words
The method of claim 2, wherein a range of residual packet numbers is associated with each time segment, the upper limit of said range being set in accordance with the traffic load of said transmission channel.
Claim 12
Dependent Claim
35 words
The method of claim 2, wherein the number of said time segments in step (G) is adjusted in accordance with the residual packet number of the last packet transmitted and not involved in a collision.
Claim 13
Dependent Claim
39 words
The method of claim 10, wherein said upper limit of said range of residual packet numbers in step (G) is adjusted in accordance with the residual packet number of the last packet transmitted and not involved in a collision.
Claim 14
Dependent Claim
23 words
The method of claim 1, wherein the interruption of step (C) takes place only for messages having a predetermined minimum residual packet number.
Claim 15
Dependent Claim
23 words
The method of claim 1, wherein the interruption of step (C) takes place only for messages having a residual packet number of 3.
Claim 16
Dependent Claim
40 words
The method of claim 1, wherein following the successful transmission of a packet, transmission of a subsequent packet takes place independently of said subsequent packet's residual packet number if said transmission channel remains unoccupied for a predetermined amount of time.
References Cited (Backward Citations)
US4536875A
Cited
US4623886A
Cited
US4598285A
Cited
US4628311A
Cited
US4670872A
Cited
US4663757A
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-11-22 | 1997-05-24 | 1997-11-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-22 | 2001-05-24 | 2001-11-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-22 | 2005-05-24 | 2005-11-23 | $7700.00 | Window Closed / Lapsed |