Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Yuchung Cheng"'
Autor:
CARDWELL, NEAL1 (AUTHOR), YUCHUNG CHENG1 (AUTHOR), GUNN, C. STEPHEN1 (AUTHOR), YEGANEH, SOHEIL HASSAS1 (AUTHOR), JACOBSON, VAN1 (AUTHOR)
Publikováno v:
Communications of the ACM. Feb2017, Vol. 60 Issue 2, p58-66. 9p. 1 Color Photograph, 1 Diagram, 2 Charts, 9 Graphs.
Autor:
Mubashir Adnan Qureshi, Yuchung Cheng, Qianwen Yin, Qiaobin Fu, Gautam Kumar, Masoud Moshref, Junhua Yan, Van Jacobson, David Wetherall, Abdul Kabbani
Publikováno v:
Proceedings of the ACM SIGCOMM 2022 Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad4b16db4d24f1c8f91716a619c8c830
https://doi.org/10.1145/3544216.3544226
https://doi.org/10.1145/3544216.3544226
This document presents the RACK-TLP loss detection algorithm for TCP. RACK-TLP uses per-segment transmit timestamps and selective acknowledgements (SACK) and has two parts: RACK ("Recent ACKnowledgment") starts fast recovery quickly using time-based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::898b5d6a66cf102b8ec98ab35eb607b7
https://doi.org/10.17487/rfc8985
https://doi.org/10.17487/rfc8985
Publikováno v:
Communications of the ACM. 60:58-66
When bottleneck buffers are large, loss-based congestion control keeps them full, causing bufferbloat. When bottleneck buffers are small, loss-based congestion control misinterprets loss as a signa...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b2e0cd9314ab6e243eafb90180f11ad
https://doi.org/10.1145/3009824
https://doi.org/10.1145/3009824
Publikováno v:
Queue. 14:20-53
When bottleneck buffers are large, loss-based congestion control keeps them full, causing bufferbloat. When bottleneck buffers are small, loss-based congestion control misinterprets loss as a signal of congestion, leading to low throughput. Fixing th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1000e8bd3d563d9c6334498c525feaa
https://doi.org/10.1145/3012426.3022184
https://doi.org/10.1145/3012426.3022184
Publikováno v:
ACM SIGCOMM Computer Communication Review. 46:1-2
Many algorithms proposed in networking research papers are widely used in many areas, including Congestion Control, Routing, Traffic Engineering, and Load Balancing. In this paper, we present algorithmic advancements that have impacted the practice o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9656849f062a2762e3bdd78b15d205ed
https://doi.org/10.1145/3243157.3243171
https://doi.org/10.1145/3243157.3243171
Autor:
Ethan Katz-Bassett, Luis Pedrosa, Tayeb Karim, Yuchung Cheng, Andreas Terzis, Ramesh Govindan, Tobias Flach, Pavlos Papageorge
Publikováno v:
SIGCOMM
Large flows like videos consume significant bandwidth. Some ISPs actively manage these high volume flows with techniques like policing, which enforces a flow rate by dropping excess traffic. While the existence of policing is well known, our contribu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3eaf561b1668af039a6282dc7020c7a4
https://doi.org/10.1145/2934872.2934873
https://doi.org/10.1145/2934872.2934873
Autor:
Jerry Chu, Nandita Dukkipati, Amit Agarwal, Arvind Jain, Natalia Sutin, Tom Herbert, Yuchung Cheng, Tiziana Refice
Publikováno v:
ACM SIGCOMM Computer Communication Review. 40:26-33
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion window is a critical TCP parameter in determining how quickly flows can fin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8c3fc8aaef4c504c6db59366ec66f62
https://doi.org/10.1145/1823844.1823848
https://doi.org/10.1145/1823844.1823848
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 3:230-244
Network routers occupy a unique role in modern distributed systems. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal point-to-point connectivity. However, this il
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8edbc43cbac5966e5f06afdc1a40ee7f
https://doi.org/10.1109/tdsc.2006.34
https://doi.org/10.1109/tdsc.2006.34
Autor:
Tobias Flach, Barath Raghavan, Shuai Hao, Andreas Terzis, Ankur Jain, Yuchung Cheng, Ethan Katz-Bassett, Neal Cardwell, Ramesh Govindan, Nandita Dukkipati
Publikováno v:
SIGCOMM
To serve users quickly, Web service providers build infrastructure closer to clients and use multi-stage transport connections. Although these changes reduce client-perceived round-trip times, TCP's current mechanisms fundamentally limit latency impr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e75c28f2c8ba86ff544bc637da975f3
https://doi.org/10.1145/2486001.2486014
https://doi.org/10.1145/2486001.2486014