公开(公告)号：US07583601B2

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

申请号：US10522713

申请日：2004-02-06

Applicant: Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC: H04J1/16

CPC classification number: H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

Abstract: 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.

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

公开(公告)号：US07652998B2

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

申请号：US10731156

申请日：2003-12-10

Applicant: Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC: H04L1/00

CPC classification number: H04L45/48 ,  H04L12/1877 ,  H04L41/12 ,  H04L45/02 ,  H04L45/121 ,  H04L45/124 ,  H04L45/16

Abstract: 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.

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

公开(公告)号：US20090028149A1

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

申请号：US12237912

申请日：2008-09-25

Applicant: Seisho YASUKAWA ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho YASUKAWA ,  Koji Sugisono ,  Masanori Uga

IPC: H04L12/56

CPC classification number: H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

Abstract: 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.

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

公开(公告)号：US07792099B2

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

申请号：US12237912

申请日：2008-09-25

Applicant: Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC: H04L12/50 ,  H04Q11/00

CPC classification number: H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

Abstract: 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.

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

公开(公告)号：US07693074B2

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

申请号：US11776919

申请日：2007-07-12

Applicant: Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC: G01R31/08

CPC classification number: H04L45/48 ,  H04L12/1877 ,  H04L41/12 ,  H04L45/02 ,  H04L45/121 ,  H04L45/124 ,  H04L45/16

Abstract: 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.

公开(公告)号：US20060147204A1

公开(公告)日：2006-07-06

申请号：US10522713

申请日：2004-02-06

Applicant: Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

Inventor： Seisho Yasukawa ,  Koji Sugisono ,  Masanori Uga

IPC: H04B10/08

CPC classification number: H04L45/48 ,  H04L45/12 ,  H04L45/121 ,  H04L45/16 ,  H04L45/50 ,  H04L45/70

Abstract: 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.

公开(公告)号：US09674083B2

公开(公告)日：2017-06-06

申请号：US13128771

申请日：2009-11-18

Applicant: Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

Inventor： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

IPC: H04L12/753 ,  H04L12/721

CPC classification number: H04L45/48 ,  H04L45/12

Abstract: A path calculation order determining method executed by a calculating apparatus for calculating a shortest path between a node pair in a network, using information on calculated shortest paths between other node pairs, the method including: a step storing calculated shortest path group information on shortest path groups each including calculated shortest paths from a starting node to one or more terminating nodes except the starting node, and topology information of the network, in a memory medium; and a calculation step of calculating shortest paths, starting from its starting node other than the starting node on the calculated shortest paths and having the most nodes that are located downstream therefrom, and terminating at nodes other than its starting node, using the calculated shortest path group information or the topology information for a path not included in the calculated shortest path group.

公开(公告)号：US09215163B2

公开(公告)日：2015-12-15

申请号：US13129178

申请日：2009-11-18

Applicant: Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

Inventor： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

IPC: H04L12/721 ,  H04L12/751 ,  H04L12/759 ,  H04L12/753

CPC classification number: H04L45/12 ,  H04L45/02 ,  H04L45/028 ,  H04L45/123 ,  H04L45/48

Abstract: A calculating apparatus calculates a shortest path connecting two nodes of a network. A shortest-path group, which is a set of shortest paths having node Y as their starting points, can be calculated at once by having calculated a shortest path having node Y as its starting point for each of other nodes. When the shortest-path group having node Y as the starting point is calculated and further if a group of shortest paths having node X as their starting points is stored beforehand in a storing unit, then path portions, which belong to the group of shortest paths having node X as the starting points and further which are paths extending from node Y to the nodes located downstream from node Y, are utilized as part of a result of calculation of the shortest path group having node Y as the starting point.

Abstract translation: 计算装置计算连接网络的两个节点的最短路径。 可以通过计算具有节点Y作为其每个其他节点的起始点的最短路径，来一次计算作为具有节点Y作为其起始点的一组最短路径的最短路径组。 当以节点Y为起始点的最短路径组被计算时，如果将具有节点X作为起始点的最短路径组预先存储在存储单元中，则属于最短路径组的路径部分 将节点X作为起始点，并且进一步是从节点Y延伸到位于节点Y下游的节点的路径，作为以节点Y为起始点的最短路径组的计算结果的一部分。

公开(公告)号：US20110222437A1

公开(公告)日：2011-09-15

申请号：US13129178

申请日：2009-11-18

Applicant: Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

Inventor： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

IPC: H04L12/28

CPC classification number: H04L45/12 ,  H04L45/02 ,  H04L45/028 ,  H04L45/123 ,  H04L45/48

Abstract: A calculating apparatus calculates a shortest path connecting two nodes of a network. A shortest-path group, which is a set of shortest paths having node Y as their starting points, can be calculated at once by having calculated a shortest path having node Y as its starting point for each of other nodes. When the shortest-path group having node Y as the starting point is calculated and further if a group of shortest paths having node X as their starting points is stored beforehand in a storing unit, then path portions, which belong to the group of shortest paths having node X as the starting points and further which are paths extending from node Y to the nodes located downstream from node Y, are utilized as part of a result of calculation of the shortest path group having node Y as the starting point.

Abstract translation: 计算装置计算连接网络的两个节点的最短路径。 可以通过计算具有节点Y作为其每个其他节点的起始点的最短路径，来一次计算作为具有节点Y作为其起始点的一组最短路径的最短路径组。 当以节点Y为起始点的最短路径组被计算时，如果将具有节点X作为起始点的最短路径组预先存储在存储单元中，则属于最短路径组的路径部分 将节点X作为起始点，并且进一步是从节点Y延伸到位于节点Y下游的节点的路径，作为以节点Y为起始点的最短路径组的计算结果的一部分。

公开(公告)号：US20110219143A1

公开(公告)日：2011-09-08

申请号：US13128771

申请日：2009-11-18

Applicant: Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

Inventor： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

IPC: G06F15/173

CPC classification number: H04L45/48 ,  H04L45/12

Abstract: A path calculation order deciding method that is implemented by a calculating apparatus (1) which calculates, by use of calculated shortest path between a node pair about a network comprising a plurality of nodes, a shortest path between other node pair comprises: wherein the calculating apparatus comprises a memory medium storing shortest path group information which represents calculated shortest paths each of which is shortest path between the node pair, whose starting nodes are identical and terminating nodes are different from one another, by use of the plurality of nodes and paths between the node pairs and also storing topology information representing topology of the plurality of nodes, and a calculation unit, a calculation step that the calculation unit selects each particular nodes of the plurality of nodes, which is different from the starting node, in decreasing order of the numbers of the downstream nodes from the particular node in calculated shortest path between the node pair represented by the shortest path group information; and calculates, in response to each selection of the particular node, the shortest path between the node pair, which has, as its starting point, the selected particular node and has, as its terminating point, other each node of the plurality of nodes, by use of calculated shortest path between other node pair and the topology information.

Abstract translation: 一种由计算装置（1）实现的路径计算顺序决定方法，所述计算装置（1）通过使用在包括多个节点的网络的节点对之间的计算出的最短路径来计算其他节点对之间的最短路径，包括：其中， 装置包括存储最短路径组信息的存储介质，所述存储介质代表所计算的最短路径，每个最短路径是其起始节点相同且终止节点彼此不同的节点对之间的最短路径，通过使用多个节点和 所述节点对并且还存储表示所述多个节点的拓扑的拓扑信息，以及计算单元，所述计算单元以与所述起始节点不同的所述多个节点中的每个特定节点按照 来自特定节点的下游节点数量之间的计算最短路径点 e对由最短路径组信息表示; 并且响应于所述特定节点的每个选择，计算所述节点对之间的所述最短路径，所述节点对作为其起始点，所选择的特定节点，并且具有作为其终点的所述多个节点中的其他每个节点， 通过使用其他节点对和拓扑信息之间的计算最短路径。