利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

9 条记录 (耗时 0.016 秒)

    Protocol speed increasing device
    1.
    发明申请
    Protocol speed increasing device 审中-公开
    协议速度提升装置

    公开(公告)号：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中的分类项目中唯一地标识信息的项目并将其余的项目存储到外部存储器的单元。

    Data transmission device and data transmission system
    2.
    发明申请
    Data transmission device and data transmission system 有权
    数据传输设备和数据传输系统

    公开(公告)号：US20060168316A1

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

    申请号：US10524613

    申请日：2004-02-02

    申请人： Keisuke Kabashima ,  Michihiro Aoki ,  Takashi Kurimoto ,  Takashi Miyamura ,  Masahiro Goshima ,  Nobuaki Matsuura ,  Shigeo Urushidani

    发明人： Keisuke Kabashima ,  Michihiro Aoki ,  Takashi Kurimoto ,  Takashi Miyamura ,  Masahiro Goshima ,  Nobuaki Matsuura ,  Shigeo Urushidani

    IPC分类号： G06F15/173

    CPC分类号： H04L12/4666 ,  H04L12/4675 ,  H04L69/18

    摘要： A data transfer apparatus and a data transfer system are provided that can reduce the cost of installing communication equipment compatible with each of several dissimilar communication protocols in one exchange office and can reduce the cost of constructing the network. The data transfer apparatus includes a data reception device (110) that receives packets that comply with dissimilar communication protocols from upstream data transfer apparatuses (51, 52, and 53); a content data extraction device (120) that extracts content data included in the packets; a line selection information storage device (130) that stores the line selection information for selecting communication lines that comply with dissimilar communication protocols; a line selection device (140) that selects the communication line compatible with content data based on the line selection information; and a data transfer device (150) that transfers data to downstream data transfer apparatuses (61, 62, and 63) that are connected to the communication line that has been selected by the line selection device.

    摘要翻译： 提供了一种数据传送装置和数据传送系统，其可以降低与一个交换局中的多个不同通信协议中的每一个兼容的通信设备的安装成本，并且可以降低构建网络的成本。 数据传送装置包括从上游数据传送装置（51,52,53）接收符合不同通信协议的分组的数据接收装置（110）。 提取包中包含的内容数据的内容数据提取装置（120） 线选择信息存储装置，存储用于选择符合不同通信协议的通信线路的线路选择信息; 线路选择装置（140），其基于线选择信息选择与内容数据兼容的通信线路; 以及数据传送装置（150），其将数据传送到与由线选择装置选择的通信线路连接的下游数据传送装置（61,62,63）。

    Data transfer apparatus and data transfer system
    4.
    发明授权
    Data transfer apparatus and data transfer system 有权
    数据传输设备和数据传输系统

    公开(公告)号：US07797444B2

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

    申请号：US10524613

    申请日：2004-02-02

    申请人： Keisuke Kabashima ,  Michihiro Aoki ,  Takashi Kurimoto ,  Takashi Miyamura ,  Masahiro Goshima ,  Nobuaki Matsuura ,  Shigeo Urushidani

    发明人： Keisuke Kabashima ,  Michihiro Aoki ,  Takashi Kurimoto ,  Takashi Miyamura ,  Masahiro Goshima ,  Nobuaki Matsuura ,  Shigeo Urushidani

    IPC分类号： G06F15/16

    CPC分类号： H04L12/4666 ,  H04L12/4675 ,  H04L69/18

    摘要： A data transfer apparatus and a data transfer system are provided that can reduce the cost of installing communication equipment compatible with each of several dissimilar communication protocols in one exchange office and can reduce the cost of constructing the network. The data transfer apparatus includes a data reception device (110) that receives packets that comply with dissimilar communication protocols from upstream data transfer apparatuses (51, 52, and 53); a content data extraction device (120) that extracts content data included in the packets; a line selection information storage device (130) that stores the line selection information for selecting communication lines that comply with dissimilar communication protocols; a line selection device (140) that selects the communication line compatible with content data based on the line selection information; and a data transfer device (150) that transfers data to downstream data transfer apparatuses (61, 62, and 63) that are connected to the communication line that has been selected by the line selection device.

    摘要翻译： 提供了一种数据传送装置和数据传送系统，其可以降低与一个交换局中的多个不同通信协议中的每一个兼容的通信设备的安装成本，并且可以降低构建网络的成本。 数据传送装置包括从上游数据传送装置（51,52,53）接收符合不同通信协议的分组的数据接收装置（110）。 提取包中包含的内容数据的内容数据提取装置（120） 线选择信息存储装置，存储用于选择符合不同通信协议的通信线路的线路选择信息; 线路选择装置（140），其基于线选择信息选择与内容数据兼容的通信线路; 以及数据传送装置（150），其将数据传送到与由线选择装置选择的通信线路连接的下游数据传送装置（61,62,63）。

    Path calculation order deciding method, program and calculating apparatus
    6.
    发明授权
    Path calculation order deciding method, program and calculating apparatus 有权

    公开(公告)号：US09674083B2

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

    申请号：US13128771

    申请日：2009-11-18

    申请人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    发明人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    IPC分类号： H04L12/753 ,  H04L12/721

    CPC分类号： H04L45/48 ,  H04L45/12

    摘要： 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.

    Path calculating method, program and calculating apparatus
    7.
    发明授权
    Path calculating method, program and calculating apparatus 有权
    路径计算方法，程序和计算装置

    公开(公告)号：US09215163B2

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

    申请号：US13129178

    申请日：2009-11-18

    申请人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    发明人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    IPC分类号： H04L12/721 ,  H04L12/751 ,  H04L12/759 ,  H04L12/753

    CPC分类号： H04L45/12 ,  H04L45/02 ,  H04L45/028 ,  H04L45/123 ,  H04L45/48

    摘要： 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.

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

    PATH CALCULATING METHOD, PROGRAM AND CALCULATING APPARATUS
    8.
    发明申请
    PATH CALCULATING METHOD, PROGRAM AND CALCULATING APPARATUS 有权
    路径计算方法，程序和计算设备

    公开(公告)号：US20110222437A1

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

    申请号：US13129178

    申请日：2009-11-18

    申请人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    发明人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    IPC分类号： H04L12/28

    CPC分类号： H04L45/12 ,  H04L45/02 ,  H04L45/028 ,  H04L45/123 ,  H04L45/48

    摘要： 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.

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

    PATH CALCULATION ORDER DECIDING METHOD, PROGRAM AND CALCULATING APPARATUS
    9.
    发明申请
    PATH CALCULATION ORDER DECIDING METHOD, PROGRAM AND CALCULATING APPARATUS 有权
    路线计算订单方法，程序和计算设备

    公开(公告)号：US20110219143A1

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

    申请号：US13128771

    申请日：2009-11-18

    申请人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    发明人： Koji Sugisono ,  Michihiro Aoki ,  Hideaki Iwata

    IPC分类号： G06F15/173

    CPC分类号： H04L45/48 ,  H04L45/12

    摘要： 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.

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