Name
Abstract | ||
|---|---|---|
Quantized congestion notification (QCN), discussed in IEEE 802.1Qau, is one of the most promising Layer 2 congestion control methods for data center networks. Because data center networks have fundamentally symmetric structures and links are designed to have high link utilization, data center flows often pass through multiple bottleneck links. QCN reduces its transmission rate in a probabilistic manner with each congestion notification feedback reception, which might cause excessive regulation of the transmission rate in a multiple-bottleneck case because each bottleneck causes congestion feedbacks. We have already proposed QCN with bottleneck selection (QCN/BS) for multicast communications in data center networks. Although QCN/BS was originally proposed for multicast communications, it can also be applied to unicast communications with multiple bottleneck points. QCN/BS calculates the congestion level for each switch based on feedback from the switch and adjusts its transmission rate to the worst congestion level. In this paper, we preliminarily evaluate QCN/BS in unicast communications with multiple tandem bottleneck points. Our preliminary evaluation reveals that QCN/BS can resolve the excessive rate regulation problem of QCN but has new fairness problems for long-hop flows. To resolve this, we propose a new algorithm that integrates QCN/BS and our already proposed Adaptive BC_LIMIT. In Adaptive BC_LIMIT, the opportunities for rate increase are almost the same for all flows even if their transmission rates differ, enabling an accelerated convergence of fair rate allocation among flows sharing a bottleneck link. The integrated algorithm is the first congestion control mechanism that takes into account unicast flows passing through multiple tandem bottleneck points based on QCN. Furthermore, it does not require any modifications of switches used in QCN. Our simulation results show that our proposed integration of QCN/BS and Adaptive BC_LIMIT significantly mitigates the fairness problem for unicast communications with multiple bottleneck points in data center networks. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1587/transcom.2015EBP3404 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
data center, QCN, congestion control, fairness | Bottleneck,Max-min fairness,Computer science,Flow (psychology),Computer network,Fairness measure,Network congestion,Data center,Distributed computing | Journal |
Volume | Issue | ISSN |
E99B | 7 | 0916-8516 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenta Matsushima | 1 | 0 | 0.68 |
| Kouji Hirata | 2 | 10 | 11.28 |
| Miki Yamamoto | 3 | 19 | 10.42 |