Patent classifications
H04L45/50
LAYER 3 CONVERGENCE FOR EVPN LINK FAILURE
A network device is configured to provide, via an Ethernet segment with a customer network, active-active multi-homing L2 virtual bridge connectivity to the customer network using an EVPN instance (EVI) and L3 routing using an IRB interface that is a L3 routing interface assigned to the EVI; to receive, from a peer PE device of the EVPN instance, an EVPN route comprising an L2-L3 binding for a customer device of the customer network and associating the L2-L3 binding with the Ethernet segment, the L2-L3 binding comprising an L2 and an L3 address assigned to the customer device, wherein the peer PE device provides, with the network device and via the Ethernet segment, active-active multi-homing L2 virtual bridge connectivity to the customer network; and to forward, via the Ethernet segment and based at least on the L2-L3 binding received from the peer PE device, an L3 packet to the customer device.
AUTO DISCOVERY AND AUTO SCALING OF SERVICES IN SOFTWARE-DEFINED NETWORK ENVIRONMENT
Techniques are described for automatic discovery of two or more virtual service instances configured to apply a given service to a packet in a software-defined networking (SDN)/network functions virtualization (NFV) environment. Virtual service instances may be deployed as virtual entities hosted on one or more physical devices to offer individual services or chains of services from a service provider. The use of virtual service instances enables automatic scaling of the services on-demand. The techniques of this disclosure enable automatic discovery by a gateway network device of virtual service instances for a given service as load balancing entities. According to the techniques, the gateway network device automatically updates a load balancing group for the given service to include the discovered virtual service instances on which to load balance traffic for the service. In this way, the disclosed techniques provide auto-scaling and auto-discovery of services in an SDN/NFV environment.
BANDWIDTH MANAGEMENT FOR RESOURCE RESERVATION PROTOCOL LSPS AND NON-RESOURCE RESERVATION PROTOCOL LSPS
In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.
DETERMINING THE OPERATIONS PERFORMED ALONG A SERVICE PATH/SERVICE CHAIN
Presented herein are techniques performed in a network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes the respective network nodes in a service path. At a network node, an indication is received of a failure or degradation of one or more service functions or applications applied to traffic at the network node. Data descriptive of the failure or degradation is generated. A previous service hop network node at which a service function or application was applied to traffic in the service path is determined. The data descriptive of the failure or degradation is communicated to the previous service hop network node.
Service Dependent IP Addresses
A system that enables end-user devices that operate within different enterprise networks to exchange data with one another. In particular, the disclosed system uses unique IP addresses that are dedicated solely to supporting a predefined communication service between enterprise computer networks, in order to identify and route each data packet according to the communications service. As part of the communications service, the data packets are transmitted, for example, from a first local service provider network hosting a first enterprise network, through a participating backbone service provider network on the public Internet and based on deterministic routing, and to a second local service provider network hosting a second enterprise network. In handling the data packets in this way, the disclosed system creates an Internet wide-area-network (WAN): the data packets are transmitted over the Internet and conceivably over a large geographic distance between enterprise networks.
NETWORK TRAFFIC CLASSIFICATION
A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.
Multi-MAC controller and single PHY systems and methods
The present disclosure relates to multi-MAC controllers and single PHY systems and methods. An example method may include receiving, at a remote PHY device and from a first MAC device located at a headend of a network, a first data packet, including a first identifier. The example method may also include determining, by the remote PHY device and using the first identifier included in the first data packet, a first output of the PHY device onto which to transmit the first data packet, the first output including a first group of customer devices. The example method may also include receiving, at the remote PHY device and from a second MAC device located at the headend, a second data packet, including a second identifier. The example method may also include determining, by the remote PHY device and using the second identifier included in the second data packet, a second output of the PHY device onto which to transmit the second data packet, the second output including a second group of customer devices.
Multi-MAC controller and single PHY systems and methods
The present disclosure relates to multi-MAC controllers and single PHY systems and methods. An example method may include receiving, at a remote PHY device and from a first MAC device located at a headend of a network, a first data packet, including a first identifier. The example method may also include determining, by the remote PHY device and using the first identifier included in the first data packet, a first output of the PHY device onto which to transmit the first data packet, the first output including a first group of customer devices. The example method may also include receiving, at the remote PHY device and from a second MAC device located at the headend, a second data packet, including a second identifier. The example method may also include determining, by the remote PHY device and using the second identifier included in the second data packet, a second output of the PHY device onto which to transmit the second data packet, the second output including a second group of customer devices.
SEGMENT ROUTING OVER LABEL DISTRIBUTION PROTOCOL
An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).
SEGMENT ROUTING OVER LABEL DISTRIBUTION PROTOCOL
An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).