会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • SYSTEM, METHOD, AND NETWORK NODE FOR CHECKING THE CONSISTENCY OF NODE RELATIONSHIP INFORMATION IN THE NODES OF A STRONGLY CONNECTED NETWORK
    • 系统,方法和网络节点,用于检查密钥相关信息在强连接网络中的一致性
    • WO2008110461A1
    • 2008-09-18
    • PCT/EP2008/052419
    • 2008-02-28
    • TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)BOSNEAG, Anne-Marie
    • BOSNEAG, Anne-Marie
    • H04L12/24
    • H04L41/12
    • A system, method, and network node (24-1 ) for checking the consistency of node relations in the nodes of a strongly connected network (20). An initiating network node (24-2) initiates a request (31 ) to check the consistency of node relations in the network. Each receiving node that receives the request determines whether defined relations received from the initiating node are symmetrically reflected by defined relations stored in the receiving network node. A local result (35) is temporarily stored. The receiving node also identifies other nodes (24-3), if any, with which the receiving node has defined relations, and sends consistency-checking requests (39) to the identified nodes. As responses (40) are received from all of the identified nodes, the receiving network node aggregates the results with the stored local result and sends an aggregated response (43) to the initiating node reporting the consistency or inconsistency of all of the receiving node's defined relations.
    • 一种用于检查强连接网络(20)的节点中的节点关系的一致性的系统,方法和网络节点(24-1)。 发起网络节点(24-2)发起请求(31)来检查网络中节点关系的一致性。 接收请求的每个接收节点确定从起始节点接收到的定义关系是否由存储在接收网络节点中的定义关系对称地反映。 暂时存储本地结果(35)。 接收节点还识别与接收节点具有定义关系的其他节点(24-3)(如果有的话),并且向所识别的节点发送一致性检查请求(39)。 由于从所有所识别的节点接收到响应(40),接收网络节点将结果与存储的本地结果进行聚合,并向发起节点发送聚合响应(43),报告所有接收节点定义的一致性或不一致性 关系。
    • 5. 发明申请
    • DISSEMINATION OF NETWORK MANAGEMENT TASKS IN A DISTRIBUTED COMMUNICATION NETWORK
    • 分布式通信网络中网络管理任务的传播
    • WO2008110460A2
    • 2008-09-18
    • PCT/EP2008052418
    • 2008-02-28
    • ERICSSON TELEFON AB L MBOSNEAG ANNE-MARIECLEARY DAVID
    • BOSNEAG ANNE-MARIECLEARY DAVID
    • H04L12/24
    • H04L41/042
    • A system, method, and network node (14) for distributing a network management task from a source to a plurality of network nodes in a traffic network (10). When a task is received in a network node (14), the node determines whether the task is to be forwarded to other network nodes. If so, the receiving network node utilizes application-level knowledge of the functionality of each neighboring node to select one or more neighboring nodes that need to receive the task. The receiving network node then utilizes a functional management overlay layer (12) known as the Data Discovery and Distribution, D 3 , layer to communicate the task to the selected neighboring nodes. The network node receives responses from the neighboring nodes, aggregates the responses with local information, and sends an aggregated response to the source.
    • 一种用于将网络管理任务从源分配到交通网络(10)中的多个网络节点的系统,方法和网络节点(14)。 当在网络节点(14)中接收到任务时,节点确定任务是否要被转发到其他网络节点。 如果是,则接收网络节点利用每个相邻节点的功能的应用级知识来选择需要接收该任务的一个或多个相邻节点。 接收网络节点随后利用被称为数据发现和分配,功能管理覆盖层(12)d 3 ,层任务传达给所选择的相邻节点。 网络节点接收来自相邻节点的响应,用本地信息聚合响应,并向源发送聚合响应。
    • 8. 发明申请
    • DISCOVERY OF DISCONNECTED COMPONENTS IN A DISTRIBUTED COMMUNICATION NETWORK
    • 在分布式通信网络中发现断开连接的组件
    • WO2008110462A2
    • 2008-09-18
    • PCT/EP2008052423
    • 2008-02-28
    • ERICSSON TELEFON AB L MBOSNEAG ANNE-MARIE
    • BOSNEAG ANNE-MARIE
    • H04L12/24
    • H04L41/12H04W24/00
    • A system, method, and network node for discovering network nodes and management information distributed in different strongly connected components, SCCs, (21, 22) in a traffic network (10). When a network node in a first SCC (21 ) receives a request at an application layer (13) for network management information, the node determines whether it can reach other nodes at the application layer. If not, the node utilizes a functional overlay layer known as the Data Discovery and Distribution, D 3 , layer (12) to identify and select a set of neighboring nodes to receive the request. The selection procedure provides good probabilistic guarantees that the selected neighbors will include at least one neighbor in a different SCC (22). The node sends (37) the request to the selected neighboring nodes at the D 3 layer (12).
    • 一种系统,方法和网络节点,用于发现分布在交通网络(10)中的不同强连接组件SCC(21,22)中的网络节点和管理信息。 当第一SCC(21)中的网络节点在应用层(13)接收到用于网络管理信息的请求时,节点确定其是否可以到达应用层的其他节点。 如果不是,则节点利用被称为数据发现和分发的层(12)的功能覆盖层来识别和选择一组相邻节点以接收该请求。 选择过程提供了良好的概率保证,所选择的邻居将在不同SCC(22)中包括至少一个邻居。 节点将请求(37)发送(D)到D< 3>层(12)上的选定的相邻节点。