LOOP DETECTION AND PREVENTION
    21.
    发明申请

    公开(公告)号:US20170230277A1

    公开(公告)日:2017-08-10

    申请号:US15015463

    申请日:2016-02-04

    CPC classification number: H04L45/18 H04L12/1877 H04L45/16

    Abstract: Various systems and methods for preventing loops. For example, one method involves receiving a multicast data packet at a node. The node is coupled to a local area network (LAN). An internet protocol (IP) prefix is assigned to the LAN. The method involves determining whether a source address included in the packet is covered by the IP prefix. Depending on the direction of travel of the multicast data packet and whether or not the source address is covered by the IP prefix, the node determines whether a loop exists.

    FAST FAIL-OVER USING TUNNELS
    22.
    发明申请

    公开(公告)号:US20170126587A1

    公开(公告)日:2017-05-04

    申请号:US14932016

    申请日:2015-11-04

    CPC classification number: H04L47/825 H04L45/28

    Abstract: Various systems and methods for performing fast fail-over. For example, one method involves receiving a packet at a node. The packet is received at the node in response to a designated forwarder (DF) detecting loss of communication between the DF and a receiver node. The method also involves determining that the first packet was received via a tunnel. The method also involves forwarding the first packet and initiating a DF election. Forwarding the first packet and initiating the DF election are performed in response to determining that the first packet was received via the tunnel.

    TRAFFIC ENGINEERING FOR BIT INDEXED EXPLICIT REPLICATION
    24.
    发明申请
    TRAFFIC ENGINEERING FOR BIT INDEXED EXPLICIT REPLICATION 审中-公开
    用于位移索引显示复制的交通工程

    公开(公告)号:US20160254987A1

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

    申请号:US14814575

    申请日:2015-07-31

    Abstract: Methods and network devices are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving at a first node in a network a message comprising a message bit array, and comparing bit values at one or more bit positions in the message bit array to one or more entries in a forwarding table stored at the first node. The one or more bit positions correspond in this embodiment to links in the network. This embodiment of the method further includes forwarding the message over a link represented in the forwarding table if a result of the comparing indicates that the link is included in a path to be taken by the message. In a further embodiment of the method, the message is a multicast message and forwarding the message comprises forwarding a replica of the multicast message.

    Abstract translation: 公开了用于通过位形式索引的显式复制的新形式进行交通工程转发的方法和网络设备。 在一个实施例中,一种方法包括在网络中的第一节点处接收包括消息比特阵列的消息,以及将消息比特阵列中的一个或多个比特位置处的比特值与存储在所述消息比特阵列中的转发表中的一个或多个条目进行比较 第一个节点。 该实施例中的一个或多个比特位置对应于网络中的链路。 该方法的该实施例还包括如果比较结果指示链路被包括在消息采取的路径中,则通过转发表中表示的链路转发该消息。 在该方法的另一实施例中,消息是多播消息,并且转发消息包括转发多播消息的副本。

    Overlay Signaling For Bit Indexed Explicit Replication
    25.
    发明申请
    Overlay Signaling For Bit Indexed Explicit Replication 审中-公开
    用于位索引显式复制的覆盖信号

    公开(公告)号:US20150139228A1

    公开(公告)日:2015-05-21

    申请号:US14603561

    申请日:2015-01-23

    CPC classification number: H04L12/185 H04L45/16 H04L45/54 H04L45/74

    Abstract: Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a membership request at a node. The membership request is received from a host and the membership request identifies a multicast group. In response to receiving the membership request, the node generates a membership message. The membership message includes information identifying the multicast group and information identifying the node. The node transmits the membership to an overlay participant that stores a bit string associated with the multicast group.

    Abstract translation: 用于执行位索引显式复制(BIER)的各种系统和方法。 例如,一种方法涉及在节点处接收成员资格请求。 从主机接收成员请求,并且成员资格请求标识多播组。 响应于接收到成员请求,节点生成成员消息。 会员消息包括标识多播组的信息和识别该节点的信息。 节点将成员资格发送给存储与多播组相关联的比特串的覆盖参与者。

    Bit indexed explicit forwarding optimization

    公开(公告)号:US11646906B2

    公开(公告)日:2023-05-09

    申请号:US17315582

    申请日:2021-05-10

    CPC classification number: H04L12/1886 H04L45/16 H04L45/54 H04L45/745

    Abstract: Disclosed is the generation of a bit-indexed forwarding table (BIFT) that can include a plurality of entries, each such entry corresponding to a bit position of a plurality of bit positions, where each such bit position represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet. The generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries (where the entry corresponds to the selected bit position), identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.

    Overlay signaling for bit indexed explicit replication

    公开(公告)号:US11240053B2

    公开(公告)日:2022-02-01

    申请号:US16654078

    申请日:2019-10-16

    Abstract: Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a membership message that was generated by an egress router, where the membership message comprises information identifying a multicast group, and information identifying a plurality of egress routers. The method identifies at least one bit position in the membership message that is associated with the first egress router, where at least one bit position of the plurality of bit positions is associated with the first egress router. The method also records membership of the first egress router in the multicast group, where the membership is recorded in a bit of a group membership table, and the bit corresponds to the bit position identified in the membership message.

    Bit indexed explicit replication
    28.
    发明授权

    公开(公告)号:US11206148B2

    公开(公告)日:2021-12-21

    申请号:US16669653

    申请日:2019-10-31

    Abstract: Methods, devices and computer readable storage media for performing bit indexed explicit replication (BIER) are disclosed. One embodiment of a method includes obtaining, at an egress node of a network, a bit position assigned to the egress node. This embodiment also includes sending an outgoing advertisement to other nodes in the network, where the outgoing advertisement identifies the egress node and the assigned bit position. The bit position is within a bit mask comprising bits in a plurality of bit positions, and each bit position corresponds to a respective egress node of the network.

    Bit Indexed Explicit Forwarding Optimization

    公开(公告)号:US20210266190A1

    公开(公告)日:2021-08-26

    申请号:US17315582

    申请日:2021-05-10

    Abstract: Disclosed is the generation of a bit-indexed forwarding table (BIFT) that can include a plurality of entries, each such entry corresponding to a bit position of a plurality of bit positions, where each such bit position represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet. The generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries (where the entry corresponds to the selected bit position), identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.

    Fast fail-over using tunnels
    30.
    发明授权

    公开(公告)号:US10917360B2

    公开(公告)日:2021-02-09

    申请号:US16422449

    申请日:2019-05-24

    Abstract: Various systems and methods for performing fast fail-over. One method involves electing a first node as a designated forwarder node and electing a second node as a backup designated forwarder node. Prior to detecting a loss of connectivity between the designated forwarder node and the local network, the method elects both the designated forwarder node and the backup designated forwarder node, and the designated forwarder node forwards to a core network at least a first packet received from a local network. Subsequent to detecting a loss of connectivity, using the backup designated forwarder node to forward an instance of a second packet to the core network. In one embodiment, the backup designated forwarder node forwards an instance of the second packet, via a tunnel, to the designated forwarder node, which then forwards the instance of the second packet to the core network following the loss of connectivity.

Patent Agency Ranking