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

Method and apparatus for reassembly of data packets into messages in an asynchronous transfer mode communications system

Assignee: RPX Clearinghouse LLC
•
Filing: 1996-07-23
•
Granted: 1999-02-09
•
Expires: 2016-07-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus for receiving messages defined by data packets having respective header and payload portions where each header portion includes a channel representation regarding a channel associated with the data packet and an end of message representation representing whether or not the data packet is a final data packet in the message and where each payload portion includes information pertaining to the message. The apparatus includes data memory for storing the payload portions of the data packets, list memory, a header processor for receiving the header portion of the data packet and for providing status signals indicative of the channel representation and the end of message representation, and a reassembly processor programmed to maintain in the list memory a pointer list of address pointers to unused blocks of data memory and a link list of address pointers associated with each channel.

Inventors

  • 👤 Dan Oprea

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 13:56
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5616; H04L2012/5638; H04L2012/5646; H04L2012/5652

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 162 words
A method for receiving messages defined by data packets having respective header and payload portions, each header portion including a channel representation regarding a channel associated with said data packet and an end of message representation representing whether or not the data packet is a final data packet in a message and each payload portion including information pertaining to the message, the method including the steps of: i) maintaining a pointer list of defined address pointers to unallocated blocks of data memory operable to store the payload portions of said data packets; ii) maintaining a link list of address pointers associated with each channel; iii) loading the payload portion of a received data packet into a block of data memory identified by an address pointer from said pointer list; iv) removing said address pointer from said pointer list; and v) adding said address pointer to said link list associated with the channel representation indicated by the header portion of said data packet.
Claim 2
Independent Claim 162 words
A method for receiving messages defined by data packets having respective header and payload portions, each header portion including a channel representation regarding a channel associated with said data packet and an end of message representation representing whether or not the data packet is a final data packet in a message and each payload portion including information pertaining to the message, the method including the steps of: i) maintaining a pointer list of defined address pointers to unallocated blocks of data memory operable to store the payload portions of said data packets; ii) maintaining a link list of address pointers associated with each channel; iii) loading the payload portion of a received data packet into a block of data memory identified by an address pointer from said pointer list; iv) removing said address pointer from said pointer list; and v) adding said address pointer to said link list associated with the channel representation indicated by the header portion of said data packet.
Claim 3
Dependent Claim 22 words
A method as claimed in claim 1 further including the step of executing the steps of claim 1 with a reassembly processor.
Claim 4
Dependent Claim 44 words
A method as claimed in claim 1 further including the step of receiving at a header processor the header portion of the data packet and causing said header processor to provide status signals indicative of said channel representation and said end of message representation.
Claim 5
Dependent Claim 22 words
A method as claimed in claim 1 further including the step of maintaining said pointer list to identify blocks of equal length.
Claim 6
Dependent Claim 28 words
A method as claimed in claim 4 further including the step of maintaining said pointer list such that said blocks of unused data memory include 48 octets each.
Claim 7
Dependent Claim 35 words
A method as claimed in claim 1 further including the step of copying the payload portions of each of said received data packets associated with the same message into a receive area of data memory.
Claim 8
Dependent Claim 34 words
A method as claimed in claim 6 further including the step of removing from said link list the address pointer associated with each block of data memory used to store a respective payload portion.
Claim 9
Dependent Claim 28 words
A method as claimed in claim 7 further including the step of adding said address pointer to said pointer list, in response to said end of message representation.
Claim 10
Dependent Claim 45 words
A method as claimed in claim 8 further including the step of copying said payload portions to said receive area in the order in which they were received such that said receive area contains a replica of at least a contiguous portion of said message.
Claim 11
Dependent Claim 31 words
A method as claimed in claim 8 further including the step of copying each address pointer to said pointer list after its respective payload portion is copied to said receive area.
Claim 12
Independent Claim 218 words
An apparatus for receiving messages defined by data packets having respective header and payload portions, each header portion including a channel representation regarding a channel associated with said data packet and an end of message representation representing whether or not the data packet is a final data packet in a message and each payload portion including information pertaining to the message, the apparatus comprising: a) data memory for storing the payload portions of said data packets; b) list memory for storing: i) a pointer list of defined address pointers to unallocated blocks of data memrory; and ii) a link list of address pointers associated with each channel; c) a header processor for receiving the header portion of the data packet and for providing status signals indicative of said channel representation and said end of message representation; d) a reassembly processor programmed to maintain said pointer list and said link list in said list memory, said reassembly processor being further programmed to load the payload portion of a received data packet into a block of data memory identified by an address pointer from said pointer list, to remove said address pointer from said pointer list, and to add said address pointer to said link list associated with the channel representation indicated by said status signals from said head processor.
Claim 13
Independent Claim 218 words
An apparatus for receiving messages defined by data packets having respective header and payload portions, each header portion including a channel representation regarding a channel associated with said data packet and an end of message representation representing whether or not the data packet is a final data packet in a message and each payload portion including information pertaining to the message, the apparatus comprising: a) data memory for storing the payload portions of said data packets; b) list memory for storing: i) a pointer list of defined address pointers to unallocated blocks of data memrory; and ii) a link list of address pointers associated with each channel; c) a header processor for receiving the header portion of the data packet and for providing status signals indicative of said channel representation and said end of message representation; d) a reassembly processor programmed to maintain said pointer list and said link list in said list memory, said reassembly processor being further programmed to load the payload portion of a received data packet into a block of data memory identified by an address pointer from said pointer list, to remove said address pointer from said pointer list, and to add said address pointer to said link list associated with the channel representation indicated by said status signals from said head processor.
Claim 14
Dependent Claim 14 words
An apparatus as claimed in claim 11 wherein said blocks are of equal length.
Claim 15
Dependent Claim 18 words
An apparatus as claimed in claim 12 wherein said blocks of unused data memory include 48 octets each.
Claim 16
Dependent Claim 94 words
An apparatus as claimed in claim 11 wherein said data memory has a receive area and wherein the reassembly processor is further programmed to: a) copy the payload portions of each of said received data packets associated with the same message into the receive area of data memory; b) remove from said link list the address pointer associated with each block of data memory used to store a respective payload portion; and c) add said address pointer to said pointer list, in response to said status signals indicative of said end of message representation.
Claim 17
Dependent Claim 48 words
An apparatus as claimed in claim 14 wherein the reassembly processor is further programmed to copy said payload portions to said receive area in the order in which they were received such that said receive area contains a replica of at least a contiguous portion of said message.
Claim 18
Dependent Claim 34 words
An apparatus as claimed in claim 14 wherein the reassembly processor is further programmed to copy each address pointer to said pointer list after its respective payload portion is copied to said receive area.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag