Source: http://www.google.com/patents/US20020141403?dq=oakley+5,387,949&ei=4yI4T8nkLYa80QG0xqnWAg
Timestamp: 2017-04-30 04:32:47
Document Index: 327281834

Matched Legal Cases: ['art 210', 'art 220', 'art 210', 'art 210', 'art 220', 'art 230', 'art 230', 'art 210', 'art 220', 'art 230', 'art 230', 'art 210', 'art 220', 'art 230', 'art 230', 'art 210', 'art 230', 'art 210', 'art 230']

Patent US20020141403 - Router - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA router comprising a priority level distinguishing means for distinguishing the priority level of a packet by referring to the information contained in the header of the packet, a routing table where an output path comprising one or more output lines can be mapped to each level of priority, an output...http://www.google.com/patents/US20020141403?utm_source=gb-gplus-sharePatent US20020141403 - RouterAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20020141403 A1Publication typeApplicationApplication numberUS 09/917,765Publication dateOct 3, 2002Filing dateJul 31, 2001Priority dateMar 30, 2001Also published asEP1246410A2, EP1246410A3, US6963578Publication number09917765, 917765, US 2002/0141403 A1, US 2002/141403 A1, US 20020141403 A1, US 20020141403A1, US 2002141403 A1, US 2002141403A1, US-A1-20020141403, US-A1-2002141403, US2002/0141403A1, US2002/141403A1, US20020141403 A1, US20020141403A1, US2002141403 A1, US2002141403A1InventorsShinichi Akahane, Takeshi AimotoOriginal AssigneeShinichi Akahane, Takeshi AimotoExport CitationBiBTeX, EndNote, RefManPatent Citations (5), Referenced by (99), Classifications (33), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetRouter
BRIEF DESCRIPTION OF THE DRAWINGS [0016] For the present invention to be clearly understood and readily practiced, the present invention will be described in conjunction with the following figures, wherein like reference characters designate the same or similar elements, which figures are incorporated into and constitute a part of the specification, wherein: [0017] [0017]FIG. 1 shows an exemplary configuration of a router of the present invention; [0018] [0018]FIG. 2 is an illustration representing an example of the format of a packet to pass across an IP network; [0019] [0019]FIG. 3 is an illustration representing an example of the packet format that is used inside a router of the present invention; [0020] [0020]FIG. 4 shows a network topology to which a router of the present invention is applied; [0021] [0021]FIG. 5 shows an exemplary configuration of a queuing unit; [0022] [0022]FIG. 6 shows an exemplary configuration of a routing processing unit; [0023] [0023]FIG. 7 details a flow table containing exemplary entries; [0024] [0024]FIG. 8 details a routing table containing exemplary entries; [0025] [0025]FIG. 9 details a packet distribution table containing exemplary entries; [0026] [0026]FIG. 10 shows an exemplary configuration of a packet distribution determining unit; [0027] [0027]FIG. 11 details a system for adjusting the distribution ratio of low-priority packets and protecting high-priority packets at the switchover between the output lines due to the fault of a line; and [0028] [0028]FIG. 12 is a flowchart illustrating a process for setting the distribution ratio.
DETAILED DESCRIPTION OF THE INVENTION [0029] It is to be understood that the figures and descriptions of the present invention have been simplified to illustrate elements that are relevant for a clear understanding of the present invention, while eliminating, for purposes of clarity, other elements that may be well known. Those of ordinary skill in the art will recognize that other elements are desirable and/or required in order to implement the present invention. However, because such elements are well known in the art, and because they do not facilitate a better understanding of the present invention, a discussion of such elements is not provided herein. The detailed description will be provided hereinbelow with reference to the attached drawings. [0030] Before explaining the preferred embodiments of the router of the present invention, an example of the format of an IP packet coming into the router and an example of the internal packet format that is used inside the router are explained with reference to FIG. 2 and FIG. 3. [0031] [0031]FIG. 2 outlines the IP packet format. An IP packet consists of a header part 210 and a data part 220. The header part 210 is comprised of a source IP address 211 (“SIP”) that is the IP address of a source or sending terminal, a destination IP address 212 (“DIP”) that is the IP address of a destination or receiving terminal, a source port 213 (“SPORT”) that represents a protocol (upper application) used on the source, and a destination port 214 (“DPORT” ) that represents a protocol used on the destination. In addition to the above information, information such as a service identifier (type of service: TOS) may also be stored in the header part 210. The data part 220 contains user data 221. [0032] [0032]FIG. 3 exemplifies the internal packet format. The internal packet consists of the IP packet shown in FIG. 2 and an internal header part 230 added to the packet. In this exemplary format, the internal header part 230 is comprised of packet length 231 that indicates the length of the packet in bytes, an input line number 232 that is the identifier of an input line through which the router received the packet, an output line number 233 that is the identifier of an output line over which the router will send out the packet, and QoS information 234 that indicates the priority of the packet. [0033] A preferred embodiment of the router of the present invention will now be described below with reference to FIG. 1. A router 100 preferably comprises packet receiving units 120-i (where i=1 to N) that receive packets carried in through one of input lines 110-i (where i=1 to N), and a packet forwarding unit 130 The router 100 may also include a routing processing unit 600 that determines an output line upon which to send out a packet, a switch 140 that performs packet switching, queuing units 500-j (where j=1 to N) that queue packets to an output line, packet transmitting units 150-j that transmit packets over one of the output lines 160-j, and a controller 170 that executes overall router control and routing. The controller 170 also preferably sets a value in the tables in the routing processing unit 600 and monitors packet passage/discard counters in the queuing units 500-j. [0034] When one of the packet receiving circuits 120-i receives an IP packet through the input line 110-i terminated thereto, it adds the internal header 230 to the received IP packet. The packet receiving unit 120-i counts the length in bytes of the received IP packet and stores the count value (in units of bytes) into the packet length field 231 of the internal header 230. The packet receiving unit 120-i stores the line number (i) of the input line 110-i through which the packet was received in the input line field 232 of the internal header 230 and delivers the packet to the packet forwarding unit 130. At this time, the output line number 233 field contains a dummy value (the output line has not been determined yet). [0035] When the packet forwarding unit 130 receives the packet including the header part 210, the data part 220, and the internal header part 230, the forwarding unit 130 extracts the header information 210 and the internal header information 230, and delivers this information to the routing processing unit 600. Using this header information 210 and internal header information 230, the routing processing unit 600 executes flow detection and routing table look-up and determines packet distribution. Then, the routing processing unit 600 determines the priority of the packet and an output line over which to send out the packet. The routing processing unit 600 then preferably notifies the packet forwarding unit 130 of the output line (for example, 160-j) and the QoS information indicating the priority of the packet. The configuration and operation of the routing processing unit 600 will be described in greater detail below. [0036] The packet forwarding unit 130 stores the line number (j) of the output line 160-j in the output line number field 233 and stores the QoS information in the QoS information field 234 of the internal header 230. The unit 130 then delivers the packet to the switch 140. [0037] In accordance with the output line number 233, the switch 140 switches the packet to the appropriate path and delivers the packet to the corresponding queuing unit 500-j as per the intended output line. The queuing unit 500-j executes transmission control suitable for the priority of the packet according to the QoS information 234 and delivers the packet to the corresponding packet transmitting unit 150-j. Upon receiving the packet, the packet transmitting unit 150-j removes the internal header part 230 from the packet and delivers the packet to the corresponding output line 160-j. [0038] The operation of a queuing unit 500-j will now be explained. FIG. 5 shows an exemplary configuration of the queuing unit 500. The queuing unit 500 is comprised of a buffer 501 for packet buffering, FIFO packet queues 510-k (where k=1 to M) provided for a plurality of priority levels, and a queuing processing circuit 502 that controls the placement of packets into the FIFO packet queues 510-k and packet discard. [0039] The queuing unit 500 preferably also includes a packet delivery controller 504 that controls the transmission of the packets placed in the FIFO packet queues 510-k in accordance with an agreement (e.g., a contract) made for each priority level of packets. The unit 500 may also include FIFO counters 520-k that count the number of packets placed in the FIFO packet queues 510-k and passage/discard counters 530-k that count the number and byte size of queued packets and the number and byte size of discarded packets for the packets queued and discarded under the control of the queuing processing circuit 502. [0040] When the queuing processing unit 502 receives a packet from the switch 140, the header part 210, the data part 220 and the internal header part 230 of the packet are all preferably stored into the buffer 501, and the internal header 230 is additionally stored in the queuing processing circuit 502. The queuing processing circuit 502 selects a FIFO packet queue (for example, 510-k) into which the packet is to be queued according to the QoS information 234 of the internal header part 230. Then, the queuing processing circuit 502 reads the value of the FIFO counter 520-k corresponding to the selected FIFO packet queue 510-k and determines to “place the packet into the queue” if the following inequality is true: [0041] “the maximum number of packets to be placed in the FIFO packet queue 510-k”>“the value of the FIFO counter 520-k.”
[0045] In this case, the queuing processing circuit 502 does not request the buffer 501 to deliver the packet. The buffer 501 overwrites the information for the packet determined to be “discarded” with the information of the next packet to arrive. The queuing processing circuit 502 also does not increment the FIFO counter 520-k. Instead, the queuing processing circuit 502 increments by “1” the number of discarded packets and adds the byte count contained in the packet length 231 field of the internal header 230 to the number of the bytes of the discarded packets in the appropriate passage/discard counter 530-k. [0046] In accordance with the agreement made for each priority level of packets, the packet delivery controller 504 preferably reads a packet from one of the FIFO packet queues 510-k provided for the priority levels and delivers it to the associated packet transmitting unit 150. For example, the packet delivery controller reads a packet from a high-priority packet queue and delivers it to the packet transmitting unit so that its transmission within the agreement bandwidth will be ensured. When sending out a low-priority packet, the packet delivery controller 504 preferably reads a packet from a low-priority packet queue at such timing so as not to interrupt the transmission of a high-priority packet. When a packet is read from a FIFO packet queue 510-k, the value of the FIFO counter 520-k corresponding to the FIFO packet queue 510-k is decremented by “1” and stored into the counter 520-k again. [0047] The controller 170 may periodically monitor the passage/discard counters 530-k provided for each of the queues 510-k and may calculate the bandwidth for passage packets and the bandwidth for discard packets for each queue. For example, the bandwidth may be calculated by monitoring the byte size over a given period of time and dividing the byte size by the time to get the bandwidth. [0048] [0048]FIG. 4 shows an exemplary network topology formed by using two units of the router 100 shown in FIG. 1. An IP network 400 comprises routers 401 and 402 that have the same configuration as the router 100 shown in FIG. 1. In the present network topology, only two routers are shown for simplifying the explanation, but any number of routers may exist in a system. [0049] The router 401 is connected to terminal A 411, terminal B 412, terminal C 413, and terminal D 414. The router 402 is connected to terminal E 415, terminal F 416, terminal G 417, and terminal H 418. The router 401 and the router 402 are interconnected with two lines 421 and 422. The line 421 and the line 422 are capable of backing up each other in a redundant configuration. In the event that one line becomes inoperative in a fault state, both the router 401 and the router 402 send all packets over the other line, including those intended to be transmitted over the inoperative (fault) line. During normal operation, the routers preferably distribute packets between these two lines for effective use of bandwidth. [0050] For purposes of example, it is assumed that the users E and F of the terminal E 415 and the terminal F 416 made an agreement with the carrier to use the IP network 400 for packet transfer in accordance with a priority predetermined per application. The agreement preferably includes the following general guidelines. For example, real-time processing communication packets are given high priority, and it is ensured that they are preferentially transferred (i.e., transferred before lower priority packets) by using a fixed bandwidth. On the other hand, web data and E-mail data packets are handled as low-priority packets and are transmitted in a low-priority transfer manner. It may also be assumed that the users G and H of the terminal G 417 and the terminal H 418 have agreed with the carrier to use the IP network 400 with agreement terms in which all packets are transferred as low-priority packets. [0051] Packets transmitted from any of terminal A 411, terminal B 412, terminal C 413, and terminal D 414 are carried through the routers 401 and 402 and arrive at any of terminal E 415, terminal F 416, terminal G 417, and terminal H 418. The router 401 is set to forward high-priority packets whose destination is the terminal E 415 over the line 421 and high-priority packets whose destination is the terminal F 416 over the line 422. The router 401 is also set to forward all packets (low-priority packets) whose destination is the terminal G 417 or the terminal H 418 by distributing them between the line 421 and the line 422. The ratio setting of this distribution between both lines are preferably changed periodically so that unoccupied bandwidth of the lines 421 and 422 can be used more efficiently. The setting of this distribution ratio will be described below. [0052] By referring to FIGS. 6 through 10, the operation of the routing processing unit 600 will now be described. FIG. 6 shows an exemplary configuration of the routing processing unit 600. The routing processing unit 600 is preferably comprised of a header information storing unit 601, a flow table 700, a flow detection processing unit 602 that looks up a flow in the flow table 700, a routing table 800, a routing table look-up processing unit 603 that looks up routing information in the routing table 800, a packet distribution table 900, and a packet distribution determining unit 1000 that determines an output line number 1006 by searching the packet distribution table 900. The header information storing unit 601 stores the header part 210 and the internal header part 230 of a packet received from the packet forwarding unit 130. [0053] [0053]FIG. 7 exemplifies the structure of a flow table 700. The flow table 700 contains the flow condition entries 701 for identifying the attribute of a packet transferred from a user to another user, a packet attribute being assigned a priority level that is predetermined in accordance with the agreement between the carrier and an individual user, and the QoS information entries 702 indicating the priority associated with the flow condition 701 entries. Herein, the conditions for identifying the attribute of a packet, comprising possible combinations of the information items specified in the header, are called flow conditions. [0054] A series of packets that meet any flow conditions is called a flow. A process consisting of identifying a flow to which an input packet belongs by determining what conditions are fulfilled by the information in the header of the packet and identifying a priority level predetermined for the flow is called flow detection. A non-entry marking “-” in the flow condition 701 fields in FIG. 7 denotes that these fields may contain any value. Although the “other header information” fields contain the “-” marking and therefore no setting for one of the flow conditions, all of the flow conditions may be set, including “other header information.” [0055] [0055]FIG. 8 exemplifies the structure of a routing table 800. The routing table 800 preferably contains the output path identifier entries 802 that correspond to the DIP entries and the entries of the above-mentioned QoS information 702. Herein, the output path identifier 802 is used as the identifier indicating a group comprising a plurality of output line candidates. [0056] [0056]FIG. 9 exemplifies the structure of a packet distribution table 900. The packet distribution table 900 preferably contains the above-mentioned output path identifier entries 802, their associated entries of a plurality of output line number candidates 901, and the distribution threshold entries 902 that correspond to the output line number candidates 901. The distribution threshold will be described below. Although, in the example of FIG. 9, two output line candidates are specified for the entries 911 to 913, the number of the output line candidates may also be greater or less than two and may be variable for each entry. [0057] [0057]FIG. 10 shows an exemplary configuration of a packet distribution determining unit 1000. Packet distribution procedures that may be implemented by the packet distribution determining unit 1000 are described in, for example, the request for comment RFC2991 from IETF. A Hash-Threshold procedure, one of the packet distribution procedures described in the above request for comment documentation, is applied. [0058] This Hash-Threshold procedure calculates a hash value from, for example, the SIP and DIP of a received packet and distributes the packet based on this hash value. The use of this procedure preferably ensures that packets having the same SIP and DIP are routed on the same path. Therefore, the packets in the same flow will preferably arrive at the receiving terminal in the sequence in which they have been sent out. If another distribution procedure is used that does not ensure that the packets arrive in sequence, the packets received at the receiving terminal may need to be rearranged into the proper sequence or a TCP retransmission may occur thereby decreasing the packet transmission bandwidth. [0059] The packet distribution determining unit 1000 is preferably comprised of an output line number candidate storing means 1001, a distribution thresholds storing means 1002, a hash value generating circuit 1003, and an output line determining circuit 1004. The output line number candidates storing means 1001 stores a plurality of output line number candidates 901 which are obtained as the result of searching the packet distribution table 900. The distribution thresholds storing means 1002 stores distribution thresholds 902 which are also obtained as the result of searching the packet distribution table 900. The hash value generating circuit 1003 generates a hash value 1005 from, for example, the SIP 211 and DIP 213 in the header part 210 which is stored in the header information storing unit 601. Hash values thus generated are, for example, 8-bit values (0 to 255). [0060] The space equivalent to the bandwidth of a virtual transmission channel consisting of a plurality of output lines is evenly partitioned in units of these hash values. The distribution thresholds 902 are used to divide this space and allocate each space division to each output line candidate. This allocation is explained using the entry 913 in FIG. 9 as an example. One space division with hash values 0 to 63 is allocated to line 1 that is output line candidate 1, and the remaining space division with hash values 64 to 255 is allocated to line 2 that is output line candidate 2. In this example, the above space is allocated between line 1 and line 2 at a ratio of 1:3 in size. [0061] Out of the plurality of space divisions, each allocated to one of the output line candidates according to the distribution thresholds 902, the output line determining circuit 1004 determines which is the space division having a predetermined hash value range within which the generated hash value 1005 falls. Then, this circuit 1004 outputs an output line number 1006 to which the determined space division is allocated as the result of the output line determination. [0062] If there are a great number of combinations of source terminals and destination terminals (that is, SIP and DIP combinations) of packets to be handled by the router 100, it can be expected that hash values generated from the SIPs and DIPs are evenly distributed throughout the space partitioned in units of hash values. Thus, the packet distribution ratio can be expected to approximate the ratio of size between the space divisions divided, according to the distribution thresholds 902. For example, packets to be routed as in the entry 913 can be distributed between line 1 and line 2 at a ratio of approximately 1:3. [0063] While the configuration of the packet distribution determining unit 1000 for implementing the Hash-Threshold procedure was explained above with reference to FIG. 10, other configurations are also possible. For example, this unit 1000 can be made to operate as follows. The unit 1000 may first read only the distribution thresholds 902 from the packet distribution table 900 and then determine an output line candidate based on the distribution thresholds 902 and the hash value 1005. Finally, the unit 1000 may read only the output line number of the determined candidate line from the packet distribution table 900. In this case, the output line number candidate storing means 1001 shown in FIG. 10 need not have as many units of storage as the number of candidates. For example, the storage means 1001 may have one unit of storage space (for storing the determined output line number). Thus, the number of units of storage may be reduced. [0064] While the configuration of the packet distribution determining unit 1000 for implementing the Hash-Threshold procedure was explained above with reference to FIG. 9 and FIG. 10, it may be possible to implement another distribution procedure. Furthermore, it may be possible to install the hardware configurations for implementing a plurality of packet distribution procedures together and carry out a different packet distribution procedure that is suitable for making routing decisions based on priority, DIP, or priority and DIP in combination. [0065] The operation of the routing processing unit 600 will now be described (see FIG. 6). Initially, the flow detection processing unit 602 searches the flow table 700 for a match with the search key of information required for flow detection retrieved from the information stored in the header information storing unit 601. QoS information 702 indicating a priority level matching with the search key, obtained as the result of search, is preferably delivered to the packet forwarding unit 130 and the routing table look-up processing unit 603. [0066] Thereafter, the routing table look-up processing unit 603 searches the routing table 800 for a match with the search key consisting of the QoS information 702 and the DIP 212 retrieved from the information stored in the header information storing unit 601. An output path identifier 802 matching the search key obtained as the result of the search is preferably delivered to the packet distribution determining unit 1000. Then, the packet distribution determining unit 1000 searches the packet distribution table 900 for a match with the search key that is the output path identifier 802. [0067] A plurality of output line candidates 901 obtained as the result of search are stored in the output line number candidates storing means 1001, and the distribution thresholds 902 predetermined for the output line number candidates are stored by the distribution threshold storing means 1002 (see FIG. 10). At the same time, the hash value generating circuit 1003 generates a hash value 1005 from the combination of appropriate information items in the header 210, stored in the header information storing unit 601, and delivers it to the output line determining circuit 1004. Based on the hash value 1005 and the distribution thresholds 902, the output line determining circuit 1004 determines an output line number 1006 and delivers it to the packet forwarding unit 130. [0068] As described above, the router 100 executes flow detection, determines the level of priority of the received packets, searches the routing table for a match with the search key consisting of the priority level (QoS information) and DIP, and executes packet distribution. Thus, even for multiple packets whose destination is the same terminal, the router can perform the distribution of individual packets according to the priority. [0069] While the routing table 800 and the packet distribution table 900 are separate in the configuration shown in FIG. 6, it is possible to integrate these tables into one combined table. That is, it is possible to expand the routing table 800 to include the settings of the output line number candidates 901 and the distribution thresholds 902 which are the look-up results of the packet distribution table 900, instead of the output path identifiers which are the look-up results of the routing table 800. [0070] In FIG. 6, the sequential processing of flow detection, routing table search, and packet distribution determination may all be executed using pipelines for high-speed processing. [0071] With reference to FIG. 11, a method of adjusting the distribution ratio of low-priority packets and of protecting high-priority packets at the switchover between the output lines due to a fault in a line will now be explained. [0072] [0072]FIG. 11 schematically displays the process by which the router 100 preferably handles packets. Specifically, it shows how the router determines the level of priority and path identifier of the packets by flow detection and a search of the routing table, and it shows how the packets are placed in the queues separately provided for different output lines. Some components of the router 100 that do not relate to the following explanation are omitted from this schematic drawing. [0073] For simplification, the FIFO counters corresponding to the queues 1101-1 to 1101-3 and 1102-1 to 1102-3 are also omitted from this schematic drawing, and the controller 160 appears to read the values of the passage/discard counters directly from the queues. Furthermore, the controller 170 appears to be notified of the line states (indicating whether a line fault occurs) of output line 1 and output line 2 directly from the lines in this drawing. [0074] In FIG. 11, high-priority packets to terminal E 1141, high-priority packets to terminal F 1142, and low-priority packets to terminals E, F, G, and H are routed in accordance with the assumed agreements as explained with respect to FIG. 4. As the result of flow detection and routing table search, it is determined that the QoS information is “1” and the path identifier is “1” for routing the high-priority packets to terminal E 1141. Similarly, it is determined that the QoS information is “2” and the path identifier is “2” for routing the high-priority packets to terminal F 1142. Similarly, it is determined that the QoS information is “3” and the path identifier is “3” for routing the low-priority packets to terminal E, F, G, and H 1143. Such determinations depend on the settings in the flow table exemplified in FIG. 7 and the settings in the routing table exemplified in FIG. 8. The QoS information is specified for each of the queues for each output line. [0075] The packet distribution table 900 preferably contains the settings as exemplified in FIG. 9. Output line 1 is assigned to the output path identifier “1.” Output line 2 is assigned to the output path identifier “2.” Two output lines 1 and 2 are assigned to the output path identifier “3.” [0076] The router 100 preferably includes the queues for output line 1: queue 1101-1 for storing high-priority packets to terminal E 1141; queue 1101-2 for storing high-priority packets to terminal F 1142; and queue 1101-3 for storing low-priority packets to terminals E, F, G, and H 1143. The same priority is given to the queue 1101-1 and the queue 1101-2. Among these queues, the queue 1101-2 is to store high-priority packets to terminal F 1142 in the event that a fault in the output line 2 occurs, but no packets are queued in this queue 1102-2 during normal operation. [0077] In addition, the router 100 preferably includes the queues for output line 2: queue 1102-1 for storing high-priority packets to terminal E 1141; queue 1102-2 for storing high-priority packets to terminal F 1142; and queue 1102-3 for storing low-priority packets to terminals E, F, G, and H 1143. The same priority is given to the queue 1102-1 and the queue 1102-2. Among these queues, the queue 1102-1 is to store high-priority packets to terminal E 1141 in the event that a fault in the output line 1 occurs, but no packets are queued in this queue 1102-1 during normal operation. [0078] The packet delivery controller 504-1 for output line 1 holds the agreement bandwidth settings for the packets in the queue 1101-1 and the packets in the queue 1101-2 to assure that the packets from each queue are transmitted within each agreement bandwidth. Thus, the packet delivery controller 504-1 delivers the packets to the output line 1 in accordance with the agreement bandwidth for transmitting the packets. If it is assumed that the agreement bandwidth setting for the packets in the queue 1101-1 is BW1, that for the packets in the queue 1101-2 is BW2, and the bandwidth allocated for the output line 1 is CW1; the following constraint shall be fulfilled: CW1≧BW1+BW2 (Inequality Constraint 1) [0079] Similarly, the packet delivery controller 504-2 for output line 2 holds inside agreement bandwidth settings BW1 and BW2, respectively for the packets in the queue 1102-1 and the packets in the queue 1102-2. If the bandwidth allocated for the output line 2 is assumed CW2, the following constraint shall be fulfilled: CW2≧BW1+BW2 [0080] The handling of the packets in the router during normal operation will now be explained. High-priority packets to terminal E 1141 are queued into the queue 1101-1 for output line 1, which is provided to store packets assigned “1” as QoS information in accordance with the settings in the flow table 700, the routing table 800, and the packet distribution table 900. The path is denoted by a solid line 111 in FIG. 11. High-priority packets to terminal F 1142 are queued into the queue 1102-2 for output line 2, which is provided to store packets assigned “2” as QoS information, which is similarly denoted by a solid line 1122. [0081] For low-priority packets to terminals E, F, G, and H 1143, there are two candidates of output lines 1 and 2 over which the packets may be forwarded. Thus, these packets are distributed to the output line 1 and the output line 2 as determined by the packet distribution determining unit 1000. These paths are denoted by solid lines 1131 and 1132 in FIG. 11. Because these packets are assigned “3” as QoS information, they are queued in queues 1101-3 and 1102-3 provided for storing them. The solid lines 1111 to 1132 are drawn to simply indicate the different queues to store the different destination packets. [0082] The packet delivery controller 504-1 sends out the packets in queue 1101-1 preferentially over the output line 1 in accordance with the agreement bandwidth setting BW1 for user E. At the same time, the packet delivery controller 504-1 attempts to send out the packets in queue 1101-2 preferentially over the output line 1 in accordance with the agreement bandwidth setting BW2 for user F. However, because no packets are queued in the queue 1101-2 during normal operation, the packet delivery controller will normally execute no delivery control of the queue 1101-2. [0083] Additionally, the packet delivery controller 504-1 sends out the packets in queue 1101-3 over the output line 1 to an extent beyond which sending these packets may affect the assured transmission of high-priority packets using the agreement bandwidth. The packet delivery controller 504-2 operates in the same way as above, and it will normally execute no delivery control of the queue 1102-1. [0084] The setting of the ratio of distributing low-priority packets 1143 between the output lines will now be explained. High-priority packets 1141 are sent out over the output line 1 in accordance with the agreement bandwidth setting BW1, and high-priority packets 1142 are sent out over the output line 2 in accordance with the agreement bandwidth setting BW2. For simplification, it is assumed that the bandwidth settings BW1 and BW2 according to which the high-priority packets 1141 and 1142 are sent out, are fixed. [0085] In this case, redundant bandwidth RW1 of output line 1 is obtained by RW1=CW1−BW1, and redundant bandwidth RW2 of output line 2 is obtained by RW2=CW2−BW2. If the average bandwidth used for incoming low-priority packets 1143 for a period is assumed to be BW3, an expected value DW3 min for the total sum DW3 of the cuts of the bandwidth, equal to the quantity of discarded low-priority packets 1143 is obtained as follows: DW3 min=max [BW3−(RW1+RW2), 0] (Equation 2) [0086] If the distribution ratio is not good, the difference between DW3 and DW3 min becomes large. This difference is expressed as DDW3=DW3−DW3 min. Thus, the distribution ratio should be adjusted so that the value of DDW3 will be minimized to maximize the use of the bandwidth. [0087] For simplification, consider a case where the change of the average bandwidth used for the incoming packets is sufficiently slow as compared with the time of the intervals at which the values of the passage/discard counters of the queues are monitored. In this case, BW3 can be regarded as being approximately constant. Thus, DW3 min can also be regarded as being constant. [0088] The outline flow of the process of setting the distribution ratio on the conditions described above is illustrated in FIG. 12. The initial distribution ratio should be set at RW1:RW2. Set the distribution thresholds in the packet distribution table to attain this distribution ratio (step 1201). After the thresholds are set, the values of the passage/discard counters of the queues are monitored (step 1202). Average bandwidth BW3 used for incoming low-priority packets 1141 and an expected value DW3 min for the total sum of bandwidth cuts equal to the quantity of discarded packets are calculated (step 1203). [0089] The value of DDW3 is calculated from DW3 (step 1204). Then, a comparison is made between DDW3 and an evaluation threshold Th which is assumed to be set in advance (step 1205). If DDW3 is less than Th, the process of setting the distribution ratio terminates (go to step 1206). If DDW3 is greater than Th, the distribution ratio is preferably recalculated based on the bandwidth cuts equal to the quantity of discarded packets for the queues 1101-3 and 1102-3. The distribution thresholds to attain the calculated ratio are set in the packet distribution table (step 1207). The values of the passage/discard counters of the queues are monitored (step 1208), and a return is made to the step 204. The controller 170 preferably executes the above flow of setting the distribution ratio whereby low-priority packets 1143 can properly be distributed between the redundant bandwidths of the output lines. [0090] High-priority packets 1141 and 1142 are sent out over a single output line; they are not distributed. Consider a presumptive case where high-priority packets 1141 and 1142 are distributed to the output line 1 and the output line 2, and the distribution ratio is altered as described above for low-priority packets in order to make effective use of the redundant bandwidths of the lines. In this case, the path of packets for which a hash value near the distribution thresholds is generated changes. Consequently, there is a possibility of the loss of the assurance that packets are received at the receiving terminal in the sequence in which they have been sent out and a possibility of the transmission bandwidth being restricted by TCP flow retransmission control activated. Thus, it is desirable that packet distribution is set to be disabled for high-priority packets for which strict requirements such as minimizing delay are specified. [0091] In the above-described example, the case was discussed where the bandwidth to be used for sending out high-priority packets 1141 is fixed to BW1 and that for sending out high-priority packets 1142 is fixed to BW2. Even if the bandwidths for sending out the high-priority packets are not fixed (for example, in a case where complete priority control is executed for high-priority packets), however, the procedure of setting the distribution ratio illustrated in FIG. 12 may be applied as well. In this case, the redundant bandwidths R1 and R2 may vary dynamically. The bandwidths for sending out high-priority packets can be measured by monitoring the values of the passage counters of the queues where the high-priority packets are queued. [0092] The handling of packets in the event that a fault occurs in the output line 2 will now be explained. When the controller 170 receives a notification that a fault occurs in output line 2, it preferably performs switchover from the line 2 to the other line 1 to send out all packets over the other output line 1 including those originally intended to be sent out over the output line 2. Although several methods of switchover between the lines are conceivable, a line switching procedure by changing the line settings in the switch 140 is applied herein. [0093] The switch 140 preferably includes a table of mapping between the output line numbers 233, one of which is specified in the internal header part 230 of a packet, and the output lines over which packets are actually sent out. The controller 170 may be capable of changing the contents of this mapping table. Assume that, during normal operation, output line 1 and output line 2 are set mapped in the table to output line numbers 1 and 2, respectively,. When a fault in the output line 2 occurs and the controller 170 receives the notification thereof, the controller 170 checks the settings in the mapping table and changes the output line mapped to output line number 2 from the output line 2 to the output line 1. Due to this change, packets sent out over the output line 2 prior to the occurrence of the fault of the line will now be sent out over the output line 1. [0094] After the line switchover processing is performed, high-priority packets to terminal F 1142 are queued in the queue 1101-2 for output line 1 as indicated by a broken line 1121 in FIG. 11. Low-priority packets to terminals E, F, G, and H are all queued in the queue 1101-3 for output line 1 as indicated by the solid line 1131. At this time, because the queue 1101-2 has been provided beforehand for high-priority packets to terminal F 1142, other high-priority packets such as those to terminal E 1141 in the present case are not affected by the line switchover. [0095] The agreement bandwidth BW for user F has been set beforehand in the packet delivery controller 504-1, and the relationship between the bandwidth of the output line 1 and BW1 plus BW2 subject to the foregoing Inequality Constraint (1) is true. Thus, sending out both high-priority packets to terminal E 1141 and high-priority packets to terminal F 1142 is controlled with the assurance that they are transmitted within their agreement bandwidths. [0096] In preparation for switching over from one line to the other, another queue for high-priority packets is provided for the other line, and the agreement bandwidth for the packets is also set in the delivery controller for the other line as explained above. In this way, a system that ensures that high-priority packets are transmitted within the agreement bandwidth after a line switchover due to the line fault can be implemented. [0097] In the above explanation, two strings of high-priority packets 1141 and 1142 are set to be queued respectively in the priority packet queues 1101-1 and 1102-2 that are for different lines. However, the packet distribution table may be set so that these packets will be queued in the priority packet queues for the same line, for example, the queues 1101-1 and 1101-2 for output line 1. In this case, the queues 1102-1 and 1102-2 for output line 2 are to store two strings of high-priority packets 1141 and 1142 in the event that a fault occurs in output line 1. [0098] By using the router of the present invention, individual packets can be distributed to at least two output lines. This distribution may or may not apply, depending on the priority level of packets. Therefore, it is feasible to distribute only low-priority packets and disable the distribution of high-priority packets. By adjusting the ratio of distributing low-priority packets between the lines, according to the use conditions of the bandwidths of the lines, effective use of the line bandwidths can be realized. Because packet distribution is not applied for high-priority packets, quality deterioration, e.g., out of sequence of the packets received, caused by path change due to the adjustment of the packet distribution ratio is substantially avoidable. [0099] Furthermore, the router of the present invention preferably determines the priority level of packets on flow detection and queues packets it received into one of the multiple queues, some of which are for high-priority packets, for each line, in accordance with the priority level. Even if a fault in one line occurs, followed by switchover to the other output line to send all packets over the other line, high-priority packets are queued into the priority packet queue for the other output line after the switchover. Thus, it can be assured that high-priority packets are always preferentially sent out over one of the output lines. [0100] The foregoing invention has been described in terms of preferred embodiments. However, those skilled, in the art will recognize that many variations of such embodiments exist. Such variations are intended to be within the scope of the present invention and the appended claims. [0101] Nothing in the above description is meant to limit the present invention to any specific materials, geometry, or orientation of elements. Many part/orientation substitutions are contemplated within the scope of the present invention and will be apparent to those skilled in the art. The embodiments described herein were presented by way of example only and should not be used to limit the scope of the invention. [0102] Although the invention has been described in terms of particular embodiments in an application, one of ordinary skill in the art, in light of the teachings herein, can generate additional embodiments and modifications without departing from the spirit of, or exceeding the scope of, the claimed invention. Accordingly, it is understood that the drawings and the descriptions herein are proffered by way of example only to facilitate comprehension of the invention and should not be construed to limit the scope thereof. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS6205150 *May 28, 1998Mar 20, 20013Com CorporationMethod of scheduling higher and lower priority data packetsUS6304578 *May 1, 1998Oct 16, 2001Lucent Technologies Inc.Packet routing and queuing at the headend of shared data channelUS6798743 *Mar 22, 1999Sep 28, 2004Cisco Technology, Inc.Packet prioritization processing technique for routing traffic in a packet-switched computer networkUS20020003795 *Aug 4, 1998Jan 10, 2002Rasoul Mirzazadeh OskouyIn-line packet processingUS20020093910 *Mar 20, 2001Jul 18, 2002Takeki YazakiPacket shaper* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7486672 *Dec 17, 2004Feb 3, 2009Samsung Electronics Co., Ltd.Apparatus and method for searching trie trees using masks with non-symbol boundaries and flooding default routes in a massively parallel routerUS7567571 *Dec 17, 2004Jul 28, 2009Samsung Electronics Co., Ltd.Apparatus and method using vector table indirection to maintain forwarding tables in a routerUS7620054Feb 2, 2005Nov 17, 2009Fujitsu Microelectronics LimitedNetwork switching device and network switching methodUS7626990 *Dec 21, 2004Dec 1, 2009Samsung Electronics Co., Ltd.Packet counters and packet adders for traffic profiling in a multiprocessor routerUS7813367Jan 8, 2007Oct 12, 2010Foundry Networks, Inc.Pipeline method and system for switching packetsUS7817659Mar 26, 2004Oct 19, 2010Foundry Networks, LlcMethod and apparatus for aggregating input data streamsUS7830884Sep 12, 2007Nov 9, 2010Foundry Networks, LlcFlexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capabilityUS7848321Aug 30, 2005Dec 7, 2010Hitachi, Ltd.Method for high speed search tables switching and packet forwarding apparatusUS7903654Dec 22, 2006Mar 8, 2011Foundry Networks, LlcSystem and method for ECMP load sharingUS7948872Mar 9, 2009May 24, 2011Foundry Networks, LlcBackplane interface adapter with error control and redundant fabricUS7953922Dec 16, 2009May 31, 2011Foundry Networks, LlcDouble density content addressable memory (CAM) lookup schemeUS7953923Dec 16, 2009May 31, 2011Foundry Networks, LlcDouble density content addressable memory (CAM) lookup schemeUS7974196 *Mar 21, 2006Jul 5, 2011Cisco Technology, Inc.Method and system of using counters to monitor a system port bufferUS7978614Dec 10, 2007Jul 12, 2011Foundry Network, LLCTechniques for detecting non-receipt of fault detection protocol packetsUS7978702Feb 17, 2009Jul 12, 2011Foundry Networks, LlcBackplane interface adapterUS7995580Mar 9, 2009Aug 9, 2011Foundry Networks, Inc.Backplane interface adapter with error control and redundant fabricUS8036689 *Mar 23, 2010Oct 11, 2011Apple Inc.Method and apparatus for distributing messages to mobile recipientsUS8037399Jul 18, 2007Oct 11, 2011Foundry Networks, LlcTechniques for segmented CRC design in high speed networksUS8040889 *Aug 4, 2008Oct 18, 2011Alaxala Networks CorporationPacket forwarding deviceUS8090901May 14, 2009Jan 3, 2012Brocade Communications Systems, Inc.TCAM management approach that minimize movementsUS8135398 *May 6, 2011Mar 13, 2012Sellerbid, Inc.Method and apparatus for multimedia communications with different user terminalsUS8149839 *Aug 26, 2008Apr 3, 2012Foundry Networks, LlcSelection of trunk ports and paths using rotationUS8155011Dec 10, 2007Apr 10, 2012Foundry Networks, LlcTechniques for using dual memory structures for processing failure detection protocol packetsUS8170044Jun 7, 2010May 1, 2012Foundry Networks, LlcPipeline method and system for switching packetsUS8194666Jan 29, 2007Jun 5, 2012Foundry Networks, LlcFlexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capabilityUS8238255Jul 31, 2007Aug 7, 2012Foundry Networks, LlcRecovering from failures without impact on data traffic in a shared bus architectureUS8259714 *Feb 26, 2007Sep 4, 2012Alaxala Networks CorporationPacket transferring nodeUS8271859Jul 18, 2007Sep 18, 2012Foundry Networks LlcSegmented CRC design in high speed networksUS8280416May 30, 2008Oct 2, 2012Apple Inc.Method and system for distributing data to mobile devicesUS8385924 *Oct 12, 2010Feb 26, 2013Atc TechnologiesSystems and methods for facilitating communications over a shared channelUS8395996Dec 10, 2007Mar 12, 2013Foundry Networks, LlcTechniques for processing incoming failure detection protocol packetsUS8448162Dec 27, 2006May 21, 2013Foundry Networks, LlcHitless software upgradesUS8464315Mar 18, 2008Jun 11, 2013Apple Inc.Network invitation arrangement and methodUS8477786May 29, 2012Jul 2, 2013Apple Inc.Messaging system and serviceUS8493988Sep 13, 2010Jul 23, 2013Foundry Networks, LlcMethod and apparatus for aggregating input data streamsUS8509236Aug 26, 2008Aug 13, 2013Foundry Networks, LlcTechniques for selecting paths and/or trunk ports for forwarding traffic flowsUS8514716Jun 4, 2012Aug 20, 2013Foundry Networks, LlcBackplane interface adapter with error control and redundant fabricUS8531960May 2, 2011Sep 10, 2013Cisco Technology, Inc.Method and system of using counters to monitor a system port bufferUS8595478 *Nov 19, 2007Nov 26, 2013AlterWAN Inc.Wide area network with high quality of serviceUS8599850Jan 7, 2010Dec 3, 2013Brocade Communications Systems, Inc.Provisioning single or multistage networks using ethernet service instances (ESIs)US8619781Apr 8, 2011Dec 31, 2013Foundry Networks, LlcBackplane interface adapter with error control and redundant fabricUS8671000Apr 17, 2008Mar 11, 2014Apple Inc.Method and arrangement for providing content to multimedia devicesUS8671219May 7, 2007Mar 11, 2014Foundry Networks, LlcMethod and apparatus for efficiently processing data packets in a computer networkUS8700613Jan 25, 2008Apr 15, 2014Apple Inc.Ad sponsors for mobile devices based on download sizeUS8718051Oct 29, 2009May 6, 2014Foundry Networks, LlcSystem and method for high speed packet transmissionUS8730794 *Nov 30, 2005May 20, 2014Gos Holdings LimitedPriority service protectionUS8730961Apr 26, 2004May 20, 2014Foundry Networks, LlcSystem and method for optimizing router lookupUS8745048Dec 8, 2010Jun 3, 2014Apple Inc.Systems and methods for promotional media item selection and promotional program unit generationUS8805358Feb 10, 2012Aug 12, 2014Virginia Innovation Sciences, Inc.Method and apparatus for multimedia communications with different user terminalsUS8811390Oct 29, 2009Aug 19, 2014Foundry Networks, LlcSystem and method for high speed packet transmissionUS8953591Aug 9, 2012Feb 10, 2015Alaxala Networks CorporationPacket transferring nodeUS8964754Nov 8, 2013Feb 24, 2015Foundry Networks, LlcBackplane interface adapter with error control and redundant fabricUS8989202Feb 16, 2012Mar 24, 2015Foundry Networks, LlcPipeline method and system for switching packetsUS9030937Jul 11, 2013May 12, 2015Foundry Networks, LlcBackplane interface adapter with error control and redundant fabricUS9030943Jul 12, 2012May 12, 2015Foundry Networks, LlcRecovering from failures without impact on data traffic in a shared bus architectureUS9112780Feb 13, 2013Aug 18, 2015Foundry Networks, LlcTechniques for processing incoming failure detection protocol packetsUS9118580 *Jun 22, 2011Aug 25, 2015Fujitsu LimitedCommunication device and method for controlling transmission priority related to shared backup communication channelUS9158575 *Jun 9, 2010Oct 13, 2015Graeme Roy SmithMultithreaded processor array with heterogeneous function blocks communicating tokens via self-routing switch fabricsUS9166818Nov 18, 2013Oct 20, 2015Brocade Communications Systems, Inc.Provisioning single or multistage networks using ethernet service instances (ESIs)US9172460 *Apr 11, 2014Oct 27, 2015Fujitsu LimitedTransmission equipment and path selection methodUS9197568 *Oct 22, 2013Nov 24, 2015Electronics And Telecommunications Research InstituteMethod for providing quality of service in software-defined networking based network and apparatus using the sameUS9320050 *Jun 28, 2013Apr 19, 2016Apple Inc.Systems and methods to enhance radio link performance in a multi-carrier environmentUS9331945 *Nov 12, 2013May 3, 2016Huawei Technologies Co., Ltd.Method and network device for transmitting data streamUS9338100Jun 24, 2013May 10, 2016Foundry Networks, LlcMethod and apparatus for aggregating input data streamsUS9367847May 28, 2010Jun 14, 2016Apple Inc.Presenting content packages based on audience retargetingUS9378005Apr 12, 2013Jun 28, 2016Foundry Networks, LlcHitless software upgradesUS9379983 *Jan 16, 2014Jun 28, 2016Panasonic Intellectual Property Management Co., Ltd.Router, method for controlling router, and computer programUS9461940Jul 9, 2014Oct 4, 2016Foundry Networks, LlcSystem and method for high speed packet transmissionUS9544241Oct 22, 2013Jan 10, 2017Sanechips Technology Co., Ltd.Queue scheduling method, apparatus and systemUS9578648 *Apr 15, 2016Feb 21, 2017Apple Inc.Systems and methods to enhance radio link performance in a multi-carrier environmentUS20040001441 *Sep 26, 2002Jan 1, 2004Kt CorporationApparatus and method for controlling traffic congestion using queueUS20050129044 *Feb 2, 2005Jun 16, 2005Fujitsu LimitedNetwork switching device and network switching methodUS20050232264 *Dec 17, 2004Oct 20, 2005Samsung Electronics Co., Ltd.Apparatus and method for searching trie trees using masks with non-symbol boundaries and flooding default routes in a massively parallel routerUS20050249206 *Dec 21, 2004Nov 10, 2005Samsung Electronics Co., Ltd.Packet counters and packet adders for traffic profiling in a multiprocessor routerUS20050254480 *May 9, 2005Nov 17, 2005Kicheon KimRouter using clock synchronizer for distributed traffic controlUS20050265307 *Dec 17, 2004Dec 1, 2005Samsung Electronics Co., Ltd.Apparatus and method using vector table indirection to maintain forwarding tables in a routerUS20060067330 *Mar 31, 2003Mar 30, 2006Siemens AktiengesellschaftMethod and arrangement for routing data packets in a packet-switched data networkUS20060072574 *Aug 30, 2005Apr 6, 2006Shinichi AkahaneMethod for high speed search tables switching and packet forwarding apparatusUS20060193318 *Oct 24, 2005Aug 31, 2006Sriram NarasimhanMethod and apparatus for processing inbound and outbound quanta of dataUS20070223385 *Mar 21, 2006Sep 27, 2007Mark BerlyMethod and system of using counters to monitor a system port bufferUS20080008181 *Feb 26, 2007Jan 10, 2008Alaxala Networks CorporationPacket transferring nodeUS20080080371 *Sep 28, 2006Apr 3, 2008Chunmei LiuMacro-spatial network multiplexingUS20080170499 *Nov 30, 2005Jul 17, 2008U4Ea Technologies LtdPriority Service ProtectionUS20080219254 *Nov 19, 2007Sep 11, 2008Alterwan, Inc.Wide area network using internet with high quality of serviceUS20090109985 *Aug 4, 2008Apr 30, 2009Alaxala Networks CorporationPacket forwarding deviceUS20100182945 *Mar 23, 2010Jul 22, 2010Cvon Innovations LimitedMethod and apparatus for distributing messages to mobile recipientsUS20110026404 *Oct 12, 2010Feb 3, 2011Mobile Satellite Ventures, LpSystems and methods for facilitating communications over a shared channelUS20110211113 *May 6, 2011Sep 1, 2011Sellerbid, Inc.Method and apparatus for multimedia communications with different user terminalsUS20110317551 *Jun 22, 2011Dec 29, 2011Fujitsu LimitedCommunication device and methodUS20120089812 *Jun 9, 2010Apr 12, 2012Graeme Roy SmithShared resource multi-thread processor arrayUS20140071828 *Nov 12, 2013Mar 13, 2014Huawei Technologies Co., Ltd.Method and network device for transmitting data streamUS20140112150 *Oct 22, 2013Apr 24, 2014Electronics And Telecommunications Research InstituteMethod for providing quality of service in software-defined networking based network and apparatus using the sameUS20140133307 *Jan 16, 2014May 15, 2014Panasonic CorporationRouter, method for controlling router, and computer programUS20140314401 *Apr 11, 2014Oct 23, 2014Fujitsu LimitedTransmission equipment and path selection methodUS20150003336 *Jun 28, 2013Jan 1, 2015Apple Inc.Systems and Methods to Enhance Radio Link Performance in a Multi-Carrier EnvironmentUS20150188829 *Dec 26, 2013Jul 2, 2015Sudhir SatpathyPriority-based routingCN103460654A *Nov 13, 2012Dec 18, 2013松下电器产业株式会社Relay device, method for controlling relay device, and computer programEP2782301A4 *Nov 13, 2012Feb 10, 2016Panasonic Ip Man Co LtdRelay device, method for controlling relay device, and computer programWO2007109637A3 *Mar 20, 2007Jul 10, 2008Mark BerlyA method and system of using counters to monitor a system port buffer* Cited by examinerClassifications U.S. Classification370/389, 370/463International ClassificationH04L12/743, H04L12/877, H04L12/911, H04L12/865, H04L12/707, H04L12/773, H04L12/725, H04L12/801, H04L12/711Cooperative ClassificationH04L47/2441, H04L47/10, H04L45/28, H04L47/125, H04L45/60, H04L45/22, H04L45/302, H04L45/54, H04L47/34, H04L45/00, H04L47/32European ClassificationH04L47/10, H04L45/302, H04L47/32, H04L47/34, H04L45/54, H04L45/22, H04L47/24D, H04L47/12B, H04L45/00, H04L45/60, H04L45/28Legal EventsDateCodeEventDescriptionNov 7, 2001ASAssignmentOwner name: HITACHI, LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AKAHANE, SHINICHI;AIMOTO, TAKESHI;REEL/FRAME:012298/0585;SIGNING DATES FROM 20010717 TO 20010731Apr 22, 2009FPAYFee paymentYear of fee payment: 4May 1, 2013FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services