IDENTIFYING REDUNDANT NETWORK LINKS USING TOPOLOGY GRAPHS

    公开(公告)号:US20220239554A1

    公开(公告)日:2022-07-28

    申请号:US17248547

    申请日:2021-01-28

    Abstract: Techniques for connectivity issue remediation are provided. A first link trace message is automatically transmitted from a source end point to a destination end point. A first topology graph is generated for a network based on the first link trace message. Presence of a loop is detected in the network. A second link trace message is then transmitted from the source end point to the destination end point, and a second topology graph is automatically generated for the network based on the second link trace message. An edge in the network that caused the loop is identified based on comparing the first and second topology graphs.

    MULTICAST PATH TRACES
    4.
    发明公开

    公开(公告)号:US20240214295A1

    公开(公告)日:2024-06-27

    申请号:US18088239

    申请日:2022-12-23

    CPC classification number: H04L45/02 H04L45/16 H04L45/26

    Abstract: In one embodiment, a device may receive a multicast path trace request for a multicast tree, wherein the device is a mid-node in the multicast tree. The device may perform, based on the device being a mid-node in the multicast tree, an upstream trace of network topology of the multicast tree from the device to a head-node of the multicast tree and a downstream trace of network topology of the multicast tree from the device to at least one tail-node. The device may generate an end-to-end visible topology of the multicast tree based on the upstream trace and the downstream trace. The device may provide the end-to-end visible topology of the multicast tree to an observability manager.

Patent Agency Ranking