会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Data transfer network
    • 数据传输网络
    • US07684328B2
    • 2010-03-23
    • US11441001
    • 2006-05-26
    • Masato KawaharaHideaki Okayama
    • Masato KawaharaHideaki Okayama
    • H04L12/28H04L12/56
    • H04L45/14H04L45/04
    • The present invention provides a data transfer network receiving a higher evaluation overall than conventional ones from various perspectives such as the number of effective nodes, the required number of links, and the required maximum node capacity. The present invention is a data transfer network of a hyper configuration in which each node is an element of m (m is 2 or more) different local networks. Further, at least one of the local networks to which the respective nodes belong is a hub network and, when a node belongs to a local network other than a hub network, the local network is a full mesh network.
    • 本发明提供了一种数据传输网络,其从诸如有效节点的数量,所需的链路数量和所需的最大节点容量等各个视角的总体上比传统网络更高。 本发明是一种超配置的数据传输网络,其中每个节点是m(m是2个或更多)个不同本地网络的元素。 此外,相应节点所属的本地网络中的至少一个是集线器网络,并且当节点属于集线器网络以外的本地网络时,本地网络是全网状网络。
    • 2. 发明申请
    • Data communication network having multidimensional link structure
    • 数据通信网络具有多维链路结构
    • US20070133410A1
    • 2007-06-14
    • US11637048
    • 2006-12-12
    • Masato KawaharaHideaki Okayama
    • Masato KawaharaHideaki Okayama
    • H04L12/26
    • H04L49/15H04L49/101H04L49/357
    • The present invention provides a data communication network that has a link structure that allows a large traffic-handling performance to be obtained with a small network construction cost. In the data communication network of the present invention, the nodes are assigned with m-dimensional coordinates (J1, J2, J3, J4, J5, . . . , Jm−1, Jm), in which any one of the coordinate values J1 to Jm is zero and the other coordinate values are all natural numbers, and each of said node is connected to other nodes which satisfy both of the following conditions (i) and (ii): (i) the coordinate Jp whose value is zero at said other node differs from a coordinate Jq whose value is zero at said node; and (ii) the value of coordinates other than the Jp and the Jq at said the other node all match the corresponding coordinate values of said node.
    • 本发明提供一种数据通信网络,其具有能够以小的网络建设成本获得大的业务处理性能的链路结构。 在本发明的数据通信网络中,节点被分配有m维坐标(J 1,J 2,J 3,J 4,J 5,...,Jm-1,Jm),其中任何一个 坐标值J 1至J m为零,其他坐标值为自然数,并且所述节点中的每一个连接到满足以下条件(i)和(ii)两者的其他节点:(i)坐标 在所述另一节点处值为零的Jp与在所述节点处的值为零的坐标Jq不同; 和(ii)在所述另一个节点处的Jp和Jq之外的坐标值都与所述节点的相应坐标值相匹配。
    • 3. 发明授权
    • Data communication network having multidimensional link structure
    • 数据通信网络具有多维链路结构
    • US07944831B2
    • 2011-05-17
    • US11637048
    • 2006-12-12
    • Masato KawaharaHideaki Okayama
    • Masato KawaharaHideaki Okayama
    • G01R31/08
    • H04L49/15H04L49/101H04L49/357
    • The present invention provides a data communication network that has a link structure that allows a large traffic-handling performance to be obtained with a small network construction cost. In the data communication network of the present invention, the nodes are assigned with m-dimensional coordinates (J1, J2, J3, J4, J5, . . . , Jm−1, Jm), in which any one of the coordinate values J1 to Jm is zero and the other coordinate values are all natural numbers, and each of said node is connected to other nodes which satisfy both of the following conditions (i) and (ii): (i) the coordinate Jp whose value is zero at said other node differs from a coordinate Jq whose value is zero at said node; and (ii) the value of coordinates other than the Jp and the Jq at said the other node all match the corresponding coordinate values of said node.
    • 本发明提供一种数据通信网络,其具有能够以小的网络建设成本获得大的业务处理性能的链路结构。 在本发明的数据通信网络中,节点被分配有m维坐标(J1,J2,J3,J4,J5,...,Jm-1,Jm),其中坐标值J1 到Jm为零,其他坐标值为自然数,并且所述节点中的每一个连接到满足以下条件(i)和(ii)的其他节点:(i)其值为零的坐标Jp 所述其他节点与在所述节点处的值为零的坐标Jq不同; 和(ii)在所述另一个节点处的Jp和Jq之外的坐标值都与所述节点的相应坐标值相匹配。
    • 5. 发明申请
    • Data transfer network
    • 数据传输网络
    • US20060268910A1
    • 2006-11-30
    • US11441001
    • 2006-05-26
    • Masato KawaharaHideaki Okayama
    • Masato KawaharaHideaki Okayama
    • H04L12/56
    • H04L45/14H04L45/04
    • The present invention provides a data transfer network receiving a higher evaluation overall than conventional ones from various perspectives such as the number of effective nodes, the required number of links, and the required maximum node capacity. The present invention is a data transfer network of a hyper configuration in which each node is an element of m (m is 2 or more) different local networks. Further, at least one of the local networks to which the respective nodes belong is a hub network and, when a node belongs to a local network other than a hub network, the local network is a full mesh network.
    • 本发明提供了一种数据传输网络,其从诸如有效节点的数量,所需的链路数量和所需的最大节点容量等各个视角的总体上比传统网络更高。 本发明是一种超配置的数据传输网络,其中每个节点是m(m是2个或更多)个不同本地网络的元素。 此外,相应节点所属的本地网络中的至少一个是集线器网络,并且当节点属于集线器网络以外的本地网络时,本地网络是全网状网络。