Abstract:
A method includes associating overlay network attributes (ONAs) with overlay virtual networks. The ONAs are managed as portable entities. A movement operation is performed on components of at least one overlay virtual network of the overlay virtual networks to servers based on management of the ONAs. An ONA is modified to identify attributes associated with the movement operation of the components of the at least one overlay virtual network.
Abstract:
Embodiments relate to controlling workload flow on converged Ethernet links. An aspect includes coupling, by a processing device, a first control loop to a second control loop. The second control loop monitors the operation of the first control loop. An equilibrium set point is initialized for the second control loop prior to commencing operation of the first control loop. Accordingly, the equilibrium set point value is adjusted in the second control loop continuously based on a rate of operation of the first control loop.
Abstract:
A method includes associating overlay network attributes (ONAs) with virtual networks. A movement operation is performed that includes re-assigning the virtual networks to servers of overlay networks based on management of the ONAs.
Abstract:
Embodiments of the invention relate to providing virtual network domain movement operations for overlay networks. One embodiment includes a method that includes determining one or more overlay network attributes (ONAs) for a plurality of virtual networks. The one or more ONAs are associated with the virtual networks. The one or more ONAs are managed as one or more portable entities by one or more of creating ONAs, deleting ONAs, moving ONAs, combining ONAs and dividing ONAs. A movement operation is performed on the one or more virtual networks among one or more servers of one or more overlay networks based on the management of the one or more ONAs.
Abstract:
A virtual network is implemented on a physical network. A virtual network data packet is tunneled through the physical network via encapsulation within a physical network data packet and via transmission of the physical network data packet through the physical network. A network congestion notification capability of the virtual network is preserved and modified during transmission of virtual network data through the physical network and vice-versa. Congestion notification metadata can be copied from a header of a virtual network data packet to a header of a physical network data packet when the virtual network data packet is encapsulated into the physical network data packet. Congestion notification metadata can be copied from a header of a physical network data packet to a header of a virtual network data packet when the virtual network data packet is decapsulated from the physical network data packet.
Abstract:
In one embodiment, a system includes a hardware processor and logic integrated with and/or executable by the processor. The logic is configured to classify a traffic flow into a traffic class based on at least one criteria related to the traffic flow and request that a credit manager remap flow credits corresponding to a first traffic class to flow credits corresponding to a second traffic class. In another embodiment, a method for providing credit-based flow control includes classifying a traffic flow into a traffic class based on at least one criteria related to the traffic flow, the traffic class being selected from a plurality of traffic classes. The method also includes storing an identifier indicating the traffic class of packets of the traffic flow according to a virtual local area network (VLAN) identifier in a three bit VLAN tag portion of a header of one or more of the packets.
Abstract:
A method for generating a switch fabric topology, comprising constructing a first switch fabric topology, modifying the first switch fabric topology to generate a second switch fabric topology, wherein modifying the first switch fabric topology comprises isolating center stage sets of the first switch fabric topology, and replacing each of the isolated center stage sets with a single × switching element to generate the second switch fabric topology, wherein is an integer representing a radix of the switching element determined in connection with the constructing of the first switch fabric topology.
Abstract:
In one embodiment, a system includes a hardware processor and logic integrated with and/or executable by the processor. The logic is configured to classify a traffic flow into a traffic class based on at least one criteria related to the traffic flow and request that a credit manager remap flow credits corresponding to a first traffic class to flow credits corresponding to a second traffic class. In another embodiment, a method for providing credit-based flow control includes classifying a traffic flow into a traffic class based on at least one criteria related to the traffic flow, the traffic class being selected from a plurality of traffic classes. The method also includes storing an identifier indicating the traffic class of packets of the traffic flow according to a virtual local area network (VLAN) identifier in a three bit VLAN tag portion of a header of one or more of the packets.
Abstract:
A network fabric may divide a physical connection into a plurality of VLANs as defined by IEEE 802.1Q. Moreover, many network fabrics use Priority Flow Control to identify and segregate network traffic based on different traffic classes or priorities. Current routing protocols define only eight traffic classes. In contrast, a network fabric may contain thousands of unique VLANs. When network congestion occurs, network devices (e.g., switches, bridges, routers, servers, etc.) can negotiate to pause the network traffic associated with one of the different traffic classes. Pausing the data packets associated with a single traffic class may also stop the data packets associated with thousands of VLANs. The embodiments disclosed herein permit a network fabric to individually pause VLANs rather than entire traffic classes.
Abstract:
A method and system are provided for implementing a hierarchical high radix switch with a time-sliced crossbar. The hierarchical high radix switch includes a plurality of inputs and a plurality of outputs. Each input belongs to one input group; each input group sends consolidated requests to each output, by ORing the requests from the local input ports in that input group. Each output port belongs to one output group; each output port grants one of the requesting input groups using a rotating priority defined by a next-to-serve pointer. Each output group consolidates the output port grants and allows one grant to pass back to an input group. Each input port in an input group evaluates all incoming grants in an oldest packet first manner to form an accept. Each input group consolidates the input port accepts and selects one accept to send to the output port.