Standby Bandwidth Aware Path Computation
    2.
    发明申请
    Standby Bandwidth Aware Path Computation 有权
    待机带宽感知路径计算

    公开(公告)号:US20150117222A1

    公开(公告)日:2015-04-30

    申请号:US14067023

    申请日:2013-10-30

    CPC classification number: H04L45/125 H04L45/1283 H04L45/22

    Abstract: At a first network device, a plurality of paths through a network from a source network device to a destination network device are determined. A vacant bandwidth is calculated for each of the plurality of paths. A primary path is selected from the plurality of paths based on the vacant bandwidth, and a standby path is selected from the plurality of paths based on the vacant bandwidth.

    Abstract translation: 在第一网络设备中,确定通过网络从源网络设备到目的地网络设备的多条路径。 为多个路径中的每一个计算空闲带宽。 基于空闲带宽从多个路径选择主路径,并且基于空闲带宽从多个路径中选择备用路径。

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES

    公开(公告)号:US20200076719A1

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

    申请号:US16280962

    申请日:2019-02-20

    Abstract: The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.

    Generating segment routing conduit in service provider network for routing packets

    公开(公告)号:US10165093B2

    公开(公告)日:2018-12-25

    申请号:US15244735

    申请日:2016-08-23

    Abstract: Utilizing the systems disclosed herein, a network element (in a network) controls, within another network, the constraints of a service, timing of the creation of the service, and selection a service on which a packet is transmitted. For example, a first network element (located in a first network) receives a request associated with initiating a service. The request is received from a second network element located in a second network and includes at least one path constraint. The first network element controls creation of the service in the first network on behalf of the second network element located in the second network by, e.g., identifying a path based, at least in part, on the at least one path constraint; and binding an identifier and an interface to the path, wherein the interface is associated with one or more operation to perform on any traffic that is labeled with the identifier.

    NODE PROTECTION FOR SEGMENT ROUTING ADJACENCY SEGMENTS
    5.
    发明申请
    NODE PROTECTION FOR SEGMENT ROUTING ADJACENCY SEGMENTS 审中-公开
    分段路由协议节点的节点保护

    公开(公告)号:US20160173366A1

    公开(公告)日:2016-06-16

    申请号:US14571848

    申请日:2014-12-16

    CPC classification number: H04L45/22 H04L45/20 H04L45/28 H04L45/50

    Abstract: In one embodiment, a device in a segment routed network identifies an adjacency segment between the device and another device in the network. The device also identifies a merge point in the network. A first network path extends between the device and the merge point via the adjacency segment. A bypass network path that does not include the adjacency segment also extends between the device and the merge point. The device generates an interior gateway protocol (IGP) message that identifies the adjacency segment and the merge point. The device provides the IGP message to one or more other devices in the network.

    Abstract translation: 在一个实施例中,段路由网络中的设备识别设备与网络中的另一设备之间的邻接段。 该设备还标识网络中的合并点。 第一网络路径经由邻接段在设备和合并点之间延伸。 不包括邻接段的旁路网络路径也在设备和合并点之间延伸。 该设备生成内部网关协议(IGP)消息,其标识邻接段和合并点。 该设备向网络中的一个或多个其他设备提供IGP消息。

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES

    公开(公告)号:US20200252316A1

    公开(公告)日:2020-08-06

    申请号:US16853450

    申请日:2020-04-20

    Abstract: The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.

    Seamless path monitoring and rapid fault isolation using bidirectional forwarding detection in a network environment
    7.
    发明授权
    Seamless path monitoring and rapid fault isolation using bidirectional forwarding detection in a network environment 有权
    在网络环境中使用双向转发检测实现无缝路径监控和快速故障隔离

    公开(公告)号:US09497107B1

    公开(公告)日:2016-11-15

    申请号:US14211710

    申请日:2014-03-14

    Abstract: An example method for seamless path monitoring and rapid fault isolation using bidirectional forwarding detection (BFD) in a network environment is provided and includes determining a BFD target identifier type for communicating in a BFD session in a network environment, determining a non-zero globally assigned BFD discriminator value associated with the BFD target identifier type, populating a Your Discriminator field in a BFD Control Packet with the non-zero globally assigned BFD discriminator value, with a My Discriminator field in the BFD Control Packet being populated with a locally assigned BFD Discriminator value, and initiating the BFD session by transmitting the BFD Control Packet to a target node in the network. In a specific embodiment, the BFD target identifier type is type 3, and the non-zero globally assigned BFD discriminator is an Alert Discriminator reserved by substantially all nodes in the network exclusively for BFD traceroute operations.

    Abstract translation: 提供了一种在网络环境中使用双向转发检测(BFD)进行无缝路径监控和快速故障隔离的示例方法,包括确定BFD目标标识符类型,以在网络环境中的BFD会话中进行通信,确定非零全局分配 与BFD目标标识符类型相关联的BFD鉴别符值,在BFD控制报文中填入非零全局分配BFD鉴别符值的“Discriminator”字段,BFD控制报文中的“我的标识符”字段填入本地分配的BFD鉴别符 通过将BFD控制报文发送到网络中的目标节点来启动BFD会话。 在具体实施例中,BFD目标标识符类型为类型3,非零全局分配的BFD鉴别器是专门用于BFD跟踪路由操作的网络中基本上所有节点保留的警报鉴别器。

    ENHANCED PATH SELECTION SCHEME FOR EQUAL COST PATHS IN COMMUNICATION NETWORKS
    8.
    发明申请
    ENHANCED PATH SELECTION SCHEME FOR EQUAL COST PATHS IN COMMUNICATION NETWORKS 有权
    通信网络中平均成本节点的增强路径选择方案

    公开(公告)号:US20140211632A1

    公开(公告)日:2014-07-31

    申请号:US13754247

    申请日:2013-01-30

    CPC classification number: H04L45/124 H04L45/125 H04L45/24 H04L45/50 H04L45/62

    Abstract: In one embodiment, a node in a communication network receives a label switched path (LSP) request and in response, the node determines at least two equal cost paths, each path having one or more path-nodes. The node may then further determine a total bandwidth-based transition value for each path of the at least two equal cost paths and selects the path having a lower total transition value. Once selected, the node may establish the requested LSP over the selected path.

    Abstract translation: 在一个实施例中,通信网络中的节点接收标签交换路径(LSP)请求,并且作为响应,节点确定至少两个相等的成本路径,每个路径具有一个或多个路径节点。 然后,节点可以进一步确定至少两个相等成本路径的每个路径的总带宽转换值,并选择具有较低总转换值的路径。 一旦选择,节点可以在所选路径上建立所请求的LSP。

    METHOD AND SYSTEM FOR NETWORK TRAFFIC DIVERSION

    公开(公告)号:US20220210051A1

    公开(公告)日:2022-06-30

    申请号:US17699237

    申请日:2022-03-21

    Abstract: A method, network device, and computer program product for network traffic diversion are disclosed. In one embodiment, a method according to the present disclosure includes receiving a frame at a core edge node that is a member of a redundancy group (where the frame comprises network address information and a packet), and determining whether a link (to which the core edge node is communicatively coupled) is affected by a network failure. The frame was sourced by a remote core edge node that is not a member of the redundancy group, and the network address information indicates that the packet is to be forwarded via the link. In response to the link being affected by the network failure, the method further includes generating a modified frame and forwarding the modified frame to another core edge node. The generating comprises including a redirect label in the modified frame. The another core edge node is another member of the redundancy group.

    METHOD AND SYSTEM FOR NETWORK TRAFFIC DIVERSION

    公开(公告)号:US20210152464A1

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

    申请号:US16686896

    申请日:2019-11-18

    Abstract: A method, network device, and computer program product for network traffic diversion are disclosed. In one embodiment, a method according to the present disclosure includes receiving a frame at a core edge node that is a member of a redundancy group (where the frame comprises network address information and a packet), and determining whether a link (to which the core edge node is communicatively coupled) is affected by a network failure. The frame was sourced by a remote core edge node that is not a member of the redundancy group, and the network address information indicates that the packet is to be forwarded via the link. In response to the link being affected by the network failure, the method further includes generating a modified frame and forwarding the modified frame to another core edge node. The generating comprises including a redirect label in the modified frame. The another core edge node is another member of the redundancy group.

Patent Agency Ranking