Abstract: Example embodiments relate to elephant flow detection in a computing device. In example embodiments, a computing device may monitor a socket for a given flow. The computing device may then determine whether the flow is an elephant flow based on the monitoring of the socket. If so, the computing device may signal the network that transmits the flow that the flow is an elephant flow.

Abstract: According to an example, a method for virtual machine (VM) data packet encapsulation and decapsulation may include receiving a data packet including a media access control (MAC) header and an internet protocol (IP) header. The method may further include encapsulating, by a processor, the received data packet to include an encapsulating MAC header, an encapsulating IP header, a VM MAC header with a same content as the MAC header of the received data packet, and a VM IP header with a same content as the IP header of the received data packet.

Abstract: According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

Abstract: Allocating bandwidth in a network (100) may include reducing initial bandwidth allocations for each tenant on a link (113) such that a sum of the bandwidth allocations is equal to or less than a capacity of the link and distributing a residual of the initial bandwidth allocations to at least one under-allocated link (114).

Abstract: Connectors of a first removable modular optical connection assembly, having a first predefined arrangement of optical signal conduits, are connected to respective connectors on a support structure that are optically connected to corresponding devices. The first modular optical connection assembly is replaceable with a second modular optical connection assembly having a second, different predefined arrangement of optical signal conduits, to change a topology of a network.

Abstract: A rate limit manager is to assign network traffic flows to hardware rate limiters. The network traffic flows are associated with rate limit values. The rate limit manager determines threshold values to assign flow(s) to hardware rate limiters, and the rate limit manager is to assign flow(s) to a last remaining unassigned hardware rate limiter independent of the threshold value.

Abstract: Selected ones of multiple groups of network entities are assigned to corresponding routing structures, where each of the routing structures defines a set of paths through a network among network entities of a corresponding one of the groups. The assigning considers available multicast resources in communication nodes in the network, and a criterion relating to reducing overall cost in the assignment of the selected groups to the corresponding routing structures.

Abstract: A datacenter network, method, and non-transitory computer readable medium for reducing cabling costs in the datacenter network are provided. The datacenter network is represented by a network topology that interconnects a plurality of network elements and a physical topology that is organized into a plurality of physical elements and physical units. A network design module assigns network elements to the plurality of physical elements and physical units based on a hierarchical partitioning of the physical topology and a matching hierarchical partitioning of the network topology that reduces costs of cables used to interconnect the network elements in the physical topology.

Abstract: Forwarding a flow in a network includes receiving the flow at a switch, determining an optimized priority queue level of the flow at the switch, and forwarding the flow via the switch using an optimized priority queue level of the flow at the switch. The flow passes through a plurality of switches, including the switch, in the network, and the optimized priority queue level of the flow at the switch is different from a priority queue level of the flow at a second switch of the plurality of switches. The second switch routes the flow at the second switch using the different priority queue level for the flow.

Abstract: A subtree within a global tree of nodes is created by determining a predicate condition. The predicate condition is disseminated to the nodes in the global tree. For each node in the global tree, a determination of whether the node belongs to the subtree is performed, and an indication of whether the node belongs to the subtree is stored. After the subtree is created, a query corresponding to the subtree is put to the subtree for resolution.

Abstract: Local rules for managing flows devolved from a central controller are received at a switch. The central controller determines a global set of rules for managing flows. The switch receives a packet from a flow from a network and determines whether a metric for the flow satisfies a dynamic condition to trigger a metric report to the central controller. In response to a determination that the metric for the flow at the switch satisfies the dynamic condition to trigger a metric report to the central controller, the switch sends a metric report to the central controller, and the switch then receives an instruction to manage the flow from the central controller. In response to a determination that the metric for the flow at the switch does not satisfy the dynamic condition to trigger the metric report to the central controller, the switch manages the flow using the local rules for managing flows.

Abstract: A method of generating a plurality of potential network topologies is provided herein. The method includes receiving parameters that specify a number of servers, a number of switches, and a number of ports in the switches. The parameters are for configuring a network topology. The method also includes generating one or more potential network topologies comprising the set of potential network topologies, for each of a number of dimensions. The number of dimensions is based on the number of switches. The method further includes determining that the set of potential network topologies is structurally feasible. Additionally, the method includes determining an optimal link aggregation (LAG) factor in each dimension of each of the set of potential network topologies.

Abstract: A method of generating a plurality of potential generalized fat tree network (GFT) topologies is provided herein. The method includes receiving parameters that specify a number of servers, a number of switches, and a number of ports in the switches. The parameters are for configuring an GFT topology. The method also includes generating a plurality of potential GFT topologies based on heuristics that favor higher bandwidth and lower latency. Generating the plurality of potential GFT topologies includes generating each level of the potential GFT topologies, recursively, and from a bottom level of a potential GFT topology to a top level.

Abstract: Managing a forwarding table in a switch of a computer network includes determining an entry in the forwarding table in a data plane in the switch to replace with a new entry to minimize a future flooding caused by a forwarding table miss of the forwarding table. The managing also includes storing a forwarding information base in the control plane, and the forwarding information base includes entries from the forwarding table.

Abstract: Proactive sending of an IP-to-MAC address binding for a node is performed if a node is determined to be a high fan-in node. If the node is determined to be a high fan-in node, the node periodically sends its IP-to-MAC address binding to nodes in a network. If the node is not determined to be a high fan-in node, the node sends its IP-to-MAC address binding in response to receiving a request for the node's IP-to-MAC address binding.

Abstract: In a method for minimizing pathological flooding of a network using a destination node, a packet is received from a source node at the destination node. The packet is transmitted from the source node to the destination node along a path. A determination is made by a node whether the packet indicates a possibility of pathological flooding. In response to a determination that the packet indicates a possibility of pathological flooding, a dummy packet is forwarded along the path to the source node.

Abstract: Example embodiments relate to elephant flow detection in a computing device. In example embodiments, a computing device may monitor a socket for a given flow. The computing device may then determine whether the flow is an elephant flow based on the monitoring of the socket. If so, the computing device may signal the network that transmits the flow that the flow is an elephant flow.

Abstract: A method for routing data on a fat-tree network using network switches includes assigning a customized MAC address to each host device in the network. The customized MAC address has a set of bits for each level in the fat-tree network, each set of bits corresponding to a division of the network in which the host device is located. Each switch applies a MAC subnet mask to a destination MAC address of each received packet and performs at least one hashing function on the masked destination MAC address to determine a forwarding port for the packet.

Abstract: In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.

Abstract: In an embodiment, a system and method may manage network resources to provide a near zero-cost background replication of data. Such a system may be inhibited from causing interference with foreground data flows. Such a system may also utilize a large fraction of spare network bandwidth. A system configured to implement such a method may include one or more servers and at least one client in communication via a network. Additionally the system may include a hint server, a monitor and/or a front-end application between a demand server and the network.