Publication

Extending R2P2 with Congestion Control and Request-Level Scheduling

2020
Student Projects

Abstract

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-level scheduling. It provides a configurable upper bound to in-network queuing using the idleness of the ToR-to-host link as the congestion signal. It also reduces the mean and tail RPC latency by minimizing head-of-line blocking in the network through shortest remaining processing time scheduling. The receiver driven scheduling mechanism is general and can support a variety of scheduling policies. The extension improves the performance of R2P2 under network load by at least 23% and up to two orders of magnitude. Finally, it enables R2P2 to perform similarly to a theoretically near-optimal, clean-slate transport protocol design.

Official source

https://infoscience.epfl.ch/entities/publication/ca42cdd7-3500-4888-9474-686d3b214c1f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2020
Student Projects

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/ca42cdd7-3500-4888-9474-686d3b214c1f

About this result

Related concepts (24)

Scheduling (computing)

In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.

Network congestion

Network congestion in data networking and queueing theory is the reduced quality of service that occurs when a network node or link is carrying more data than it can handle. Typical effects include queueing delay, packet loss or the blocking of new connections. A consequence of congestion is that an incremental increase in offered load leads either only to a small increase or even a decrease in network throughput.

Transmission Control Protocol

The Transmission Control Protocol (TCP) is one of the main protocols of the Internet protocol suite. It originated in the initial network implementation in which it complemented the Internet Protocol (IP). Therefore, the entire suite is commonly referred to as TCP/IP. TCP provides reliable, ordered, and error-checked delivery of a stream of octets (bytes) between applications running on hosts communicating via an IP network. Major internet applications such as the World Wide Web, email, remote administration, and rely on TCP, which is part of the Transport Layer of the TCP/IP suite.

Related publications (2)

Extending R2P2 with Congestion Control and Request-Level Scheduling

Chat with Graph Search

Analysis of finite capacity queueing networks

A Novel Scheduler for a Low Delay Service Within Best-Effort