H04L12/755

OPERATION MANAGEMENT APPARATUS, METHOD, AND NON-TRANSITORY COMPUTER READABLE MEDIUM
20210029084 · 2021-01-28 · ·

An object is to provide an operation management apparatus, a method, and a program capable of predicting, when a service providing apparatus for providing services to users stops its operation for a predetermined time, effects on the services. An operation management apparatus according to the present disclosure includes an acquisition unit configured to acquire stop information indicating that a predetermined apparatus stops its operation for a predetermined time, and a specification unit configured to specify communication route information containing the predetermined apparatus from communication list information as specified communication route information, the communication list information including a plurality of pieces of communication route information in which communication transmission-source apparatus information, in-route apparatus information, transmission-destination apparatus information, and a communication allowable time are associated with each other.

SYSTEM AND METHOD FOR HANDLING IGP FLOODING TOPOLOGY INCONSISTENCY
20210029017 · 2021-01-28 ·

A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

PER-APPLICATION SPLIT-TUNNELED PROXY
20210021518 · 2021-01-21 ·

Disclosed are various embodiments for providing split-tunneled network connectivity on a per-application basis. A request to make a connection, such as a transmission control protocol (TCP) or a universal datagram protocol (UDP) connection, to a remote host specified by an internet protocol (IP) address in the request is received from a network driver. A hostname lookup table is queried to determine a hostname associated with the IP address for the remote host. A policy is identified based on the hostname associated with the IP address for the remote host. Then, the connection is routed based on the policy.

OPTIMIZING IP MULTICAST DELIVERY WITH USE OF LOCAL SOURCE NODES AND THE PROPAGATION OF ADVERTISEMENTS THEREFOR

In one illustrative example, a network node connected in a network fabric may identify that it is established as part of a multicast distribution tree for forwarding multicast traffic from a source node to one or more host receiver devices of a multicast group. In response, the network node may propagate in the network fabric a message for advertising the network node as a candidate local source node at which to join the multicast group. The message for advertising may include data such as a reachability metric. The propagation of the message may be part of a flooding of such messages in the network fabric. The network node serving as the candidate local source node may thereafter locally join a host receiver device in the multicast group at the network node so that the device may receive the multicast traffic from the source node via the network node.

LINK STATE ADDITION AND DELETION BASED ON RECEPTION OF A SINGLE MESSAGE IN LINK STATE VECTOR ROUTING
20210014148 · 2021-01-14 ·

Techniques for updating a routing table based on a single message are described. One technique includes receiving at a first network device a node message from a second network device. The node message includes a sequence number and a list of link state(s) originated by the second network device. The first network device determines whether to withdraw one or more link states originated by the second network device and maintained in a routing table of the first network device based on the sequence number and the list of the link state(s) within the node message. The routing table is updated based on the determinations.

Container-based cloud exchange disaster recovery

In general, this disclosure describes techniques for coordinating, with a cloud exchange, automated cloud-based disaster recovery across containers from a failed cloud service to a backup cloud service. In some examples, an orchestration engine for a cloud exchange is configured to: detect an indication of a disruption in a first cloud service provided by a first cloud service provider network coupled to the cloud exchange to send and receive data packets via the cloud exchange; provision, in response to detecting the indication of the disruption in the first cloud service, disaster recovery infrastructure layers in containers of a second cloud service provided by a second cloud service provider network coupled to the cloud exchange; obtain code and state from containers of the first cloud service; and communicate the code and state to the disaster recovery infrastructure layers in the containers of the second cloud service.

Segment routing network processing of packets including packets having a segment identifier structure providing processing and/or memory efficiencies

In one embodiment, segment routing (SR) network processing of packets is performed on packets having a segment identifier structure providing processing and/or memory efficiencies. Responsive to an identified particular segment routing policy, the particular router retrieves from memory a dynamic segment routing identifier portion of the particular SR policy that includes a SR node value and a SR function value. The SR function value identifies segment routing processing to be performed by a router in the network identified based on the SR node value. A segment routing discriminator is independently identified, possibly being a fixed value for all segment identifiers in the network. Before sending into the network, a complete segment identifier is added to the particular packet by combining the segment routing discriminator with the dynamic segment routing identifier portion. The particular packet including the complete segment identifier is sent into the network.

Efficient algorithm to eliminate redundant specific prefixes in forwarding information base using trie

In general, the invention relates to a method for programming a network element. The method includes detecting an addition of a first route in a routing information base (RIB) on the network element, adding, in response to detecting the addition, a first route network prefix associated with the first route to a network prefix trie (NPT), identifying, based on the adding, a first parent network prefix for the first route network prefix using the NPT, making a first determination that the first route network prefix and the first parent network prefix are reachable via a first common next hop connected to the network element, and waiving, based on the first determination, a creation of a forwarding information base (FIB) entry associated with the first route network prefix in a FIB on the network element.

Forwarding path link table packet in software defined network

A forwarding path link table packet is generated, the forwarding path link table packet comprises forwarding information of each SDN switch on a forwarding path; and the forwarding path link table packet is delivered to any one of SDN switches on the forwarding path, to enable the forwarding path link table packet to be delivered among SDN switches on the forwarding path, so as to cause each SDN switch that receives the forwarding path link table packet to generate a forwarding flow table entry of the SDN switch according to the forwarding information of the SDN switch in the forwarding path link table packet, and forward the forwarding path link table packet on the forwarding path.

OPERATING A SERVICE PROVIDER NETWORK NODE
20200412667 · 2020-12-31 ·

Certain aspects of the present disclosure provide a method of operating a service provider network node in a service provider network, comprising: establishing an interface between a control plane processing part and a data plane processing part for routing of control packets at the data plane processing part; at the control plane processing part, generating a control packet for routing through the service provider network; and at the control plane processing part, sending the control packet to the data plane processing part via the interface, to cause the data plane processing part to route the control packet through the service provider network using the one or more routing tables maintained by the data plane processing part in response to receiving the control packet from the control plane processing part via the interface.