利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

9 条记录 (耗时 0.012 秒)

    PATH COMPUTATION METHOD AND APPARATUS, STORAGE MEDIUM, AND ELECTRONIC DEVICE
    2.
    发明公开
    PATH COMPUTATION METHOD AND APPARATUS, STORAGE MEDIUM, AND ELECTRONIC DEVICE 审中-公开

    公开(公告)号：EP4277424A1

    公开(公告)日：2023-11-15

    申请号：EP22806531.4

    申请日：2022-04-28

    申请人： ZTE Corporation

    发明人： XIONG, Quan

    IPC分类号： H04W76/10 ,  H04L45/122

    摘要： Provided in embodiments of the present disclosure are a path computation method and apparatus, a storage medium, and an electronic device. The method includes: computing, by a controller, a forwarding path and forwarding delay information according to an end-to-end delay requirement; and sending, by the controller, the forwarding path and the forwarding delay information to a device side. Accordingly, the problem that a network path or route computed based on a network graph cannot satisfy service requirements in the related art can be solved, and a determined target path can satisfy the service requirements.

    CONNECTIVITY AWARE PATH FINDING
    6.
    发明公开
    CONNECTIVITY AWARE PATH FINDING 审中-公开

    公开(公告)号：EP4401379A1

    公开(公告)日：2024-07-17

    申请号：EP24151983.4

    申请日：2024-01-15

    申请人： ECI Telecom Ltd.

    发明人： SHEM-TOV, Ziv ,  GELMAN, Efraim ,  HECHT, Inbal ,  EZRA, Shirel

    IPC分类号： H04L45/02 ,  H04L41/12 ,  H04L45/122 ,  H04L45/18 ,  H04L45/42

    CPC分类号： H04L45/02 ,  H04L45/122 ,  H04L45/42 ,  H04L45/18 ,  H04L41/12

    摘要： Systems and methods are disclosed for configuring a communication network to satisfy a set of demands. A network management system can obtain a network graph representing the communication network, connectivity relationship that indicates valid pairs of edges for each vertex in the network graph, and a structure that lacks zero divisors. The network management system can use the network graph, connectivity relationship, and structure to determine a path length for which a valid path connecting a source vertex and a terminal vertex exists. The path length can be determined using a dynamic programming approach that associates an element of the structure with the collection of paths connecting the source vertex and the terminal vertex. The network management system can then use the network graph, connectivity relationship, and structure to determine a valid path of the path length that connects the source vertex and the terminal vertex.

    CONFIGURING WIRELESS SENSOR NETWORK PATHS
    9.
    发明公开
    CONFIGURING WIRELESS SENSOR NETWORK PATHS 审中-公开

    公开(公告)号：EP3979597A1

    公开(公告)日：2022-04-06

    申请号：EP21199683.0

    申请日：2021-09-29

    申请人： Nokia Technologies Oy

    发明人： KRUSE, Johanna ,  MANDELLI, Silvio ,  KHOSRAVIRAD, Saeed Reza

    IPC分类号： H04L45/122 ,  H04L45/00 ,  H04W40/10 ,  H04W40/12 ,  H04W40/34

    摘要： To configure a wireless sensor network, a sink node receives from nodes first reports, a first report from a node indicating quality of service requirement of the node and battery information of the node, and second reports, a second report from a node indicating at least a signal strength of one signal received from another node. The information in the first reports and in the second reports are used for determining paths from the nodes to the sink node, wherein a path of a node is either a direct link from the node to the sink node or the path comprises at least one node acting as a cluster head between the node and the sink node.