Comput. Commun. Rev.最新文献_第3页

Reflections on being CCR editor 2008--2012 2008- 2012年担任CCR编辑的感想

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371946

S. Keshav

引用次数: 0

Don't mind the gap: Bridging network-wide objectives and device-level configurations: brief reflections on abstractions for network programming 不要介意差距:桥接网络范围的目标和设备级配置:对网络编程抽象的简要反思

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371965

Ryan Beckett, Ratul Mahajan, T. Millstein, J. Padhye, D. Walker

引用次数: 107

Never waste a mid-life crisis: change for the better 不要浪费中年危机:让生活变得更好

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371939

J. Rexford

引用次数: 1

Five decades of the ACM special interest group on data communications (SIGCOMM): a bibliometric perspective ACM数据通信特别兴趣小组(SIGCOMM)的五十年:文献计量学的视角

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371948

Waleed Iqbal, Junaid Qadir, Saeed-Ul Hassan, R. T. Javed, A. Mian, J. Crowcroft, Gareth Tyson

引用次数: 5

Reflections on "analysis and simulation of a fair queueing algorithm" 关于“一种公平排队算法的分析与仿真”的思考

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371952

S. Keshav

引用次数: 1

The July 2019 issue 2019年7月号

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371927.3371928

O. Bonaventure

引用次数: 0

Reflections on "a control-theoretic approach to flow control" 关于“流动控制的控制理论方法”的思考

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371954

S. Keshav

引用次数: 0

Datacenter congestion control: identifying what is essential and making it practical 数据中心拥塞控制:确定什么是必要的并使其实用

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371927.3371932

Aisha Mushtaq, R. Mittal, J. McCauley, Mohammad Alizadeh, S. Ratnasamy, S. Shenker

{"title":"Datacenter congestion control: identifying what is essential and making it practical","authors":"Aisha Mushtaq, R. Mittal, J. McCauley, Mohammad Alizadeh, S. Ratnasamy, S. Shenker","doi":"10.1145/3371927.3371932","DOIUrl":"https://doi.org/10.1145/3371927.3371932","url":null,"abstract":"Recent years have seen a slew of papers on datacenter congestion control mechanisms. In this editorial, we ask whether the bulk of this research is needed for the common case where congestion control involves hosts responding to simple congestion signals from the network and the performance goal is reducing some average measure of flow completion time. We raise this question because we find that, out of all the possible variations one could make in congestion control algorithms, the most essential feature is the switch scheduling algorithm. More specifically, we find that congestion control mechanisms that use Shortest-Remaining-Processing-Time (SRPT) achieve superior performance as long as the rate-setting algorithm at the host is reasonable. We further find that while SRPT's performance is quite robust to host behaviors, the performance of schemes that use scheduling algorithms like FIFO or Fair Queuing depend far more crucially on the rate-setting algorithm, and their performance is typically worse than what can be achieved with SRPT. Given these findings, we then ask whether it is practical to realize SRPT in switches without requiring custom hardware. We observe that approximate and deployable SRPT (ADS) designs exist, which leverage the small number of priority queues supported in almost all commodity switches, and require only software changes in the host and the switches. Our evaluations with one very simple ADS design shows that it can achieve performance close to true SRPT and is significantly better than FIFO. Thus, the answer to our basic question - whether the bulk of recent research on datacenter congestion control algorithms is needed for the common case - is no.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133618365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Sizing router buffers (redux) 调整路由器缓冲区的大小(redux)

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371957

N. McKeown, G. Appenzeller, I. Keslassy

引用次数: 22

It's not about the internet 这与互联网无关

Comput. Commun. Rev. Pub Date : 2019-11-08 DOI: 10.1145/3371934.3371937

L. Chapin

引用次数: 0