Patent US5719864A successfully refreshed from Google Patents.
US5719864A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Logical channel resolution in asynchronous transmission mode communication systems
Assignee: International Business Machines Corp
•
Filing: 1995-08-11
•
Granted: 1998-02-17
•
Expires: 2015-08-11
Abstract
Abstract An asynchronous transmission mode data cell header includes virtual channel and virtual path identifiers which are resolved into logical channel identifiers at the user interface by two table lookup operations. The virtual path identifier is used to access a virtual path table entry having a variable length pointer value buffered out to a fixed length field by zeros with a binary one at the boundary position. Using the binary one as a marker, the pointer field is extracted and concatenated with a base register value and the lower order bits of the virtual channel identifier, corresponding to the bit position of the binary one marker, to provide an index into a logical channel identifier table. The logical channel identifier is used to associate the data cell attached to that header with the appropriate user data stream.
Inventors
- 👤 Ryan Lance Badger
- 👤 Vernon Roberts Norman
- 👤 Brian Alan Youngman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 17:56
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/30; H04L49/3081; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5619
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
146 words
A logical channel resolution system for virtual path and virtual channel identification values comprising: a virtual path table containing a plurality of entries each adapted to include a pointer value field and a position marker field; a logical channel identifier table containing a plurality of entries each adapted to contain a different logical identifier; means utilizing one of said virtual path identification values to retrieve one entry from said virtual path table; means utilizing said position marker field to retrieve said pointer value and to truncate said virtual channel identification value; means for concatenating said pointer value and the truncated virtual channel identification value to access said logical channel identifier table; and means for entering all binary zero entries into said virtual path table for all combinations of virtual path and virtual channel identification values not corresponding to any entry in said logical channel identifier table.
Claim 2
Dependent Claim
146 words
A logical channel resolution system for virtual path and virtual channel identification values comprising: a virtual path table containing a plurality of entries each adapted to include a pointer value field and a position marker field; a logical channel identifier table containing a plurality of entries each adapted to contain a different logical identifier; means utilizing one of said virtual path identification values to retrieve one entry from said virtual path table; means utilizing said position marker field to retrieve said pointer value and to truncate said virtual channel identification value; means for concatenating said pointer value and the truncated virtual channel identification value to access said logical channel identifier table; and means for entering all binary zero entries into said virtual path table for all combinations of virtual path and virtual channel identification values not corresponding to any entry in said logical channel identifier table.
Claim 3
Dependent Claim
36 words
The logical channel resolution system according to claim 1 further comprising means for entering all binary zero entries into said logical channel identifier table for all invalid combinations of virtual path and virtual channel identification values.
Claim 4
Dependent Claim
51 words
The logical channel resolution system according to claim 1 further comprising means for attaching said virtual path and virtual channel identifiers to data cells, derived from a data stream, for transmission in an asynchronous transmission mode system, and means, utilizing one of said logical channel identifiers, for reassembling said data stream.
Claim 5
Dependent Claim
66 words
The logical channel resolution system according to claim 1 further comprising means for inserting an all binary zero value into said position marker field with a single binary one in the leftmost position of said position marker field, means for scanning for said single binary one to identify said pointer value, and means, responsive to said means for scanning, for truncating said virtual channel identification value.
Claim 6
Independent Claim
142 words
A method for logical channel resolution system of virtual path and virtual channel identification values comprising the steps of: storing a virtual path table containing a plurality of entries each adapted to include a pointer value field and a position marker field; storing a logical channel identifier table containing a plurality of entries each adapted to contain a different logical channel identifier; retrieving, utilizing said virtual path identification, one entry from said virtual path table; utilizing said position marker field, retrieving said pointer value and truncating said virtual channel identification value, concatenating said pointer value and the truncated virtual channel identification value to access said logical channel identifier table; and entering all binary zero entries into said virtual path table for all combinations of virtual path and virtual channel identification values not corresponding to any entry in said logical channel identification table.
Claim 7
Independent Claim
142 words
A method for logical channel resolution system of virtual path and virtual channel identification values comprising the steps of: storing a virtual path table containing a plurality of entries each adapted to include a pointer value field and a position marker field; storing a logical channel identifier table containing a plurality of entries each adapted to contain a different logical channel identifier; retrieving, utilizing said virtual path identification, one entry from said virtual path table; utilizing said position marker field, retrieving said pointer value and truncating said virtual channel identification value, concatenating said pointer value and the truncated virtual channel identification value to access said logical channel identifier table; and entering all binary zero entries into said virtual path table for all combinations of virtual path and virtual channel identification values not corresponding to any entry in said logical channel identification table.
Claim 8
Dependent Claim
34 words
The method according to claim 5 further comprising the step of entering all binary zeros entries into said logical channel identifier table for all invalid combinations of virtual path and virtual channel identification values.
Claim 9
Dependent Claim
48 words
The method according to claim 5 further comprising the steps of attaching said virtual path and virtual channel identifiers to data cells, derived from a data stream, for transmission in an asynchronous transmission mode system, and utilizing one of said logical channel identifiers for reassembling said data stream.
Claim 10
Dependent Claim
61 words
The method according to claim 5 further comprising the steps of inserting an all binary zero values into said position marker field with a single binary one in the leftmost position of said position marker field, scanning for said single binary one to identify said pointer value, and truncating, in response to said step of scanning, said virtual channel identification value.
Claim 11
Independent Claim
185 words
A system for converting a virtual asynchronous transmission mode data cell virtual address, including a virtual path identifier and a virtual channel identifier, into a logical channel identifier value comprising a virtual path table including a plurality of entries, each virtual path table entry comprising a variable length pointer field padded out to a fixed length with a field of binary zero bits having a single binary one bit at t eh leftmost bit position of said field of binary zeros, a logical channel identifier table for identifying particular streams of asynchronous transmission mode data cells, means, utilizing said virtual path identifier, for retrieving one entry from said virtual path table, means, utilizing said leftmost binary one bit, for extracting said variable length pointer, means, utilizing said leftmost binary one bit, for extracting from said virtual channel identifier, a lower order number of bits corresponding to the bit position of said binary one bit; and means for concatenating said variable length pointer and said lower order number of bits from said virtual channel identifier to form an index into said table of logical channel identifiers.
Claim 12
Independent Claim
185 words
A system for converting a virtual asynchronous transmission mode data cell virtual address, including a virtual path identifier and a virtual channel identifier, into a logical channel identifier value comprising a virtual path table including a plurality of entries, each virtual path table entry comprising a variable length pointer field padded out to a fixed length with a field of binary zero bits having a single binary one bit at t eh leftmost bit position of said field of binary zeros, a logical channel identifier table for identifying particular streams of asynchronous transmission mode data cells, means, utilizing said virtual path identifier, for retrieving one entry from said virtual path table, means, utilizing said leftmost binary one bit, for extracting said variable length pointer, means, utilizing said leftmost binary one bit, for extracting from said virtual channel identifier, a lower order number of bits corresponding to the bit position of said binary one bit; and means for concatenating said variable length pointer and said lower order number of bits from said virtual channel identifier to form an index into said table of logical channel identifiers.
Claim 13
Dependent Claim
23 words
The system according to claim 9 further comprising means for inserting all binary zeros into all unused entries of said virtual path table.
Claim 14
Dependent Claim
23 words
The system according to claim 9 further comprising means for inserting all zeros into all unused entries of said logical channel identifier table.
Claim 15
Dependent Claim
46 words
The system according to claim 9 further comprising means for storing the beginning location of said logical channel identifier table in a base register, and means for concatenating said beginning location with said pointer value and said lower order bits of said virtual channel identification value.
Claim 16
Independent Claim
179 words
A method for converting an asynchronous transmission mode data cell virtual address, including a virtual path identifier and a virtual channel identifier, into a logical channel identification value comprising the steps of storing a virtual path table including a plurality of entries, each virtual path table entry comprising a variable length pointer field padded out to a fixed length with a field of binary zero bits having a single binary one at the leftmost bit position of said field of binary zeros, storing a logical channel identifier table for identifying particular streams of asynchronous transmission mode data cells, utilizing said virtual path identifier, retrieving one entry from said virtual path table; utilizing said leftmost binary one bit, extracting said variable length pointer, utilizing said leftmost binary one bit, extracting from said virtual channel identifier, a lower order number of bits corresponding to the bit position of said binary one bit; and concatenating said variable length pointer and said lower order number of bits from said virtual channel identifier to form an index into said table of logical channel identifiers.
Claim 17
Independent Claim
179 words
A method for converting an asynchronous transmission mode data cell virtual address, including a virtual path identifier and a virtual channel identifier, into a logical channel identification value comprising the steps of storing a virtual path table including a plurality of entries, each virtual path table entry comprising a variable length pointer field padded out to a fixed length with a field of binary zero bits having a single binary one at the leftmost bit position of said field of binary zeros, storing a logical channel identifier table for identifying particular streams of asynchronous transmission mode data cells, utilizing said virtual path identifier, retrieving one entry from said virtual path table; utilizing said leftmost binary one bit, extracting said variable length pointer, utilizing said leftmost binary one bit, extracting from said virtual channel identifier, a lower order number of bits corresponding to the bit position of said binary one bit; and concatenating said variable length pointer and said lower order number of bits from said virtual channel identifier to form an index into said table of logical channel identifiers.
Claim 18
Dependent Claim
24 words
The method according to claim 13 further comprising the step of inserting all binary zeros into all unused entries of said virtual path table.
Claim 19
Dependent Claim
25 words
The method according to claim 13 further comprising the step of inserting all binary zeros into all unused entries of said logical channel identifier table.
Claim 20
Dependent Claim
45 words
The method according to claim 13 further comprising the steps of storing the beginning location of said logical channel identifier table in a base register, and concatenating said beginning location with said pointer value and said lower order bits of said virtual channel identification value.
References Cited (Backward Citations)
US5132966A
Cited
US5303233A
Cited
US5267232A
Cited
US5271010A
Cited
US5265091A
Cited
US5479401A
Cited
US5467349A
Cited
US5414701A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-02-16 | 2001-08-18 | 2002-02-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-02-16 | 2005-08-18 | 2006-02-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-02-16 | 2009-08-18 | 2010-02-17 | $7700.00 | Window Closed / Lapsed |