ExpressPass : Credit-scheduled delay-bounded congestion control for datacenters데이터센터를 위한 크레딧 기반 지연 제한 혼잡 제어

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 585
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorHan, Dongsu-
dc.contributor.advisor한동수-
dc.contributor.authorCho, Inho-
dc.date.accessioned2019-09-04T02:45:29Z-
dc.date.available2019-09-04T02:45:29Z-
dc.date.issued2018-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=733964&flag=dissertationen_US
dc.identifier.urihttp://hdl.handle.net/10203/266981-
dc.description학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2018.2,[iv, 39 p. :]-
dc.description.abstractShort RTTs less than tens of microseconds, bursty flow arrivals, and a large number of concurrent flows up to thousands in datacenters bring fundamental challenges to congestion control as they either force a flow to send at most one packet per RTT or induce a large queue build-up. The widespread use of shallow buffered switches also makes the problem more challenging with hosts generating many flows in bursts. In addition, as link speeds increase, algorithms that gradually probe for bandwidth take a long time to reach the fair-share. An ideal datacenter congestion control must provide 1) zero data loss, 2) fast convergence, 3) low buffer occupancy, and 4) high utilization. However, these requirements present conflicting goals. This paper presents a new radical approach, called ExpressPass, an end-to-end credit-scheduled, delay-bounded congestion control for datacenters. ExpressPass uses credit packets to control congestion even before sending data packets, which enables us to achieve bounded delay and fast convergence. It gracefully handles bursty flow arrivals. We implement ExpressPass using commodity switches and provide evaluations using testbed experiments and simulations. ExpressPass converges up to 80 times faster than DCTCP in 10 Gbps links, and the gap increases as link speeds become faster. It greatly improves performance under heavy incast workloads and significantly reduces the flow completion times, especially, for small and medium size flows compared to RCP, DCTCP, HULL, and DX under realistic workloads.-
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectCongestion Control▼aDatacenter▼aTransport Protocol-
dc.subject혼잡 제어▼a데이터센서▼a전송 계층 프로토콜-
dc.titleExpressPass-
dc.title.alternative데이터센터를 위한 크레딧 기반 지연 제한 혼잡 제어-
dc.typeThesis(Master)-
dc.identifier.CNRN325007-
dc.description.department한국과학기술원 :전기및전자공학부,-
dc.contributor.alternativeauthor조인호-
dc.title.subtitleCredit-scheduled delay-bounded congestion control for datacenters-
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0