CIRCUIT-STYLE NETWORK WITH CO-ROUTED BIDIRECTIONAL NETWORK PATHS

    公开(公告)号:WO2023287651A1

    公开(公告)日:2023-01-19

    申请号:PCT/US2022/036472

    申请日:2022-07-08

    Abstract: Disclosed are systems, apparatuses, methods, and computer-readable media to implement circuit-style network with co-routed bidirectional network paths. A method includes receiving a request for a circuit policy between a source node and a destination node, the circuit policy defining a co-routed bidirectional policy between the source node and the destination node; requesting a path compute service to identify a path between the source node and the destination node that satisfies the circuit policy through a first network; receiving a path identifying a first set of network nodes that satisfy the circuit policy; configuring each node in the first set of network nodes within the first network with the circuit policy; and establishing a connection using the path that satisfies the circuit policy between the source node and the destination node.

    SRv6 SEGMENT IDENTIFIERS AND MICRO SEGMENTS INVOKING NETWORK BEHAVIOR INCLUDING REALIZATION OF NETWORK SLICES

    公开(公告)号:WO2022192001A1

    公开(公告)日:2022-09-15

    申请号:PCT/US2022/017755

    申请日:2022-02-24

    Abstract: In one embodiment, Segment Routing Internet Protocol Version 6 (SRv6) micro segments ("uSIDs") are included in destination addresses, and possibly in other Segment Identifiers ("SIDs"), of packets transported through a network, and invoking corresponding network behavior, including, but not limited to, realization of corresponding network slices. In one embodiment, network nodes are configured to perform differential network slice realization functionality based on values slice-representative value(s) provided by global and/or local uSIDs of packets. This configuration may be defined by a controller in the network and/or routing protocol advertisements. Responsive to a received packet, a network node identifies and performs the corresponding network slice realization functionality based on slice-representative value(s) provided by one or more global and/or local uSIDs of the destination address of the received packet. Various encodings within an IPv6 Destination Address of the encapsulating packet are disclosed.

    REPLACING AN EXISTING NETWORK COMMUNICATIONS PATH
    3.
    发明申请
    REPLACING AN EXISTING NETWORK COMMUNICATIONS PATH 审中-公开
    更换现有的网络通信路径

    公开(公告)号:WO2014126734A1

    公开(公告)日:2014-08-21

    申请号:PCT/US2014/014282

    申请日:2014-01-31

    Abstract: In one embodiment, a replacement network communications path is determined using dedicated resources of an existing path. One or more network elements in a network determines a new communications path between a first network node and a second network node in the network while an existing communications path is currently configured in the network to carry traffic between the first and second network nodes. The existing communications path includes one or more exclusive physical resources dedicated to the existing communications path. The new communications path includes at least one of said exclusive physical resources dedicated to the existing communications path. One embodiment includes: subsequent to said determining the new communications path, removing the existing communications path from service, and then instantiating the new communications path, with the new communications path including said at least one of said exclusive physical resources.

    Abstract translation: 在一个实施例中,使用现有路径的专用资源来确定替换网络通信路径。 网络中的一个或多个网络元件确定网络中的第一网络节点和第二网络节点之间的新的通信路径,而现有的通信路径当前被配置在网络中以承载第一和第二网络节点之间的业务。 现有的通信路径包括专用于现有通信路径的一个或多个专用物理资源。 新的通信路径包括专用于现有通信路径的所述独占物理资源中的至少一个。 一个实施例包括:在所述确定新的通信路径之后,从服务中移除现有的通信路径,然后实例化新的通信路径,新的通信路径包括所述独占物理资源中的所述至少一个。

    FAST REROUTE FOR BIDIRECTIONAL CO-ROUTED TRAFFIC ENGINEERING TUNNELS
    6.
    发明申请
    FAST REROUTE FOR BIDIRECTIONAL CO-ROUTED TRAFFIC ENGINEERING TUNNELS 审中-公开
    双向交通交通工程隧道快速路

    公开(公告)号:WO2014035941A1

    公开(公告)日:2014-03-06

    申请号:PCT/US2013/056754

    申请日:2013-08-27

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

    Abstract: In one embodiment, network devices are configured to route traffic and signaling onto co-routed bypass tunnels. Co-routed bypass tunnels protect against node or link failures in a label switched paths. The co-routed bypass tunnels provide bidirectional protection. In one example, a node acting as the point of local repair (PLR) receives a resource reservation state message at a first node and extracts a tunnel sender address from the reservation state message. The PLR is configured to identify a bypass tunnel to a second node in the reverse direction of the label switched path and signal resource reservation messages over the bypass tunnel in the reverse direction. In another example, a PLR receives a resource reservation message with bypass tunnel identification and the PLR is configured to identify a bypass tunnel to a second node in the reverse direction.

    Abstract translation: 在一个实施例中,网络设备被配置为将通信量和信令路由到共路由旁路隧道。 路由旁路隧道可防止标签交换路径中的节点或链路故障。 共路旁路隧道提供双向保护。 在一个示例中,充当本地修复点(PLR)的节点在第一节点处接收资源预留状态消息,并从预留状态消息中提取隧道发送方地址。 PLR被配置为在相反方向上通过旁路隧道来识别在标签交换路径的相反方向上的第二节点的旁路隧道和信号资源预留消息。 在另一示例中,PLR接收具有旁路隧道标识的资源预留消息,并且PLR被配置为在相反方向上识别到第二节点的旁路隧道。

    NETWORK INTERWORKING WITH NO CROSS-DOMAIN STATE

    公开(公告)号:WO2021011392A1

    公开(公告)日:2021-01-21

    申请号:PCT/US2020/041646

    申请日:2020-07-10

    Abstract: Network interworking with no cross-domain state may be provided. First, an edge node may receive a packet from an intermediate node in a first domain. The edge node may be between the first domain and a second domain. Next, the edge node may pop, in response to a first Service Identifier (SID) in the packet, headers corresponding to the first domain from the packet. The edge node may then push, in response to the first SID, a label stack corresponding to the second domain onto the packet. The first SID may include data corresponding to the label stack. Then the edge node may route the packet to the second domain destine to an end node in the second domain.

    SCALABLE NETWORK SLICE BASED QUEUING USING SEGMENT ROUTING FLEXIBLE ALGORITHM

    公开(公告)号:WO2020092045A1

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

    申请号:PCT/US2019/057322

    申请日:2019-10-22

    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.

    SCALABLE AND PROGRAMMABLE MECHANISM FOR TARGETED IN-SITU OAM IMPLEMENTATION IN SEGMENT ROUTING NETWORKS

    公开(公告)号:WO2020061462A1

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

    申请号:PCT/US2019/052168

    申请日:2019-09-20

    Abstract: The present technology provides a system and method for implementing targeted collection of in-situ Operation, Administration and Maintenance data from select nodes in a Segment Routing Domain. The selection is programmable and is implemented by setting an iOAM bit in the function arguments field of a Segment Identifier. In this way only the nodes associated with local Segment Identifiers (Function field of a Segment Identifier) with an iOAM argument bit are directed to generate iOAM data. The iOAM data generated by target nodes may be stored in TLV field of the segment routing header. The Segment Routing packet is then decapsulated at a Segment Routing egress node and the Header information with the collected iOAM data is sent to a controller entity for further processing, analysis and/or monitoring.

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

    公开(公告)号:WO2014120751A1

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

    申请号:PCT/US2014/013572

    申请日:2014-01-29

    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。

Patent Agency Ranking