OPTIMIZING PATH TRACING TO ENABLE NETWORK ASSURANCE IN EXISTING NETWORK HARDWARE

    公开(公告)号:US20240297839A1

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

    申请号:US18227557

    申请日:2023-07-28

    CPC classification number: H04L43/106 H04L43/12

    Abstract: Techniques for providing an optimized behavior to source node(s) of a path tracing sequence allowing for implementation of path tracing source node behavior on an ASIC with edit-depth limitations and/or on an ASIC that does not have access to the full 64-bit timestamp. A source node having optimized behavior may be configured to record a first full 64-bit timestamp in an SRH PT-TLV header of a probe packet using the CPU of the source node. A source node having the optimized behavior may also be configured to compute a midpoint compressed data (MCD) entry and record the entry into an MCD stack of a probe packet using the NPU of the source node. A sink node and/or network controller may be configured to determine a final timestamp for the probe packet through the network by leveraging the SRH PT-TLV header and the MCD entry.

    Virtual network function proof of transit

    公开(公告)号:US11962473B1

    公开(公告)日:2024-04-16

    申请号:US18133950

    申请日:2023-04-12

    CPC classification number: H04L41/122 H04L41/0895 H04L41/40 H04L43/10

    Abstract: Techniques for monitoring data transport in a network virtualization function chain (chain). A path tracing packet is generated having a Midpoint Compressed Data (MCD) to collect path tracing information of the chain. The network virtualization function node is configured to record an MCD containing Wide Local Path Tracing Identification (WL PT ID). The WL PT ID includes a first field having a value that indicates that a non-standard path tracing format is to be used and a second field that indicates a particular path tracing format to be used. The path tracing packet is passed through the chain and is received back after passing through the chain. Data collected by the path tracing packet is then analyzed to determine which network virtualization function nodes and chains the path tracing packet passed through and the amount of time taken for the path tracing packet to pass through the chain.

    PACKET TRACING MECHANISM IN A NETWORK LEVERAGING SRV6

    公开(公告)号:US20240022510A1

    公开(公告)日:2024-01-18

    申请号:US18352921

    申请日:2023-07-14

    CPC classification number: H04L45/74 H04L43/106 H04L45/02 H04L69/22

    Abstract: The present disclosure provides a packet tracing mechanism will be described that provides packet tracing information to a mobile network controller. In one aspect, a method includes receiving a data packet sent from a source node to a destination node; determining if the data packet is to be updated with packet tracing information; and upon determining that the data packet is to be updated, updating the packet tracing information of the data packet to include identification of the network device and an ingress timestamp of the data packet at the network device for a corresponding network controller to determining network routing policies.

    Packet network interworking including segment routing

    公开(公告)号:US11838200B2

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

    申请号:US17448695

    申请日:2021-09-23

    CPC classification number: H04L45/04 H04L45/741

    Abstract: In one embodiment, a network comprises a first forwarding domain using a first data plane forwarding protocol and a second forwarding domain using a second data plane forwarding protocol different than the first data forwarding plane forwarding protocol. The first forwarding domain includes a first path node and a particular border node. The second forwarding domain includes a second path node and the particular border node. The particular border node performs Segment Routing or other protocol interworking between the different data plane forwarding domains, such as for transporting packets through a different forwarding domain or translating a packet to use a different data forwarding protocol. These forwarding domains typically include Segment Routing (SR) and SR-Multiprotocol Label Switching (SR-MPLS). Paths through the network are determined by a Path Computation Engine and/or based on route advertisements such associated with Binding Segment Identifiers (BSIDs) (e.g., labels, Internet Protocol version 6 addresses).

    INBAND GROUP-BASED NETWORK POLICY USING SRV6

    公开(公告)号:US20220385573A1

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

    申请号:US17865125

    申请日:2022-07-14

    Abstract: The present technology pertains to a group-based network policy using Segment Routing over an IPv6 dataplane (SRv6). After a source application sends a packet, an ingress node can receive the packet, and if the source node is capable, it can identify an application policy and apply it. The ingress node indicates that the policy has been applied by including policy bits in the packet encapsulation. When the packet is received by the egress node, it can determine whether the policy was already applied, and if so, the packet is forward to the destination application. If the egress node determines that the policy has not be applied the destination application can apply the policy. Both the ingress node and egress nodes can learn of source application groups, destination application groups, and applicable policies through communication with aspects of the segment routing fabric.

Patent Agency Ranking