IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0969124
(2001-09-24)
|
발명자
/ 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
52 인용 특허 :
14 |
초록
Mode-locked fiber lasers with an active feedback control of the frequency chirp and a mechanism for adjusting the dispersion of the output pulses.
대표청구항
▼
Mode-locked fiber lasers with an active feedback control of the frequency chirp and a mechanism for adjusting the dispersion of the output pulses. de, said method including the steps of: i. parsing said second binary number into substrings, wherein each of said substrings has a number of binary d
Mode-locked fiber lasers with an active feedback control of the frequency chirp and a mechanism for adjusting the dispersion of the output pulses. de, said method including the steps of: i. parsing said second binary number into substrings, wherein each of said substrings has a number of binary digits equal to the dimension of each of said nodes except for the last substring whose number of binary digits is less than the dimension of each of said nodes; ii. using said substrings to map a path from said root node to said terminal node associated with said first binary number; and iii. storing said first binary number from said terminal node. 4. A method for use in deleting a first binary number associated with a second binary number in a trie data structure stored on a computer readable storage medium, said trie data structure consisting of nodes, said nodes including a root node, said root node being a first node, at least one intermediate level node, said intermediate level node being directly linked to said root node and having other lower level nodes directly linked to said intermediate level node, and at least one leaf node, said leaf node being directly linked to a higher level node and having no lower level nodes directly linked to said leaf node, each of said nodes being an associative table of binary numbers consisting of rows and columns with each number of said rows of each of said nodes being the same number, wherein, when the length of said second binary number is not an integral multiple of said number of rows, said first binary number is stored at a position defined by the intersection of a row and a column in a terminal node, said method including the steps of: i. parsing said second binary number into substrings, wherein each of said substrings has a number of binary digits equal to the dimension of each of said nodes except for the last substring whose number of binary digits is less than the dimension of each of said nodes; ii. using said substrings to map a path from said root node to said terminal node associated with said first binary number; and iii. deleting said first binary number from said terminal node. 5. In a trie data structure stored on a computer readable storage medium that is used for transmitting a presented data packet, said trie data structure including a root node, one or more intermediate level nodes, and one or more leaf nodes, wherein each node is composed of a number of words, each of said words having fields composed of a plurality of bits that is processed by the circuitry of a router and causes said router to transmit said presented data packet in accordance with an output port address associated with said word, a field composed of a plurality of bits that is examined by said circuitry and indicates to said circuitry if a valid output port address is contained in said word, a field composed of a plurality of bits that is capable of containing an output port address, a field composed of a plurality of bits that is capable of containing the address in said computer readable storage medium of another node of said trie data structure, a field composed of a plurality of bits that is capable of containing information indicating either the number of words in said node that contain useful information, wherein the improvement includes: iv. a first field composed of a plurality of binary digits that is capable of containing information indicating either the number of words in said node that contain useful information or additional routing information associated with a subprefix; v. a second field composed of a plurality of binary digits is capable of indicating that an output port address is associated with a full prefix; and vi. a third field composed of a plurality of binary digits that is capable of containing information indicating the location of valid output port addresses in said first field. 6. A method for use in retrieving the output port address of a presented data packet containing a destination address in which a trie data structure stored on a computer readable storage medium is used, said trie data st ructure including a root node, one or more intermediate level nodes, and one or more leaf nodes, wherein each node is composed of a number of words, each of said words having fields composed of a plurality of bits that is processed by the circuitry of a router and causes said router to transmit said presented data packet in accordance with an output port address associated with said word, a first field composed of a plurality of bits that is examined by said circuitry and indicates to said circuitry if a valid output port address is contained in said word, a second field composed of a plurality of bits that is capable of containing an output port address, a third field composed of a plurality of bits that is capable of containing the address in said computer readable storage medium of another node of said trie data structure, a fourth field composed of a plurality of bits that indicates whether said node is a terminal node, a fifth field composed of a plurality of binary digits that is capable of containing information indicating either the number of words in said node that contain useful information or additional routing information associated with a subprefix; a sixth field composed of a plurality of binary digits is capable of indicating that an output port address is associated with a full prefix; and a seventh field composed of a plurality of binary digits that is capable of containing information indicating the location of valid output port addresses in said first field, said method including the steps of: i. parsing said destination address into a plurality of substrings, each containing a predetermined number of binary digits and each of said substrings having an equal number of binary digits; ii. examining a word in said root node associated with the substring contained in said destination address that is composed of the most significant digits of said destination address; iii. transmitting said data packet in accordance with the output port address contained in said output port address field of said word read in the preceding step if said first field of said word has a predetermined value and said second field of said word has a predetermined value, otherwise storing the output port address contained in said word and reading from said fifth field of said word the address of a nonroot node of said trie data structure; iv. examining a word in said node indicated in the preceding step associated with the substring contained in said destination address that is composed of the next most significant digits of said destination address; v. transmitting said data packet in accordance with the output port address contained in said output port address field of said word read in the preceding step if first field has a predetermined value and said second field of said word has a predetermined value, otherwise storing the output port address contained in said word and reading the address from said fifth field of said word of another node of said trie data structure; vi. iteratively repeating steps iii through v until an output port address is returned or the retrieval terminates. 7. A method for use in inserting information associated with a subprefix regarding the output port address of a data packet containing a destination address, in which a trie data structure stored on a computer readable storage medium is used, said trie data structure including a root node, one or more intermediate level nodes, and one or more leaf nodes, wherein each node is composed of a number of words, each of said words having fields composed of a plurality of bits that is processed by the circuitry of a router and causes said router to transmit said presented data packet in accordance with an output port address associated with said word, a first field composed of a plurality of bits that is examined by said circuitry and indicates to said circuitry if a valid output port address is contained in said word, a second field composed of a plura
※ AI-Helper는 부적절한 답변을 할 수 있습니다.