US6345375B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet-based communication methods and systems having improved data throughput
Assignee: LG Electronics Inc
•
Filing: 1999-02-24
•
Granted: 2002-02-05
•
Expires: 2019-02-24
Abstract
Abstract Packet-based communication methods and systems are provided which improve data throughput and which respond to different error-rate conditions with modifications appropriate for those conditions. In method embodiments, data frames are initially formed to each have N data packets and a frame error code. Data frames are then transmitted and checked. In response to the check, data packets of error-free data frames are routed through the system and data frames that are in error are retransmitted. The checking, processing and retransmitting steps are repeated until all data packets are routed through the communication system. In another method embodiment, data packets of each data frame found to be in error in the checking step are inserted into a data frame of the forming step. In a feedback feature, a system error rate is determined and, in response, N is periodically updated to a value that realizes the best throughput under the current noise condition of the transmission link.
Inventors
- 👤 Kris Kelkar
- 👤 David M. Stewart
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 17:36
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/12; H04L1/16; H04L1/18
Claims Analysis
Total Claims: 42
Claim 1
Independent Claim
88 words
A method of improving data throughput in a packet-based communication system, comprising the steps of: forming data frames to each have N data packets and a frame error code; transmitting said data frames; checking received data frames; in response to said checking step, determining an error rate; updating an integer value for N that enhances said data throughput; routing the data packets of error-free data frames; retransmitting data frames found to be in error; and repeating said checking, processing and retransmitting steps until all data packets are routed.
Claim 2
Independent Claim
88 words
A method of improving data throughput in a packet-based communication system, comprising the steps of: forming data frames to each have N data packets and a frame error code; transmitting said data frames; checking received data frames; in response to said checking step, determining an error rate; updating an integer value for N that enhances said data throughput; routing the data packets of error-free data frames; retransmitting data frames found to be in error; and repeating said checking, processing and retransmitting steps until all data packets are routed.
Claim 3
Dependent Claim
21 words
The method of claim 1 , wherein said updating step includes the step of changing N inversely to said error rate.
Claim 4
Dependent Claim
33 words
The method of claim 1 , wherein said determining step includes the step of comparing data frames found to be in error to total number of data frames checked in said checking step.
Claim 5
Dependent Claim
15 words
The method of claim 1 , wherein said error rate is a bit error rate.
Claim 6
Dependent Claim
22 words
The method of claim 1 , wherein said routing step includes the step of distributing said data packets through said communication system.
Claim 7
Dependent Claim
21 words
The method of claim 1 , further including a step of forming said frame error code as a cyclic redundancy code.
Claim 8
Dependent Claim
24 words
The method of claim 1 , wherein said checking step includes the step of verifying each data frame with its respective frame error code.
Claim 9
Dependent Claim
30 words
The method of claim 1 , further including the step of excluding from said data frames in said forming step, error codes restricted to any one of said data packets.
Claim 10
Dependent Claim
18 words
The method of claim 1 , further including the step of restricting N to be less than 10.
Claim 11
Dependent Claim
18 words
The method of claim 1 , further including the step of restricting N to be less than 15.
Claim 12
Dependent Claim
26 words
The method of claim 1 , wherein said transmitting step includes the step of including frame identification and routing information in each of said data frames.
Claim 13
Independent Claim
85 words
A method of improving data throughput in a packet-based communication system, comprising the steps of: forming data frames to each have N data packets and a frame error code; transmitting said data frames; checking received data frames; routing the data packets of error-free data frames; inserting the data packets of each data frame found to be in error in said checking step into a data frame of said forming step; and repeating said transmitting, checking, routing and inserting steps until all data packets are routed.
Claim 14
Independent Claim
85 words
A method of improving data throughput in a packet-based communication system, comprising the steps of: forming data frames to each have N data packets and a frame error code; transmitting said data frames; checking received data frames; routing the data packets of error-free data frames; inserting the data packets of each data frame found to be in error in said checking step into a data frame of said forming step; and repeating said transmitting, checking, routing and inserting steps until all data packets are routed.
Claim 15
Dependent Claim
33 words
The method of claim 12 , further including the steps of: in response to said checking step, determining an error rate; and updating an integer value for N that enhances said data throughput.
Claim 16
Dependent Claim
21 words
The method of claim 13 , wherein said updating step includes the step of changing N inversely to said error rate.
Claim 17
Dependent Claim
33 words
The method of claim 13 , wherein said routing step includes the step of comparing data frames found to be in error to total number of data frames checked in said checking step.
Claim 18
Dependent Claim
15 words
The method of claim 13 , wherein said error rate is a bit error rate.
Claim 19
Dependent Claim
22 words
The method of claim 12 , wherein said processing step includes the step of distributing said data packets through said communication system.
Claim 20
Dependent Claim
21 words
The method of claim 12 , further including a step of forming said frame error code as a cyclic redundancy code.
Claim 21
Dependent Claim
24 words
The method of claim 12 , wherein said checking step includes the step of verifying each data frame with its respective frame error code.
Claim 22
Dependent Claim
30 words
The method of claim 12 , further including the step of excluding from said data frames in said forming step, error codes restricted to any one of said data packets.
Claim 23
Dependent Claim
18 words
The method of claim 12 , further including the step of restricting N to be less than 10.
Claim 24
Dependent Claim
18 words
The method of claim 12 , further including the step of restricting N to be less than 15.
Claim 25
Dependent Claim
26 words
The method of claim 12 , wherein said transmitting step includes the step of including frame identification and routing information in each of said data frames.
Claim 26
Dependent Claim
182 words
A packet-based communication system for routing data between data sources and data sinks, comprising: at least one transmission link; a plurality of data-interconnection modules that interface with said data sources and data sinks; a transmitter that couples at least one of said data interconnection modules to said transmission link; a receiver that couples at least one of said data interconnection modules to said transmission link; and a processor programmed to conduct the steps of: a) gathering data from said data source; b) from said data, forming data frames to each have N data packets and a frame error code; c) transmitting said data frames through said transmission link; d) checking received data frames; e) routing data packets of error-free data frames to said data sink; f) retransmitting data frames found to be in error; and g) repeating said checking, processing and retransmitting steps until all data packets are routed; wherein said processor is further programmed to conduct the steps of: in response to said checking step, determining an error rate; and updating an integer value for N that enhances said data throughput.
Claim 27
Dependent Claim
182 words
A packet-based communication system for routing data between data sources and data sinks, comprising: at least one transmission link; a plurality of data-interconnection modules that interface with said data sources and data sinks; a transmitter that couples at least one of said data interconnection modules to said transmission link; a receiver that couples at least one of said data interconnection modules to said transmission link; and a processor programmed to conduct the steps of: a) gathering data from said data source; b) from said data, forming data frames to each have N data packets and a frame error code; c) transmitting said data frames through said transmission link; d) checking received data frames; e) routing data packets of error-free data frames to said data sink; f) retransmitting data frames found to be in error; and g) repeating said checking, processing and retransmitting steps until all data packets are routed; wherein said processor is further programmed to conduct the steps of: in response to said checking step, determining an error rate; and updating an integer value for N that enhances said data throughput.
Claim 28
Dependent Claim
22 words
The communication system of claim 24 , wherein said updating step includes the step of changing N inversely to said error rate.
Claim 29
Dependent Claim
31 words
The communication system of claim 24 , wherein said at least one transmission link is one of a group comprised of a wireless link, a wire link and an optical link.
Claim 30
Dependent Claim
30 words
The communication system of claim 24 , wherein at least one of said data interconnection modules is one of a group comprised of a router, a switch and a bridge.
Claim 31
Dependent Claim
25 words
The communication system of claim 24 , wherein said processor is included in a selected one of said data-interconnection modules, said transmitter and said receiver.
Claim 32
Dependent Claim
27 words
The communication system of claim 24 , wherein said data source is one of a group comprised of a computer, a mobile telephone and a video source.
Claim 33
Dependent Claim
27 words
The communication system of claim 24 , wherein said data sink is one of a group comprised of a computer, a mobile telephone and a video monitor.
Claim 34
Dependent Claim
159 words
A packet-based communication system for routing data between data sources and data sinks, comprising: at least one transmission link; a plurality of data-interconnection modules that interface with said data sources and data sinks; a transmitter that couples at least one of said data interconnection modules to said transmission link; a receiver that couples at least one of said data interconnection modules to said transmission link; and a processor programmed to conduct the steps of: a) gathering data from said data source; b) from said data, forming data frames to each have N data packets and a frame error code; c) transmitting said data frames; d) checking received data frames; e) routing data packets of error-free data frames; f) inserting the data packets of each data frame found to be in error in said checking step into a data frame of said forming step; and g) repeating said transmitting, checking, routing and inserting steps until all data packets are routed.
Claim 35
Dependent Claim
159 words
A packet-based communication system for routing data between data sources and data sinks, comprising: at least one transmission link; a plurality of data-interconnection modules that interface with said data sources and data sinks; a transmitter that couples at least one of said data interconnection modules to said transmission link; a receiver that couples at least one of said data interconnection modules to said transmission link; and a processor programmed to conduct the steps of: a) gathering data from said data source; b) from said data, forming data frames to each have N data packets and a frame error code; c) transmitting said data frames; d) checking received data frames; e) routing data packets of error-free data frames; f) inserting the data packets of each data frame found to be in error in said checking step into a data frame of said forming step; and g) repeating said transmitting, checking, routing and inserting steps until all data packets are routed.
Claim 36
Dependent Claim
40 words
The communication system of claim 31 , wherein said processor is further programmed to conduct the steps of: in response to said checking step, determining an error rate; and updating an integer value for N that enhances said data throughput.
Claim 37
Dependent Claim
22 words
The communication system of claim 32 , wherein said updating step includes the step of changing N inversely to said error rate.
Claim 38
Dependent Claim
31 words
The communication system of claim 31 , wherein said at least one transmission link is one of a group comprised of a wireless link, a wire link and an optical link.
Claim 39
Dependent Claim
30 words
The communication system of claim 31 , wherein at least one of said data interconnection modules is one of a group comprised of a router, a switch and a bridge.
Claim 40
Dependent Claim
25 words
The communication system of claim 31 , wherein said processor is included in a selected one of said data-interconnection modules, said transmitter and said receiver.
Claim 41
Dependent Claim
27 words
The communication system of claim 31 , wherein said data source is one of a group comprised of a computer, a mobile telephone and a video source.
Claim 42
Dependent Claim
27 words
The communication system of claim 31 , wherein said data sink is one of a group comprised of a computer, a mobile telephone and a video monitor.
References Cited (Backward Citations)
US5629948A
Cited
US5768533A
Cited
US5790806A
Cited
US5818852A
Cited
US5870406A
Cited
US5923650A
Cited
US6088826A
Cited
US6167270A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-02-04 | 2005-08-06 | 2006-02-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-02-04 | 2009-08-06 | 2010-02-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-02-04 | 2013-08-06 | 2014-02-05 | $7700.00 | Window Closed / Lapsed |