利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

73 条记录 (耗时 0.023 秒)

    CONNECTIONS AND ACCESSES FOR HIERARCHICAL PATH COMPUTATION ELEMENT (PCE)
    2.
    发明公开
    CONNECTIONS AND ACCESSES FOR HIERARCHICAL PATH COMPUTATION ELEMENT (PCE) 审中-公开

    公开(公告)号：EP4207701A2

    公开(公告)日：2023-07-05

    申请号：EP22193287.4

    申请日：2017-07-06

    申请人： Huawei Technologies Co., Ltd.

    发明人： CHEN, Huaimo

    IPC分类号： H04L41/12 ,  H04L43/08 ,  H04L45/02

    摘要： Disclosed herein are various embodiments for constructing an abstract domain topology. In one embodiment, a Path Computation Element (PCE) is configured as a parent PCE to at least one child PCE. Each of the child PCEs is responsible for providing path computational services for a domain. Communication is established between the parent PCE and the at least one child PCE. The parent PCE receives from each of its child PCEs domain connection information corresponding to the domain of each child PCE. The parent PCE builds and maintains an abstract domain topology based on the domain connection information that it receives from its child PCEs. In one embodiment, the domain connection information is communicated from the child PCE to the parent PCE by adding a new notificationtype (NT) and notification-value (NV) to a notification object in a Path Computation Element Communication Protocol (PCEP) notification message.

    SYSTEM AND METHODS FOR COMPUTING FLOODING TOPOLOGY
    10.
    发明公开
    SYSTEM AND METHODS FOR COMPUTING FLOODING TOPOLOGY 审中-实审

    公开(公告)号：EP4319092A3

    公开(公告)日：2024-03-27

    申请号：EP23200060.4

    申请日：2020-07-02

    申请人： Huawei Technologies Co., Ltd.

    发明人： CHEN, Huaimo

    IPC分类号： H04L45/02 ,  H04L45/16 ,  H04L45/00

    摘要： Methods of computing a flooding topology (FT) for a network are presented. The methods include a process for computing a FT that includes all nodes in the network and a process for ensuring that all nodes in the FT have at least two links in the FT. Some of the methods minimize a number of links of the nodes in the FT. Some of the methods also constrain some of the nodes in the FT to a maximum number of links. Some of the methods compute a first FT for nodes whose maximum number of links in the FT equal their number of links in the network, then compute a second FT for remaining nodes in the network, then combines the two FTs to compute a complete FT for the network.