Abstract:
An embodiment of a system and method that uses inline measurements to probe available bandwidth for a transmission control protocol, and adaptively sets a slow-start threshold according to the available bandwidth. The method includes initializing a congestion window “cwnd,” sending cwnd packets, estimating an available bandwidth for the cwnd packets. The congestion window cwnd is set to a higher number, and the higher number of further packets is sent if the available bandwidth is greater than a first threshold level. The available bandwidth is re-estimated for the higher number of the further packets, and a soft start threshold “ssthresh” is set to the re-estimated available bandwidth. A statistical measure is calculated for the re-estimated available bandwidth, and the congestion window cwnd is set equal to ssthresh if a ratio of the statistical measure to the re-estimated available bandwidth is less than a second threshold level.
Abstract:
An embodiment of a system and method that uses inline measurements to probe available bandwidth for a transmission control protocol, and adaptively sets a slow-start threshold according to the available bandwidth. The method includes initializing a congestion window “cwnd,” sending cwnd packets, estimating an available bandwidth for the cwnd packets. The congestion window cwnd is set to a higher number, and the higher number of further packets is sent if the available bandwidth is greater than a first threshold level. The available bandwidth is re-estimated for the higher number of the further packets, and a soft start threshold “ssthresh” is set to the re-estimated available bandwidth. A statistical measure is calculated for the re-estimated available bandwidth, and the congestion window cwnd is set equal to ssthresh if a ratio of the statistical measure to the re-estimated available bandwidth is less than a second threshold level.
Abstract:
A method for delivering packets in a wireless communications system includes determining a cause of loss for a previously transmitted packet based on a packet acknowledgement corresponding to the previously transmitted packet, the packet acknowledgement including at least one of a wireless loss indicator and a congestion warning indicator for the wireless communications system. The method also includes adjusting a transmission parameter in a packet transmission protocol according to the cause of loss, and retransmitting the previously transmitted packet.
Abstract:
A method for delivering packets in a wireless communications system includes determining a cause of loss for a previously transmitted packet based on a packet acknowledgement corresponding to the previously transmitted packet, the packet acknowledgement including at least one of a wireless loss indicator and a congestion warning indicator for the wireless communications system. The method also includes adjusting a transmission parameter in a packet transmission protocol according to the cause of loss, and retransmitting the previously transmitted packet.
Abstract:
Technologies are presented for power optimization of datacenter networks in a hierarchical perspective. In some examples, a two-level power optimization model may be established to reduce the power consumption of datacenter networks by switching off network switches and links while still guaranteeing full connectivity and maximum link utilization. The model may be implemented by solving a capacitated constraint multi-commodity flow (CMCF) problem employing simple heuristic techniques. A power status of network switches may be determined according to a network traffic matrix and the CMCF optimization determined at core-level and at pod-level. A complementary process to provision whole network connectivity and to meet quality of service (QoS) goals may also be performed.
Abstract:
Technologies are generally described for an enhanced Quantized Congestion Notification (QCN) congestion control approach, referred to as Fair QCN (FQCN) for enhancing fairness of multiple flows sharing link capacity in a high bandwidth, low latency data center network. QCN messages may be fed back to flow sources (e.g., servers) which send packets with a sending rate over their share of the bottleneck link capacity. By enabling the flow sources to regulate their data traffic based on the QCN messages from a congestion control component, the queue length at the bottleneck link may converge to an equilibrium queue length rapidly and TCP throughput performance may be enhanced substantially in a TCP incast circumstance.
Abstract:
Technologies are generally described for an enhanced Quantized Congestion Notification (QCN) congestion control approach, referred to as Fair QCN (FQCN) for enhancing fairness of multiple flows sharing link capacity in a high bandwidth, low latency data center network. QCN messages may be fed back to flow sources (e.g., servers) which send packets with a sending rate over their share of the bottleneck link capacity. By enabling the flow sources to regulate their data traffic based on the QCN messages from a congestion control component, the queue length at the bottleneck link may converge to an equilibrium queue length rapidly and TCP throughput performance may be enhanced substantially in a TCP incast circumstance.
Abstract:
Technologies are presented for power optimization of datacenter networks in a hierarchical perspective. In some examples, a two-level power optimization model may be established to reduce the power consumption of datacenter networks by switching off network switches and links while still guaranteeing full connectivity and maximum link utilization. The model may be implemented by solving a capacitated constraint multi-commodity flow (CMCF) problem employing simple heuristic techniques. A power status of network switches may be determined according to a network traffic matrix and the CMCF optimization determined at core-level and at pod-level. A complementary process to provision whole network connectivity and to meet quality of service (QoS) goals may also be performed.
Abstract:
Techniques for transferring data among nodes on a network are disclosed. Some example methods include a downloader-initiated random linear network coding algorithm. A downloading node may be aware of the chunks of original data held by neighboring nodes, and the downloading node can request linear combinations of chunks from the neighboring nodes that are linearly independent of any linear combinations of chunks already held by the downloading node.