Scalable network slice based queuing using segment routing flexible algorithm

    公开(公告)号:US10601724B1

    公开(公告)日:2020-03-24

    申请号:US16178418

    申请日:2018-11-01

    Abstract: The present technology is directed to a system and method for implementing network resource partitioning and Quality of Service (QoS) separation through network slicing. Embodiments of the present invention describe scalable network slicing method based on defining Segment Routing Flexible Algorithm to represent a network slice and assigning a distinct QoS policy queue to each of the Flexible Algorithms configured on a network node. Therefore, scalable network slice based queuing is implemented wherein a single packet processing queue is assigned to each Flex-Algorithm based network slice. QoS policy queue may be implemented in a hierarchical fashion by differentiation between flow packets in a single QoS policy queue based on value of experimental bits in the header.

    Packet communications providing packet forwarding efficiencies in a network including using a segment routing and tunnel exchange

    公开(公告)号:US10594513B2

    公开(公告)日:2020-03-17

    申请号:US15925731

    申请日:2018-03-19

    Abstract: In one embodiment, a segment routing and tunnel exchange provides packet forwarding efficiencies in a network, including providing an exchange between a segment routing domain and a packet tunnel domain. One application includes the segment routing and tunnel exchange interfacing segment routing packet forwarding (e.g., in a Evolved Packet Core (EPC) and/or 5-G user plane) and packet tunnel forwarding in access networks (e.g., replacing a portion of a tunnel between an access node and a user plane function for accessing a corresponding data network). In one embodiment, a network provides mobility services using a segment routing data plane that spans segment routing and tunnel exchange(s) and segment routing-enabled user plane functions. One embodiment uses the segment routing data plane without any modification to a (radio) access network (R)AN (e.g., Evolved NodeB, Next Generation NodeB) nor to user equipment (e.g., any end user device).

    REAL-TIME MANAGEMENT OF SERVICE NETWORK PATHWAYS

    公开(公告)号:US20250055789A1

    公开(公告)日:2025-02-13

    申请号:US18629355

    申请日:2024-04-08

    Abstract: This disclosure describes techniques and mechanisms for coupling measurement probes with customer data traffic and enabling real-time and selective management of ECMP pathways that are not meeting performance metric(s) in a service provider network. Nodes within the service provider network are configured to perform specific hashing behavior. An ingress node may be configured to create and maintain a TCAM table to store flow label(s) corresponding to ECMP pathways that are not meeting performance metric(s). The system may configure performance measurement session(s) between an ingress node and an egress node. The system may receive performance data, identify pathway(s) violating performance metric(s), and may perform action(s) in real-time.

    ECMP-AWARE TWAMP PERFORMANCE MEASUREMENTS

    公开(公告)号:US20240430188A1

    公开(公告)日:2024-12-26

    申请号:US18371848

    申请日:2023-09-22

    Abstract: Techniques for determine latency, loss, and liveness performance metrics associated with ECMP routes. The techniques may include determining that a TWAMP probe is to be sent from a first node to a second node along an equal-cost multipath ECMP route. In some examples, the first node may generate a packet for sending the TWAMP probe to the second node. The packet may include information specifying a forward path and reverse path to be traversed by the packet. In examples, the first node may send the packet to the second node along the ECMP route and subsequently receive the packet including telemetry data associated with the second node and a midpoint node of the ECMP route. Based at least in part on the telemetry data, the first node may determine a metric indicative of a performance measurement associated with the ECMP route.

    VIRTUAL NETWORK FUNCTION PROOF OF TRANSIT

    公开(公告)号:US20240235946A9

    公开(公告)日:2024-07-11

    申请号: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.

    VIRTUAL NETWORK FUNCTION PROOF OF TRANSIT
    18.
    发明公开

    公开(公告)号:US20240163179A1

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

    申请号:US18422801

    申请日:2024-01-25

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

    Abstract: Techniques for monitoring data transport in a network virtualization function (NVF) chain. A path tracing packet is generated having a Midpoint Compressed Data (MCD) to collect path tracing information of the NVF chain. The NVF 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 has a second field that indicates a particular path tracing format to be used. The path tracing packet is passed through the NVF chain and is then received back again after passing through the NVF chain. Data collected by the path tracing packet is analyzed to determine which NVF nodes the path tracing packet passed through, and the amount of time taken for the path tracing packet to pass through, the NVF chain.

Patent Agency Ranking