1. A casting belt for producing a transcendental wide width film where a polymer solvent is cast to form a gel-state film in manufacturing an optical film by means of a solvent casting process, wherein the casting belt includes transverse welded portions formed in the transverse direction of the casting belt to connect adjacent casting belt sections such that the adjacent casting belt sections are longitudinally connected without welded portions longitudinally formed, and a thickness tw of the transverse welded portions is 0.95 tb\u2266tw\u22661.05 tb when a thickness of the casting belt sections is tb, and a size of pin holes formed in the transverse welded portions is 20\u02dc50 \u03bcm and a depth of pin holes is within 50 \u03bcm.
2. The casting belt for producing a transcendental wide width film according to claim 1, wherein a width Ww extending in a direction transverse to a welding direction of the transverse welded portions is within 2 mm.
3. The casting belt for producing a transcendental wide width film according to claim 2, wherein the transverse welded portions make an angle of 20\xb0 with the transverse cross-section of the casting belt.
4. The casting belt for producing a transcendental wide width film according to claim 3, wherein a width extending in a direction transverse to a longitudinal direction of the casting belt is 2000 mm or more.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A system for adaptively parsing received frames that include data units having multiple field values formatted according to at least one of a set of network protocols used in a communication network, the system comprising:
a memory storing information suited to resolve the at least one of the set of network protocols;
a preprocessor configured to interact with the memory to provide a type classification for a first frame and generate a layer code based upon said type classification wherein said layer code delineates selected field values in said first frame corresponding to a protocol format of a resolved one of the set of network protocols;
a dual-port memory coupled to said preprocessor and operative to concurrently receive said first frame and said layer code;
an instruction memory operatively coupled to said dual-port memory, said instruction memory storing layer offsets associated with said selected field values delineated by said layer code and at least one instruction that is selected based upon the type classification of said first frame;
a parsing engine communicatively coupled to said instruction memory and said dual-port memory in a feed-forward data flow connection and a feed-back dataflow connection, the feed-forward dataflow connection operative to provide said parsing engine with the at least one instruction and with said layer offsets for accessing the selected field values in said first frame, said parsing engine being adapted to parse said first frame according to said at least one instruction and generate an output indicative of a classification of said first frame, said feed-back dataflow connection affecting communication between said parsing engine and at least one of said instruction memory and said dual-port memory by forwarding at least a portion of said output to said instruction memory for use in refining of said at least one instruction targeted for execution on and to said dual-port memory for re-inputting to said parsing engine through said feed-forward dataflow connection.
2. The system of claim 1 wherein said feed-back dataflow connection includes an extractor coupled to said parsing engine for receiving said output and constructing search words, said search words suitable for application against a contents-addressable memory (CAM) for obtaining search results embodying information about the first frame.
3. The system of claim 1 wherein said parsing engine is coupled to one or more of a mask unit, a compare unit, a register file and a arithmetic logic unit (ALU), wherein said mask unit is configured to mask a first portion of said first frame to provide masked frame data, said compare unit is adapted to compare the at least one selected field value in said masked frame data to a predetermined value to generate at least a partial identity of the protocol format of the resolved one of the set of network protocols, said ALU is adapted to process one or more of the at least one selected field, said partial identity of said protocol format to provide updated output indicative of the classification of said first frame.
4. The system of claim 1 wherein said parsing engine is provided with a data pipe and a instruction pipe disposed in said feed-forward dataflow connection in data communication with said dual-port memory and said instruction memory respectively that maintain said first frame and said at least one instruction substantially aligned with each other.
5. The system of claim 4 wherein said data units correspond to two or more frames and arrive in an interleaved sequence with said data pipe and said instruction pipe is operative to align said data units from the first frame with said at least one instruction that is selected responsive to the type classification of said first frame.
6. The system of claim 1 wherein said at least one instruction that is selected based upon the type classification of said first frame includes a first sequence of instructions having at least one branch instruction that enables said instruction memory to select a second sequence of instructions targeted for execution by said parsing engine, said second sequence of instructions being based on at least a partial parsing of the first frame using one or more of said first sequence of instructions.
7. The system of claim 1 wherein said at least one instruction comprises instructions drawn from the group consisting of EXTRACT, MASK, NOT, AND, OR, XOR, and Range.
8. A method for classifying a frame composed of data-fields formatted according to protocol layers used in a communication network, the method comprising:
storing predetermined data in a first memory wherein said predetermined data enables at least a partial resolution of said protocol layers;
operating a preprocessor in interactive communication with the first memory to correlate at least a portion of the predetermined data with one or more data-fields to obtain class information for the frame, said class information including indicia pointing to boundaries between said protocol layers;
concurrently transferring said data-fields and said class information to be stored in a second memory; selectively loading an instruction memory with a sequence of program instructions for subsequent processing of said frame responsive to said data-fields and said class information;
parsing said frame by operating on said data-fields, pointed to by said indicia, using said sequence of program instructions to output a first set of search words indicative of an identification of said data-fields at a first resolution;
iteratively refining said sequence of program instructions responsive to said first set of search words and causing said refined sequence of program instructions to operate on one or more of said data-fields and said first set of search words to generate a second set of search words indicative of the identification of said data-fields at a second resolution greater than said first resolution; and
outputting said data-fields and said second set of search words when said second resolution meets predefined criteria.
9. The method of claim 8 further including aligning said data-fields with the sequence of program instructions before said program instructions operate on said data-fields.
10. The method of claim 9 wherein said data-fields include two or more sets of data-fields corresponding to two or more arriving frames with each set of data-fields embodying differing protocol layers, said step of aligning said data-fields with the sequence of program instructions including aligning said a first set of data-fields with an associated first sequence of program instructions and a second set of data-fields with an associated second sequence of program instructions.
11. The method of claim 10 wherein said step of parsing said frame includes interleaving operation of both said first sequence of program instructions on said first data-fields and said second sequence of program instructions on said second data-fields during a single time span.
12. The method of claim 8 wherein said frame ingresses at a first bit-rate and egresses at a second bit-rate that is substantially equal to said first bit-rate.
13. The method of claim 8 wherein said predefined criteria corresponds to identification of all protocol layers for said frame.
14. The method of claim 8 wherein said step of outputting said first set of search results further includes: using an extractor with an output of said parsing engine to build search keys; and applying said search keys against a contents-addressable memory (CAM) to generate said first set of search results that contain a frame classification.
15. The method of claim 8 wherein parsing said frame includes the steps of: receiving predetermined data corresponding to at least one protocol layer; extracting said frame into a plurality of bit fragments of varying length using at least one data mask; comparing said predetermined data with at least one bit fragment to generate at least one comparison result; storing said at least one comparison result in a first register; concatenating said comparison results from said register to obtain a search key; and indexing a memory using said search key to generate a classification of said frame.
16. The method of claim 15 further comprising the steps of: providing a content-addressable memory (CAM); storing a plurality of instructions for handling said frame in said CAM; receiving said search key at said CAM and outputting a set of instructions from said stored plurality of instructions responsive to said search key; and reparsing said frame using said outputted set of instructions.
17. A processor configured to process contents of packets passing through a connection point on a computer network, the processor comprising:
(a) a buffer for receiving at least some of the contents of each packet passing through the connection point;
(b) a memory containing one or more instructions of an instruction set for the state processor;
(c) an arithmetic logic unit (ALU) coupled to the buffer;
(d) a control block coupled to the ALU and to the instruction memory for decoding instructions; and
(e) a program counter coupled to the instruction memory and to the ALU for indicating the next state processor instruction in the memory to process, wherein the ALU includes a searching apparatus comprising one or more comparators for searching for a reference string in the contents of a packet.