EXTENDING A VIRTUAL LOCAL AREA NETWORK ACROSS A LAYER 2 DATA CENTER INTERCONNECT

    公开(公告)号:US20190068449A1

    公开(公告)日:2019-02-28

    申请号:US15683196

    申请日:2017-08-22

    Abstract: The present disclosure involves systems and methods for automating interconnecting or stitching disparate Layer 2 domains across data center interconnects without the need to renumber virtual local area networks (VLANs) within an existing network. The interconnected networks may allow components or virtual machines, such as containers, within the connected networks or data centers to exchange Layer 2 communications while the connected VLANs or fabrics retain existing VLAN identification numbers to minimize alterations made to the data center networks. Further, the process of interconnecting the data centers may be automated such that administrators of the networks may provide an indication of interconnecting the data center networks without the need to manually access and configure edge devices of the networks to facilitate the Layer 2 communication.

    OPTIMIZING EVPN FOR DATA CENTERS WITH REDUNDANT TOP-OF-RACK DEPLOYMENTS

    公开(公告)号:US20170171057A1

    公开(公告)日:2017-06-15

    申请号:US15043079

    申请日:2016-02-12

    CPC classification number: H04L45/02

    Abstract: Presented herein are methods for advertising an IP prefix to address the connectivity problem in multi-chassis link aggregation scenario. A peer switch will advertise two VTEP addresses. It will use a physical IP (PIP) address as a next hop (NH) for a prefix route, while continuing to use a VIP for host IP and MAC route advertisement. A new virtual MAC is introduced and it is derived from the VIP as the router MAC associated with VIP. A switch is made to use a VIP for prefix advertisement when a device detects that the same prefix is reachable both locally and from its peer. This saves adjacency entries consumed in the remote VTEPs. These techniques fix the connectivity issue for prefix routes that is exposed with current EVPN, without requiring any additional adjacency resource consumption.

    TOUCHLESS ORCHESTRATION FOR LAYER 3 DATA CENTER INTERCONNECT IN COMMUNICATIONS NETWORKS
    6.
    发明申请
    TOUCHLESS ORCHESTRATION FOR LAYER 3 DATA CENTER INTERCONNECT IN COMMUNICATIONS NETWORKS 有权
    通信网络中第3层数据中心互连的无连接协调

    公开(公告)号:US20150341220A1

    公开(公告)日:2015-11-26

    申请号:US14286891

    申请日:2014-05-23

    Abstract: A method is provided in one example embodiment and includes receiving from an orchestrator element for a new Virtual Routing and Forwarding element (“VRF”) created in a communications network a name of the VRF and interconnect identification; selecting a border element for the VRF; and creating in a database a VRF entry for the selected border element, the entry identifying a configuration profile for the selected border element. The method further includes forwarding a VRF create notification to the selected border element; and providing the configuration profile from the corresponding entry to the selected border element in response to a query to the database from the selected border element. The selected border element applies the configuration profile automatically to configure the selected border element.

    Abstract translation: 在一个示例实施例中提供了一种方法,并且包括从业务流程元件接收在通信网络中创建的新的虚拟路由和转发元件(“VRF”),VRF的名称和互连标识; 选择VRF的边框元素; 并在数据库中创建所选边界元素的VRF条目,该条目标识所选边框元素的配置简档。 该方法还包括将VRF创建通知转发到所选择的边界元素; 以及响应于从所选择的边界元素向数据库的查询,将配置简档从对应的条目提供给所选择的边界元素。 所选的边框元素将自动应用配置配置文件来配置所选的边框元素。

    Scalable multicast route distribution in a multitenant data center fabric in a network environment
    7.
    发明授权
    Scalable multicast route distribution in a multitenant data center fabric in a network environment 有权
    网络环境中多租户数据中心架构中的可扩展组播路由分布

    公开(公告)号:US09065661B2

    公开(公告)日:2015-06-23

    申请号:US13787453

    申请日:2013-03-06

    CPC classification number: H04L12/18 H04L12/1886 H04L45/16

    Abstract: A method is provided in one example embodiment and includes determining a route target (“RT”) membership for a network element; determining at least one attribute for the RT membership; and advertising the RT membership with the at least one attribute to other network elements. The at least one attribute may include an RT membership type attribute for indicating whether the RT membership is due to a local virtual network connection, transit support, or both. Additionally or alternatively, the at least one attribute may include a distribution tree binding attribute for indicating a distribution tree for the RT membership.

    Abstract translation: 在一个示例实施例中提供了一种方法,并且包括确定网络元件的路由目标(“RT”)成员资格; 确定RT成员资格的至少一个属性; 以及将具有至少一个属性的RT成员资格广告到其他网络元件。 所述至少一个属性可以包括用于指示RT成员资格是由于本地虚拟网络连接,中转支持还是两者的RT成员资格类型属性。 另外或替代地,所述至少一个属性可以包括用于指示RT成员资格的分发树的分发树绑定属性。

    LEARNING BY INFERENCE FROM PREVIOUS DEPLOYMENTS

    公开(公告)号:US20210385133A1

    公开(公告)日:2021-12-09

    申请号:US17407006

    申请日:2021-08-19

    Abstract: The present technology provides a system, method and computer-readable medium for configuration pattern recognition and inference, directed to a device with an existing configuration, through an extensible policy framework. The policy framework uses a mixture of python template logic and CLI micro-templates as a mask to infer the intent behind an existing device configuration in a bottom-up learning inference process. Unique values for device/network identifiers and addresses as well as other resources are extracted and accounted for. The consistency of devices within the fabric is checked based on the specific policies built into the extensible framework definition. Any inconsistencies found are flagged for user correction or automatically remedied by a network controller. This dynamic configuration pattern recognition ability allows a fabric to grow without being destroyed and re-created, thus new devices with existing configurations may be added and automatically configured to grow a Brownfield fabric.

    Scalable handling of BGP route information in VXLAN with EVPN control plane

    公开(公告)号:US10826829B2

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

    申请号:US15864762

    申请日:2018-01-08

    Abstract: A method for programming a MAC address table by a first leaf node in a network comprising a plurality of leaf nodes is provided. Each leaf node comprises one or more Virtual Tunnel End Points (“VTEPs”) and instantiates a plurality of Virtual Routing and Forwarding elements (“VRFs”), with a corresponding Bridge Domain (“BD”) assigned to each VRF. The method includes obtaining information indicating one or more VTEP Affinity Groups (VAGs), each VAG comprising an identification of one VTEP per leaf node, obtaining information indicating assignment of each VRF to one of the VAGs, assigning each VAG to a unique Filtering Identifier (“FID”), thereby generating one or more FIDs, and programming the MAC address table, using FIDs instead of BDs, by populating the MAC address table with a plurality of entries, each entry comprising a unique combination of a FID and a MAC address of a leaf node.

    INTEROPERABILITY BETWEEN DATA PLANE LEARNING ENDPOINTS AND CONTROL PLANE LEARNING ENDPOINTS IN OVERLAY NETWORKS

    公开(公告)号:US20200021555A1

    公开(公告)日:2020-01-16

    申请号:US16577330

    申请日:2019-09-20

    Abstract: A system and a method are disclosed for enabling interoperability between data plane learning endpoints and control plane learning endpoints in an overlay network environment. An exemplary method for managing network traffic in the overlay network environment includes receiving network packets in an overlay network from data plane learning endpoints and control plane learning endpoints, wherein the overlay network extends Layer 2 network traffic over a Layer 3 network; operating in a data plane learning mode when a network packet is received from a data plane learning endpoint; and operating in a control plane learning mode when the network packet is received from a control plane learning endpoint. Where the overlay network includes more than one overlay segment, the method further includes operating as an anchor node for routing inter-overlay segment traffic to and from hosts that operate behind the data plane learning endpoints.

Patent Agency Ranking