Loop prevention technique for MPLS using two labels

    公开(公告)号:US20060164975A1

    公开(公告)日:2006-07-27

    申请号:US11046163

    申请日:2005-01-26

    IPC分类号: H04L12/28 G08C15/00

    摘要: A fast reroute (FRR) technique is implemented at the edge of a network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device 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. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.

    Method and apparatus for providing faster convergence for redundant sites
    13.
    发明授权
    Method and apparatus for providing faster convergence for redundant sites 有权
    为冗余站点提供更快收敛的方法和装置

    公开(公告)号:US07505402B2

    公开(公告)日:2009-03-17

    申请号:US11159719

    申请日:2005-06-23

    IPC分类号: G06F11/00 G01R31/08 H04L12/56

    摘要: A method, apparatus and computer program product for providing convergence for a dual-homed site in a network is presented. An occurrence of a failure between a first Provider Edge (PE) device and a first Customer Edge (CE) device in communication with a dual-homed site is detected. A determination is made whether an alternate route exists for the dual-homed site in a routing table associated with the first PE device. When an alternate route exists then a routing entry associated with the first CE device in a routing table of said first PE device is kept from being deleted for a predetermined amount of time, the routing table is modified to reference the alternate route, the routing entry is rewritten to perform a POP and lookup in a VRF table of the first PE device, and the routing entry is deleted after the predetermined amount of time has elapsed.

    摘要翻译: 提出了一种用于为网络中的双归位点提供融合的方法,装置和计算机程序产品。 检测到与双归位置通信的第一提供商边缘(PE)设备和第一客户边缘(CE)设备之间的故障的发生。 确定在与第一PE设备相关联的路由表中是否存在用于双归属站点的备用路由。 当存在替代路由时,在所述第一PE设备的路由表中与第一CE设备相关联的路由条目不被删除预定的时间量,所述路由表被修改以引用所述替代路由,所述路由条目 被重写以在第一PE设备的VRF表中执行POP和查找,并且在经过预定时间量之后删除路由条目。

    DISTRIBUTED STATEFUL PATH COMPUTATION ELEMENT OVERLAY ARCHITECTURE
    16.
    发明申请
    DISTRIBUTED STATEFUL PATH COMPUTATION ELEMENT OVERLAY ARCHITECTURE 有权
    分布式状态计算元素重叠结构

    公开(公告)号:US20130336159A1

    公开(公告)日:2013-12-19

    申请号:US13524071

    申请日:2012-06-15

    IPC分类号: H04L12/28

    CPC分类号: H04L45/50 H04L45/04

    摘要: In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.

    摘要翻译: 在一个实施例中,计算机网络中的特定设备维护本地拥有的隧道状态表,并且连接分布式散列表(DHT)环。 此外,本地拥有的隧道状态表与DHT环的其他设备共享,以建立DHT拥有的隧道状态表。 特定设备(和其他设备)根据DHT环确定针对流量工程数据库(TED)的特定部分的链路状态通告(LSA)的所有权。 因此,当特定设备(或任何设备)使用本地TED计算隧道的路径时,特定设备可以请求允许沿着所计算的路径使用资源,这些资源在特定LSA的特定LSA中被从该特定LSA的所有者通告 由特定设备拥有。

    TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT
    17.
    发明申请
    TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT 有权
    一个稳定的路径计算元素计算的隧道的基于时间的调度

    公开(公告)号:US20130336126A1

    公开(公告)日:2013-12-19

    申请号:US13524751

    申请日:2012-06-15

    IPC分类号: H04L12/24 H04L12/26

    摘要: In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.

    摘要翻译: 在一个实施例中,计算机网络中的路径计算元件(PCE)接收一个或多个路径计算请求(PCReq),并记录每个PCReq的时间和相应的请求带宽。 基于该信息,PCE可以确定计算机网络的流量简档,并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库(TED)。 因此,在特定时间之前,PCE可以在特定时间内确定隧道在业务简档内的布置。

    ORDERED FLOODING REQUESTS FOR PATH COMPUTATION ELEMENTS
    18.
    发明申请
    ORDERED FLOODING REQUESTS FOR PATH COMPUTATION ELEMENTS 有权
    路径计算要素的订购流水要求

    公开(公告)号:US20130336109A1

    公开(公告)日:2013-12-19

    申请号:US13524057

    申请日:2012-06-15

    IPC分类号: H04L12/24 H04L12/26

    摘要: In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update.

    摘要翻译: 在一个实施例中,计算机网络中的有状态路径计算元件(PCE)确定需要路由至少一个阈值数量的隧道,并且作为响应,从确定的一组路由器触发路由更新。 为了更新路由器集合的路由信息​​和可用的网络资源,状态PCE然后可以基于更新来计算隧道。

    MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS
    20.
    发明申请
    MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS 有权
    管理具有多个现场区域路由器的本地计算机网络的主机路由

    公开(公告)号:US20130013809A1

    公开(公告)日:2013-01-10

    申请号:US13176301

    申请日:2011-07-05

    IPC分类号: G06F15/173

    CPC分类号: H04L45/22 H04L45/64

    摘要: In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.

    摘要翻译: 在一个实施例中,具有多个FAR的本地计算机网络(例如,网状网络)中的特定场区域路由器(FAR)将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。 本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量,并且在多个FAR之间建立隧道覆盖。 一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组,并且响应于特定的FAR没有到该特定设备的主机路由,它将隧道覆盖上的分组转发到多个 本地计算机网络的FAR。