Method and apparatus for managing network

    公开(公告)号:US11489754B2

    公开(公告)日:2022-11-01

    申请号:US17251464

    申请日:2019-07-09

    发明人: Nicolas Gresset

    摘要: A method for method for managing a computer network is proposed, which comprises: performing data collection configuration for at least one network node of the computer network belonging to a set of one or more network nodes corresponding to a first depth level of a routing tree, the data collection configuration comprising: receiving respective first configuration data from at least one child node in the routing tree of the at least one network node of the computer network, wherein the at least child node corresponds to a second depth level of the routing tree which immediately follows the first depth level in a sequence of depth levels of the routing tree, and generating second configuration data based on the received first configuration data.

    INFORMATION PROCESSING APPARATUS, PACKET GENERATION METHOD, SYSTEM, AND PROGRAM

    公开(公告)号:US20220345396A1

    公开(公告)日:2022-10-27

    申请号:US17640570

    申请日:2020-07-21

    申请人: NEC Corporation

    发明人: Anan SAWABE

    IPC分类号: H04L45/00 H04L45/02 H04L45/48

    摘要: In order to provide an information processing apparatus that easily finds a network configuration corresponding to characteristics of a terminal to be connected, the information processing apparatus includes a model generation section and a specifying section, the model generation section being configured to generate a traffic pattern generation model, based on learning of a traffic pattern of a terminal, and the specifying section being configured to specify traffic for an output of the traffic pattern generation model, based on virtual traffic in the traffic pattern generation model. The information processing apparatus may further include a packet generation section configured to generate a packet, based on the specified traffic.

    Packet forwarding based on geometric location

    公开(公告)号:US11451475B2

    公开(公告)日:2022-09-20

    申请号:US16721171

    申请日:2019-12-19

    摘要: The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.

    Flow-zone switching
    68.
    发明授权

    公开(公告)号:US11418460B2

    公开(公告)日:2022-08-16

    申请号:US16613354

    申请日:2018-05-14

    申请人: Roger B. Marks

    发明人: Roger B. Marks

    摘要: Flow-zone switching provides for the switching of frames through a network, basing forwarding decisions on location and flow information encoded in the frames, such as in the source and destination addresses. Various address formats are disclosed, supporting transfer of packet data among data switches as well as among endpoints. Systems, apparatuses, and methods are disclosed.

    Optimized objective function for routing determination

    公开(公告)号:US11356365B2

    公开(公告)日:2022-06-07

    申请号:US16868418

    申请日:2020-05-06

    申请人: Itron Global SARL

    摘要: Techniques are directed to determining a rank value associated with a first network node. An example method includes determining a second network node indicated as being a preferred parent network node for the first network node. A first rank value is processed to determine a second rank value, the first rank value corresponding to a path from the second network node to a destination network node, including rounding up the first rank value in a predetermined manner to at least a second next higher integral rank value than the first rank value, to determine the second rank value. The second rank value is processed with at least a third rank value to determine the rank value associated with the first network node, the third rank value associated with a path from one of a plurality of candidate parent network nodes, for the first network node, to the destination network node.