H04L49/1569

Defining non-forwarding adjacencies in bipartite networks, such as Clos newtorks, having a level 2 backbone and level 1 nodes

Problems associated with providing a large Clos network having at least one top of fabric (ToF) node, a plurality of internal nodes, and a plurality of leaf nodes may be solved by: (a) providing L2 tunnels between each of the leaf nodes of the Clos and one or more of the at least one ToF node to ensure a non-partitioned IGP L2 backbone, and (b) identifying the L2 tunnels as non-forwarding adjacencies in link state topology information stored in ToF node(s) and leaf node(s) such that the L2 tunnels are not used for forwarding traffic. In some example implementations consistent with the present disclosure, the L2 tunnels are not used to compute routes from the link state topology information. Alternatively, in some other example implementations consistent with the present disclosure, the L2 tunnels are used to compute routes, but such routes are not used, or only used if no routes using only L1 (or L1-down adjacencies) are available. In some example implementations consistent with the present disclosure, L2 prefix information is leaked down to L1 of the IGP.

Address translation for external network appliance

Systems, methods, and computer-readable media relate to providing a network management service. A system is configured to request first network information from a first component of a network using a public IP address for the first component, wherein the first network information includes private IP addresses for a second component in the network and translate, based on a mapping information for a private IP address space to a public IP address space, the private IP address for a second component to a public IP address for the second component. The system is further configured to request second network information from the second component using the public IP address and provide a network management service for the network based on the second network information.

PACKET SENDING METHOD, DEVICE, AND SYSTEM

The method includes: generating, by a first device, a first packet including a BIER header, where the BIER header includes entropy, and the entropy includes a first part and a second part; determining, by the first device based on the first packet, that there are a plurality of forwarding entries used to forward the first packet; selecting, by the first device, one forwarding entry from the plurality of forwarding entries based on the first part, where the selected forwarding entry includes an address of a second device, and the second device is a next-hop device of the first device; and sending, by the first device, the first packet to the second device, where the second part is used by the second device to select, from a plurality of forwarding entries used to forward the first packet, a forwarding entry used by the second device to forward the first packet.

Packet Control Method, Flow Table Update Method, and Node Device
20210135999 · 2021-05-06 ·

A packet control method, a flow table update method, and a node device including a first queue and a second queue, where the method includes: obtaining, by the node device, a first packet; determining, by the node device, that a data flow to which the first packet belongs is marked as an isolated flow; and if the first queue and/or the second queue meet and/or meets a first preset condition, controlling, by the node device, the first packet to enter the first queue and wait to be scheduled; or if the first queue and/or the second queue meet and/or meets a second preset condition, controlling, by the node device, the first packet to enter the second queue and wait to be scheduled.

ACCURATE ANALYTICS, QUALITY OF SERVICE AND LOAD BALANCING FOR INTERNET PROTOCOL FRAGMENTED PACKETS IN DATA CENTER FABRICS

A network device receives a fragmented packet of an internet protocol (IP) packet. The fragmented packet is subsequently received relative to an initial fragmented packet of the IP packet and includes a first set of tuple information. The network device determines an entry of a hash table associated with the IP packet, based on the first set of tuple information and a fragment identifier (ID) within the fragmented packet. The network device retrieves a second set of tuple information associated with the fragmented packet from the hash table entry, and transmits an indication of the first and second sets of tuple information.

BGP aggregation in Clos networks

The present disclosure provides Border Gateway Protocol route aggregation in a Clos fabric when one or more communication failures are detected. A method includes receiving a prefix component of a first aggregate route from a first next hop node, the prefix component being associated with a failed network element; announcing, to one or more neighboring nodes, the first aggregate route along with the prefix component and the first next hop node associated with the failed network element; identifying, by the one or more neighboring nodes, a second aggregate route, the second aggregate route being a shortest aggregate route that contains the first aggregate route; and generating, from the second aggregate route, one or more Chad routes to the prefix component of the first aggregate route, wherein the one or more Chad routes are associated with one or more next hop nodes that are different from the first next hop node.

DISINTEGRATED SOFTWARE DEFINED OPTICAL LINE TERMINAL
20210036778 · 2021-02-04 ·

The present disclosure relates to an optical line terminal device. The optical line terminal device includes a data center point of presence module, one or more access point of presence module and one or more aggregation point of presence module. The data center point of presence module includes a first region and a second region. The first region includes a leaf and spine fabric and a top-of-rack architecture. The second region includes compute infrastructure and storage infrastructure. Further, the one or more access point of presence module includes optical line terminal-Gigabit Passive Optical Networks access input/output and Metro Ethernet Access input/output. The one or more aggregation point of presence module includes access input/output hardware abstraction, limited compute infrastructure and multi-protocol label switching transfer router.

Physical network orchestration for data centers

A method is provided in one example embodiment and includes creating a segment organization, which includes a configuration profile. The method also includes attaching the configuration profile to a server in the segment organization. The method further includes sending the attached configuration profile to a database in a physical network.

SWITCHING AND LOAD BALANCING TECHNIQUES IN A COMMUNICATION NETWORK

A source access network device multicasts copies of a packet to multiple core switches, for switching to a same target access network device. The core switches are selected for the multicast based on a load balancing algorithm managed by a central controller. The target access network device receives at least one of the copies of the packet and generates at least metric indicative of a level of traffic congestion at the core switches and feeds back information regarding the recorded at least one metric to the controller. The controller adjusts the load balancing algorithm based on the fed back information for selection of core switches for a subsequent data flow.

BGP AGGREGATION IN CLOS NETWORKS
20200313956 · 2020-10-01 ·

The present disclosure provides Border Gateway Protocol route aggregation in a Clos fabric when one or more communication failures are detected. A method includes receiving a prefix component of a first aggregate route from a first next hop node, the prefix component being associated with a failed network element; announcing, to one or more neighboring nodes, the first aggregate route along with the prefix component and the first next hop node associated with the failed network element; identifying, by the one or more neighboring nodes, a second aggregate route, the second aggregate route being a shortest aggregate route that contains the first aggregate route; and generating, from the second aggregate route, one or more Chad routes to the prefix component of the first aggregate route, wherein the one or more Chad routes are associated with one or more next hop nodes that are different from the first next hop node.