中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

245 records (took 0.038 seconds)

    MITIGATING NEIGHBOR DISCOVERY-BASED DENIAL OF SERVICE ATTACKS
    101.
    发明公开
    MITIGATING NEIGHBOR DISCOVERY-BASED DENIAL OF SERVICE ATTACKS 审中-公开
    ABSCHWÄCHUNGVON DIENSTVERWEIGERUNGSANGRIFFEN AUF GRUNDLAGE VON NACHBARERKENNUNG

    公开(公告)号：EP3070902A2

    公开(公告)日：2016-09-21

    申请号：EP16156779.7

    申请日：2016-02-22

    Applicant: Cisco Technology, Inc.

    Inventor： THUBERT, Pascal ,  LEVY-ABEGNOLI, Eric ,  WETTERWALD, Patrick

    IPC: H04L29/06 ,  H04L29/12 ,  H04L12/743

    CPC classification number: H04L63/0236 ,  H04L45/74 ,  H04L45/7453 ,  H04L61/103 ,  H04L61/6059 ,  H04L63/1425 ,  H04L63/1458

    Abstract: In one embodiment, a device in a network determines whether a destination address of a packet received by the device is within a neighbor discovery (ND) cache of the device. The device determines whether the destination address is not in a set of addresses used to generate an address lookup array or possibly in the set of addresses used to generate the address lookup array, in response to determining that the destination address of the packet is not within the ND cache. The device performs address resolution for the destination address of the packet, in response to determining that the destination address of the packet is possibly in the set of addresses used to generate the address lookup array.

    Abstract translation: 在一个实施例中，网络中的设备确定由设备接收的分组的目的地地址是否在设备的邻居发现（ND）高速缓存内。 响应于确定分组的目的地址不在内部，该设备确定目的地址是否不在用于生成地址查找阵列的地址集合中，或者可能在用于生成地址查找阵列的地址集合中。 ND缓存。 响应于确定分组的目的地地址可能在用于生成地址查找阵列的地址集合中，该设备对分组的目的地地址执行地址解析。

    ADDRESS AUTOCONFIGURATION USING BLOOM FILTER PARAMETERS FOR UNIQUE ADDRESS COMPUTATION
    103.
    发明公开
    ADDRESS AUTOCONFIGURATION USING BLOOM FILTER PARAMETERS FOR UNIQUE ADDRESS COMPUTATION 审中-公开
    ADRESS-AUTOKONFIGURATION MIT BLOOMFILTER-PARAMETERN ZUR EINDEUTIGEN ADRESSBERECHNUNG

    公开(公告)号：EP3010208A1

    公开(公告)日：2016-04-20

    申请号：EP15189182.7

    申请日：2015-10-09

    Applicant: Cisco Technology, Inc.

    Inventor： LEVY-ABEGNOLI, Eric Michel ,  THUBERT, Pascal ,  WETTERWALD, Patrick

    IPC: H04L29/12 ,  H04L12/743

    CPC classification number: H04L41/0803 ,  H04L43/10 ,  H04L45/7453 ,  H04L61/2092 ,  H04L61/6059

    Abstract: In one embodiment, a method comprises generating, by a network device, a Bloom filter bit vector based on applying Bloom filter parameters to a candidate address autoconfigured by the network device; and selectively repeating, by the network device, the autoconfiguring of the candidate address until the corresponding Bloom filter bit vector includes a bit set at a reserved bit vector position that is reserved for the network device, the reserved bit vector position providing uniqueness of the candidate address within a link layer domain.

    Abstract translation: 在一个实施例中，一种方法包括由网络设备根据将布隆过滤器参数应用于由网络设备自动配置的候选地址来生成布隆过滤器比特向量; 并且由所述网络设备选择性地重复所述候选地址的自动配置，直到所述对应的Bloom过滤器比特向量包括在为所述网络设备保留的保留比特向量位置中设置的比特，所述保留位向量位置提供所述候选者的唯一性 链路层域内的地址。

    SCHEDULE-BASED PRIORITIZATION IN CONTENTION-BASED SHARED-MEDIA COMPUTER NETWORKS
    104.
    发明公开
    SCHEDULE-BASED PRIORITIZATION IN CONTENTION-BASED SHARED-MEDIA COMPUTER NETWORKS 审中-公开
    计划基于优先排序与共享的媒体竞争的计算机网络

    公开(公告)号：EP2974184A1

    公开(公告)日：2016-01-20

    申请号：EP14713301.1

    申请日：2014-03-04

    Applicant: Cisco Technology, Inc.

    Inventor： THUBERT, Pascal ,  WETTERWALD, Patrick ,  DIDIER, Paul

    IPC: H04L12/833

    CPC classification number: H04L47/27 ,  H04L45/24 ,  H04L47/2458 ,  H04L47/28 ,  H04W74/04

    Abstract: In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.

    HIERARCHAL LABEL DISTRIBUTION AND ROUTE INSTALLATION IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS AT MULTIPLE HIERARCHAL LEVELS FOR RING TOPOLOGIES
    105.
    发明公开
    HIERARCHAL LABEL DISTRIBUTION AND ROUTE INSTALLATION IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS AT MULTIPLE HIERARCHAL LEVELS FOR RING TOPOLOGIES 审中-公开
    分层标签分配和路由安装在一个循环中免布线拓扑中使用路由负债表上的环形拓扑多层次级别

    公开(公告)号：EP2896165A1

    公开(公告)日：2015-07-22

    申请号：EP13770756.8

    申请日：2013-09-13

    Applicant: Cisco Technology, Inc.

    Inventor： THUBERT, Pascal ,  BELLAGAMBA, Patrice ,  ANTEUNIS, Dirk

    IPC: H04L12/711 ,  H04L12/703 ,  H04L12/705 ,  H04L12/723 ,  H04L12/715

    Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.

    METHOD AND DEVICES FOR PROTECTING NEIGHBOR DISCOVERY CACHE AGAINST DOS ATTACKS
    107.
    发明公开
    METHOD AND DEVICES FOR PROTECTING NEIGHBOR DISCOVERY CACHE AGAINST DOS ATTACKS 有权
    方法和设备防范NEIGHBORHOOD检测CACHE DoS攻击

    公开(公告)号：EP2845365A1

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

    申请号：EP13722914.2

    申请日：2013-04-29

    Applicant: Cisco Technology, Inc.

    Inventor： THUBERT, Pascal ,  LEVY-ABEGNOLI, Eric ,  RIBIERE, Vincent, J.

    IPC: H04L29/06 ,  H04L12/751

    CPC classification number: H04L63/1458 ,  G06F21/10 ,  H04L45/742 ,  H04L61/103 ,  H04L61/6009 ,  H04L61/6059 ,  H04L2463/142

    Abstract: In one embodiment, a device (e.g., switch or registry) maintains a binding table for all internet protocol (IP) addresses in a particular subnet associated with the device, and in response to receiving a neighbor solicitation (NS) lookup message from a router for a particular address, determines whether the particular address is within the binding table. When the particular address is not within the binding table, the device causes the router to not store the particular address in a neighbor discovery (ND) cache at the router (e.g., by responding to clear the cache, or ignoring to prevent state from being created). In another embodiment, the ND-requesting router ensures that the particular address is not kept in an ND cache at the router in response to the device indicating that the particular address is not within its binding table (e.g., an explicit response to clear, or absence of instruction to store state).

    Abstract translation: 在一个实施方式中，一个设备（例如，开关或注册表）与所述设备相关联的特定子网保持用于所有互联网协议绑定表（IP）地址，并且响应于从路由器接收邻居请求（NS）查找消息 对于一个特定的地址，确定矿山是否特定地址绑定表内。 当特定地址不是绑定表内，则装置使路由器到特定的地址不存储在邻居发现在路由器（例如，（ND）的高速缓存，以响应于清除缓存，或忽略以防止状态 创建）。 在另一个实施方案中，ND请求路由器确保DASS死特定地址不能保持在路由器一个ND缓存响应于所述设备的指示DASS模具的特殊的地址不是其绑定表（例如内，在明确的响应被清除，或 缺席指令的存储状态）。

    ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING
    109.
    发明公开
    ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING 有权
    交变DOWN路径的布线向无环GRAPHICS

    公开(公告)号：EP2548341A1

    公开(公告)日：2013-01-23

    申请号：EP11756658.8

    申请日：2011-03-15

    Applicant: Cisco Technology, Inc.

    Inventor： WETTERWALD, Patrick ,  THUBERT, Pascal ,  VASSEUR, Jean-Phillippe

    IPC: H04L12/28

    CPC classification number: H04L41/12 ,  H04L45/02 ,  H04L45/48 ,  Y04S40/164

    Abstract: In one embodiment, a node "N" within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node "P" within the DAG, and, where P is not a DAG root, may determine a grandparent node "GP" as a parent node to the parent node P. The node N may then also select an alternate parent node "P'" that has connectivity to GP and N. N may then inform P and P' about prefixes reachable via N, and also about P' as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P' as an alternate parent node to P to reach the prefixes reachable via N, and P' may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.

Patent Agency Ranking