Abstract: Techniques are described for balancing traffic load for networks configured in multi-rooted tree topologies, in the presence of link failures. Maximum flows (through minimum cuts) are calculated for subgraphs that incorporate effective link capacities on links between source and destination nodes. Effective link capacities may be determined that take into account link failures, as well as sharing of current available link capacities by multiple nodes. Traffic is balanced while simultaneously fully utilizing available link capacities, even available link capacities on partially failed links (e.g., partially failed Link Aggregation Groups (LAGs)).

Abstract: Disclosed are systems and methods for network architecture that is a server-centric network architectural design.

Abstract: A system, method or computer readable medium to provide efficient congestion notification is described herein. In various embodiments, a packet is received at an intermediate node of one or more data center networks. A current queue length at the intermediate node is determined. A threshold value for the current queue length is tuned by dynamically computing an upper bound and a lower bound based at least in part on the network. The packet is marked to indicate possible congestion in the one or more data center networks when the current queue length exceeds the threshold value. In some embodiments, the packet is marked when it is being de-queued. In a further embodiment, Flexible Initial Packet Size (FIPS) may be utilized to improve the efficiency of the tuning.

Abstract: In some cases, a network monitoring system may determine an operating or health condition of a node or connection link in a network (e.g., a datacenter network) by preparing an encapsulated data packet according to a tunneling protocol. Depending on a result of routing the encapsulated data packet, the network monitoring system determines whether the node or connection link is functioning normally or is experiencing an issue such as overloading or malfunctioning.

Abstract: A load balancer system is described herein which uses one or more switch-based hardware multiplexers, each of which performs a multiplexing function. Each such hardware multiplexer operates based on an instance of mapping information associated with a set of virtual IP (VIP) addresses, corresponding to a complete set of VIP addresses or a portion of the complete set. That is, each hardware multiplexer operates by mapping VIP addresses that correspond to its set of VIP addresses to appropriate direct IP (DIP) addresses. In another implementation, the load balancer system may also use one or more software multiplexers that perform a multiplexing function with respect to the complete set of VIP addresses. A main controller can generate one or more instances of mapping information, and then load the instance(s) of mapping information on the hardware multiplexer(s), and the software multiplexer(s) (if used).

Abstract: The present invention provides an isothermal processing method for making an isothermal processed copper clad aluminum composite comprising: providing an aluminum component and a copper component; cleaning the aluminum component and shape finishing the aluminum component; extruding the aluminum component into a core aluminum billet; cleaning the copper component; transforming the copper component into a copper cladding layer; cladding longitudinal and circumferential surfaces of the core aluminum billet with the copper cladding layer and molding the core aluminum billet and the copper cladding layer together to form a copper cladded aluminum billet; and transforming the copper cladded aluminum billet into an isothermal processed copper cladded aluminum composite through isothermal rolling and annealing. The present invention also provides an isothermal processed copper cladded aluminum composite and a system for manufacturing an isothermal processed copper cladded aluminum composite.

Abstract: Methods and systems for handing off a wireless client between access points wherein the scanning for access points is decoupled from the handing off, thus reducing the delay in handing off. Channel scan delay may be eliminated or reduced in some embodiments by scanning early (prior to actual handoff) and interleaving the channel scan with ongoing traffic in a non-intrusive way. A smart handoff trigger may be used in some embodiments that covers both uplink and downlink quality, and addresses link asymmetry problems. The methods or systems may be implemented in some embodiments in a software-only client-only solution without the need to modify the networks themselves or their access points.

Abstract: This application describes a system and method for auto configuring data center networks. The networks include a plurality of electronic devices that may include switches, servers, routers, or any other device that may be used in a data center network. Graph theory is applied to the arrangement of the network devices to determine if the intended design of the data network matches the actual implementation of the network. This may be achieved by resolving the blueprint graph with the physical graph to determine if they are isomorphic. Also, the isomorphic techniques may be used to detect miswirings in the network that do not cause a node degree change for any of the network components.

Abstract: Implementations are described for controlling, avoiding, and/or minimizing incast congestion in a network. In various embodiments, the network may be a data center network, which may include one or more senders and a receiver that transmit data across the network using Transmission Control Protocol. The receiver may be associated with a receive window that may determine amount of data that may be received by the receiver at a single time. Moreover, a size of the receive window may be adjusted based at least in part on an available bandwidth of the receiver. As a result of an increase or decrease in the receive window, the one or more senders may not be constrained in transmitting data to the receiver and incast congestion at the receiver may be reduced and/or avoided.

Abstract: A method includes storing a partition of a distributed document-oriented database in a computer. It is determined whether an assignment policy is unsatisfied, where the assignment policy specifies locations for documents within the distributed document-oriented database. A request for a transfer transaction to move a document from the computer is initiated when the assignment policy is unsatisfied. There is a wait for an indication of a transfer transaction commit or a transfer transaction abort. The transfer transaction is completed in the event of a transfer transaction commit, such that the document is moved from the computer. The transfer transaction is aborted in the event of a transfer transaction abort, such that the document remains at the computer.

Abstract: This application describes a system and method for auto configuring data center networks. The networks include a plurality of electronic devices that may include switches, servers, routers, or any other device that may be used in a data center network. Graph theory is applied to the arrangement of the network devices to determine if the intended design of the data network matches the actual implementation of the network. This may be achieved by resolving the blueprint graph with the physical graph to determine if they are isomorphic. Also, the isomorphic techniques may be used to detect miswirings in the network that do not cause a node degree change for any of the network components.

Abstract: A system, method or computer readable medium to provide efficient congestion notification is described herein. In various embodiments, a packet is received at an intermediate node of one or more data center networks. A current queue length at the intermediate node is determined. A threshold value for the current queue length is tuned by dynamically computing an upper bound and a lower bound based at least in part on the network. The packet is marked to indicate possible congestion in the one or more data center networks when the current queue length exceeds the threshold value. In some embodiments, the packet is marked when it is being de-queued. In a further embodiment, Flexible Initial Packet Size (FIPS) may be utilized to improve the efficiency of the tuning.

Abstract: The present invention is directed to low toxicity boronated compounds and methods for their use in the treatment, visualization, and diagnosis of tumors. More specifically, the present invention is directed to low toxicity halogenated, carborane-containing 5,10,15,20-tetraphenylporphyrin compounds and methods for their use particularly in boron neutron capture therapy (BNCT) and photodynamic therapy (PDT) for the treatment of tumors of the brain, head and neck, and surrounding tissue. The invention is also directed to using these halogenated, carborane-containing tetraphenylporphyrin compounds in methods of tumor imaging and/or diagnosis such as MRI, SPECT, or PET.

Abstract: This application describes routing packets from a source server to a plurality of ports of a switch. The switch is programmed by the control server and is used to direct incoming data packets to one or more ports of the switch in a manner that reduces congestion of incoming data packets to a destination server. Further, the control server queries congestion information from the switch, and then sends congestion notification back to the source server to either increase or decrease the amount of data being sent to the destination server.

Abstract: This application describes a system and method for auto configuring data center networks. The networks include a plurality of electronic devices that may include switches, servers, routers, or any other device that may be used in a data center network. Graph theory is applied to the arrangement of the network devices to determine if the intended design of the data network matches the actual implementation of the network. This may be achieved by resolving the blueprint graph with the physical graph to determine if they are isomorphic. Also, the isomorphic techniques may be used to detect miswirings in the network that do not cause a node degree change for any of the network components.

Abstract: Implementations are described for controlling, avoiding, and/or minimizing incast congestion in a network. In various embodiments, the network may be a data center network, which may include one or more senders and a receiver that transmit data across the network using Transmission Control Protocol. The receiver may be associated with a receive window that may determine amount of data that may be received by the receiver at a single time. Moreover, a size of the receive window may be adjusted based at least in part on an available bandwidth of the receiver. As a result of an increase or decrease in the receive window, the one or more senders may not be constrained in transmitting data to the receiver and incast congestion at the receiver may be reduced and/or avoided.

Abstract: Disclosed are systems and methods for network architecture that is a server-centric network architectural design.

Abstract: A method and system for providing a multi-level interconnection network is provided. A multi-level interconnection network comprises basic cells that are aggregated into higher level cells at each level of the network. At the first level, the basic cells are aggregated into first level cells. Each first level cell is an aggregation of a number of basic cells that is one more than the number of devices in a basic cell. The basic cells of a first level cell are fully connected; that is, each basic cell has a first level link or connection to each other basic cell. In a first level cell, each device of a basic cell has a first level link to each other basic cell. The multi-level interconnection network has higher level cells that are aggregations of lower level cells in a similar manner.

Abstract: A hybrid Butterfly Cube (“BCube”) architecture is described herein. The BCube architecture is a server-centric network architectural design, and includes a plurality of servers. Each of the plurality of servers may have multiple network ports and serve not only as an end host, but also an intermediate relay node for other servers. The BCube architecture further includes a plurality of switches which are arranged in multiple levels. Each switch has a certain number of network ports for connecting to the servers. The BCube architecture provides multiple parallel paths between any two servers. A packet source routing protocol and a BCube source routing (BSR) protocol are used to determine which path is used for routing a packet between any two servers.

Abstract: A number of data center units in a data center system may be directly connected with each other via switch interfaces. The data center system is server-centric and scalable by storing routing logics (e.g., inter-data center unit logic and/or inner-data center unit logic) at each server to achieve routing, load balancing, and/or fault tolerance. Switch interfaces of the data center units, thus, may be dumb devices and a centralized router for routing data among data center units may be omitted.