Abstract: Examples disclosed herein relate to locally polling the value of a flag to determine whether a resource is free for a thread to use in a system with multiple processing nodes that are incoherent with regards to each other. A flag in a direct attached memory to one of the processing nodes is set to indicate that the resource is not free for the thread to use. A previous tail of a lock list is determined from a list master. The previous tail is located on another one of the processing nodes.

Abstract: An example method for allocating resources in accordance with aspects of the present disclosure includes collecting proposals from a plurality of modules, the proposals assigning the resources to the plurality of modules and resulting in topology changes in a computer network environment, identifying a set of proposals in the proposals, the set of proposals complying with policies associated with the plurality of modules, instructing the plurality of modules to evaluate the set of proposals, selecting a proposal from the set of proposals, and instructing at least one module associated with the selected proposal to instantiate the selected proposal.

Abstract: A technique includes using circuit switches to selectively couple packet switches of a switch assembly to the port connectors of the assembly.

Abstract: A computer system operates as a computing node of a fabric computing system, to receive write requests over a memory fabric channel from a sender node. The computer system determines an interrupt vector identifier (VID) for individual write requests that specify a monitored portion of memory. When a write request is to the monitored portion of memory, a processor of the computer system initiates an interrupt that is based on the interrupt VID.

Abstract: Embodiments herein relate to addition or modification to a forwarding table based on an address. A first packet having a source address and a location value may be received. The source address includes a source of the first packet and the location value indicates at least part of a route along a network to the source address. The forwarding table is not modified or no new entry is added to the forwarding table, if the forwarding table does not include the source address.

Abstract: A photonic interconnect apparatus includes tunable light devices, multiplexers to multiplex optical signals produced by the tunable light devices onto optical paths, and a cyclic arrayed waveguide grating (AWG) to receive the optical signals over the optical paths, and to direct a given optical signal of the received optical signals to a selected output of a plurality of outputs of the cyclic AWG based on a wavelength of the given optical signal. A respective demultiplexer directs the given optical signal to a selected output of a plurality of outputs of the respective demultiplexer according to which coarse wavelength band the wavelength of the given optical signal is part of.

Abstract: A method may include determining whether a host destination address of a packet received at a particular switch of a switching fabric is associated with a virtual switch address. In response to a determination that the host destination address is associated with the virtual switch address, the method may also include encapsulating the packet with the virtual switch address as a destination fabric address, where the virtual switch address is associated with a virtual switch including a first physical switch and a second physical switch. The method may further include selecting one of the first physical switch and the second physical switch as a routing path. The method may further include routing the packet to the selected physical switch based on the virtual switch address and transmitting the packet from the selected physical switch to a client switch.

Abstract: A configurable Clos network includes leafs and spines and a switch fabric that connects the leafs and the spines. The switch fabric couples each leaf port of each leaf to at least one spine port of each spine.

Abstract: Example embodiments relate to providing efficient routing in software defined networks. In example embodiments, an indirect group table includes a first group entry that is associated with a first route tree in a software defined network. A failure is detected in the first route tree during a data transmission, and a notification of the failure is sent to a remote controller device, where the remote controller device identifies a second route tree that does not include the failure. After the remote controller device updates the first group entry to be associated with the second route tree, the data transmission is performed using the second route tree.

Abstract: The present disclosure is generally related to a method for wireless software-defined networking. The method includes establishing a wireless link between an access point of a network and a plurality of client devices. The method includes generating a time schedule. The time schedule allocates a time window to each of the plurality of client devices. Each time window defines when a plurality of client devices is allowed to communicate within the network via the access point.

Abstract: An example method for allocating resources in accordance with aspects of the present disclosure includes collecting proposals from a plurality of modules, the proposals assigning the resources to the plurality of modules and resulting in topology changes in a computer network environment, identifying a set of proposals in the proposals, the set of proposals complying with policies associated with the plurality of modules, instructing the plurality of modules to evaluate the set of proposals, selecting a proposal from the set of proposals, and instructing at least one module associated with the selected proposal to instantiate the selected proposal.

Abstract: Illustrated is a system and method to generate a teaching message with a host device address that impersonates a device source address, the impersonation to instruct an additional network device as to the host device address. It further include a transmitter to transmit the teaching message to the additional network device. It also includes traversing a forwarding table to identify an additional network device that has yet to receive a teaching message since an expiration of a predefined threshold value, the teaching message to relate to a source device. It also includes a transmitter to transmit a teaching message to the additional network device.

Abstract: A method for load balancing Ethernet traffic within a fat tree network (315, 455) includes randomly assigning incoming messages (510) into hash classes using a hash function (520); allocating the hash classes among uplinks (550); and transmitting the incoming messages on the uplinks (550) according to the hash class. A network switch (515) for load balancing communication flows in a fat tree network (315, 455) includes downlinks (545) and uplinks (550); the network switch (515) being configured to route communication flows among the downlinks (545) and uplinks (550); a hash module (520) which receives a MAC address from a message (510) and outputs a hash address; and a TCAM lookup module (535) which allocates the hash address into a hash class and allocates the hash class to one of the uplinks (550).

Abstract: A configurable Clos network includes leafs and spines and a switch fabric that connects the leafs and the spines. The switch fabric couples each leaf port of each leaf to at least one spine port of each spine.

Abstract: As an example, a system and method is provided for allocating network bandwidth. The method includes identifying congested and uncongested links using a tenant demand for each link and a tenant bandwidth cap. A portion of the tenant bandwidth cap may be allocated to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap. Additionally, the remainder of the tenant bandwidth cap may be allocated to the tenants congested links based on a link capacity.

Abstract: In a method (400) for routing packets between a plurality of top switches (110a-110n) and a plurality of leaf switches (120a-120n) using a balancing table (204, 208, 210) in a fat tree network (100), a failed link between at least one top switch (110n) and at least one leaf switch (120n) is detected (402). In addition, the balancing table (204, 208, 210) is modified (406) based on the detected failed link, and the packets are routed (408) between the plurality of top switches (110a-110n) and the plurality of leaf switches (120a-120n) in the fat tree network (100) based on the modified balancing table (204, 208, 210).

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: A system and method are provided to route packets in a data center network. Individual packets are encapsulated at an edge of the data center network, so that each encapsulated packet includes a set of header fields, such as a tenant identifier. For each encapsulated packet, a hash class is determined from the set of header fields. A routing virtual local area network (VLAN) is selected for the packet based on the tenant identifier and the hash class.

Abstract: An optical connection infrastructure has optical conduits between first devices and at least one second device. Dynamic reconfiguration of the optical connection infrastructure can be performed from a first connection topology to a second, different connection topology based on programming of the first devices.

Abstract: In a method for routing packets between a plurality of switches in a computer network, in which paths between the plurality of switches are identified as a plurality of virtual local area networks (VLANs) stored in a balancing table, a packet to be routed from a source switch to a destination switch is received. In addition, a VLAN is selected from the plurality of VLANs in the balancing table to route the packet through the computer network and the packet is routed through the selected VLAN.