Consider a data center network using CEE (802.1Qau) with different tenants. If a tenant is running way larger number of flows, according to 802.1Qau, he can get most of the bandwidth because 802.1Qau only enforces per-flow fairness (even distribution) of bandwidth allocation. We cannot do (1) per-user even distribution and...
[more]
Isard et al (2009) Quincy: Fair Scheduling for Distributed Computing Clusters (SOSP)
A paper from Microsoft Research Silicon Valley.
[more]
Al-Fares et al (2010) Hedera: Dynamic Flow Scheduling for Data Center Networks (NSDI)
This is about flow scheduling for multiroot networks using centralized server.
[more]
Wang et al (2010) c-Through: Part-time Optics in Data Centers (SIGCOMM)
This paper proposed a term, HyPaC network, for hybrid of packet and circuit
switched network. The packet switched network are commodity electrical ethernet
switch and the circuit switched network is optical connections. This paper
built a HyPaC testbed, c-through.
[more]
Doyle et al (2010) An Experimental Evaluation of Distributed Rate Limiting for Cloud Computing Applications (ANCS)
Assuming there are \(N\) different data centers together worked as a computation cloud. User submit job to one of the \(N\) data center but the SLA upperbounded the total throughput over all \(N\) data centers.
[more]