利索-全球专利检索

  1. Login
  2. Sign Up

Search Results

171 records (took 0.021 seconds)

    LONGEST-PREFIX MATCHING DYNAMIC ALLOCATION IN COMMUNICATIONS NETWORK
    3.
    发明申请
    LONGEST-PREFIX MATCHING DYNAMIC ALLOCATION IN COMMUNICATIONS NETWORK 有权

    公开(公告)号：US20220231946A1

    公开(公告)日：2022-07-21

    申请号：US17174325

    申请日：2021-02-11

    Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

    Inventor： Colin TREGENZA DANCER

    IPC: H04L12/745 ,  H04L12/743 ,  H04L12/759

    Abstract: A method performed by a node of a communications network such as a virtual routing function or policy enforcement node comprises receiving at least one packet, such as an internet protocol packet having an associated address and obtaining one or more metrics. The method involves dynamically configuring a longest-prefix match process on the basis of at least the metric(s). The dynamically configured longest-prefix match process is used with the associated address to identify an action and the identified action is applied to the packet.

    ROUTING SPIKE MESSAGES IN SPIKING NEURAL NETWORKS
    4.
    发明申请
    ROUTING SPIKE MESSAGES IN SPIKING NEURAL NETWORKS 有权

    公开(公告)号：US20220156564A1

    公开(公告)日：2022-05-19

    申请号：US16951898

    申请日：2020-11-18

    Applicant: Micron Technology, Inc.

    Inventor： Dmitri Yudanov

    IPC: G06N3/063 ,  G06N3/04 ,  H04L12/751 ,  H04L12/759

    Abstract: The present disclosure is directed to routing of data in a spiking neural network (SNN) that performs in-memory operations. To model a computer-implemented SNN after a biological neural network, the architecture in the present disclosure involves different memory sections for storing inbound spike messages, synaptic connection data, and synaptic connection parameters. Embodiments are directed to routing spike messages through various router-based topologies. For example, spike messages may be multicasted to target routers using address tables.

    Route calculation method, route calculation apparatus and program
    7.
    发明授权
    Route calculation method, route calculation apparatus and program 有权

    公开(公告)号：US11196659B2

    公开(公告)日：2021-12-07

    申请号：US16969234

    申请日：2019-02-13

    Applicant: Nippon Telegraph and Telephone Corporation

    Inventor： Takuma Tsubaki ,  Mika Ishizuka ,  Hiroshi Inoue ,  Seisho Yasukawa

    IPC: H04L12/24 ,  H04L12/759 ,  H04L12/721 ,  H04W4/90

    Abstract: A computer executes a first determination procedure determining a first link which at least partially overlaps a disaster area representing a range reached by an influence of a predetermined disaster, among links constituting a network, a second determination procedure determining a second link which at least partially overlaps a road area representing a range of a road width of a predetermined road used to recover from the disaster, among the links constituting the network, a route search procedure searching for a plurality of routes from a start point node to an end point node constituting the network, a grouping procedure grouping the plurality of routes searched for by the route search procedure into groups depending on a first parameter value that is based on the first link included in the routes, a computing procedure computing, for each of the plurality of routes searched for by the route search procedure, a second parameter value that is based on the first link and the second link included in the routes, and a selecting procedure selecting a predetermined number of routes among one or more routes grouped into the same group on the basis of the second parameter value computed by the computing procedure for each of the groups grouped by the grouping procedure.

    Dynamic flooding for link state protocols
    9.
    发明授权
    Dynamic flooding for link state protocols 有权

    公开(公告)号：US11102106B2

    公开(公告)日：2021-08-24

    申请号：US15945038

    申请日：2018-04-04

    Applicant: Arista Networks, Inc.

    Inventor： Anthony Joseph Li

    IPC: H04L12/759 ,  H04L12/721 ,  H04L12/801 ,  H04L12/931 ,  H04L12/733 ,  H04L12/701 ,  H04L12/753 ,  H04L12/751 ,  H04L12/803

    Abstract: One or more embodiments of the invention may relate to a method, and/or non-transitory computer readable medium including instructions, for distributing link state information. In one or more embodiments of the invention, the method includes building a link state database on a plurality of network devices; electing a leader from among the plurality of network devices; computing, by the leader, a flooding topology; encoding, by the leader, the flooding topology to obtain an encoded flooding topology; distributing, by the leader, the encoded flooding topology to other network devices of the plurality of network devices.

Patent Agency Ranking