Multipath schedulers
draft-bonaventure-iccrg-schedulers-01
ICCRG Working Group O. Bonaventure
Internet-Draft M. Piraux
Intended status: Experimental Q. De Coninck
Expires: March 13, 2021 UCLouvain
M. Baerts
Tessares
C. Paasch
Apple
M. Amend
Deutsche Telekom
September 09, 2020
Multipath schedulers
draft-bonaventure-iccrg-schedulers-01
Abstract
This document proposes a series of abstract packet schedulers for
multipath transport protocols equipped with a congestion controller.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on March 13, 2021.
Copyright Notice
Copyright (c) 2020 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
Bonaventure, et al. Expires March 13, 2021 [Page 1]
Internet-Draft Multipath schedulers September 2020
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. An abstract multipath transport protocol . . . . . . . . . . 4
3. Packet scheduling challenges . . . . . . . . . . . . . . . . 5
4. Packet schedulers . . . . . . . . . . . . . . . . . . . . . . 6
4.1. Round-Robin . . . . . . . . . . . . . . . . . . . . . . . 7
4.2. Weighted Round-Robin . . . . . . . . . . . . . . . . . . 7
4.3. Strict Priority . . . . . . . . . . . . . . . . . . . . . 8
4.4. Round-Trip-Time Threshold . . . . . . . . . . . . . . . . 9
4.5. Lowest Round-Trip-Time First . . . . . . . . . . . . . . 9
4.6. Combination of schedulers type: Priority and Lowest
round-trip-time first . . . . . . . . . . . . . . . . . . 11
5. Informative References . . . . . . . . . . . . . . . . . . . 12
Appendix A. Change log . . . . . . . . . . . . . . . . . . . . . 13
A.1. Since draft-bonaventure-iccrg-schedulers-00 . . . . . . . 13
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 13
1. Introduction
The Internet was designed under the implicit assumption that hosts
are equipped with a single network interface while routers are
equipped with several ones. Under this assumption, an Internet host
is usually identified by the IP address of its network interface.
This assumption does not hold anymore today for two reasons. First,
a growing fraction of the Internet hosts are equipped with several
network interfaces, usually through different datalink networks.
These multihomed hosts are reachable via different IP addresses.
Second, a growing fraction of the hosts that are attached through a
single network interface are dual-stack and are thus reachable over
both IPv4 and IPv6.
Several Internet transport protocols have been extended to leverage
the different paths that are exposed on such hosts: Multipath TCP
[RFC6824], the load sharing extensions to SCTP
[I-D.tuexen-tsvwg-sctp-multipath], Multipath DCCP
[I-D.amend-tsvwg-multipath-dccp] and Multipath QUIC
[I-D.deconinck-quic-multipath]. These multipath transport protocols
differ in the way they are organized and exchange control information
and user data. However, they all include algorithms to handle three
problems that any multipath transport protocol needs to solve:
Show full document text