US5020054A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet format including unique network identity
Assignee: AT&T Inc
•
Filing: 1989-06-23
•
Granted: 1991-05-28
•
Expires: 2009-06-23
Abstract
Abstract A unique packet transport word, i.e., header, format is employed which eliminates the possiblity of particular packet transport words being mistaken for other transport words used in a private network, public network or otherwise. This is realized by employing a unique network reference code word to compute one or more prescribed parity checks over bits in predetermined bit positions of the transport word. The network reference code word is used to specify the sense, i.e., odd or even, of predetermined ones of the parity check bits being computed which form the one or more prescribed parity checks. Individual ones of such network reference code words are assignable to specific private transport users and, thereby, provide transparency of their transport words in the public or other networks. Additionally, unique network reference code words are assigned to each network layer in a system hierarchy to identify each of the specific network layers and to provide transparency of the lower network layer transport words in the higher network layers.
Inventors
- 👤 Carl J. May, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 22:23
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L49/00; H04L49/10; H04L49/102; H04L9/00; H04L9/40; H04L49/25; H04L49/253; H04L49/254; H04L49/30
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
153 words
Apparatus for generating a packet including at least a transport word, i.e., header, comprising: means for generating said transport word including a predetermined number of groups of bit positions each including a predetermined number of said bit positions, predetermined ones of said transport word bit positions forming an at least one prescribed parity check field; a source of a reference code word having a number of bits, said reference code word being independent from any information in the transport word; means for generating an at least first prescribed parity check from bits in a number of predetermined bit positions of said transport word and predetermined ones of said number of bits of said reference code word; and means for inserting a number of bits representative of said at least first prescribed parity check into a corresponding number of bit positions forming said at least first prescribed parity check field in said transport word.
Claim 2
Dependent Claim
153 words
Apparatus for generating a packet including at least a transport word, i.e., header, comprising: means for generating said transport word including a predetermined number of groups of bit positions each including a predetermined number of said bit positions, predetermined ones of said transport word bit positions forming an at least one prescribed parity check field; a source of a reference code word having a number of bits, said reference code word being independent from any information in the transport word; means for generating an at least first prescribed parity check from bits in a number of predetermined bit positions of said transport word and predetermined ones of said number of bits of said reference code word; and means for inserting a number of bits representative of said at least first prescribed parity check into a corresponding number of bit positions forming said at least first prescribed parity check field in said transport word.
Claim 3
Dependent Claim
95 words
The apparatus as defined in claim 1 wherein said means for generating said at least first prescribed parity check generates a predetermined number of parity check bits forming said at least first parity check by computing parity form said bits in a number of predetermined bit positions of said transport word and wherein each of predetermined ones of said number of reference code word bits defines the sense, i.e., odd or even, of parity being computed to generate a corresponding one of said predetermined number of parity check bits forming said first prescribed parity check.
Claim 4
Dependent Claim
85 words
The apparatus as defined in claim 2 wherein said means for generating said at least first prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least first prescribed parity check by computing parity to yield individual ones of said parity check bits from bits in predetermined bit positions in one or more of predetermined ones of said groups of bit positions in said transport word in conjunction with said predetermined ones of said reference code word bits.
Claim 5
Dependent Claim
73 words
The apparatus as defined in claim 2 wherein said means for generating said at least first prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least first prescribed parity check by computing parity from bits in predetermined similar bit positions in predetermined ones of said groups of bit positions in said transport word in conjunction with said predetermined ones of said reference code word bits.
Claim 6
Dependent Claim
84 words
The apparatus as defined in claim 2 wherein a predetermined number of said transport word bit positions form an at least second prescribed parity check field, and further including means for generating an at least second prescribed parity check from bits in predetermined bit positions of said transport word and means for inserting a number of bits representative of said at least second prescribed parity check in said number of bit positions of said at least second parity check field in said transport word.
Claim 7
Dependent Claim
104 words
The apparatus as defined in claim 5 wherein predetermined ones of said reference code word bits are supplied to said means for generating said at least second prescribed parity check, wherein said means for generating said at least second prescribed parity check generates a predetermined number of parity check bits forming said at least second prescribed parity check and wherein each of said supplied predetermined ones of said reference code word bits defines the sense, i.e., odd or even, of parity being computed to generate a corresponding one of said predetermined number of parity check bits forming said at least second prescribed parity check.
Claim 8
Dependent Claim
74 words
The apparatus as defined in claim 6 wherein said means for generating said at least second prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least second prescribed parity check by computing parity from bits in predetermined similar bit positions in predetermined ones of said groups of bit positions in said transport word in conjunction with said supplied predetermined ones of said reference code word bits.
Claim 9
Dependent Claim
82 words
The apparatus as defined in claim 7 wherein said means for generating said at least first prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least first prescribed parity check by computing individual ones of said parity check bits from bits in predetermined bit positions in one or more of predetermined ones of said groups of bit positions in said transport word in conjunction with said predetermined ones of said reference code word bits.
Claim 10
Dependent Claim
40 words
The apparatus as defined in claim 8 wherein predetermined ones of said predetermined similar bit positions in said predetermined ones of said groups of bit positions include said parity check bits which form said at least first prescribed parity check.
Claim 11
Dependent Claim
60 words
The apparatus as defined in claim 2 wherein each of said predetermined number of groups of bit positions forms a byte, wherein said means for generating said transport word generates each said byte in parallel and wherein said transport word bit positions form a predetermined number of columns of bit positions and a predetermined number of rows of bit positions.
Claim 12
Dependent Claim
76 words
The apparatus as defined in claim 10 wherein said means for generating said at least first prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least first prescribed parity check by computing parity from bits in predetermined bit positions of one or more of predetermined ones of said columns of bit positions in said transport word in conjunction with said predetermined ones of said reference code word bits.
Claim 13
Dependent Claim
84 words
The apparatus as defined in claim 11 wherein a predetermined number of said transport word bit positions form an at least second prescribed parity check field, and further including means for generating an at least second prescribed parity check from bits in predetermined bit positions of said transport word and means for inserting a number of bits representative of said at least second prescribed parity check in said number of bit positions of said at least second parity check field in said transport word.
Claim 14
Dependent Claim
104 words
The apparatus as defined in claim 12 wherein predetermined ones of said reference code word bits are supplied to said means for generating said at least second prescribed parity check, wherein said means for generating said at least second prescribed parity check generates a predetermined number of parity check bits forming said at least second prescribed parity check and wherein each of said supplied predetermined ones of said reference code word bits defines the sense, i.e., odd or even, of parity being computed to generate a corresponding one of said predetermined number of parity check bits forming said at least second prescribed parity check.
Claim 15
Dependent Claim
81 words
The apparatus as defined in claim 13 wherein said means for generating said at least second prescribed parity check includes means for generating said predetermined number of parity check bits forming said at least second prescribed parity check by computing parity from bits in predetermined ones of bit positions of each of a corresponding number of predetermined ones of said rows of bit positions in said transport word in conjunction with said supplied predetermined ones of said reference code word bits.
Claim 16
Dependent Claim
144 words
The apparatus as defined in claim 14 wherein said means for generating said transport word generates said transport word to include eight bytes and each byte includes eight bit positions, wherein said means for generating said at least first prescribed parity check generates individual parity check bits by computing parity from bits in the eight bit positions of at least six of said bytes, wherein said means for generating said at least second prescribed parity check generates individual parity check bits by computing parity from bits in each row of bit positions from seven of said bytes and wherein said number of reference code word bits is at least twelve, eight of which are associated on a one-to-one basis with said rows of bit positions and four of which are associated on a one-to-one basis with predetermined ones of said columns of bit positions.
Claim 17
Dependent Claim
20 words
The apparatus as defined in claim 1 wherein said reference code word is unique to a particular transport network configuration.
Claim 18
Dependent Claim
24 words
The apparatus as defined in claim 1 further including means for interfacing to a transmission facility supplying information to be formatted into said packet.
Claim 19
Dependent Claim
24 words
The apparatus as defined in claim 1 further including means for interfacing to a transmission facility to transmit said packet to a remote location.
Claim 20
Dependent Claim
22 words
The apparatus as defined in claim 1 further including means for interfacing to apparatus supplying information to be formatted into said packet.
Claim 21
Dependent Claim
17 words
The apparatus as defined in claim 19 further including means for interfacing to a packet network node.
Claim 22
Dependent Claim
17 words
The apparatus as defined in claim 20 further including means for interfacing to a packet cross-connect switch.
Claim 23
Dependent Claim
164 words
Apparatus for generating a packet including at least a transport word, i.e., header, comprising: means for generating said transport word including a predetermined number of groups of bit positions each including a predetermined number of bit positions, predetermined ones of said transport word bit positions forming a plurality of parity check fields; a source of a reference code word having a number of bits, said reference code word being independent from any information in the transport word; means for generating a plurality of prescribed parity checks from bits in predetermined bit positions of said transport word in conjunction with said number of bits of said reference code word, wherein each of said bits from said predetermined bit positions in said transport word is used to compute at least two different parity check bits which form said plurality of prescribed parity checks; and means for inserting said computed parity check bits into bit positions in said plurality of parity check fields in said transport word.
Claim 24
Dependent Claim
164 words
Apparatus for generating a packet including at least a transport word, i.e., header, comprising: means for generating said transport word including a predetermined number of groups of bit positions each including a predetermined number of bit positions, predetermined ones of said transport word bit positions forming a plurality of parity check fields; a source of a reference code word having a number of bits, said reference code word being independent from any information in the transport word; means for generating a plurality of prescribed parity checks from bits in predetermined bit positions of said transport word in conjunction with said number of bits of said reference code word, wherein each of said bits from said predetermined bit positions in said transport word is used to compute at least two different parity check bits which form said plurality of prescribed parity checks; and means for inserting said computed parity check bits into bit positions in said plurality of parity check fields in said transport word.
Claim 25
Dependent Claim
52 words
The apparatus as defined in claim 22 wherein said means for generating said plurality of prescribed parity checks includes means for using said number of reference code word bits to determine the sense, i.e., odd or even, of parity being computed to realize predetermined ones of said parity check bits being computed.
Claim 26
Dependent Claim
20 words
The apparatus as defined in claim 23 wherein said reference code word is unique to a particular transport network configuration.
Claim 27
Dependent Claim
24 words
The apparatus as defined in claim 24 further including means for interfacing to a transmission facility supplying information to be formatted into said packet.
References Cited (Backward Citations)
US4063220A
Cited
US4516239A
Cited
US4550397A
Cited
US4764920A
Cited
US4704606A
Cited
US4644533A
Cited
US4679189A
Cited
US4712214A
Cited
US4679190A
Cited
US4754451A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-05-27 | 1994-11-26 | 1995-05-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-05-27 | 1998-11-26 | 1999-05-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-05-27 | 2002-11-26 | 2003-05-28 | $7700.00 | Window Closed / Lapsed |