Communicating packets across multi-domain networks using compact forwarding instructions

    公开(公告)号:US11140074B2

    公开(公告)日:2021-10-05

    申请号:US16580944

    申请日:2019-09-24

    Abstract: Techniques and mechanisms for compressing the size of SIDs to be smaller than a complete IPv6 address (or “micro SIDs”), and scaling micro SIDs across a multi-domain environment using micro SID-domain-blocks. Segment routing over IPv6 (SRv6) uses 128-bit IPv6 addresses as SIDs for segment routing. According to this disclosure, multiple SRv6 SIDs may be expressed in a compact format such that a 128-bit IPv6 address, such as the destination address field of the IPv6 header, may store multiple micro SIDs. Further, SID-domain-blocks may be assigned to each domain in a multi-domain network such that micro SIDs may be expressed in the context of a given domain, rather than being shared in the global multi-domain network. In this way, lists of domain-specific SIDs may be fully expressed in the IPv6 destination address of the packet to scale micro SID into large, multi-domain networks.

    Malleable routing for data packets
    42.
    发明授权

    公开(公告)号:US11050662B2

    公开(公告)日:2021-06-29

    申请号:US15986174

    申请日:2018-05-22

    Abstract: Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.

    Reroute Detection in Segment Routing Data Plane

    公开(公告)号:US20180077051A1

    公开(公告)日:2018-03-15

    申请号:US15266498

    申请日:2016-09-15

    CPC classification number: H04L45/745 H04L45/28 H04L69/22 H04W24/06

    Abstract: Methods and systems are disclosed for detection of reroute occurrences in segment routing enabled networks. In one embodiment, a method includes receiving, at a first node in a communications network, a test message comprising a header, where the header comprises one or more segment identifiers. This embodiment of the method further includes detecting a first indicator of a rerouted test path for the message and sending an outgoing message to a node determined using the header, where sending the outgoing message comprises including in the outgoing message a second indicator that the test message has been rerouted. An embodiment of a system includes a network interface adapted for data communication with one or more nodes of a communications network and a processor operably coupled to the network interface and adapted to implement an embodiment of the method.

    Capability Aware Routing
    44.
    发明申请
    Capability Aware Routing 有权
    能力意识路由

    公开(公告)号:US20160218961A1

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

    申请号:US14813268

    申请日:2015-07-30

    CPC classification number: H04L12/4633 H04L45/02 H04L45/127

    Abstract: Various systems and methods for bypassing one or more non-capable nodes. For example, one method involves a capable node determining that an adjacent node is non-capable, where capable nodes are configured to implement a data plane capability and non-capable nodes are not. The method then involves identifying a downstream node that is capable. The downstream node is on a shortest path. The method also involves generating information that identifies a tunnel to the downstream node.

    Abstract translation: 用于绕过一个或多个非能力节点的各种系统和方法。 例如,一种方法涉及能力节点确定相邻节点是无能力的,其中能力节点被配置为实现数据平面能力,并且不能够执行的节点不是。 该方法然后涉及识别能够实现的下游节点。 下游节点在最短路径上。 该方法还涉及生成标识到下游节点的隧道的信息。

    MALLEABLE ROUTING FOR DATA PACKETS
    45.
    发明申请

    公开(公告)号:US20250071051A1

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

    申请号:US18652622

    申请日:2024-05-01

    Abstract: Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.

    Source address validation for asymmetric routing

    公开(公告)号:US12149432B2

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

    申请号:US18501775

    申请日:2023-11-03

    Abstract: Techniques are described for providing a method and apparatus for determining source address validation of a data packet in a network in the presence of asymmetric routing. When a data packet is received by a node such as a router, a reverse path forwarding lookup is performed to determine if the data packet was received on a next-hop interface and if the reverse path forwarding fails, a Shortest Path First (SPF) computation at the router advertising the source route will be performed using the link state database to determine whether the data packet arrived from a valid path of the network.

    Systems and methods for link state flooding transmitter-based flow control

    公开(公告)号:US12068969B2

    公开(公告)日:2024-08-20

    申请号:US17493498

    申请日:2021-10-04

    CPC classification number: H04L47/25 H04L47/26

    Abstract: In one embodiment, a method for link state flooding between a network node and a receiving node includes determining a current transmit rate that Link State Protocol Data Units (LSPs) are being transmitted from the network node to the receiving node. The method further includes determining an LSP acknowledgment rate that indicates a rate at which a plurality of LSP acknowledgments are received at the network node from the receiving node. The method further includes determining a new transmit rate based on the current transmit rate and the LSP acknowledgment rate. The method further includes transmitting a plurality of LSPs from the network node to the receiving node using the new transmit rate.

    Communicating packets across multi-domain networks using compact forwarding instructions

    公开(公告)号:US11611505B2

    公开(公告)日:2023-03-21

    申请号:US17404817

    申请日:2021-08-17

    Abstract: Techniques and mechanisms for compressing the size of SIDs to be smaller than a complete IPv6 address (or “micro SIDs”), and scaling micro SIDs across a multi-domain environment using micro SID-domain-blocks. Segment routing over IPv6 (SRv6) uses 128-bit IPv6 addresses as SIDs for segment routing. According to this disclosure, multiple SRv6 SIDs may be expressed in a compact format such that a 128-bit IPv6 address, such as the destination address field of the IPv6 header, may store multiple micro SIDs. Further, SID-domain-blocks may be assigned to each domain in a multi-domain network such that micro SIDs may be expressed in the context of a given domain, rather than being shared in the global multi-domain network. In this way, lists of domain-specific SIDs may be fully expressed in the IPv6 destination address of the packet to scale micro SID into large, multi-domain networks.

Patent Agency Ranking