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

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: A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees.

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

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

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: An extended wireless access point may have many distributed radio units connected to associated processing units via a radio transmission network comprising commodity switches controlled by one or more network controllers. The one or more network controllers may use a load balancing algorithm to select a processing unit to process a signal received by a distributed radio unit. The radio units may receive a wireless signal, and generate compressed samples of the wireless signal for transport via the radio transmission network and processing by a selected processing unit. Similarly, a processing unit may generate and transmit via the radio transmission network compressed samples for decompression and transmission by a radio unit.

Abstract: Some implementations include routing and/or delivering communications within a network system. In one example, a packet source may be configured to recursively encode a data delivery tree so that any sub-tree formed from the data delivery tree compresses a continuous data block of the data delivery tree.

Abstract: A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees.

Abstract: An extended wireless access point may have many distributed radio units connected to associated processing units via a radio transmission network comprising commodity switches controlled by one or more network controllers. The one or more network controllers may use a load balancing algorithm to select a processing unit to process a signal received by a distributed radio unit. The radio units may receive a wireless signal, and generate compressed samples of the wireless signal for transport via the radio transmission network and processing by a selected processing unit. Similarly, a processing unit may generate and transmit via the radio transmission network compressed samples for decompression and transmission by a radio unit.

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: Some implementations include routing and/or delivering communications within a network system. In one example, a packet source may be configured to recursively encode a data delivery tree so that any sub-tree formed from the data delivery tree compresses a continuous data block of the data delivery tree.

Abstract: A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees.

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: Disclosed are systems and methods for network architecture that is a server-centric network architectural design.

Abstract: A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees.