LOOP AVOIDANCE DURING NETWORK CONVERGENCE IN SWITCHED NETWORKS
    12.
    发明申请
    LOOP AVOIDANCE DURING NETWORK CONVERGENCE IN SWITCHED NETWORKS 有权
    开关网络网络融合期间的环绕避免

    公开(公告)号:US20150381406A1

    公开(公告)日:2015-12-31

    申请号:US14319353

    申请日:2014-06-30

    CPC classification number: H04L45/28 H04L12/24 H04L41/00 H04L41/0654 H04L45/02

    Abstract: Various techniques can be used to avoid loops during network convergence after a topology change such as a failure. For example, a method can involve detecting a failure that disrupts an existing forwarding path between a node and a destination node; calculating at least one updated forwarding path from the node to the destination node; identifying a maximum time for at least a portion of the network to reach a post-convergence state with respect to the failure; until the maximum time has elapsed at the node, explicitly specifying at least a portion of the updated forwarding path in packet headers of any packets being sent from the node to the destination node; and after the maximum time has elapsed at the node, non-explicitly specifying the portion of the updated forwarding path in packet headers of any additional packets being sent from the node to the destination node.

    Abstract translation: 在拓扑变化(如故障)后,可以采用各种技术避免网络融合过程中的环路。 例如,一种方法可以涉及检测中断节点和目的地节点之间的现有转发路径的故障; 计算从所述节点到所述目的地节点的至少一个更新的转发路径; 识别所述网络的至少一部分相对于所述故障达到后收敛状态的最大时间; 直到节点经过最长时间,明确地指定从节点发送到目的地节点的任何分组的分组报头中的更新转发路径的至少一部分; 并且在节点经过最大时间之后,非明确地指定从节点发送到目的地节点的任何附加分组的分组报头中更新的转发路径的部分。

    MPLS segment-routing
    13.
    发明授权
    MPLS segment-routing 有权
    MPLS段路由

    公开(公告)号:US09049233B2

    公开(公告)日:2015-06-02

    申请号:US13760155

    申请日:2013-02-06

    Abstract: MPLS segment routing is disclosed. In one embodiment, a first core router generates a first data structure that maps first portcodes to respective identities of first neighbor routers or respective first links, wherein the first portcodes identify respective first ports of the first core router, and wherein the first ports are coupled to the first neighbor routers, respectively, via the first links, respectively. The first core router generates and transmits a first link-state packet, wherein the first link-state packet comprises an identity of the first core router and the first data structure.

    Abstract translation: 公开了MPLS段路由。 在一个实施例中,第一核心路由器生成第一数据结构,其将第一端口码映射到第一邻居路由器或相应的第一链路的相应标识,其中第一端口号标识第一核心路由器的相应第一端口,并且其中第一端口被耦合 分别通过第一链路到达第一邻居路由器。 第一核心路由器生成并发送第一链路状态分组,其中第一链路状态分组包括第一核心路由器的标识和第一数据结构。

    OPPORTUNISTIC COMPRESSION OF ROUTING SEGMENT IDENTIFIER STACKS
    14.
    发明申请
    OPPORTUNISTIC COMPRESSION OF ROUTING SEGMENT IDENTIFIER STACKS 有权
    路由器标识符堆栈的机会压缩

    公开(公告)号:US20140369356A1

    公开(公告)日:2014-12-18

    申请号:US14449632

    申请日:2014-08-01

    Abstract: A method and device are disclosed for opportunistic compression of routing segment identifiers. In one embodiment, the method includes participating in routing of a first data packet through a first node in a network, and subsequently entering into an arrangement with an adjacent node in the network. The first data packet includes a first plurality of routing segment identifiers, and additional data packets to be routed through the first node also include the first plurality of routing segment identifiers. The arrangement entered into includes representation of the first plurality of routing segment identifiers by a single compression identifier. The method further includes participating in routing of at least one of the additional data packets using the compression identifier instead of the first plurality of routing segment identifiers. In an embodiment, the device includes one or more network interfaces and a processor configured to perform the steps of the method.

    Abstract translation: 公开了用于路由段标识符的机会性压缩的方法和设备。 在一个实施例中,该方法包括通过网络中的第一节点参与第一数据分组的路由,并且随后进入与网络中的相邻节点的布置。 第一数据分组包括第一多个路由段标识符,并且要通过第一节点路由的附加数据分组还包括第一多个路由段标识符。 输入的安排包括通过单个压缩标识符表示第一多个路由段标识符。 该方法还包括使用压缩标识符而不是第一多个路由段标识符来参与至少一个附加数据分组的路由。 在一个实施例中,设备包括一个或多个网络接口和被配置为执行该方法的步骤的处理器。

    Framework for dynamically programmed network packet processing
    17.
    发明授权
    Framework for dynamically programmed network packet processing 有权
    动态编程网络包处理框架

    公开(公告)号:US09462043B2

    公开(公告)日:2016-10-04

    申请号:US13927394

    申请日:2013-06-26

    CPC classification number: H04L67/10 H04L45/566 H04L63/0428 H04L2463/041

    Abstract: One or more functions to be performed on a packet at one or more network nodes along a network path are determined at a network device. A packet is generated which includes a packet header. Included in the packet header are an instruction pointer and an instruction portion. A first instruction for the one or more functions to be performed at the one or more network nodes is written to the instruction portion. Additionally, a value pointing to the first instruction is written to the instruction pointer. The packet is transmitted along the network path from the network device.

    Abstract translation: 在网络设备处确定在网络路径的一个或多个网络节点处对分组执行的一个或多个功能。 生成包含分组报头的分组。 分组报头中包括指令指针和指令部分。 将在一个或多个网络节点执行的一个或多个功能的第一指令写入指令部分。 另外,指向第一指令的值被写入指令指针。 该分组沿网络路径从网络设备传输。

    Loop avoidance during network convergence in switched networks
    19.
    发明授权
    Loop avoidance during network convergence in switched networks 有权
    交换网络网络融合过程中环路回避

    公开(公告)号:US09401858B2

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

    申请号:US14319353

    申请日:2014-06-30

    CPC classification number: H04L45/28 H04L12/24 H04L41/00 H04L41/0654 H04L45/02

    Abstract: Various techniques can be used to avoid loops during network convergence after a topology change such as a failure. For example, a method can involve detecting a failure that disrupts an existing forwarding path between a node and a destination node; calculating at least one updated forwarding path from the node to the destination node; identifying a maximum time for at least a portion of the network to reach a post-convergence state with respect to the failure; until the maximum time has elapsed at the node, explicitly specifying at least a portion of the updated forwarding path in packet headers of any packets being sent from the node to the destination node; and after the maximum time has elapsed at the node, non-explicitly specifying the portion of the updated forwarding path in packet headers of any additional packets being sent from the node to the destination node.

    Abstract translation: 在拓扑变化(如故障)后,可以采用各种技术避免网络融合过程中的环路。 例如,一种方法可以涉及检测中断节点和目的地节点之间的现有转发路径的故障; 计算从所述节点到所述目的地节点的至少一个更新的转发路径; 识别所述网络的至少一部分相对于所述故障达到后收敛状态的最大时间; 直到节点经过最长时间,明确地指定从节点发送到目的地节点的任何分组的分组报头中的更新转发路径的至少一部分; 并且在节点经过最大时间之后,非明确地指定从节点发送到目的地节点的任何附加分组的分组报头中更新的转发路径的部分。

    Framework for Dynamically Programmed Network Packet Processing
    20.
    发明申请
    Framework for Dynamically Programmed Network Packet Processing 有权
    动态程序化网络数据包处理框架

    公开(公告)号:US20140280717A1

    公开(公告)日:2014-09-18

    申请号:US13927394

    申请日:2013-06-26

    CPC classification number: H04L67/10 H04L45/566 H04L63/0428 H04L2463/041

    Abstract: One or more functions to be performed on a packet at one or more network nodes along a network path are determined at a network device. A packet is generated which includes a packet header. Included in the packet header are an instruction pointer and an instruction portion. A first instruction for the one or more functions to be performed at the one or more network nodes is written to the instruction portion. Additionally, a value pointing to the first instruction is written to the instruction pointer. The packet is transmitted along the network path from the network device.

    Abstract translation: 在网络设备处确定在网络路径的一个或多个网络节点处对分组执行的一个或多个功能。 生成包含分组报头的分组。 分组报头中包括指令指针和指令部分。 将在一个或多个网络节点执行的一个或多个功能的第一指令写入指令部分。 另外,指向第一指令的值被写入指令指针。 该分组沿网络路径从网络设备传输。

Patent Agency Ranking