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

Systems and methods for transmitting and receiving data in connection with a communications stack in a communications system

Assignee: International Business Machines Corp
•
Filing: 1997-02-19
•
Granted: 1999-11-09
•
Expires: 2017-02-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Management of datastream construction prior to transmission of the datastream across a channel of a communications system by providing for data blocking while reducing movement or copying of the data improves the performance in a communications system. Multiple header segments received from a higher layer in the communications stack are copied into the datastream header area of a datastream such that the header segments are sequentially stored in the datastream header area. A datastream buffer list having entries referencing the datastream header area is generated. Buffer list entries referencing data segments received from higher layers in the communications stack are also stored in the datastream buffer list. The data segments are not physically moved or copied into the datastream during processing by the communications stack. Rather, a "virtual" datastream is generated by the communications stack for transmission without physically moving or copying the data segment. The datastream is transmitted across the channel by the system input/output interface by first writing the datastream header area referenced by the datastream buffer list directly into the channel, and the data segments directly from their original storage location into the channel of the communications system using the datastream buffer list entries.

Inventors

  • 👤 Scott Allan Campbell
  • 👤 Dale C. Gugliotta
  • 👤 Lynn Douglas Long
  • 👤 Louis F. Menditto
  • 👤 Masashi E. Miyake
  • 👤 Linwood Hugh Overby
  • 👤 Bala Rajaraman
  • 👤 Arthur James Stagg

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 22:59
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L49/00; H04L49/90; H04L49/9042; H04L41/00; H04L49/901; H04L49/9021; H04L49/9084; H04L49/9089; H04L49/9094; H04L69/00; H04L69/22

Claims Analysis

Total Claims: 39
Claim 1
Independent Claim 274 words
A method for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said method comprising the steps of: copying the plurality of header segments into a datastream header area of a datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 2
Independent Claim 274 words
A method for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said method comprising the steps of: copying the plurality of header segments into a datastream header area of a datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 3
Dependent Claim 49 words
A method for assembling according to claim 1 wherein said assembling occurs in a communications stack having multiple layers, and wherein said copying step is preceded by the step of: receiving said data segments and said header segments from one layer of said multiple layers in the communications stack.
Claim 4
Dependent Claim 25 words
A method for assembling according to claim 2 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.
Claim 5
Dependent Claim 113 words
A method for assembling according to claim 1 further comprising the steps of: transmitting the datastream header area having the plurality of header segments across the network channel; obtaining the plurality of data segments referenced by the datastream buffer list; and transmitting the obtained plurality of data segments referenced by the datastream buffer list across the network channel as a datastream data area; wherein the combination of said header segments in said datastream header area and said data segments in said datastream data area form the datastream and said header segments in said datastream header area are discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto.
Claim 6
Dependent Claim 41 words
A method for assembling according to claim 1 wherein said datastream header area of said datastream buffer has a block header portion, and said copying step is preceded by the step of storing datastream specific information in said block header portion.
Claim 7
Dependent Claim 78 words
A method for assembling according to claim 1 wherein said associating step comprises the steps of: determining the displacement between each one of said header segments in the datastream header area of the datastream and the data segment in the datastream data area corresponding to each one of said header segments; and storing the determined displacement in said datastream header area in association with the one of said header segments corresponding to the one of said data segments.
Claim 8
Independent Claim 251 words
A method for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said method comprising the steps of: generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; storing said one of said header segments in a header segment buffer; storing said one of said data segments in a data segment buffer; and discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 9
Independent Claim 251 words
A method for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said method comprising the steps of: generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; storing said one of said header segments in a header segment buffer; storing said one of said data segments in a data segment buffer; and discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 10
Dependent Claim 135 words
A method for assembling according to claim 7 wherein the discontiguously passing step comprises the steps of: generating a communications stack internal buffer list for the one of said data segments, the internal buffer list being uniquely associated with the one of said data segments and the associated one of said header segments; and passing the internal buffer list from one layer in said communications stack to a higher layer in said communications stack, wherein the one of said data segments is passed to the higher layer in said communications stack discontiguously from its associated header segment and without physically moving the one of said data segments associated with the one of said header segments, and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 11
Dependent Claim 88 words
A method for assembling according to claim 8 wherein the generating a communications stack internal buffer list comprises the steps of: generating a token for representing the one of said data segments, said token being uniquely associated with the corresponding one of said data segments; generating a buffer list header pointer for uniquely referencing the one of said data segments corresponding to the one of said header segments; storing the token in the internal buffer list; and storing the buffer list header pointer in the internal buffer list.
Claim 12
Dependent Claim 84 words
A method for assembling according to claim 7 wherein the generating step comprises the steps of: identifying one of said header segments in said discontiguous datastream; storing a header pointer for referencing the identified one of said header segments in the datastream buffer list; identifying one of said data segments in said discontiguous datastream which uniquely corresponds to the identified one of said header segments; and storing a data pointer for referencing the identified one of said data segments in the datastream buffer list.
Claim 13
Dependent Claim 25 words
A method for assembling according to claim 7 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.
Claim 14
Independent Claim 285 words
A system for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said system comprising: a datastream buffer having a datastream header area; means for copying the plurality of header segments into the datastream header area of the datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; means for associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and means for generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 15
Independent Claim 285 words
A system for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said system comprising: a datastream buffer having a datastream header area; means for copying the plurality of header segments into the datastream header area of the datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; means for associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and means for generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 16
Dependent Claim 50 words
A system for assembling according to claim 12 wherein said system for assembling is operatively connected with a communications stack having multiple layers, and wherein said system further comprises means for receiving said data segments and said header segments from one layer of said multiple layers in the communications stack.
Claim 17
Dependent Claim 25 words
A system for assembling according to claim 13 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.
Claim 18
Dependent Claim 116 words
A system for assembling according to claim 12 further comprising: means for transmitting the datastream header area having the plurality of header segments across the network channel; means for obtaining the plurality of data segments referenced by the datastream buffer list; and means for transmitting the obtained plurality of data segments referenced by the datastream buffer list across the network channel as a datastream data area; wherein the combination of said header segments in said datastream header area and said data segments in said datastream data area form the datastream and said header segments in said datastream header area are discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto.
Claim 19
Dependent Claim 38 words
A system for assembling according to claim 12 wherein said datastream header area of said datastream buffer has a block header portion, and said system further comprises means for storing datastream specific information in said block header portion.
Claim 20
Dependent Claim 80 words
A system for assembling according to claim 12 wherein said means for associating comprises: means for determining the displacement between each one of said header segments in the datastream header area of the datastream and the data segments in the datastream data area corresponding to each one of said header segments; and means for storing the determined displacement in said datastream header area in association with the one of said header segments corresponding to the one of said data segments.
Claim 21
Independent Claim 264 words
A system for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said system comprising: means for generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; a header segment buffer; means for storing said one of said header segments in a header segment buffer; a data segment buffer; means for storing said one of said data segments in a data segment buffer; and means for discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 22
Independent Claim 264 words
A system for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said system comprising: means for generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; a header segment buffer; means for storing said one of said header segments in a header segment buffer; a data segment buffer; means for storing said one of said data segments in a data segment buffer; and means for discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 23
Dependent Claim 136 words
A system for assembling according to claim 18 wherein the discontiguously passing means comprises: means for generating a communications stack internal buffer list for the one of said data segments, the internal buffer list being uniquely associated with the one of said data segments and the associated one of said header segments; and means for passing the internal buffer list from one layer in said communications stack to a higher layer in said communications stack, wherein the one of said data segments is passed to the higher layer in said communications stack discontiguously from its associated header segment and without physically moving the one of said data segments associated with the one of said header segments, and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 24
Dependent Claim 89 words
A system for assembling according to claim 19 wherein the generating internal buffer list means comprises: means for generating a token representing the one of said data segments, said token being uniquely associated with the corresponding one of said data segments; means for generating a buffer list header pointer uniquely referencing the one of said data segments corresponding to the one of said header segments; means for storing the token in the internal buffer list; and means for storing the buffer list header pointer in the internal buffer list.
Claim 25
Dependent Claim 89 words
A system for assembling according to claim 18 wherein the generating means comprises: means for identifying one of said header segments in said discontiguous datastream; means for storing a header pointer for referencing the identified one of said header segments in the datastream buffer list; means for identifying one of said data segments in said discontiguous datastream which uniquely corresponds to the identified one of said header segments; and means for storing a data pointer for referencing the identified one of said data segments in the datastream buffer list.
Claim 26
Dependent Claim 25 words
A system for assembling according to claim 18 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.
Claim 27
Dependent Claim 307 words
A computer program product for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said computer program product comprising: a computer readable storage medium having computer readable code means embodied in said medium, said computer readable code means comprising: computer instruction means for copying the plurality of header segments into a datastream header area of a datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; computer instruction means for associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and computer instruction means for generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 28
Dependent Claim 307 words
A computer program product for assembling a plurality of data segments and a plurality of header segments into a datastream for transmission across a network channel, each one of said data segments uniquely corresponding to one of said header segments, and said network channel generally requiring each one of said data segments to be contiguous with the uniquely corresponding one of said header segments to enable efficient transmission of data segments and corresponding header segments across the network channel, said computer program product comprising: a computer readable storage medium having computer readable code means embodied in said medium, said computer readable code means comprising: computer instruction means for copying the plurality of header segments into a datastream header area of a datastream buffer, said header segments being sequentially stored in said datastream header area of the datastream buffer; computer instruction means for associating each one of said header segments stored in said datastream header area of the datastream buffer with the one of said data segments corresponding thereto; and computer instruction means for generating a datastream buffer list comprising entries referencing said header segments in said datastream header area of the datastream buffer and entries referencing said data segments; wherein said data segments, said datastream buffer list and said datastream buffer having a datastream header area may be used collectively to form a datastream for transmission across the network channel without physically moving the data segments and without creating a copy of the data segments until transmission of the datastream, said datastream having a datastream header area and a datastream data area such that said header segments in said datastream header area may be discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto and said datastream is formed at the time of transmission of said datastream on said network channel.
Claim 29
Dependent Claim 53 words
A computer program product for assembling according to claim 23 wherein said assembling occurs in a communications stack having multiple layers, and wherein said computer readable code means further comprises computer instruction means for receiving said data segments and said header segments from one layer of said multiple layers in the communications stack.
Claim 30
Dependent Claim 27 words
A computer program product for assembling according to claim 24 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.
Claim 31
Dependent Claim 130 words
A computer program product for assembling according to claim 23, wherein said computer readable code means further comprises: computer instruction means for transmitting the datastream header area having the plurality of header segments across the network channel; computer instruction means for obtaining the plurality of data segments referenced by the datastream buffer list; and computer instruction means for transmitting the obtained plurality of data segments referenced by the datastream buffer list across the network channel as a datastream data area; wherein the combination of said header segments in said datastream header area and said data segments in said datastream data area form the datastream and said header segments in said datastream header area are discontiguously located in said datastream from the data segments in said datastream data area corresponding thereto.
Claim 32
Dependent Claim 45 words
A computer program product for assembling according to claim 23 wherein said datastream header area of said datastream buffer has a block header portion, and said computer readable code means further comprises computer instruction means for storing datastream specific information in said block header portion.
Claim 33
Dependent Claim 76 words
A computer program product for assembling according to claim 23 wherein said computer instruction means for associating comprises: computer instruction means for determining the displacement between each header segment in the datastream header area of the datastream and the data segment in the datastream data area corresponding to such header segment; and computer instruction means for storing the determined displacement in said datastream header area in association with the header segment corresponding to the data segment.
Claim 34
Dependent Claim 288 words
A computer program product for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said computer program product comprising: a computer readable storage medium having computer readable code means embodied in said medium, said computer readable code means comprising: computer instruction means for generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; computer instruction means for storing said one of said header segments in a header segment buffer; computer instruction means for storing said one of said data segments in a data segment buffer; and computer instruction means for discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 35
Dependent Claim 288 words
A computer program product for assembling in a communications stack having multiple layers header segments and corresponding data segments from a discontiguous datastream received on a network channel, said received discontiguous datastream comprising a datastream header area having a plurality of header segments and a datastream data area having a plurality of data segments, each one of said data segments uniquely corresponding to one of said header segments, said one of said data segments located in said datastream in a discontiguous relationship to said corresponding one of said header segments, said computer program product comprising: a computer readable storage medium having computer readable code means embodied in said medium, said computer readable code means comprising: computer instruction means for generating a datastream buffer list having a header entry referencing one of said header segments in said discontiguous datastream and a data entry referencing one of said data segments in said discontiguous datastream which uniquely corresponds to the one of said header segments; computer instruction means for storing said one of said header segments in a header segment buffer; computer instruction means for storing said one of said data segments in a data segment buffer; and computer instruction means for discontiguously passing said one of said data segments and said uniquely corresponding one of said header segments to a second layer in said communications stack, wherein said one of said data segments is passed to the second layer in said communications stack discontiguously from its associated one of said header segments and without physically moving the one of said data segments associated with the one of said header segments and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 36
Dependent Claim 102 words
A computer program product for assembling according to claim 29 wherein the computer instruction means for generating comprises: computer instruction means for identifying one of said header segments in said discontiguous datastream; computer instruction means for storing a header pointer for referencing the identified one of said header segments in the datastream buffer list; computer instruction means for identifying one of said data segments in said discontiguous datastream which uniquely corresponds to the identified one of said header segments; and computer instruction means for storing a data pointer for referencing the identified one of said data segments in the datastream buffer list.
Claim 37
Dependent Claim 145 words
A computer program product for assembling according to claim 30 wherein the computer instruction means for discontiguously passing comprises: computer instruction means for generating a communications stack internal buffer list for the one of said data segments, the internal buffer list being uniquely associated with the one of said data segments and the associated one of said header segments; and computer instruction means for passing the internal buffer list from one layer in said communications stack to a higher layer in said communications stack, wherein the one of said data segments is passed to the higher layer in said communications stack discontiguously from its associated header segment and without physically moving the one of said data segments associated with the one of said header segments, and without creating a copy of the one of said data segments associated with the one of said header segments.
Claim 38
Dependent Claim 107 words
A computer program product for assembling according to claim 31 wherein the computer instruction means for generating a communications stack internal buffer list comprises: computer instruction means for generating a token for representing the one of said data segments, said token being uniquely associated with the corresponding one of said data segments; computer instruction means for generating a buffer list Header pointer for uniquely referencing the one of said data segments corresponding to the one of said header segments; computer instruction means for storing the token in the internal buffer list; and computer instruction means for storing the buffer list header pointer in the internal buffer list.
Claim 39
Dependent Claim 27 words
A computer program product for assembling according to claim 29 wherein said communications stack is a communications stack implemented in a virtual telecommunications access method (VTAM) system.

References Cited (Backward Citations)

US4365295A Cited
US4586134A Cited
US4926322A Cited
US5297265A Cited
US5027269A Cited
US5269013A Cited
US5386536A Cited
US5278834A Cited
US5396614A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-11-08 2003-05-10 2003-11-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-11-08 2007-05-10 2007-11-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-11-08 2011-05-10 2011-11-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag