公开(公告)号：US07652998B2

公开(公告)日：2010-01-26

申请号：US10731156

申请日：2003-12-10

申请人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

发明人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC分类号： H04L1/00

CPC分类号： H04L45/48 ,  H04L12/1877 ,  H04L41/12 ,  H04L45/02 ,  H04L45/121 ,  H04L45/124 ,  H04L45/16

摘要： A multicast communication path calculation method is disclosed which includes the steps of: obtaining minimum delay paths from a source node to each destination node; selecting, as candidate nodes of a rendezvous point node, nodes on one of the obtained minimum delay paths; for each candidate node, calculating minimum delay paths from the candidate node to each destination node, and obtaining a difference between the maximum value and the minimum value among delays of the calculated minimum delay paths; selecting, as the rendezvous point node, a candidate node by which the difference is smallest; and outputting a minimum delay path from the source node to the rendezvous point node and minimum delay paths from the rendezvous point node to each destination node.

摘要翻译： 公开了一种组播通信路径计算方法，其包括以下步骤：获得从源节点到每个目的地节点的最小延迟路径; 作为会合点节点的候选节点选择所获得的最小延迟路径之一上的节点; 计算从所述候选节点到每个目的地节点的最小延迟路径，并且获得所计算的最小延迟路径的延迟中的最大值和最小值之间的差值; 选择作为会合点节点的差异最小的候选节点; 并输出从源节点到会合点节点的最小延迟路径和从会合点节点到每个目的地节点的最小延迟路径。

公开(公告)号：US20090028149A1

公开(公告)日：2009-01-29

申请号：US12237912

申请日：2008-09-25

申请人： Seisho YASUKAWA ,  Koji Sugisono ,  Masanori Uga

发明人： Seisho YASUKAWA ,  Koji Sugisono ,  Masanori Uga

IPC分类号： H04L12/56

CPC分类号： H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

摘要： A method of establishing a multicast transfer route is disclosed that can reduce the cost of entire route under a constraint on delay incurred between starting point and ending points. The method includes the steps of: computing the shortest route with respect to delay connecting the starting point and the plural ending points based on measurement result; computing delay from a node on the shortest route to each ending point and the greatest delay; removing, if the greatest delay satisfies a delay condition, the greatest-cost route from the shortest route in accordance with selection criteria effective for cost reduction; dividing the multicast transfer route into two route trees; and establishing separately computed route as a complementary route that complement the removed route for connecting the two route trees. A method of multicast label switching for realizing the above method is also disclosed. A multicast label switching route is established using hierarchical labels by establishing a common multicast label switching route using a first layer label and establishing plural partial multicast label switching routes for subgroup destinations using lower layer labels. A relay node recognizes the hierarchical labels thereby to label-switch using all hierarchical labels.

摘要翻译： 公开了一种建立多播传输路由的方法，可以在起始点和终点之间的延迟约束下降低整个路由的成本。 该方法包括以下步骤：基于测量结果计算相对于连接起始点和多个终点的延迟的最短路径; 计算从最短路径上的节点到每个终点的延迟和最大延迟; 如果最大延迟满足延迟条件，则根据有效降低成本的选择标准，从最短路由中删除最大成本路由; 将组播传输路由划分为两条路由树; 并建立单独计算的路由作为补充路由，用于补充用于连接两条路由树的已删除路由。 还公开了一种实现上述方法的组播标签交换方法。 使用分层标签建立组播标签交换路由，使用第一层标签建立公共组播标签交换路由，并使用下层标签为子组目的建立多个部分组播标签交换路由。 中继节点识别分层标签，从而使用所有分层标签进行标签交换。

公开(公告)号：US4757550A

公开(公告)日：1988-07-12

申请号：US732219

申请日：1985-05-09

申请人： Masanori Uga

发明人： Masanori Uga

IPC分类号： H01L21/301 ,  B23Q15/22 ,  G01B11/00 ,  G06K9/46 ,  G06T7/00 ,  G06K9/58

CPC分类号： G06K9/4609 ,  B23Q15/22 ,  G06T7/0044 ,  G06T2207/20016 ,  G06T2207/30148

摘要： An automatic accurate alignment system for positioning an object to be worked which has a certain pattern on its surface at a required position. The system performs primary positioning of the object to be worked on the basis of low magnification pattern matching with respect to at least a part of the image of the object magnified at a relatively low magnification. Thereafter, the system performs secondary positioning of the object to be worked on the basis of high magnification pattern matching with respect to at least a part of the image of the object magnified at a relatively high magnification.

摘要翻译： 一种用于定位待加工物体的自动精确对准系统，其在其表面上在所需位置具有一定的图案。 基于相对于以较低放大率放大的物体的至少一部分图像的低放大倍率模式匹配，系统对待加工对象进行主要定位。 此后，系统基于相对于以较高放大倍率放大的物体的图像的至少一部分的高倍率模式匹配，对被加工物进行二次定位。

公开(公告)号：US20080013465A1

公开(公告)日：2008-01-17

申请号：US11776919

申请日：2007-07-12

申请人： Seisho YASUKAWA ,  Koji SUGISONO ,  Masanori UGA

发明人： Seisho YASUKAWA ,  Koji SUGISONO ,  Masanori UGA

IPC分类号： H04L12/28

CPC分类号： H04L45/48 ,  H04L12/1877 ,  H04L41/12 ,  H04L45/02 ,  H04L45/121 ,  H04L45/124 ,  H04L45/16

摘要： A multicast communication path calculation method is disclosed which includes the steps of: obtaining minimum delay paths from a source node to each destination node; selecting, as candidate nodes of a rendezvous point node, nodes on one of the obtained minimum delay paths; for each candidate node, calculating minimum delay paths from the candidate node to each destination node, and obtaining a difference between the maximum value and the minimum value among delays of the calculated minimum delay paths; selecting, as the rendezvous point node, a candidate node by which the difference is smallest; and outputting a minimum delay path from the source node to the rendezvous point node and minimum delay paths from the rendezvous point node to each destination node.

摘要翻译： 公开了一种组播通信路径计算方法，其包括以下步骤：获得从源节点到每个目的地节点的最小延迟路径; 作为会合点节点的候选节点选择所获得的最小延迟路径之一上的节点; 计算从所述候选节点到每个目的地节点的最小延迟路径，并且获得所计算的最小延迟路径的延迟中的最大值和最小值之间的差值; 选择作为会合点节点的差异最小的候选节点; 并输出从源节点到会合点节点的最小延迟路径和从会合点节点到每个目的地节点的最小延迟路径。

公开(公告)号：US4720635A

公开(公告)日：1988-01-19

申请号：US808124

申请日：1985-12-12

申请人： Masanori Uga

发明人： Masanori Uga

IPC分类号： G05D3/12 ,  G01B11/00 ,  H01L21/00 ,  H01L21/68 ,  G01B11/27

CPC分类号： H01L21/67271 ,  H01L21/682

摘要： An automatic accurate alignment system for positioning at a required position an object to be worked which has a certain pattern on its surface. The system includes a key pattern memory, a pattern matching device and movement control device. The key pattern memory memorizes a first signal indicative of a key pattern existing in a specified area and its position when the object to be worked is positioned at a predetermined position, and memorizes a second signal indicative of the key pattern existing in the specified area and its position when the object to be worked is rotated through 90 degrees from the predetermined the second signal is determined from the first signal. The pattern matching device performs a first pattern matching on the basis of the first signal and a second pattern matching on the basis of the second signal. The movement control device performs a first positioning of the object to be worked on the basis of the first pattern matching, then, rotates the object to be worked through 90 degrees, and thereafter, performs a second positioning of the object to be worked on the basis of the second pattern matching.

摘要翻译： 一种用于在所需位置处定位其表面上具有一定图案的待加工物体的自动精确对准系统。 该系统包括键图案存储器，图案匹配装置和运动控制装置。 键图案存储器存储指示存在于指定区域中的键图案的第一信号及其待加工对象位于预定位置的位置，并且存储指示存在于指定区域中的键图案的第二信号，以及 当从第一信号确定待加工物体从预定的第二信号旋转90度时的位置。 模式匹配装置基于第一信号执行第一模式匹配，并且基于第二信号执行第二模式匹配。 运动控制装置基于第一图案匹配执行待加工对象的第一定位，然后使待加工对象旋转90度，然后，对待加工对象进行第二定位 第二种模式匹配的基础。

公开(公告)号：US07583601B2

公开(公告)日：2009-09-01

申请号：US10522713

申请日：2004-02-06

申请人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

发明人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC分类号： H04J1/16

CPC分类号： H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

摘要： A method of establishing a multicast transfer route is disclosed that can reduce the cost of entire route under a constraint on delay incurred between starting point and ending points. The method includes the steps of: computing the shortest route with respect to delay connecting the starting point and the plural ending points based on measurement result; computing delay from a node on the shortest route to each ending point and the greatest delay; removing, if the greatest delay satisfies a delay condition, the greatest-cost route from the shortest route in accordance with selection criteria effective for cost reduction; dividing the multicast transfer route into two route trees; and establishing separately computed route as a complementary route that complement the removed route for connecting the two route trees. A method of multicast label switching for realizing the above method is also disclosed. A multicast label switching route is established using hierarchical labels by establishing a common multicast label switching route using a first layer label and establishing plural partial multicast label switching routes for subgroup destinations using lower layer labels. A relay node recognizes the hierarchical labels thereby to label-switch using all hierarchical labels.

摘要翻译： 公开了一种建立多播传输路由的方法，可以在起始点和终点之间的延迟约束下降低整个路由的成本。 该方法包括以下步骤：基于测量结果计算相对于连接起始点和多个终点的延迟的最短路径; 计算从最短路径上的节点到每个终点的延迟和最大延迟; 如果最大延迟满足延迟条件，则根据有效降低成本的选择标准，从最短路由中删除最大成本路由; 将组播传输路由划分为两条路由树; 并建立单独计算的路由作为补充路由，用于补充用于连接两条路由树的已删除路由。 还公开了一种实现上述方法的组播标签交换方法。 使用分层标签建立组播标签交换路由，使用第一层标签建立公共组播标签交换路由，并使用下层标签为子组目的建立多个部分组播标签交换路由。 中继节点识别分层标签，从而使用所有分层标签进行标签交换。

公开(公告)号：US20060078333A1

公开(公告)日：2006-04-13

申请号：US10531436

申请日：2004-08-18

申请人： Masanori Uga ,  Takashi Kurimoto ,  Michihiro Aoki

发明人： Masanori Uga ,  Takashi Kurimoto ,  Michihiro Aoki

IPC分类号： H04B10/08

CPC分类号： H04L45/00 ,  G11C15/00 ,  H04L45/54 ,  H04L45/7453

摘要： A routing table generating unit that generates a routing table describing a next hop to which a packet is to be sent according to a destination address of the packet that is input via an input channel, including a ternary content addressable memory (TCAM); an external memory; a unit that classifies items in information that is received; and a unit that stores an item that uniquely identifies the information among the classified items in the TCAM and stores the rest of the items to the external memory.

摘要翻译： 路由表生成单元，其根据通过输入信道输入的分组的目的地地址生成描述要发送分组的下一跳的路由表，包括三进制内容可寻址存储器（TCAM）; 外部记忆 对接收到的信息中的项目进行分类的单元; 以及存储在TCAM中的分类项目中唯一地标识信息的项目并将其余的项目存储到外部存储器的单元。

公开(公告)号：US06718326B2

公开(公告)日：2004-04-06

申请号：US09927284

申请日：2001-08-10

申请人： Masanori Uga ,  Kohei Shiomoto

发明人： Masanori Uga ,  Kohei Shiomoto

IPC分类号： G06F1730

CPC分类号： H04L47/10 ,  H04L45/00 ,  H04L45/306 ,  H04L45/54 ,  H04L47/2408 ,  H04L47/2441 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99937

摘要： A packet classification search device and method are implemented which are capable of searching rules of packet classification having very long search bit width at high speed while using a CAM which has a limited bit width. The fields of rules of packet classification are grouped into groups, and the grouped fields of each rule are stored along with search related information (except for the initial group) and number of searches information in a CAM. The next number of searches information (if further groups exist which must be searched), comparison related information, and actions related to packets (if further groups exist which must be searched, directing searching again, while if no further groups exist which must be searched, actions for packet classification) are stored in a search result storage device. By doing this it is made possible to search with the bit width of the group unit.

摘要翻译： 实现了能够在使用具有有限位宽度的CAM的情况下，以高速搜索具有非常长的搜索位宽度的分组分类的规则的分组分类检索装置和方法。 分组分类规则的字段被分组成组，每个规则的分组字段与CAM中的搜索相关信息（初始组除外）和搜索信息数一起存储。 下一数量的搜索信息（如果存在必须搜索的另外的组），比较相关信息和与分组相关的动作（如果存在必须搜索的另外的组，则再次指导搜索，而如果不存在必须搜索的另外的组 ，分组分类的动作）存储在搜索结果存储装置中。 通过这样做，可以用组单位的位宽搜索。

公开(公告)号：US07792099B2

公开(公告)日：2010-09-07

申请号：US12237912

申请日：2008-09-25

申请人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

发明人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC分类号： H04L12/50 ,  H04Q11/00

CPC分类号： H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

摘要： A method of establishing a multicast transfer route is disclosed that can reduce the cost of entire route under a constraint on delay incurred between starting point and ending points. The method includes the steps of: computing the shortest route with respect to delay connecting the starting point and the plural ending points based on measurement result; computing delay from a node on the shortest route to each ending point and the greatest delay; removing, if the greatest delay satisfies a delay condition, the greatest-cost route from the shortest route in accordance with selection criteria effective for cost reduction; dividing the multicast transfer route into two route trees; and establishing separately computed route as a complementary route that complement the removed route for connecting the two route trees. A method of multicast label switching for realizing the above method is also disclosed. A multicast label switching route is established using hierarchical labels by establishing a common multicast label switching route using a first layer label and establishing plural partial multicast label switching routes for subgroup destinations using lower layer labels. A relay node recognizes the hierarchical labels thereby to label-switch using all hierarchical labels.

摘要翻译： 公开了一种建立多播传输路由的方法，可以在起始点和终点之间的延迟约束下降低整个路由的成本。 该方法包括以下步骤：基于测量结果计算相对于连接起始点和多个终点的延迟的最短路径; 计算从最短路径上的节点到每个终点的延迟和最大延迟; 如果最大延迟满足延迟条件，则根据有效降低成本的选择标准，从最短路由中删除最大成本路由; 将组播传输路由划分为两条路由树; 并建立单独计算的路由作为补充路由，用于补充用于连接两条路由树的已删除路由。 还公开了一种实现上述方法的组播标签交换方法。 使用分层标签建立组播标签交换路由，使用第一层标签建立公共组播标签交换路由，并使用下层标签为子组目的建立多个部分组播标签交换路由。 中继节点识别分层标签，从而使用所有分层标签进行标签交换。

公开(公告)号：US07693074B2

公开(公告)日：2010-04-06

申请号：US11776919

申请日：2007-07-12

申请人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

发明人： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC分类号： G01R31/08

CPC分类号： H04L45/48 ,  H04L12/1877 ,  H04L41/12 ,  H04L45/02 ,  H04L45/121 ,  H04L45/124 ,  H04L45/16

摘要： A multicast communication path calculation method is disclosed which includes the steps of: obtaining minimum delay paths from a source node to each destination node; selecting, as candidate nodes of a rendezvous point node, nodes on one of the obtained minimum delay paths; for each candidate node, calculating minimum delay paths from the candidate node to each destination node, and obtaining a difference between the maximum value and the minimum value among delays of the calculated minimum delay paths; selecting, as the rendezvous point node, a candidate node by which the difference is smallest; and outputting a minimum delay path from the source node to the rendezvous point node and minimum delay paths from the rendezvous point node to each destination node.