摘要:
Ordering logic ensures that data items being processed by a number of parallel processing units are unloaded from the processing units in the original per-flow order that the data items were loaded into the parallel processing units. The ordering logic includes a pointer memory, a tail vector, and a head vector. Through these three elements, the ordering logic keeps track of a number of “virtual queues” corresponding to the data flows. A round robin arbiter unloads data items from the processing units only when a data item is at the head of its virtual queue.
摘要:
A key engine that performs route lookups for a plurality of keys may include a data processing portion configured to process one data item at a time and to request data when needed. A buffer may be configured to store a partial result from the data processing portion. A controller may be configured to load the partial result from the data processing portion into the buffer. The controller also may be configured to input another data item into the data processing portion for processing while requested data is obtained for a prior data item. A number of these key engines may be used by a routing unit to perform a large number of route lookups at the same time.
摘要:
Ordering logic ensures that data items being processed by a number of parallel processing units are unloaded from the processing units in the original per-flow order that the data items were loaded into the parallel processing units. The ordering logic includes a pointer memory, a tail vector, and a head vector. Through these three elements, the ordering logic keeps track of a number of “virtual queues” corresponding to the data flows. A round robin arbiter unloads data items from the processing units only when a data item is at the head of its virtual queue.
摘要:
A key engine that performs route lookups for a plurality of keys may include a data processing portion configured to process one data item at a time and to request data when needed. A buffer may be configured to store a partial result from the data processing portion. A controller may be configured to load the partial result from the data processing portion into the buffer. The controller also may be configured to input another data item into the data processing portion for processing while requested data is obtained for a prior data item. A number of these key engines may be used by a routing unit to perform a large number of route lookups at the same time.
摘要:
A key engine that performs route lookups for a plurality of keys may include a data processing portion configured to process one data item at a time and to request data when needed. A buffer may be configured to store a partial result from the data processing portion. A controller may be configured to load the partial result from the data processing portion into the buffer. The controller also may be configured to input another data item into the data processing portion for processing while requested data is obtained for a prior data item. A number of these key engines may be used by a routing unit to perform a large number of route lookups at the same time.
摘要:
A bit coding method modifies the bit-steam information in such a way as to provide a very high compression during lossless symbol coding and may be used as a preprocessor for Huffman and arithmetic encodings or on its own. A bit rearrangement scheme (BRS) improves the run length within a data symbol set and achieves a more efficient data-to-symbol mapping. The BRS is implemented on the data symbol set in a column-by-column fashion. The BRS can be combined with any available lossless coding scheme, providing for a more efficient lossless bit coding scheme (ALBCS).
摘要:
In many instances it is necessary to store and transfer information and data on a temporary basis. Typically this information and data is transient but is vulnerable to capture and piracy as it is not in an encrypted state. Therefore a unique method is disclosed that performs randomized scrambling of unprotected digital information that make it unreadable, or otherwise unusable, without the appropriate descrambling. In order to be effective and secure the method requires a large population of scrambling patterns, or codes, and assigns them index numbers. Scrambling patterns are randomly chosen for use in the scrambling of the information and data. Unique schemes for developing this large population of patterns and choosing at random the usable set at each interval or usage. In particular the method is useful in the protection of digital content.
摘要:
A smokeless tobacco product is provided. A water-permeable pouch containing a tobacco formulation and configured for insertion into the mouth of a user of that product is provided. The tobacco formulation includes granular tobacco and a buffer comprised of sodium carbonate and sodium bicarbonate. An outer packaging material enveloping the pouch is provided and is sealed so as to allow a controlled environment to be maintained within.
摘要:
A network device includes an interface and packet processing logic. The interface receives a multicast packet. The packet processing logic determines identifier data corresponding to the received multicast packet and replicates the identifier data to multiple outgoing packet forward engines at a first point in a processing path. The packet processing logic further replicates the identifier data to multiple data streams at a second point in the processing path and replicates the identifier data to multiple logical interfaces in the same stream at a third point in the processing path.