中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

152 records (took 0.03 seconds)

    LOOP PREVENTION TECHNIQUES USING ENCAPSULATION MANIPULATION OF IP/MPLS FIELD
    92.
    发明公开
    LOOP PREVENTION TECHNIQUES USING ENCAPSULATION MANIPULATION OF IP/MPLS FIELD 有权
    环路预防技术，再加上EINKAPSELUNGSBEHANDLUNG IP / MPLS领域

    公开(公告)号：EP1867106A2

    公开(公告)日：2007-12-19

    申请号：EP06749167.0

    申请日：2006-04-03

    Applicant: Cisco Technology, Inc.

    Inventor： SCUDDER, John Galen ,  WARD, David D. ,  FILSFILS, Clarence

    IPC: H04L12/28

    CPC classification number: H04L45/22 ,  H04L45/02 ,  H04L45/28 ,  H04L45/50 ,  H04L47/2408

    Abstract: A fast reroute (FRR) technique is implemented at the edge of a computer network. In accordance with the technique, if an edge device (160) detects a node or link failure that prevents it from communicating with a neighboring routing domain (110), the edge device reroutes at least some data packets addressed to that domain to a backup edge device (165) which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being 'protected' (i.e., rerouted) data packets before they are forwarded to the backup edge device (700b). To that end, the edge device incorporates an identifier into the rerouted data packets to indicate that the packets are being FRR re-routed. The identifier may be a predetermined value stored at a known location in the rerouted packets' encapsulation headers, such as in their MPLS or IP headers. Upon receiving a data packet containing the identifier, the backup edge device is not permitted to reroute the packet a second time.

    AUTOMATIC ROUTE TAGGING OF BGP NEXT-HOP ROUTES IN IGP
    93.
    发明公开
    AUTOMATIC ROUTE TAGGING OF BGP NEXT-HOP ROUTES IN IGP 有权
    TAGGING BGP下一跳航路IN A IGP路由自动

    公开(公告)号：EP1832056A2

    公开(公告)日：2007-09-12

    申请号：EP05855668.9

    申请日：2005-12-27

    Applicant: Cisco Technology, Inc.

    Inventor： FILSFILS, Clarence ,  PREVIDI, Stefano, B. ,  VASSEUR, Jean-Philippe

    IPC: H04L12/28

    CPC classification number: H04L45/04 ,  H04L45/02 ,  H04L45/026 ,  H04L45/28 ,  H04L45/52

    Abstract: A technique configures an intermediate network node to automatically determine whether a route advertised by a routing protocol is important for fast convergence in a computer network. As used herein, an important route needed for fast convergence is a route advertised by the routing protocol, such as an exterior gateway routing protocol (EGP) process executing on the node, as a next-hop address, since external connectivity relies on such a route. Notably, the EGP process interacts with an interior gateway routing protocol (IGP) process executing on the node to identify the route as an important route. Identification of an important route, in turn, allows IGP to process the route in a high priority fashion, thereby facilitating fast convergence.

    METHOD AND APPARATUS FOR GENERATING ROUTING INFORMATION IN A DATA COMMUNICATIONS NETWORK
    94.
    发明公开
    METHOD AND APPARATUS FOR GENERATING ROUTING INFORMATION IN A DATA COMMUNICATIONS NETWORK 有权
    方法和设备的数据通信电网发电机ROUTING INFORMATION

    公开(公告)号：EP1673901A1

    公开(公告)日：2006-06-28

    申请号：EP04795045.6

    申请日：2004-10-13

    Applicant: Cisco Technology, Inc.

    Inventor： BRYANT, Stewart Frederick ,  SHAND, Ian Michael Charles ,  PREVIDI, Stefano Benedetto ,  FILSFILS, Clarence

    IPC: H04L12/26

    CPC classification number: H04L45/123 ,  H04L45/02 ,  H04L45/023

    Abstract: A method and apparatus are disclosed for generating routing information in a data communications network. A first network element (such as a router) receives information relating to a second network element, such as another node or a network link. In response, the first network element determines whether the information relating to the second network element indicates a change in the network. When information relating to a second network element indicates a change in the network, the first network element determines a new shortest path through the network from the first network element for each network element in the network. After a delay, the first network element updates routing information for the first network element based on the new shortest path for the first network element. Preferably the delay is proportional to the distance of the first network element from the second network element.

    SEAMLESS SEGMENT ROUTING
    98.
    发明公开
    SEAMLESS SEGMENT ROUTING 审中-公开

    公开(公告)号：EP3896922A1

    公开(公告)日：2021-10-20

    申请号：EP21178606.6

    申请日：2014-03-14

    Applicant: Cisco Technology, Inc.

    Inventor： FILSFILS, Clarence ,  WARD, David Delano ,  BRYANT, Stewart Frederick ,  FROST, Daniel ,  NAINAR, Nagendra Kumar ,  PIGNATARO, Carlos M.

    IPC: H04L12/715 ,  H04L12/723 ,  H04L12/741

    Abstract: A method is described including receiving a packet and a segment ID stack at a first segment routing enabled node in a first area of a subdivided segment routing enabled network, wherein the segment ID stack comprises a plurality of segment IDs. At least a first segment ID of the plurality of segment IDs comprises an area segment ID corresponding to a second area of the subdivided segment routing enabled network and at least a second segment ID of the plurality of segment IDs corresponds to a multi-hop path to a node in the subdivided segment routing enabled network. A next hop egress interface of the first segment routing enabled node is selected based on the first segment ID and the packet and the segment ID stack are forwarded via the selected next hop egress interface.

Patent Agency Ranking