利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.011 秒)

    COMPRESSING SINGLY LINKED LISTS SHARING COMMON NODES FOR MULTI-DESTINATION GROUP EXPANSION
    2.
    发明公开
    COMPRESSING SINGLY LINKED LISTS SHARING COMMON NODES FOR MULTI-DESTINATION GROUP EXPANSION 有权
    压缩个别联公共节点列出了用多目标扩展

    公开(公告)号：EP2997702A1

    公开(公告)日：2016-03-23

    申请号：EP14728776.7

    申请日：2014-05-06

    申请人： Cisco Technology, Inc.

    发明人： LI, Mingzhe

    IPC分类号： H04L12/761 ,  H04L12/931

    CPC分类号： H04L12/18 ,  G06F3/0484 ,  G06T11/60 ,  H04L45/16 ,  H04L49/201

    摘要： A multi-destination expansion table is stored that comprises a first database containing data representing all nodes in a singly linked list that is a superset of nodes for a plurality of multi-destination groups and a second database storing data representing multi- destination group specific arcs across one or more nodes. The singly linked list is traversed to determine how to replicate a packet for a particular multi-destination group. The packet is replicated based on interface data stored in the first database associated with the current node address. When a match is found in the second database, a next node address is determined from the second database. When a match is not found in the second database, a next node address determined from accessing the first database. Traversing of the singly linked list is terminated when the next node address is determined to be invalid or null.

    IMPROVING HARDWARE UTILIZATION FOR A BIDIRECTIONAL ACCESS CONTROL LIST IN A LOW LATENCY HIGH-THROUGHPUT NETWORK
    10.
    发明公开
    IMPROVING HARDWARE UTILIZATION FOR A BIDIRECTIONAL ACCESS CONTROL LIST IN A LOW LATENCY HIGH-THROUGHPUT NETWORK 有权
    改进的硬件使用双向访问控制列表在低和高吞吐量时延网络

    公开(公告)号：EP2878113A2

    公开(公告)日：2015-06-03

    申请号：EP13742079.0

    申请日：2013-07-09

    申请人： Cisco Technology, Inc.

    发明人： LI, Mingzhe ,  FULLI, Alessandro ,  SUBAGIO, Putu Harry ,  HUANG, Chih-Tsung

    IPC分类号： H04L29/06

    CPC分类号： H04L63/101 ,  G06F17/30595 ,  H04L63/0236

    摘要： A method in an example embodiment includes creating a first search key from variable data of a message received in a network environment, creating a second search key from constant data of the message, identifying a first database entry in a first database based on the first search key, and identifying a second database entry in a second database based on the second search key. The method can also include performing an action associated with the first database entry when a correlation is identified between the first and second database entries. In specific embodiments, the variable data are modified and the constant data are not modified. The first search key can be created prior or subsequent to forwarding the message. In further embodiments, the correlation is identified when an offset of the first database entry is the same as an offset of the second database entry.

    摘要翻译： 在一个示例实施例包括创建从在网络环境中接收到的消息的可变数据的第一搜索键，产生从该消息的恒定数据的第二搜索键，基于所述第一搜索识别在第一数据库中的第一数据库条目的方法 键，以及基于第二搜索键在第二数据库的第二个数据库条目。 因此，该方法可包括执行在与所述第一数据库条目当相关性的第一和第二数据库条目之间识别相关联的动作。 在具体的实施方案中，可变数据被修改和常数数据不会被修改。 第一搜索键可以之前或之后将所述消息转发来创建。 在进一步的实施例中，相关性被确定当第一数据库条目的偏移量相同的第二数据库条目的偏移量。