Packet format including unique network identity
First Claim
1. 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.
1 Assignment
0 Petitions
Accused Products
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.
28 Citations
25 Claims
-
1. 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. 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. - View Dependent Claims (23, 24, 25)
-
Specification