会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • PERIODICALLY RECONFIGURED NETWORKS
    • 定期重新配置的网络
    • US20080175170A1
    • 2008-07-24
    • US12016116
    • 2008-01-17
    • John Anderson Fergus RossAmit Bhavanishankar KulkarniJohn Erik HersheyMichael James Hartman
    • John Anderson Fergus RossAmit Bhavanishankar KulkarniJohn Erik HersheyMichael James Hartman
    • H04L12/28
    • H04L45/028H04L45/02
    • Methodologies for determining one or more staged topologies for a communication network, communication networks implementing one or more staged topologies, and systems for determining one or more staged topologies for a communication network are provided. In one embodiment, a method of determining a staged topology for a communication network including a plurality of nodes includes identifying a plurality of topologies comprising different subsets of available communication links among the nodes, associating a connection matrix with each identified topology, establishing one or more sequences of topologies using the identified topologies, multiplying the connection matrices associated with the topologies in each sequence of topologies to obtain a sequenced connection matrix corresponding with each sequence of topologies, multiplying each sequenced connection matrix by a weighting matrix to obtain a total cost matrix corresponding with each sequence of topologies, and selecting one of the sequences of topologies as the staged topology based on the total cost matrices corresponding with each sequence of topologies.
    • 提供用于确定通信网络的一个或多个分段拓扑,实现一个或多个分级拓扑的通信网络以及用于确定通信网络的一个或多个分级拓扑的系统的方法。 在一个实施例中,确定包括多个节点的通信网络的分段拓扑的方法包括标识包括节点之间的可用通信链路的不同子集的多个拓扑,将连接矩阵与每个识别的拓扑结合起来,建立一个或多个 使用所识别的拓扑结构的拓扑序列,将与每个拓扑序列中的拓扑相关联的连接矩阵相乘以获得与每个拓扑序列相对应的有序连接矩阵,将每个顺序连接矩阵乘以加权矩阵,以获得对应的总成本矩阵 每个拓扑序列,并且基于与每个拓扑序列对应的总成本矩阵,选择拓扑序列之一作为分段拓扑。
    • 5. 发明授权
    • Periodically reconfigured networks
    • 定期重新配置的网络
    • US07756062B2
    • 2010-07-13
    • US12016116
    • 2008-01-17
    • John Anderson Fergus RossAmit Bhavanishankar KulkarniJohn Erik HersheyMichael James Hartman
    • John Anderson Fergus RossAmit Bhavanishankar KulkarniJohn Erik HersheyMichael James Hartman
    • H04L12/28G06F15/173
    • H04L45/028H04L45/02
    • Methodologies for determining one or more staged topologies for a communication network, communication networks implementing one or more staged topologies, and systems for determining one or more staged topologies for a communication network are provided. In one embodiment, a method of determining a staged topology for a communication network including a plurality of nodes includes identifying a plurality of topologies comprising different subsets of available communication links among the nodes, associating a connection matrix with each identified topology, establishing one or more sequences of topologies using the identified topologies, multiplying the connection matrices associated with the topologies in each sequence of topologies to obtain a sequenced connection matrix corresponding with each sequence of topologies, multiplying each sequenced connection matrix by a weighting matrix to obtain a total cost matrix corresponding with each sequence of topologies, and selecting one of the sequences of topologies as the staged topology based on the total cost matrices corresponding with each sequence of topologies.
    • 提供用于确定通信网络的一个或多个分段拓扑,实现一个或多个分级拓扑的通信网络以及用于确定通信网络的一个或多个分级拓扑的系统的方法。 在一个实施例中,确定包括多个节点的通信网络的分段拓扑的方法包括识别包括节点之间的可用通信链路的不同子集的多个拓扑,将连接矩阵与每个识别的拓扑结合起来,建立一个或多个 使用所识别的拓扑结构的拓扑序列,将与每个拓扑序列中的拓扑相关联的连接矩阵相乘以获得与每个拓扑序列相对应的有序连接矩阵,将每个顺序连接矩阵乘以加权矩阵,以获得对应的总成本矩阵 每个拓扑序列,并且基于与每个拓扑序列对应的总成本矩阵,选择拓扑序列之一作为分段拓扑。
    • 8. 发明申请
    • System for creating optimally-sized clusters
    • 用于创建最佳大小的集群的系统
    • US20070299950A1
    • 2007-12-27
    • US11471901
    • 2006-06-21
    • Amit Bhavanishankar Kulkarni
    • Amit Bhavanishankar Kulkarni
    • G06F15/173G06F15/16
    • H04L45/00H04L45/46H04W40/32
    • A system clusters nodes of a network of a plurality of nodes. The system includes: a receiver for obtaining information about a local neighborhood around a first node of the plurality of nodes, the first node having a first clusterhead node; a compiler for generating a list of clusterhead nodes; a recorder for recording weights of the clusterhead nodes of the list; a processor for computing a differential weight for the clusterhead nodes of the list; a comparator for comparing each of the differential weights with a predetermined affinity threshold; and a determinator for determining whether the first node replaces the first clusterhead node with a new clusterhead node or the first node becomes a clusterhead node.
    • 系统聚集多个节点的网络的节点。 该系统包括:接收器,用于获得关于多个节点的第一节点周围的局部邻域的信息,第一节点具有第一簇头节点; 用于生成簇头节点列表的编译器; 用于记录列表的簇头节点的权重的记录器; 用于计算列表的簇头节点的差分权重的处理器; 比较器,用于将每个差分权重与预定的亲和度阈值进行比较; 以及确定器,用于确定第一节点是否用新的簇头节点替换第一簇头节点,或者第一节点成为簇头节点。