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

Methods, apparatus and computer program products for packet transport over wireless communication links

Assignee: Ericsson Inc
•
Filing: 1998-03-04
•
Granted: 2000-09-05
•
Expires: 2018-03-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Methods, systems and computer program products are provide which reduce overhead in the communication of messages having a message header over a communication link. An alias address is selected from a predefined set of alias addresses and associated with a portion of the header of the message. If no unused alias addresses are available the least recently used alias address is associated with the portion of the message header. The portion of the message header is removed from the message and the alias address substituted. This reduced data message is then transmitted. The number of alias addresses may be increased to avoid churning of alias addresses. The message is reconstructed based on the alias address and the associated portion of the original message.

Inventors

  • 👤 Kumar Balachandran
  • 👤 Havish Koorapaty
  • 👤 David R. Irvin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 13:39
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/90; H04L49/9042; H04L1/00; H04L1/0078; H04L1/0083; H04L61/00; H04L61/09; H04L61/10; H04L61/106; H04L69/00; H04L69/04; H04W; H04W28/00; H04W28/02; H04W28/06; H04L69/22; H04W8/00; H04W8/26

Claims Analysis

Total Claims: 42
Claim 1
Independent Claim 166 words
A method of reducing overhead in communication of messages having a message header over a communication link, the method comprising the steps of: receiving a message to be transmitted on the communication link; determining if an unused alias address from a first predefined set of alias addresses is available; associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and transmitting the reduced data message and the associated alias address on the communication link.
Claim 2
Independent Claim 166 words
A method of reducing overhead in communication of messages having a message header over a communication link, the method comprising the steps of: receiving a message to be transmitted on the communication link; determining if an unused alias address from a first predefined set of alias addresses is available; associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and transmitting the reduced data message and the associated alias address on the communication link.
Claim 3
Dependent Claim 37 words
A method according to claim 1, wherein said removing step is preceded by the step of transmitting the alias address and at least a portion of the message header associated with the message on the communication link.
Claim 4
Dependent Claim 35 words
A method according to claim 2, further comprising the step of receiving from the communication link a confirmation of the association of the at least a portion of the message header and the associated alias.
Claim 5
Dependent Claim 50 words
A method according to claim 1, further comprising the steps of: receiving an alias address and a transmitted reduced data message from the communication link; reconstructing the subsequent message from the at least a portion of the message header associated with the received alias address and the reduced data message.
Claim 6
Dependent Claim 27 words
A method according to claim 1, further comprising the step of identifying as used an alias address associated with at least a portion of a message header.
Claim 7
Dependent Claim 101 words
A method according to claim 1, wherein said step of associating a used alias address from the first predefined set of alias addresses comprises the steps of: determining when each used alias address from the first predefined set of alias addresses was last utilized so as to provide a last time of use for each of the used alias addresses; and associating a used alias address with the oldest last time of use from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available.
Claim 8
Dependent Claim 27 words
A method according to claim 1, wherein the at least a portion of the message header includes a source address and a destination address of the message.
Claim 9
Dependent Claim 15 words
A method according to claim 1, wherein the communication link is a wireless communication link.
Claim 10
Dependent Claim 51 words
A method according to claim 1, further comprising the steps of: monitoring the association of alias addresses with the message headers; and increasing the number of alias addresses in the first predefined set of alias addresses based upon said monitoring so as to provide a second predefined set of alias address.
Claim 11
Dependent Claim 24 words
A method according to claim 9, wherein said increasing step comprises the step of transmitting an increased alias length notification on the communication link.
Claim 12
Dependent Claim 31 words
A method according to claim 9, further comprising the step of removing alias addresses from the second predefined set of alias addresses if the alias addresses are determined to be inactive.
Claim 13
Dependent Claim 33 words
A method according to claim 11, wherein the second predefined set of alias addresses comprises a combination of the first predefined set of alias addresses and a third predefined set of alias addresses.
Claim 14
Dependent Claim 46 words
A method according to claim 12, further comprising the step of reducing the number of alias addresses to the first predefined set of alias addresses if all of the third predefined set of alias addresses have been removed from the second predefined set of alias addresses.
Claim 15
Independent Claim 173 words
A system for reducing overhead in communication of messages having a message header over a communication link, comprising: means for receiving a message to be transmitted on the communication link; means for determining if an unused alias address from a first predefined set of alias addresses is available; means for associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; means for associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; means for removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and means for transmitting the reduced data message and the associated alias address on the communication link.
Claim 16
Independent Claim 173 words
A system for reducing overhead in communication of messages having a message header over a communication link, comprising: means for receiving a message to be transmitted on the communication link; means for determining if an unused alias address from a first predefined set of alias addresses is available; means for associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; means for associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; means for removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and means for transmitting the reduced data message and the associated alias address on the communication link.
Claim 17
Dependent Claim 31 words
A system according to claim 14, further comprising means for transmitting the alias address and at least a portion of the message header associated with the message on the communication link.
Claim 18
Dependent Claim 34 words
A system according to claim 15, further comprising means for receiving from the communication link a confirmation of the association of the at least a portion of the message header and the associated alias.
Claim 19
Dependent Claim 52 words
A system according to claim 14, further comprising: means for receiving an alias address and a transmitted reduced data message from the communication link; and means for reconstructing the subsequent message from the at least a portion of the message header associated with the received alias address and the reduced data message.
Claim 20
Dependent Claim 26 words
A system according to claim 14, further comprising means for identifying as used an alias address associated with at least a portion of a message header.
Claim 21
Dependent Claim 102 words
A system according to claim 14, wherein said means for associating a used alias address from the first predefined set of alias addresses comprises: means for determining when each used alias address from the first predefined set of alias addresses was last utilized so as to provide a last time of use for each of the used alias addresses; and means for associating a used alias address with the oldest last time of use from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available.
Claim 22
Dependent Claim 27 words
A system according to claim 14, wherein the at least a portion of the message header includes a source address and a destination address of the message.
Claim 23
Dependent Claim 15 words
A system according to claim 14, wherein the communication link is a wireless communication link.
Claim 24
Dependent Claim 52 words
A system according to claim 14, further comprising: means for monitoring the association of alias addresses with the message headers; and means for increasing the number of alias addresses in the first predefined set of alias addresses based upon said monitoring so as to provide a second predefined set of alias address.
Claim 25
Dependent Claim 24 words
A system according to claim 22, wherein said means for increasing comprises means for transmitting an increased alias length notification on the communication link.
Claim 26
Dependent Claim 30 words
A system according to claim 22, further comprising means for removing alias addresses from the second predefined set of alias addresses if the alias addresses are determined to be inactive.
Claim 27
Dependent Claim 33 words
A system according to claim 24, wherein the second predefined set of alias addresses comprises a combination of the first predefined set of alias addresses and a third predefined set of alias addresses.
Claim 28
Dependent Claim 45 words
A system according to claim 25, further comprising means for reducing the number of alias addresses to the first predefined set of alias addresses if all of the third predefined set of alias addresses have been removed from the second predefined set of alias addresses.
Claim 29
Dependent Claim 216 words
A computer program product for reducing overhead in communication of messages having a message header over a communication link, the computer program product comprising: a computer-readable storage medium having computer-readable program code means embodied in said medium, said computer-readable program code means comprising: computer-readable program code means for receiving a message to be transmitted on the communication link; computer-readable program code means for determining if an unused alias address from a first predefined set of alias addresses is available; computer-readable program code means for associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; computer-readable program code means for associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; computer-readable program code means for removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and computer-readable program code means for transmitting the reduced data message and the associated alias address on the communication link.
Claim 30
Dependent Claim 216 words
A computer program product for reducing overhead in communication of messages having a message header over a communication link, the computer program product comprising: a computer-readable storage medium having computer-readable program code means embodied in said medium, said computer-readable program code means comprising: computer-readable program code means for receiving a message to be transmitted on the communication link; computer-readable program code means for determining if an unused alias address from a first predefined set of alias addresses is available; computer-readable program code means for associating an unused alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is available; computer-readable program code means for associating a used alias address from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available; computer-readable program code means for removing at least a portion of the message header from a subsequent message having a message header, a portion of which is substantially identical the message header of the received message, to provide a reduced data message; and computer-readable program code means for transmitting the reduced data message and the associated alias address on the communication link.
Claim 31
Dependent Claim 36 words
A computer program product according to claim 27, further comprising computer-readable program code means for transmitting the alias address and at least a portion of the message header associated with the message on the communication link.
Claim 32
Dependent Claim 39 words
A computer program product according to claim 28, further comprising computer-readable program code means for receiving from the communication link a confirmation of the association of the at least a portion of the message header and the associated alias.
Claim 33
Dependent Claim 60 words
A computer program product according to claim 27, further comprising: computer-readable program code means for receiving an alias address and a transmitted reduced data message from the communication link; and computer-readable program code means for reconstructing the subsequent message from the at least a portion of the message header associated with the received alias address and the reduced data message.
Claim 34
Dependent Claim 31 words
A computer program product according to claim 27, further comprising computer-readable program code means for identifying as used an alias address associated with at least a portion of a message header.
Claim 35
Dependent Claim 113 words
A computer program product according to claim 27, wherein said computer-readable program code means for associating a used alias address from the first predefined set of alias addresses comprises: computer-readable program code means for determining when each used alias address from the first predefined set of alias addresses was last utilized so as to provide a last time of use for each of the used alias addresses; and computer-readable program code means for associating a used alias address with the oldest last time of use from the first predefined set of alias addresses with at least a portion of the header of the received message if an unused alias address is not available.
Claim 36
Dependent Claim 29 words
A computer program product according to claim 27, wherein the at least a portion of the message header includes a source address and a destination address of the message.
Claim 37
Dependent Claim 17 words
A computer program product according to claim 27, wherein the communication link is a wireless communication link.
Claim 38
Dependent Claim 60 words
A computer program product according to claim 27, further comprising: computer-readable program code means for monitoring the association of alias addresses with the message headers; and computer-readable program code means for increasing the number of alias addresses in the first predefined set of alias addresses based upon said monitoring so as to provide a second predefined set of alias address.
Claim 39
Dependent Claim 32 words
A computer program product according to claim 35, wherein said computer-readable program code means for increasing comprises computer-readable program code means for transmitting an increased alias length notification on the communication link.
Claim 40
Dependent Claim 35 words
A computer program product according to claim 35, further comprising computer-readable program code means for removing alias addresses from the second predefined set of alias addresses if the alias addresses are determined to be inactive.
Claim 41
Dependent Claim 35 words
A computer program product according to claim 37, wherein the second predefined set of alias addresses comprises a combination of the first predefined set of alias addresses and a third predefined set of alias addresses.
Claim 42
Dependent Claim 50 words
A computer program product according to claim 38, further comprising computer-readable program code means for reducing the number of alias addresses to the first predefined set of alias addresses if all of the third predefined set of alias addresses have been removed from the second predefined set of alias addresses.

References Cited (Backward Citations)

US5131016A Cited
US5293379A Cited
US5307413A Cited
US5521940A Cited
US5483556A Cited
US5561662A Cited
US5446736A Cited
US5414701A Cited
US5535199A Cited
US5572530A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-09-05 2004-03-06 2004-09-05 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-09-05 2008-03-06 2008-09-05 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-09-05 2012-03-06 2012-09-05 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag