会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Problem model for alarm correlation
    • 报警相关问题模型
    • US06598033B2
    • 2003-07-22
    • US08892433
    • 1997-07-14
    • Niall RossAnthony Richard Phillip White
    • Niall RossAnthony Richard Phillip White
    • G06F1700
    • H04L41/0631H04L41/0233H04L41/0856H04L41/0893H04M3/36
    • A method of processing data such as alarms from a communications network, the network comprising a plurality of network entities, having predetermined states of operation, the method comprising the step of creating an object (88) associated with a given state of one of the entities, such as a fault state. The object comprises knowledge based reasoning capability (89) such as rules for determining whether the entity is in the given state, and the method further comprises the steps of: passing data about the network, such as alarms and events, to the object; and inferring whether the entity is in the given fault state using the rules. This enables faster correlation of alarms and simpler development and maintenance of the rules.
    • 一种处理诸如来自通信网络的报警的数据的方法,所述网络包括具有预定操作状态的多个网络实体,所述方法包括创建与所述实体之一的给定状态相关联的对象(88)的步骤 ,如故障状态。 该对象包括基于知识的推理能力(89),例如用于确定实体是否处于给定状态的规则,并且该方法还包括以下步骤:将关于网络的诸如警报和事件的数据传递到对象; 并使用规则推断实体是否处于给定的故障状态。 这样可以实现更快速的警报相关性和更简单的开发和维护规则。
    • 5. 发明授权
    • Traffic route finder in communications network
    • 通信网络中的路由查找器
    • US06314093B1
    • 2001-11-06
    • US09088805
    • 1998-06-02
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • H04L324
    • H04Q11/0478H04J2203/0053H04J2203/0069H04L45/12H04L45/24H04L2012/562H04L2012/5642H04L2012/5651
    • A route finder means and method for finding routes to satisfy a plurality of connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. Arrays of eight shortest paths of links between each pair of nodes in the network are created. Bit strings comprising for example a 3 bit binary number for each point-to-point connection request are generated. Each 3 bit number is an index to one element of the shortest path array for each connection request's source and destination nodes. The bit strings are assembled into population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The route finder means and method has an ability to split traffic over multiple routes, and to handle different traffic types, eg different bit rate traffic types. The route finder means and method is generic to a plurality of different communications network types.
    • 一种用于寻找在包括由多个链路连接的多个节点的通信网络中满足多个连接请求的路由的路线寻找装置和方法。 每个网络链路分配一个成本。 创建网络中每对节点之间的八条最短路径的数组。 生成包括例如每个点到点连接请求的3位二进制数的比特串。 每个3位数字是每个连接请求的源和目标节点的最短路径数组的一个元素的索引。 位串被组合成由遗传算法操纵的群体成员。 通过计算遍历由位串表示的路由的成本来评估人口成员的适应度。 路由查找器的方法和方法具有在多个路由上分流流量的能力,并处理不同的流量类型,例如不同的比特率流量类型。 路线寻找装置和方法是通用于多种不同的通信网络类型。
    • 6. 发明授权
    • Traffic route finder in communications network
    • 通信网络中的路由查找器
    • US06310883B1
    • 2001-10-30
    • US09044889
    • 1998-03-20
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • Jason Warren MannJohn Ian TurnerAnthony Richard Phillip White
    • H04L1244
    • H04Q11/0478H04J2203/0053H04J2203/0069H04L45/12H04L45/24H04L2012/562H04L2012/5642H04L2012/5651
    • A route finder for point to multi-point connection requests in a communications network comprising a plurality of nodes connected by a plurality of links. A cost is assigned to each network link. For each connection request a set of all network nodes not included in its source node or its plurality of destination nodes are selected. An array of bits is created with an array element corresponding to a selected node element having a value of 1 if the node is steiner vertex for a steiner tree of nodes not selected, otherwise the array element has a value of 0. Each array is treated as a bit string and considered as population members which are manipulated by genetic algorithms. The fitness of the population members is evaluated by calculating the cost of traversing the routes represented by the bit strings. The method is capable of routing a plurality of multi-point connection requests, and selecting an overall optimum solution.
    • 一种用于在包括由多个链路连接的多个节点的通信网络中的点对多点连接请求的路线寻找器。 每个网络链路分配一个成本。 对于每个连接请求,选择未包括在其源节点或其多个目的地节点中的一组所有网络节点。 如果节点是未选择的节点的steiner树的节点顶点,则使用与所选节点元素相对应的数组元素来创建位数组,否则数组元素的值为0.每个数组被处理 作为一个字串,被认为是由遗传算法操纵的人口成员。 通过计算遍历由位串表示的路由的成本来评估人口成员的适应度。 该方法能够路由多个多点连接请求,并且选择整体最优解。