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.
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.
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:
Resource rationing for network slices in segment routing networks may be provided. A network slice may be created in a communication network. A portion of network resource may be dedicated to the network slice. The dedicated portion of network resource may be bound to the network slice using a segment identifier. The segment identifier may be advertised to the communication network. Data packets associated with the network slice may be routed using the dedicated portion of network resource.
Abstract:
A method is disclosed for use by a network element coupled with an optical transport network. The method comprises calculating an optical path from a first packet-terminated optical interface of the network element to a second packet-terminated optical interface of a destination network element coupled with the optical transport network, and signaling the optical transport network to create the optical path. The method further comprises creating an Ethernet interface corresponding to the first packet-terminated optical interface, and adding the Ethernet interface to an Ethernet bundle interface. The method further comprises communicating across the optical path using addressing of the Ethernet bundle interface.
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:
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.
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.
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.
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.