Search

Modern data centers often host multiple applications with diverse network demands. To provide fair bandwidth allocation to several thousand traversing flows, Approximate Fair Queueing (AFQ) utilizes multiple priority queues in switch to approximate ideal fair queueing. However, due to limited number of queues in programmable switches, AFQ easily experiences high packet loss and low link utilization. In this paper, we propose Elastic Fair Queueing (EFQ), which leverages limited priority queues to flexibly achieve both high network utilization and fair bandwidth allocation. EFQ dynamically assigns the free buffer space in priority queues for each packet to obtain high utilization without sacrificing flow-level fairness. The results of simulation experiments and real implementations show that EFQ reduces the average flow completion time by up to 82% over the state-of-the-art fair bandwidth allocation mechanisms. [ABSTRACT FROM AUTHOR]

The emerging latency-sensitive services such as smart grid and tactile internet require deterministic network performance including deterministic end-to-end latency, latency jitter and bounded packet loss rate. To empower standard Ethernet with such capability, we provide a deterministic forwarding system named DLCC with end-to-end congestion control and queue management available at common hardwares to provide bounded delay over Internet. Meanwhile, DLCC provides a per-hop delay correction scheme to minimize delay variation under dynamic scenarios. Compared with other schemes, DLCC effectively reduces the delay jitter by up to 90% and is able to quickly converge to the required end-to-end delay. [ABSTRACT FROM AUTHOR]