US5446735A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bandwidth allocation in a shared transmission channel employing CSMA/CD
Assignee: Starlight Networks Inc
•
Filing: 1992-12-18
•
Granted: 1995-08-29
•
Expires: 2012-12-18
Abstract
Abstract In a local area network segment, the bandwidth in the channel between a network interface device, e.g., a port, switching hub, router, bridge or server, and one or more associated station is shared as follows. At the network interface device, a variable is maintained which stores information relating to the success or failure of transmission of packets in the channel. If the channel is sensed idle, the network interface device transmits the packet with probability 1. If the channel is sensed busy, the network interface device senses the channel for an end-of-carrier signal and, thereafter, waits a period of time equal to the interframe gap g. In addition, after an additional delay period ζ, the network interface device reattempts to transmit the packet in the channel. If the variable maintained by the network interface device is less than a certain limit, the delay ζ is selected according to a first basic bandwidth allocation protocol. If the variable is greater than or equal to the limit, the delay is selected according to a second basic bandwidth allocation protocol.
Inventors
- 👤 Fouad A. Tobagi
- 👤 Joseph M. Gang, Jr.
- 👤 Bruce L. Lieberman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 23:45
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/44; H04L12/40; H04L12/407; H04L12/413; H04L12/40143
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
252 words
A method for transmitting a plurality of packets, said plurality of packets including packets containing continuous data via a transmission channel from a network interface device to at least one station in a communications network segment comprising the steps of: at the network interface device, maintaining a variable which stores information relating to the success or failure of transmission of said plurality of packets in said transmission channel, sensing said channel by said network interface device, if said channel is sensed idle, transmitting one of said packets from said network interface device, and if said channel is sensed busy by said network interface device, sensing said channel for an end-of-carrier signal, waiting a period of time equal to an interframe gap g and attempting to transmit said one packet after a delay ζ selected according to a first basic bandwidth allocation protocol if said variable maintained at said network interface device is less than a certain limit and according to a second basic bandwidth allocation protocol different from said first basic bandwidth allocation protocol if said variable equals or exceeds said certain limit, said first protocol and second protocol assuring a particular fraction of a bandwidth of said transmission channel to said network interface for the transmission of said plurality of packets containing said continuous data to said at least one station while also providing a portion of said bandwidth of said channel to said at least one station for the transmission of packets via said channel to said network interface device.
Claim 2
Independent Claim
252 words
A method for transmitting a plurality of packets, said plurality of packets including packets containing continuous data via a transmission channel from a network interface device to at least one station in a communications network segment comprising the steps of: at the network interface device, maintaining a variable which stores information relating to the success or failure of transmission of said plurality of packets in said transmission channel, sensing said channel by said network interface device, if said channel is sensed idle, transmitting one of said packets from said network interface device, and if said channel is sensed busy by said network interface device, sensing said channel for an end-of-carrier signal, waiting a period of time equal to an interframe gap g and attempting to transmit said one packet after a delay ζ selected according to a first basic bandwidth allocation protocol if said variable maintained at said network interface device is less than a certain limit and according to a second basic bandwidth allocation protocol different from said first basic bandwidth allocation protocol if said variable equals or exceeds said certain limit, said first protocol and second protocol assuring a particular fraction of a bandwidth of said transmission channel to said network interface for the transmission of said plurality of packets containing said continuous data to said at least one station while also providing a portion of said bandwidth of said channel to said at least one station for the transmission of packets via said channel to said network interface device.
Claim 3
Dependent Claim
26 words
The method of claim 1 wherein one of said first and second protocols is a Greedy protocol according to which ζ is selected equal to zero.
Claim 4
Dependent Claim
63 words
The method of claim 1 wherein one of said first and second protocols is a Deferring protocol according to which ζ is selected at least equal to τ+(2 min{n ,10} -1)·s, where n is the number of collisions thus far incurred by the stations, τ is the maximum roundtrip propagation delay of the channel, and s is the slot time of said channel.
Claim 5
Dependent Claim
16 words
The method of claim 3 wherein ζ is selected equal to 2 min{n ,10 } ·s.
Claim 6
Dependent Claim
39 words
The method of claim 1 wherein one of said first and second protocols is a Courteous protocol according to which ζ is selected equal to at least τ, where τ is the maximum roundtrip propagation delay of the channel.
Claim 7
Dependent Claim
21 words
The method of claim 5 wherein ζ is selected equal to s, where s is the slot time of the channel.
Claim 8
Dependent Claim
63 words
The method of claim 5 wherein a plurality of stations are connected to the network interface device via the channel and wherein if a collision amongst the stations is detected, ζ is selected equal to at least τ+(2 min{n } -1)·s, where n is the number of collisions thus far incurred by the stations and s is the slot time of said channel.
Claim 9
Dependent Claim
23 words
The method of claim 7 wherein if a collision amongst the stations is detected, ζ is selected equal to 2 min{n } -1)·s.
Claim 10
Dependent Claim
25 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of collisions thus far incurred by the stations.
Claim 11
Dependent Claim
49 words
The method of claim 9 further comprising the steps of: if a packet is successfully transmitted from a station, resetting n to zero, and if a collision is incurred by a station, incrementing n by 1, where n is the number of collisions thus far incurred by the stations.
Claim 12
Dependent Claim
30 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of successfully transmitted packets by the stations in each observation window of time.
Claim 13
Dependent Claim
32 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of packets successfully transmitted from the network interface device in each observation window of time.
Claim 14
Dependent Claim
45 words
The method of claim 1 wherein the variable maintained at the network interface device stores the ratio of the number of packets successfully transmitted from the network interface device to the number of packets successfully transmitted from the stations in each observation window of time.
Claim 15
Dependent Claim
97 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of collisions thus far incurred by the stations, wherein the first protocol is a Greedy protocol according to which ζ is selected equal to zero and wherein the second protocol is a Deferring protocol according to which ζ is selected at least equal to τ+(2 min{n } -1)·s, where n is the number of collisions thus far incurred by the stations, τ is the maximum roundtrip propagation delay of the channel, and s is the slot time of said channel.
Claim 16
Dependent Claim
73 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of collisions thus far incurred by the stations, wherein the first protocol is a Greedy protocol according to which ζ is selected equal to zero and wherein the second protocol is a Courteous protocol according to which ζ is selected equal to at least τ, where τ is the maximum roundtrip propagation delay of the channel.
Claim 17
Dependent Claim
78 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of packets successfully transmitted by the stations in each observation window of time, wherein the first protocol is a Courteous protocol according to which ζ is selected equal to at least τ, where τ is the maximum roundtrip propagation delay of the channel, and wherein the second protocol is a Greedy protocol according to which ζ is selected equal to zero.
Claim 18
Dependent Claim
102 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of packets successfully transmitted by the stations in each observation window of time, wherein the first protocol is a Deferring protocol according to which ζ is selected at least equal to τ+(2 min{n } -1)·s, where n is the number of collisions thus far incurred by the stations, τ is the maximum roundtrip propagation delay of the channel, and s is the slot time of said channel, and wherein the second protocol is a Greedy protocol according to which ζ is selected equal to zero.
Claim 19
Dependent Claim
80 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of packets successfully transmitted by the network interface device in each observation window of time, wherein the first protocol is a Greedy protocol according to which ζ is selected equal to zero and wherein the second protocol is a Courteous protocol according to which ζ is selected equal to at least τ, where τ is the maximum roundtrip propagation delay of the channel.
Claim 20
Dependent Claim
104 words
The method of claim 1 wherein the variable maintained at the network interface device stores the number of packets successfully transmitted by the network interface device in each observation window of time, wherein the first protocol is a Greedy protocol according to which ζ is selected equal to zero, and wherein the second protocol is a Deferring protocol according to which ζ is selected at least equal to τ+(2 min{n } -1)·s, where n is the number of collisions thus far incurred by the stations, τ is the maximum roundtrip propagation delay of the channel, and s is the slot time of said channel.
Claim 21
Dependent Claim
93 words
The method of claim 1 wherein the variable maintained at the network interface device stores the ratio of the number of packets successfully transmitted from the network interface device to the number of packets successfully transmitted from the stations in each observation window of time, wherein the first protocol is a Greedy protocol according to which ζ is selected equal to zero and wherein the second protocol is a Courteous protocol according to which ζ is selected equal to at least τ, where τ is the maximum roundtrip propagation delay of the channel.
Claim 22
Dependent Claim
14 words
The method of claim 1 wherein said limit varies as a function of time.
Claim 23
Dependent Claim
83 words
The method of claim 1 wherein a station sends a packet to the network interface device in accordance with the following steps: at the station, initiating the transmission of a packet from the station into the channel, sensing the channel at the station to determine if the packet from the station was successfully transmitted to the network interface device or if the packet experienced a collision, and if the packet experienced a collision, rescheduling the packet in accordance with an exponential backoff algorithm.
Claim 24
Dependent Claim
15 words
The method of claim 1 wherein said transmission channel is formed by a coaxial cable.
Claim 25
Dependent Claim
17 words
The method of claim 1 wherein said transmission channel is formed by a twisted pair of wires.
Claim 26
Dependent Claim
10 words
The method of claim 1 wherein said channel is wireless.
Claim 27
Dependent Claim
15 words
The method of claim 1 wherein at least some of said packets contain video data.
Claim 28
Dependent Claim
22 words
The method of claim 1 wherein packets are transmitted from said stations via said channel in accordance with the IEEE 802.3 protocol.
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) | 1998-08-28 | 1999-02-27 | 1999-08-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-08-28 | 2003-02-27 | 2003-08-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-08-28 | 2007-02-27 | 2007-08-29 | $7700.00 | Window Closed / Lapsed |