← Back to Patent Explorer
US5131016A Expired / Lapsed US ⏱️ 0.0 years remaining

Communications network data compression control system and method

Assignee: International Business Machines Corp
•
Filing: 1991-01-09
•
Granted: 1992-07-14
•
Expires: 2011-01-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Data communication nodes in a network comprising a plurality of nodes linked together to form communication paths negotiate by passing messages to identify to one another the maximum supportable degree of data compression capability. Logical comparisons are made at each node between indications received from upstream and downstream nodes, if any, regarding their own or their received indications of data compression capability with the present node's own degree of compression capability. This enables logical decisions to be made to suport the maximum degree of compression capability over each link or portion of a link between terminal nodes which define the ends of the overall link, thus improving data transmission by providing the highest degree of supportable compression over the longest path length.

Inventors

  • 👤 John C. Broughton
  • 👤 Robert S. Cahn
  • 👤 James P. Gray
  • 👤 John P. O'Donnell

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 22:55
CPC Classifications
H; H04; H04L; H04L69/00; H04L69/04; H04L9/00; H04L9/40; H04L69/24

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 230 words
At each node of a data communications network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for the purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, a method of controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising steps performed at each said node in said link of: generating indications at said node of the maximum degree of data compression capability supportable with any neighboring nodes to said node in first and second directions from said node; and controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable with said neighboring nodes; and sending said indications to any said neighboring nodes lying in said first and second directions, respectively, from said node to which said indications pertain; and receiving at said node indications of the maximum degree of data compression supportable at said node's neighboring nodes; and comparing said node's own degree of data compression capability with said received indications.
Claim 2
Dependent Claim 230 words
At each node of a data communications network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for the purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, a method of controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising steps performed at each said node in said link of: generating indications at said node of the maximum degree of data compression capability supportable with any neighboring nodes to said node in first and second directions from said node; and controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable with said neighboring nodes; and sending said indications to any said neighboring nodes lying in said first and second directions, respectively, from said node to which said indications pertain; and receiving at said node indications of the maximum degree of data compression supportable at said node's neighboring nodes; and comparing said node's own degree of data compression capability with said received indications.
Claim 3
Independent Claim 288 words
A method as claimed in 1, wherein: if said indications of the maximum degree of data compression capability for said node and received at said node from said neighboring nodes are designated, respectively as Uc for indications received at said node from said first direction and Dc for indications received at said node from said second direction and Nc for the indications possessed by said node, said controlling step is responsive to said comparing step in accordance with the results of said comparisons as defined by the following relationships: if Uc is equal to Dc, or if Uc is not equal to Dc and Nc is less than both Uc and Dc or if Uc is not equal to Dc and Nc is less than or equal to Uc and Dc, setting said node's mode of data compression operation in both said first and said second directions to none; and if Dc is less than Uc and Nc and if Nc is greater than or equal to Uc, or if Uc is less than Dc and Nc, setting node's mode of data compression operation in said second direction equal to Uc and setting said node's mode of data compression in said first direction equal to Dc; and if Dc is less than Uc and Nc and if Nc is less than Uc, setting node's mode of data compression operation in said second direction equal to Nc and setting said node's mode of data compression in said first direction equal to Dc; and if Uc is less than Nc and Dc, setting said node's mode of data compression in second direction equal to UC and setting node's mode of data compression operation in said first direction equal to Nc.
Claim 4
Dependent Claim 135 words
A method as claimed in claim 2, wherein, whenever said node lacks a said neighboring node in either said first or said second direction, setting said node's mode of data compression operation according to the following relation: if Uc is less than or equal to Nc or if Dc is less than or equal to Nc according to whichever of Uc or Dc is received, setting said node's mode of data compression equal to Uc or Dc in the direction to its said neighboring node which provided said Uc or Dc indication; and if Nc is less than Uc or Dc, according to whichever of said Uc or Dc indications is received, setting said node's mode of data compression operation equal to Nc with its existing said neighboring node providing said Uc or Dc indication.
Claim 5
Dependent Claim 233 words
At each node of a data communications network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, means for controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising: means at said node for generating indications of the maximum degree of data compression capability supportable by said node with any neighboring said nodes in first and second directions from said node; and means for controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable by said node with said neighboring nodes; means for sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and means for receiving indications at said node of the maximum degree of data compression capability supportable at said node's neighboring nodes; and means for comparing said node's own degree of data compression capability with said received indications.
Claim 6
Dependent Claim 233 words
At each node of a data communications network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, means for controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising: means at said node for generating indications of the maximum degree of data compression capability supportable by said node with any neighboring said nodes in first and second directions from said node; and means for controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable by said node with said neighboring nodes; means for sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and means for receiving indications at said node of the maximum degree of data compression capability supportable at said node's neighboring nodes; and means for comparing said node's own degree of data compression capability with said received indications.
Claim 7
Dependent Claim 240 words
In a node as claimed 4, apparatus further comprising: means for controlling the setting of said node's modes of data compression operation in response to said comparing means in accordance with the results of said comparisons as defined by the following relationships: if Uc is equal to Dc, or if Uc is not equal to Dc and Nc is less than both Uc and Dc or if Uc is not equal to Dc and Nc is less than or equal to Uc and Dc, setting said node's mode of data compression operation in both said first and said second directions to none; and if Dc is less than Uc and Nc and if Nc is greater than or equal to Uc, or if Uc is less than Dc and Nc, setting node's mode of data compression operation in second direction equal to Uc and setting said node's mode of data compression in said first direction equal to Dc; and if Dc is less than Uc and Nc and if Nc is less than Uc, setting node's mode of data compression operation in said second direction equal to Nc and setting said node's mode of data compression in said first direction equal to Dc; and if Uc is less than Nc and Dc, setting said node's mode of data compression in second direction equal to UC and setting node's mode of data compression operation in said first direction equal to Nc.
Claim 8
Dependent Claim 150 words
In a node as claimed in claim 5, wherein, if said node lacks a said neighbor in either said first or said second direction, means for controlling said setting of said modes of data compression with an existing said neighbor comprising means responsive to said comparing means according to the following relation: if Uc is less than or equal to Nc or if Dc is less than or equal to Nc according to whichever of Uc or Dc is received, setting said node's mode of data compression equal to Uc or Dc in the direction to its said neighboring node which provided said Uc or Dc indication; and if Nc is less than Uc or Dc, according to whichever of said Uc or Dc indications is received, setting said node's mode of data compression operation equal to Nc with its existing said neighboring node providing said Uc or Dc indication.
Claim 9
Independent Claim 194 words
A method of operating a data communications network having plural interconnected nodes for sending and receiving data, any two of which said nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable data compression capability comprising steps performed at each node in said link of: generating at said node indications of the maximum degree of data compression capability supportable with any neighboring nodes to said node in first and second directions from said node; and controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression supportable with said neighboring nodes; and sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and receiving indications at said node of the maximum degree of data compression supportable at any said node's neighboring nodes; and comparing said node's own degree of data compression capability with said received indications.
Claim 10
Independent Claim 194 words
A method of operating a data communications network having plural interconnected nodes for sending and receiving data, any two of which said nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable data compression capability comprising steps performed at each node in said link of: generating at said node indications of the maximum degree of data compression capability supportable with any neighboring nodes to said node in first and second directions from said node; and controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression supportable with said neighboring nodes; and sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and receiving indications at said node of the maximum degree of data compression supportable at any said node's neighboring nodes; and comparing said node's own degree of data compression capability with said received indications.
Claim 11
Dependent Claim 304 words
A method as claimed in claim 7, wherein said controlling step further comprises setting said node's modes of operation according to the following relations: if said indications of the maximum degree of data compression capability for said node and received at said node from said neighboring nodes are designated, respectively as Uc for indications received at said node from said first direction and Dc for indications received at said node from said second direction and Nc for the indications possessed by said node, said controlling step is responsive to said comparing step in accordance with the results of said comparisons as defined by the following relationships: if Uc is equal to Dc, or if Uc is not equal to Dc and Nc is less than both Uc and Dc or if Uc is not equal to Dc and Nc is less than or equal to Uc and Dc, setting said node's mode of data compression operation in both said first and said second directions to none; and if Dc is less than Uc and Nc and if Nc is greater than or equal to Uc, or if Uc is less than Dc and Nc, setting node's mode of data compression operation in second direction equal to Uc and setting said node's mode of data compression in said first direction equal to Dc; and if Dc is less than Uc and Nc and if Nc is less than Uc, setting node's mode of data compression operation in said second direction equal to Nc and setting said node's mode of data compression in said first direction equal to Dc; and if Uc is less than Nc and Dc, setting said node's mode of data compression in second direction equal to UC and setting node's mode of data compression operation in said first direction equal to Nc.
Claim 12
Dependent Claim 137 words
A method as claimed in claim 8, wherein if said node lacks a said neighbor in either said first or said second direction, steps of setting said node's mode of data compression operation with its existing said neighbor comprising: if Uc is less than or equal to Nc or if Dc is less than or equal to Nc according to whichever of Uc or Dc is received, setting said node's mode of data compression equal to Uc or Dc in the direction to its said neighboring node which provided said Uc or Dc indication; and if Nc is less than Uc or Dc, according to whichever of said Uc or Dc indications is received, setting said node's mode of data compression operation equal to Nc with its existing said neighboring node providing said Uc or Dc indication.
Claim 13
Dependent Claim 238 words
A data communications network comprising a plurality of nodes, each said node of said network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, means for controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising: means at said node for generating indications of the maximum degree of data compression capability supportable by said node with any neighboring said nodes in first and second directions from said node; and means for controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable with said neighboring nodes; and means for sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and means for receiving indications at said node of the maximum degree of data compression capability supportable at said node's neighboring nodes; and means for comparing said node's own degree of data compression capability with said received indications.
Claim 14
Dependent Claim 238 words
A data communications network comprising a plurality of nodes, each said node of said network having plural interconnected nodes for sending and receiving data, any two of which nodes may define link terminal ends for purposes of a given communication, each said node having an identifiable degree of data compression capability and settable modes of data compression operation less than or equal to said identifiable compression capability, means for controlling the degree of data compression and data decompression applied by said node to transmitted or received data over a link whose ends are defined in said network by any two of said nodes, comprising: means at said node for generating indications of the maximum degree of data compression capability supportable by said node with any neighboring said nodes in first and second directions from said node; and means for controlling said node's data compression operation in said first and second directions from said node in accordance with said indications of the maximum degree of data compression capability supportable with said neighboring nodes; and means for sending said indications to any said neighboring nodes lying in said first and said second directions, respectively, from said node to which said indications pertain; and means for receiving indications at said node of the maximum degree of data compression capability supportable at said node's neighboring nodes; and means for comparing said node's own degree of data compression capability with said received indications.
Claim 15
Dependent Claim 242 words
In a node as claimed in claim 10, apparatus further comprising: means for controlling the setting of said node's modes of data compression operation in response to said comparing means in accordance with the results of said comparisons as defined by the following relationships: if Uc is equal to Dc, or if Uc is not equal to Dc and Nc is less than both Uc and Dc or if Uc is not equal to Dc and Nc is less than or equal to Uc and Dc, setting said node's mode of data compression operation in both said first and said second directions to none; and if Dc is less than Uc and Nc and if Nc is greater than or equal to Uc, or if Uc is less than Dc and Nc, setting node's mode of data compression operation in second direction equal to Uc and setting said node's mode of data compression in said first direction equal to Dc; and if Dc is less than Uc and Nc and if Nc is less than Uc, setting node's mode of data compression operation in said second direction equal to Nc and setting said node's mode of data compression in said first direction equal to Dc; and if Uc is less than Nc and Dc, setting said node's mode of data compression in second direction equal to UC and setting node's mode of data compression operation in said first direction equal to Nc.
Claim 16
Dependent Claim 150 words
In a node as claimed in claim 11, wherein, if said node lacks a said neighbor in either said first or said second direction, means for controlling said setting of said modes of data compression with an existing said neighbor comprising means responsive to said comparing means according to the following relation: if Uc is less than or equal to Nc or if Dc is less than or equal to Nc according to whichever of Uc or Dc is received, setting said node's mode of data compression equal to Uc or Dc in the direction to its said neighboring node which provided said Uc or Dc indication; and if Nc is less than Uc or Dc, according to whichever of said Uc or Dc indications is received, setting said node's mode of data compression operation equal to Nc with its existing said neighboring node providing said Uc or Dc indication.

References Cited (Backward Citations)

US4679187A Cited
US4823342A Cited
US4890282A Cited
US4899147A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-07-14 1996-01-13 1996-07-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-07-14 2000-01-13 2000-07-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-07-14 2004-01-13 2004-07-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag