DELTA DATABASE SYNCHRONIZATION
    16.
    发明申请

    公开(公告)号:US20170344594A1

    公开(公告)日:2017-11-30

    申请号:US15254943

    申请日:2016-09-01

    Abstract: Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.

    TRANSIT DOMAIN CONTROL
    17.
    发明申请
    TRANSIT DOMAIN CONTROL 有权
    过境控制

    公开(公告)号:US20160285740A1

    公开(公告)日:2016-09-29

    申请号:US14666786

    申请日:2015-03-24

    Abstract: A method for controlling transit of routing messages in a network comprising multiple autonomous systems (AS) is disclosed. The method includes receiving, at a first AS, a routing message of an inter-AS routing protocol and identifying that the routing message comprises transit domain control (TDC) information specifying one or more autonomous systems to which the routing message may be propagated and/or one or more autonomous systems to which the routing message may not be propagated. The method further includes propagating the routing message from the first AS to a second AS in accordance with the TDC information.

    Abstract translation: 公开了一种用于控制包括多个自治系统(AS)的网络中的路由消息的传送的方法。 该方法包括在第一AS处接收跨AS路由协议的路由消息,并且识别该路由消息包括指定可以传播路由消息的一个或多个自治系统的传输域控制(TDC)信息和/ 或路由消息可能不被传播到的一个或多个自治系统。 该方法还包括根据TDC信息将路由消息从第一AS传播到第二AS。

    OPTIMIZED BORDER GATEWAY PROTOCOL BEST PATH SELECTION FOR OPTIMAL ROUTE REFLECTION
    18.
    发明申请
    OPTIMIZED BORDER GATEWAY PROTOCOL BEST PATH SELECTION FOR OPTIMAL ROUTE REFLECTION 审中-公开
    优化边界网关协议最佳路径选择最佳路由反射

    公开(公告)号:US20160248663A1

    公开(公告)日:2016-08-25

    申请号:US14805300

    申请日:2015-07-21

    CPC classification number: H04L45/24 H04L45/12 H04L45/42 H04L67/10

    Abstract: Embodiments are provided for optimized best path selection for optimal route reflection and include configuring, by a cloud-based node, a first cluster of nodes in an autonomous system, and determining whether any paths for a network address prefix are available in the first cluster of nodes. Embodiments also include selecting a best path from one or more paths if the one or more paths are determined to be available in the first cluster for the network address prefix. Embodiments further include advertising the best path to one or more nodes in the first cluster. More specific embodiments include determining, if no paths for the network address prefix are available in the first cluster, another path for the network address prefix is available in a second cluster of nodes of the autonomous system, and selecting the other path as the best path.

    Abstract translation: 提供实施例用于优化最佳路径选择以优化路线反射,并且包括由基于云的节点配置自治系统中的第一个节点集群,以及确定网络地址前缀的任何路径是否可用于第一集群 节点。 实施例还包括:如果确定一个或多个路径在网络地址前缀的第一簇中可用,则从一个或多个路径选择最佳路径。 实施例还包括向第一集群中的一个或多个节点广告最佳路径。 更具体的实施例包括确定如果第一集群中没有网络地址前缀的路径是可用的,则网络地址前缀的另一路径在自治系统的第二节点簇中可用,并且选择另一路径作为最佳路径 。

    Automatically detecting best paths from shadow route reflectors
    19.
    发明授权
    Automatically detecting best paths from shadow route reflectors 有权
    自动检测阴影路径反射器的最佳路径

    公开(公告)号:US08908676B2

    公开(公告)日:2014-12-09

    申请号:US14051860

    申请日:2013-10-11

    Abstract: In an embodiment, a method comprises receiving a path advertisement comprising information about an available path and a well-known community value associated with the available path. A modified best path calculation is performed in response to receiving the available path either from a higher-ranked device or from a device that is not participating in diverse path calculation, resulting in creating a particular best path. The particular best path is advertised to other routers with or without a restriction indicator based on whether it is a client learned path or non-client iBGP peer learned path and based on whether the advertisement is directed to a client or a non-client iBGP peer.

    Abstract translation: 在一个实施例中,一种方法包括接收包括关于可用路径的信息和与可用路径相关联的公知社区值的路径通告。 响应于从更高排名的设备或不参与不同路径计算的设备接收可用路径而执行修改的最佳路径计算,导致创建特定的最佳路径。 根据客户端学习路径还是非客户端iBGP对等体学习路径,并根据广告是指向客户端还是非客户端iBGP对等体,将特定最佳路径通告给具有或不具有限制指示符的其他路由器 。

Patent Agency Ranking