東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Pushing Transport Layer Latency Down...

Arslan, Serhat,

Linked to FindBook

Google Book

Amazon

博客來

Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms // Serhat Arslan.
Author:	Arslan, Serhat,
Description:	1 electronic resource (129 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
Contained By:	Dissertations Abstracts International86-03B.
Subject:	Control algorithms. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31324650
ISBN:	9798384201717

Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms /
Arslan, Serhat,

Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms /Serhat Arslan. - 1 electronic resource (129 pages)

Source: Dissertations Abstracts International, Volume: 86-03, Section: B.

Data center applications keep scaling horizontally across many machines to accommodate more users and data. This makes the communication performance requirements even more stringent, i.e., higher bandwidth and lower latency. The increasing link capacities address the bandwidth demands, but the latency requirements necessitate more sophisticated solutions.In this thesis, I observe that the transport layer is the only layer in the networking stack to impact latency both at the end-hosts and the network. The way it handles packets sets the end-hosts processing delay. And its congestion control determines the queuing delay in the network. Hence, I study transport layer designs to push both latencies down to their physical limits.First, I argue that end-host latency can be minimized by offloading the transport layer to NIC hardware, but fixed-function chips prohibit custom solutions for diversified environments. As a solution, I introduce nanoTransport, a programmable NIC architecture for message-based Remote Procedure Calls. It is programmed using the P4 language, making it easy to modify (or create) transport protocols while the packets are processed orders of magnitude faster than traditional software stacks. It identifies common events and primitive operations for a streamlined, modular, and programmable pipeline; including packetization, reassembly, timeouts, and packet generation, all expressed by the programmer.Next, I argue that network latency can only be minimized with quick and accurate congestion control decisions, which require precise congestion signals and the shortest control loop delay. I present Bolt to address these requirements and push congestion control to its theoretical limits. Bolt is based on three core ideas, (I) Sub-RTT Control (SRC) reacts to congestion faster than one RTT, (II) Proactive Ramp-up (PRU) foresees flow completions to promptly occupy released bandwidth, and (III) Supply matching (SM) matches bandwidth demand with supply to maximize utilization. I show that these mechanisms reduce 99th-p latency by 80% and improve 99th-p flow completion time by up to 3X compared to Swift and HPCC even at 400Gb/s.

English

ISBN: 9798384201717Subjects--Topical Terms:

3560702
Control algorithms.

Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms /
LDR:03608nmm a22004093i 4500 001 2432396
005 20250707081454.5
006 m o d
007 cr|nu||||||||
008 261011s2024 miu||||||m |||||||eng d
020 $a 9798384201717
035 $a (MiAaPQD)AAI31324650
035 $a (MiAaPQD)Stanfordzj481vg3597
035 $a AAI31324650
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Arslan, Serhat, $e author. $3 3821599
245 1 0 $a Pushing Transport Layer Latency Down Towards its Physical Limits in Data Centers with Programmable Architectures and Algorithms / $c Serhat Arslan.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2024
300 $a 1 electronic resource (129 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
500 $a Advisors: McKeown, Nick; Katti, Sachin Committee members: Prabhakar, Balaji; Bent, Stacey F.
502 $b Ph.D. $c Stanford University $d 2024.
520 $a Data center applications keep scaling horizontally across many machines to accommodate more users and data. This makes the communication performance requirements even more stringent, i.e., higher bandwidth and lower latency. The increasing link capacities address the bandwidth demands, but the latency requirements necessitate more sophisticated solutions.In this thesis, I observe that the transport layer is the only layer in the networking stack to impact latency both at the end-hosts and the network. The way it handles packets sets the end-hosts processing delay. And its congestion control determines the queuing delay in the network. Hence, I study transport layer designs to push both latencies down to their physical limits.First, I argue that end-host latency can be minimized by offloading the transport layer to NIC hardware, but fixed-function chips prohibit custom solutions for diversified environments. As a solution, I introduce nanoTransport, a programmable NIC architecture for message-based Remote Procedure Calls. It is programmed using the P4 language, making it easy to modify (or create) transport protocols while the packets are processed orders of magnitude faster than traditional software stacks. It identifies common events and primitive operations for a streamlined, modular, and programmable pipeline; including packetization, reassembly, timeouts, and packet generation, all expressed by the programmer.Next, I argue that network latency can only be minimized with quick and accurate congestion control decisions, which require precise congestion signals and the shortest control loop delay. I present Bolt to address these requirements and push congestion control to its theoretical limits. Bolt is based on three core ideas, (I) Sub-RTT Control (SRC) reacts to congestion faster than one RTT, (II) Proactive Ramp-up (PRU) foresees flow completions to promptly occupy released bandwidth, and (III) Supply matching (SM) matches bandwidth demand with supply to maximize utilization. I show that these mechanisms reduce 99th-p latency by 80% and improve 99th-p flow completion time by up to 3X compared to Swift and HPCC even at 400Gb/s.
546 $a English
590 $a School code: 0212
650 4 $a Control algorithms. $3 3560702
650 4 $a Response time. $3 3562212
650 4 $a Protocol. $3 3564384
650 4 $a Communication. $3 524709
650 4 $a Queuing. $3 3699127
650 4 $a Design. $3 518875
650 4 $a Network interface cards. $3 3683605
650 4 $a Web studies. $3 2122754
650 4 $a Software. $2 gtt. $3 619355
690 $a 0389
690 $a 0800
690 $a 0459
690 $a 0646
710 2 $a Stanford University. $e degree granting institution. $3 3765820
720 1 $a McKeown, Nick $e degree supervisor.
720 1 $a Katti, Sachin $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-03B.
790 $a 0212
791 $a Ph.D.
792 $a 2024
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31324650