SRPT-based Congestion Control for Flows with Unknown Sizes

2021 IFIP Networking Conference (IFIP Networking)(2021)

引用 1|浏览6
暂无评分
摘要
Modern datacenter transports are required to support latency constraints, usually represented by various forms of flow completion time (FCT). Most implemented congestion control mechanisms that minimize FCT are based on SRPT priorities (e.g., pFabric and Homa). However, SRPT-based scheduling requires prior knowledge of flow sizes, making this discipline problematic in general. Non-SRPT-based alter...
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要