利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

35 条记录 (耗时 0.021 秒)

    Non-eligible distance vector protocol paths as backup paths
    11.
    发明授权
    Non-eligible distance vector protocol paths as backup paths 有权

    公开(公告)号：US09742670B2

    公开(公告)日：2017-08-22

    申请号：US14223871

    申请日：2014-03-24

    申请人： Alvaro E. Retana

    发明人： Alvaro E. Retana

    IPC分类号： H04L12/741 ,  H04L29/14 ,  H04L29/06

    CPC分类号： H04L45/74 ,  H04L69/14 ,  H04L69/40

    摘要： In one embodiment, non-eligible distance vector protocol paths are used as backup paths. In one embodiment, the distance vector protocol is Enhanced Interior Gateway Protocol (EIGRP) and unless a path is a feasible successor for a destination, the path is not eligible as a backup path. Therefore, if there is no feasible successor, there is no eligible backup path. One embodiment avoids an initial delay in finding a replacement path for traffic by determining and installing a non-eligible backup path (e.g., a path that is not a feasible successor) in one or more forwarding tables. In this manner, the router can immediately forward packets over this non-eligible backup path until, for example, forwarding in the network can converge in light of the primary path being no longer available.

    Non-eligible Distance Vector Protocol Paths as Backup Paths
    12.
    发明申请
    Non-eligible Distance Vector Protocol Paths as Backup Paths 有权
    不符合条件的距离矢量协议路径作为备份路径

    公开(公告)号：US20150271069A1

    公开(公告)日：2015-09-24

    申请号：US14223871

    申请日：2014-03-24

    申请人： Alvaro E. Retana

    发明人： Alvaro E. Retana

    IPC分类号： H04L12/741 ,  H04L29/06 ,  H04L12/933

    CPC分类号： H04L45/74 ,  H04L69/14 ,  H04L69/40

    摘要： In one embodiment, non-eligible distance vector protocol paths are used as backup paths. In one embodiment, the distance vector protocol is Enhanced Interior Gateway Protocol (EIGRP) and unless a path is a feasible successor for a destination, the path is not eligible as a backup path. Therefore, if there is no feasible successor, there is no eligible backup path. One embodiment avoids an initial delay in finding a replacement path for traffic by determining and installing a non-eligible backup path (e.g., a path that is not a feasible successor) in one or more forwarding tables. In this manner, the router can immediately forward packets over this non-eligible backup path until, for example, forwarding in the network can converge in light of the primary path being no longer available.

    摘要翻译： 在一个实施例中，不合格的距离矢量协议路径被用作备份路径。 在一个实施例中，距离矢量协议是增强内部网关协议（EIGRP），除非路径是目的地的可行后继，否则该路径不符合备用路径的条件。 因此，如果没有可行的继任者，则没有合格的备份路径。 一个实施例通过在一个或多个转发表中确定和安装不合格的备用路径（例如，不是可行后继者的路径）来避免找到用于业务的替换路径的初始延迟。 以这种方式，路由器可以通过该非合格备份路径立即转发数据包，直到例如网络中的转发可以根据主路径不再可用来收敛。

    Transparent automatic protection switching for a chassis deployment
    13.
    发明授权
    Transparent automatic protection switching for a chassis deployment 有权
    透明的自动保护切换，用于机箱部署

    公开(公告)号：US08203934B2

    公开(公告)日：2012-06-19

    申请号：US11445584

    申请日：2006-06-02

    申请人： Donnie V. Savage ,  Alvaro E. Retana ,  Steven E. Moore

    发明人： Donnie V. Savage ,  Alvaro E. Retana ,  Steven E. Moore

    IPC分类号： H04J3/14

    CPC分类号： H04J3/14 ,  H04L45/22 ,  H04L45/28 ,  H04L45/583

    摘要： Methods and apparatus for allowing a traffic level switch associated with an automatic protection switching (APS) topology to occur transparently and without reconverging routing are described. According to one aspect of the present invention, a method for providing protection switching configuration information associated with a router arrangement to includes identifying a first interface and a second interface of the router arrangement as an APS group. The method also includes providing information regarding the APS group to a process that implements a routing protocol. Providing the information regarding the group includes identifying the first interface as a primary interface and identifying the second interface as a backup interface that is arranged to protect the primary interface.

    摘要翻译： 描述了允许与自动保护切换（APS）拓扑相关联的流量级别交换透明地发生并且没有重新恢复路由的方法和装置。 根据本发明的一个方面，一种用于提供与路由器装置相关联的保护交换配置信息的方法，包括将路由器装置的第一接口和第二接口标识为APS组。 该方法还包括向实现路由协议的进程提供关于APS组的信息。 提供关于组的信息包括将第一接口标识为主接口，并将第二接口标识为被配置为保护主接口的备份接口。

    APPARATUS AND METHOD TO HIDE TRANSIT ONLY MULTI-ACCESS NETWORKS IN OSPF
    14.
    发明申请
    APPARATUS AND METHOD TO HIDE TRANSIT ONLY MULTI-ACCESS NETWORKS IN OSPF 有权
    在OSPF中仅隐藏多个接入网络的设备和方法

    公开(公告)号：US20110222550A1

    公开(公告)日：2011-09-15

    申请号：US13048731

    申请日：2011-03-15

    申请人： Yi Yang ,  Alvaro E. Retana ,  James L. Ng ,  Abhay Roy ,  Alfred C. Lindem ,  Sina Mirtorabi ,  Timothy M. Gage ,  Syed Khalid Raza

    发明人： Yi Yang ,  Alvaro E. Retana ,  James L. Ng ,  Abhay Roy ,  Alfred C. Lindem ,  Sina Mirtorabi ,  Timothy M. Gage ,  Syed Khalid Raza

    IPC分类号： H04L12/56

    CPC分类号： H04L45/021 ,  H04L45/02 ,  H04L45/025 ,  H04L45/54 ,  H04L45/60 ,  H04L47/10 ,  H04L63/0407

    摘要： In one embodiment, a Link State Advertisement (LSA) is received from a first router in a network at a second router in the network. The LSA advertises an address of an interface of the first router. The second router determines whether the LSA includes a transit-only identification that indicates the interface of the first router is a transit-only interface. If the LSA does not include a transit-only identification, the second router installs the advertised address of the interface of the first router in a Router Information Base (RIB) of the second router. If the LSA does include a transit-only identification, the second router declines to install the advertised address of the interface of the first router in the RIB of the second router.

    摘要翻译： 在一个实施例中，在网络中的第二路由器处从网络中的第一路由器接收链路状态通告（LSA）。 LSA通告第一个路由器的接口地址。 第二个路由器确定LSA是否包括仅表示第一个路由器的接口的只有传输的标识才是传输专用接口。 如果LSA不包含传输标识，则第二路由器将路由器信息库（RIB）中第一个路由器接口的通告地址安装在第二个路由器上。 如果LSA确实包含只有传输标识，则第二个路由器拒绝在第二个路由器的RIB中安装第一个路由器接口的通告地址。

    Method and apparatus to enable an IPe domain through EIGRP
    15.
    发明授权
    Method and apparatus to enable an IPe domain through EIGRP 有权
    通过EIGRP实现IPe域的方法和装置

    公开(公告)号：US07940668B2

    公开(公告)日：2011-05-10

    申请号：US12052861

    申请日：2008-03-21

    申请人： Alvaro E. Retana ,  Russell I. White ,  Yi Yang

    发明人： Alvaro E. Retana ,  Russell I. White ,  Yi Yang

    IPC分类号： H04J1/16

    CPC分类号： H04L45/12 ,  H04L45/02 ,  H04L45/025

    摘要： In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list.

    摘要翻译： 在一个实施例中，通过在通信网络中的连接节点处接收网络路由地址来发生用于防止通信网络中的路由信息​​的过度传输的系统，方法和装置，所述网络路由地址允许从 源节点到通信网络中的目的地节点; 确定覆盖到目的地节点的路径的最长汇总路由; 创建包括所述连接节点的所有邻居连接节点的摘要的列表; 以及向所述广播包含较短地址前缀的目的地地址的所有邻居节点发送所述网络路由地址的最长摘要路由的更新，其中，所述发送处理以从所述列表中输入的第一邻居连接节点顺序发生。

    Adjacency discovery through multicast and single-hop messaging
    17.
    发明授权
    Adjacency discovery through multicast and single-hop messaging 有权
    通过组播和单跳信息发现邻接发现

    公开(公告)号：US08964741B2

    公开(公告)日：2015-02-24

    申请号：US13164809

    申请日：2011-06-21

    申请人： Alvaro E. Retana ,  Thang Tat Do

    发明人： Alvaro E. Retana ,  Thang Tat Do

    IPC分类号： H04L12/28 ,  G06F15/177 ,  H04L12/751

    CPC分类号： H04L45/02

    摘要： A first node of a network may send a multicast discovery message comprising a domain identifier of the first node. The first node may also send a single-hop discovery message to one or more single-hop neighbors of the first node. The single-hop discovery message may comprise the domain identifier of the first node. A plurality of neighbor discovery messages may be received. At least one node of the network may be identified through the neighbor discovery messages. A level of trust may be determined for each identified node of the network based on at least one of the neighbor discovery messages.

    摘要翻译： 网络的第一节点可以发送包括第一节点的域标识符的多播发现消息。 第一节点还可以向第一节点的一个或多个单跳邻居发送单跳发现消息。 单跳发现消息可以包括第一节点的域标识符。 可以接收多个邻居发现消息。 可以通过邻居发现消息来识别网络的至少一个节点。 可以基于至少一个邻居发现消息来确定网络的每个已识别节点的信任级别。

    Transit prevention in hub-and-spoke topologies using link state protocols
    18.
    发明授权
    Transit prevention in hub-and-spoke topologies using link state protocols 有权
    使用链路状态协议的中心辐射拓扑中的传输预防

    公开(公告)号：US08400945B2

    公开(公告)日：2013-03-19

    申请号：US12207624

    申请日：2008-09-10

    申请人： Michael Barnes ,  Alvaro E. Retana ,  Paul Wells

    发明人： Michael Barnes ,  Alvaro E. Retana ,  Paul Wells

    IPC分类号： H04L12/28

    CPC分类号： H04L45/123 ,  H04L45/12 ,  H04L45/48

    摘要： In one embodiment, a method and apparatus of controlling transmission of data packets in a communications network includes designating all networking devices in a portion of the communications network as either hubs or spokes, communicating a link-state advertisement to each connected hub and spoke in the portion of the communications network, computing a shortest path tree at all the hubs and the spokes based on the link-state advertisement, the computing including truncating the shortest path tree at the hubs only for links leading from the spoke to the hub, creating a routing table at each of the hub and the spoke based on the truncated shortest path tree, and transmitting the data packets in the communications network based on the link-state advertisement. The shortest path tree includes all data transmission routes in the tree except links leading from a spoke to a hub.

    摘要翻译： 在一个实施例中，控制通信网络中的数据分组传输的方法和装置包括将通信网络的一部分中的所有网络设备指定为集线器或辐条，将链路状态广告传送到每个连接的集线器并在 通信网络的一部分，基于链路状态广告在所有集线器和轮辐处计算最短路径树，所述计算包括仅在从轮辐到集线器的链路上截断中心处的最短路径树，从而创建 基于截短的最短路径树在集线器和辐条的每一个处的路由表，以及基于链路状态广告在通信网络中发送数据分组。 最短路径树包括树中的所有数据传输路由，除了从辐条引导到集线器的链路。

    Adjacency Discovery Through Multicast and Single-Hop Messaging
    19.
    发明申请
    Adjacency Discovery Through Multicast and Single-Hop Messaging 有权
    通过组播和单跳信息发现邻接关系

    公开(公告)号：US20120327933A1

    公开(公告)日：2012-12-27

    申请号：US13164809

    申请日：2011-06-21

    申请人： Alvaro E. Retana ,  Thang Tat Do

    发明人： Alvaro E. Retana ,  Thang Tat Do

    IPC分类号： H04L12/56

    CPC分类号： H04L45/02

    摘要： A first node of a network may send a multicast discovery message comprising a domain identifier of the first node. The first node may also send a single-hop discovery message to one or more single-hop neighbors of the first node. The single-hop discovery message may comprise the domain identifier of the first node. A plurality of neighbor discovery messages may be received. At least one node of the network may be identified through the neighbor discovery messages. A level of trust may be determined for each identified node of the network based on at least one of the neighbor discovery messages.

    摘要翻译： 网络的第一节点可以发送包括第一节点的域标识符的多播发现消息。 第一节点还可以向第一节点的一个或多个单跳邻居发送单跳发现消息。 单跳发现消息可以包括第一节点的域标识符。 可以接收多个邻居发现消息。 可以通过邻居发现消息来识别网络的至少一个节点。 可以基于至少一个邻居发现消息来确定网络的每个已识别节点的信任级别。