使用前，修改:(本条对应vagrant那个方法或者你就是想拉取github仓库)
- prepare_vm.sh 在标记处 设置你自己的代理地址
- Vagrantfile 这里我增加了一个192.168.56.0的本地私有网络用于传输文件，你可以选择不开(注释掉那行)，或者改成你本地
- 先按 https://zhuanlan.zhihu.com/p/259833884 装好vagrant，virtualbox
- 把本项目git clone到本地
- cd进这个目录
- vagrant up
- vagrant ssh
默认账号密码 vagrant@vagrant
我已经将脚本中需要拉取得仓库地址全部替换为了gitee仓库
可以直接在ubuntu18，20，22的机器中运行这个脚本bash prepare_vm_cn.sh就会完成所有环境所需得安装(取消了quic_go，暂时不需要)
This repository is part of the ACM SIGCOMM 2020 Tutorial on Multipath Transport Protocols. More specifically, it contains the hands-on labs enabling participants to play with both Multipath TCP and Multipath QUIC.
To benefit from the hands-on, you need recent versions of the following software installed on your local computer:
- Vagrant
- VirtualBox
- Wireshark (to be able to analyze Multipath TCP packet traces)
The remaining of this hands-on assumes that your host is running a Linux-based system. However, the commands to run on your local machine are only limited to interactions with vagrant.
To setup the vagrant box, simply cd to this folder and run the following commands on your host
# The first `vagrant up` invocation fetches the vagrant box and runs the provision script.
# It is likely that this takes some time, so launch this command ASAP!
# The following `vagrant reload` command is required to restart the VM with the Multipath TCP kernel.
$ vagrant up; vagrant reload
# Now that your VM is ready, let's SSH it!
$ vagrant sshOnce done, you should be connected to the VM. To check that your VM's setup is correct, let's run the following commands inside the VM
$ cd ~; ls
# iproute-mptcp mininet minitopo oflops oftest openflow picotls pox pquic
$ uname -a
# Linux ubuntu-bionic 4.14.146.mptcp #17 SMP Tue Sep 24 12:55:02 UTC 2019 x86_64 x86_64 x86_64 GNU/LinuxStarting from now, we assume that otherwise stated, all commands are run inside the vagrant box.
The tutorial_files folder is shared with the vagrant box, such as the VM can access to this folder containing the experiment files through the /tutorial folder.
The network experiments that we will perform in the remaining of this tutorial rely on minitopo which itself is a wrapper of Mininet.
For the sake of simplicity, we will rely on a bash alias called mprun (which is defined in /etc/bash.bashrc).
Typically, you just need to go to the right folder and run mprun -t topo_file -x xp_file where topo_file is the file containing the description of a network scenario and xp_file the one with the description of the experiment to perform.
If you are interested in reproducing the setup in another environment, or if you want to understand the provided "black-box", feel free to have a look at the prepare_vm.sh provision script.
The remaining of this document is split into 6 sections. The first five ones focus on Multipath TCP and the experimentation of various scenarios with different provided algorithms (packet scheduler, path manager, congestion control). The last one is dedicated to Multipath QUIC, with a small coding part. Although this document was written to perform experiments in order, feel free to directly jump to the section(s) of your interest. In case of troubles, do not hesitate to contact us on the dedicated Slack channel (during the MobiCom event) or open a GitHub issue.
One of the use cases of multipath transport protocols is to aggregate the bandwidths of the available paths. To demonstrate this, let's consider a simple, symmetrical network scenario.
|-------- 20 Mbps, 40 ms RTT ---------|
Client Router --------- Server
|-------- 20 Mbps, 40 ms RTT ---------|
This scenario is described in the file 01_multipath/topo.
With this network, we will compare two iperf runs.
The first consists in a regular TCP transfer between the client and the server.
To perform this experiment, ssh into the vagrant VM and then type the following commands
$ cd /tutorial/01_multipath
$ mprun -t topo -x xp_tcpThe run will take about 25 seconds.
When done, you can check (either on the VM or on your host machine) the content of server.log using
$ cat server.logYou should notice that the overall goodput achieved by ìperf should be about 19-20 Mbps, which is expected since only one of the 20 Mbps network path is used.
The run should also provide you two pcap files, one from the client's perspective (client.pcap) and the other from the server's one (server.pcap).
There is also an
iperf.logfile that shows the bandwidth estimation from the sender's side.
Then, we will consider the same experiment, but running now Multipath TCP instead of plain TCP. For this, in the vagrant VM, just type the following command
$ mprun -t topo -x xp_mptcpA quick inspection of the server.log file should indicate a goodput twice larger than with plain TCP.
This confirms that Multipath TCP can take advantage of multiple network paths (in this case, two) while plain TCP cannot.
You can also have a look at the pcap files to observe the usage of "Multipath TCP" TCP options.
The packet scheduler is one of the multipath-specific algorithms. It selects on which available subflow for sending the next packet will be sent. The two most basic packets schedulers are the following.
- Lowest RTT first: called
defaultin MPTCP, it favors the available subflow experiencing the lowest RTT. - Round-Robin: called
roundrobinin MPTCP, it equally shares the network load across subflows.
The packet scheduler is also responsible of the content of the data to be sent. Yet, due to implementation constraints, most of the proposed packet schedulers in the litterature focus on the first data to be sent (i.e., they only select the path where to send the next data). With such strategy, the scheduler has only impactful choices when several network paths are available for data transmission. Notice that cleverer packet schedulers, such as BLEST or ECF can delay the transmission of data on slow paths to achieve lower transfer times.
|-------- 100 Mbps, 40 ms RTT --------|
Client Router --------- Server
|-------- 100 Mbps, 80 ms RTT --------|
Let's consider a simple traffic where the client sends requests every 250 ms (of 10 KB, a size inferior to an initial congestion window) and the server replies to them.
The client computes the delay between sending the request and receiving the corresponding response.
To perform the experiment with the Lowest RTT scheduler, run the following command under folder /tutorial/02_scheduler/reqres:
$ mprun -t topo -x reqres_rttWhen inspecting the msg_client.log file containing the measured delays in seconds, you can notice that all the delays are about 40-50 ms.
Because the Lowest RTT scheduler always prefer the faster path, and because this fast path is never blocked by the congestion window due to the application traffic, the data only flows over the fast path.
To perform the same experiment using the Round-Robin packet scheduler, runs:
$ mprun -t topo -x reqres_rrIn this case, most of the response's delays are around 90 ms. Since the round-robin scheduler spreads the load over the slowest network path, it causes the delay to have as lower bound the delay of this slow path.
- Notice that the first request is answered in about 50 ms. Could you figure out why? HINT: have a look at the PCAP traces.
Note that the multipath algorithms, including the packet scheduler, are host specific. This means that the client and the server can use different algorithms over a single connection. However, the Multipath TCP implementation in the Linux kernel does not apply
sysctls per namespace, making this experimentation not possible using Mininet.
While the choice of the packet scheduler is important for delay-sensitive traffic, it also has some impact for bulk transfers, especially when hosts have constrained memory. Consider the following network scenario, where Multipath TCP creates a subflow between each Client's interface and the Server's one.
|-------- 20 Mbps, 30 ms RTT ---------|
Client Router --------- Server
|-------- 20 Mbps, 100 ms RTT --------|
On this network, the client will perform a HTTP GET request to the server for a file of 10 MB.
The experiences files are located in the folder /tutorial/02_scheduler/http.
In the remaining, we assume that each host uses a (fixed) sending (resp. receiving) window of 1 MB.
First perform the run using regular TCP. Single-path TCP will only take advantage of the upper path (the one with 30 ms RTT).
$ mprun -t topo -x http_tcpHave a look at the time indicated at the end of the http_client.log file, and keep it as a reference.
Now run any of the following lines using Multipath TCP
# Using Lowest RTT scheduler
$ mprun -t topo -x http_rtt
# Using Round-Robin scheduler
$ mprun -t topo -x http_rrand have a look at the results in the http_client.log file.
- Does the Multipath speedup correspond to your expectations? If not, why? HINT: Have a look at the server trace using Wireshark, select one packet going from the server to the client (like the first SYN/ACK) of the first subflow, then go to "Statistics -> TCP Stream Graphs -> Time Sequence (tcptrace)". Alternate between both subflows using either "Stream 0" or "Stream 1".
- What happens if you increase the window sizes? (Replace all the 1000000 values by 8000000 in the experiment file)
- On the other hand, if you focus on the Lowest RTT scheduler, what if the window sizes are very low (set 300000)? Could you explain this result?
Other schedulers such as BLEST or ECF aim at tackling this Head-Of-Line blocking problem. However, these are not included in the provided version of the vagrant box.
The path manager is the multipath algorithm that determines how subflows will be created over a Multipath TCP connection. In the Linux kernel implementation, we find the following simple algorithms:
default: a "passive" path manager that does not initiate any additional subflow on a connectionfullmesh: the default path manager creating a subflow between each pair of (IP client, IP server)ndiffports: over the same pair of (IP client, IP server), creates several subflows (by default 2) by modifying the source port.
Notice that in Multipath TCP, only the client initiates subflows. To understand these different algorithms, consider the following network scenario first.
Client ----- 25 Mbps, 20 ms RTT ------ Router --------- Server
Let us first consider the difference between the fullmesh and the ndiffports path managers.
Run the associated experiments (running an iperf traffic) and compare the obtained goodput.
Then, have a look at their corresponding PCAP files to spot how many subflows were created for each experiment.
$ mprun -t topo_single_path -x iperf_fullmesh
$ mprun -t topo_single_path -x iperf_ndiffportsHINT: Since the iperf traffic only generates one TCP connection, you can quickly spot the number of TCP subflows by going to "Statistics -> Conversations" and selecting the "TCP" tab.
In the generated PCAP traces, you should notice only one subflow for the fullmesh path manager, while the ndiffports one should generate two.
Then, let us consider the following network.
|-------- 25 Mbps, 20 ms RTT --------|
Client Router --------- Server
|-------- 25 Mbps, 20 ms RTT --------|
Now consider the three different path managers.
$ mprun -t topo_two_client_paths -x iperf_fullmesh
$ mprun -t topo_two_client_paths -x iperf_ndiffports
$ mprun -t topo_two_client_paths -x iperf_default- For each of them, can you explain the results you obtain in terms of goodput (
server.log) and the number of subflows created (by inspecting the PCAP traces)?
Finally, consider this network.
/------ 25 Mbps, 20 ms RTT ------\ /------ 50 Mbps, 10 ms RTT ------\
Client Router Server
\------ 25 Mbps, 20 ms RTT ------/ \------ 50 Mbps, 10 ms RTT ------/
Run the experiment with the fullmesh path manager.
$ mprun -t topo_two_client_paths_two_server_paths -x iperf_fullmesh- How many subflows are created, and between which IP address pairs?
- How does the client learn the other IP address of the server? HINT: have a look at the first packets of the Multipath TCP connection.
In some situations, available network paths do not have the same cost.
They might be expensive for usage, e.g., a data-limited cellular connectivity versus a flat cost based Wi-Fi one.
Instead of preventing their usage at all, we can declare a network interface as a backup one, such that all the Multipath TCP subflows using this network interface will be marked as backup subflows.
The default Lowest-RTT packet scheduler considers backup subflows only if either 1) there is no non-backup subflows, or 2) all the non-backup ones are marked as potentially failed.
A subflow enters this potentially failed state when it experiences retransmissions time outs.
To better grasp this notion, consider the request/response traffic presented in the Section 2 with the network scenario shown below.
|-------- 100 Mbps, 40 ms RTT --------|
Client Router --------- Server
|-------- 100 Mbps, 30 ms RTT --------|
The connection starts on the 40 ms RTT path.
Then, after 3 seconds, the 40 ms RTT path blackholes all packets (tc netem loss 100%) without notifying hosts of the loss of connectivity.
This situation mimics a mobile device moving out of reachability of a wireless network.
Two versions of the topology are present in /tutorial/04_backup: topo (where both paths are marked as "normal") and topo_bk (where the 30 ms RTT path is marked as a backup one).
The experiment uses the default scheduler.
First run the experiment reqres_rtt with the topology topo.
$ mprun -t topo -x reqres_rtt- Have a look at the experienced application delay in
msg_client.log. Can you explain your results?
Now consider the same experiment but with the topology topo_bk.
$ mprun -t topo_bk -x reqres_rtt- How do MPTCP hosts advertise the 30 ms RTT path as a backup one? HINT: Have a look at the SYN of the 30ms path.
- Look at the application delays in
msg_client.log. Based on the client trace, can you explain the results? - Focus on the server-side trace. Where does the server send the first response after the loss event? Can you explain why? Would it be possible for the server to decrease this application delay?
The ability to use several network paths over a single (Multipath) TCP connection raises concerns about the fairness relative to single-path protocols (like regular TCP). To picture this issue, consider an iperf traffic with the following network scenario.
Client_1 ---------- 20 Mbps, 20 ms RTT ----- -------- Server_1
/ \ /
/ \ /
Client Router --------- Server
\ / \
\ / \
Client_2 ---------- 20 Mbps, 80 ms RTT ----- -------- Server_2
Here, the main Client shares each of the network bottleneck with another host.
Three iperf traffics are generated.
The first flow, using Multipath TCP, is between Client and Server and lasts 50 seconds.
The second flow, using TCP, is between Client_1 and Server_1, lasts 20 seconds and starts 10 seconds after the first flow.
The third flow, also using TCP, is between Client_2 and Server_2, lasts 20 seconds and starts 20 seconds after the first flow.
Therefore, the first and second flows compete for the upper bottleneck between time 10s and 30s, while the first and third flow compete for the lower one between time 20s and 40s.
First consider the regular case where Multipath TCP establish one subflow per IP address pair (thus two subflows).
We compare two congestion control algorithms for the Multipath TCP flow: the regular uncoupled New Reno one (reno) and the coupled OLIA one (olia).
TCP flows use the reno congestion control.
You can run them in the folder tutorial/05_congestion_control using
$ mprun -t topo_cong -x iperf_scenario_reno_1sf
$ mprun -t topo_cong -x iperf_scenario_olia_1sfTake some time to look at the results (the Multipath TCP Iperf flow result file is iperf.log0 and TCP ones are respectively iperf.log1 and iperf.log2).
You should observe that when TCP flows run, they obtain half of the bandwidth capacity of the bottleneck.
The rate that the Multipath TCP flow should obtain should
- start to about 40 Mbps,
- then decrease to 30 Mbps after 10 seconds (competition with flow 1 on upper bottleneck),
- decrease again to 20 Mbps after 20 seconds (competing with both flows on both bottlenecks),
- increase to 30 Mbps after 30 seconds (flow 1 completed, only competing with flow 2 on lower bottleneck),
- and finally restoring the 40 Mbps after 40 seconds when both single-path flows completed.
In this situation, you should observe similar results when running
renoandolia.
However, either intentional or not, several subflows of a same Multipath TCP connection might compete for the same network bottleneck. To illustrate this case, consider the case where the Multipath TCP client creates 4 subflows between each pair of IP addresses. Therefore, up to 5 TCP connections can compete over each bottleneck (1 regular TCP flow + 4 Multipath TCP subflows).
First run the associated reno experience.
$ mprun -t topo_cong -x iperf_scenario_reno_4sf- Observe first the rate obtained by TCP flows (
iperf.log1andiperf.log2). Then observe the rate obtained by the Multipath TCP flow (iperf.log0). What do you observe? Can you explain this behavior?
To prevent this possible unfairness against single-path flows, Multipath TCP can use coupled congestion control algorithms.
When using a coupled one, subflows of a same connection competing for the same bottleneck should get together as much bandwidth as a single uncoupled (TCP) flow.
Using such schemes prevent possible starvation attacks against single-path protocols.
To observe this behavior, reconsider the olia congestion control with the 4 subflows per IP address pair.
$ mprun -t topo_cong -x iperf_scenario_olia_4sfWhat do you observe?
We now turn into Multipath QUIC. To play with it, we focus on the plugin implementation provided by PQUIC. Before going further, let us quickly assess if Multipath QUIC is able to take advantage of multiple network paths.
Notice that for the purpose of this tutorial, we only explore quite slow networks. This is because VirtualBox constrains us with only 1 vCPU to have stable network experiments. Yet, QUIC is quite CPU-intensive due to the usage of TLS. For further experiments, we advise you to install PQUIC on your host machine. Please see the
install_dependenciesandinstall_pquicfunctions of theprepare_vm.shprovision script.
For this, consider the following simple network scenario.
|-------- 10 Mbps, 40 ms RTT --------|
Client Router --------- Server
|-------- 10 Mbps, 40 ms RTT --------|
Here, the client initiates a GET request to the server to fetch a file of 5 MB.
First, let us observe the performance of regular QUIC.
The files are located in /tutorial/06_multipath_quic.
$ mprun -t topo -x xp_quicOnce the experiment completes, have a look at the pquic_client.log file.
Notice that the file is quite long.
This is because all the connection's packets and frames are logged in this output file.
Since QUIC packets are nearly completely encrypted, it is difficult to analyze PCAP traces without knowing the TLS keys.
Some tools, such as qlog and qvis, are very convenient to analyze network traces.
For this tutorial, we will stick to the textual log provided by the PQUIC implementation.
At the beginning of the log file, you will notice the sending of Crypto frames performing the TLS Handshake of the QUIC connection.
Most of them are carried by initial and handshake packets, which are special QUIC packets used during the initiation of a QUIC connection.
When the TLS handshake completes, the log lists the transport parameters advertised by the peer.
For instance, you could observe something similar to the following content.
Received transport parameter TLS extension (58 bytes):
Extension list (58 bytes):
Extension type: 5, length 4 (0x0005 / 0x0004), 80200000
Extension type: 4, length 4 (0x0004 / 0x0004), 80100000
Extension type: 8, length 2 (0x0008 / 0x0002), 6710
Extension type: 1, length 2 (0x0001 / 0x0002), 7a98
Extension type: 3, length 2 (0x0003 / 0x0002), 45a0
Extension type: 2, length 16 (0x0002 / 0x0010), 051c361adef11849bb90d5ab01168212
Extension type: 9, length 2 (0x0009 / 0x0002), 6710
Extension type: 6, length 4 (0x0006 / 0x0004), 80010063
Extension type: 7, length 4 (0x0007 / 0x0004), 8000ffff
The extension type refers to a specific QUIC Transport Parameter.
For instance, the type 4 refers the the initial_max_data (i.e., the initial receiving window for data over the whole connection) which is here set to the hexadecimal value 0x100000 which correspond to about 1 MB (notice that values are encoded as varint, or variable integer, and the leading 8 indicates that the number is formatted on 4 bytes).
Then, you should observe that the client initiates the GET request by sending a Stream frame.
Opening stream 4 to GET /doc-5120000.html
6f6ab4b64e3e5ffc: Sending packet type: 6 (1rtt protected phi0), S1,
6f6ab4b64e3e5ffc: <966c3af56ac82e96>, Seq: 1 (1)
6f6ab4b64e3e5ffc: Prepared 26 bytes
6f6ab4b64e3e5ffc: Stream 4, offset 0, length 23, fin = 1: 474554202f646f63...
Notice that here, the Destination Connection ID used by packets going from the client to the server is 966c3af56ac82e96, and this packet has the number 1.
A little later in the file, you should notice that the server starts sending the requested file over the same Stream 4.
6f6ab4b64e3e5ffc: Receiving 1440 bytes from 10.1.0.1:4443 at T=0.108525 (5ac37709f20e2)
6f6ab4b64e3e5ffc: Receiving packet type: 6 (1rtt protected phi0), S1,
6f6ab4b64e3e5ffc: <ee522f732adea40d>, Seq: 3 (3)
6f6ab4b64e3e5ffc: Decrypted 1411 bytes
6f6ab4b64e3e5ffc: ACK (nb=0), 0-1
6f6ab4b64e3e5ffc: Stream 4, offset 0, length 1403, fin = 0: 3c21444f43545950...
In the server to client flow, the Destination Connection ID used is ee522f732adea40d.
Notice also the ACK frame acknowledging the client's packets from 0 to 1 included.
You can then flow to the end of the file
At the end of the file (the penultimate line), you should have the time of the GET transfer, which should be about 4.5 s.
Then, you can have a look at the multipath version of QUIC.
Two variants are available: one using a lowest-latency based packet scheduler and the other one using a round-robin strategy.
Each variant is provided as a plugin; see files xp_mpquic_rtt, xp_mpquic_rr and the ~/pquic/plugins/multipath/ directory.
$ mprun -t topo -x xp_mpquic_rtt
$ mprun -t topo -x xp_mpquic_rrLet us now open the output file pquic_client.log and spot the differences with the plain QUIC run.
You should notice lines similar to the following ones at the end of the handshake.
9134561c0b91d956: Receiving packet type: 6 (1rtt protected phi0), S0,
9134561c0b91d956: <63acfe69e68b5f06>, Seq: 0 (0)
9134561c0b91d956: Decrypted 203 bytes
9134561c0b91d956: MP NEW CONNECTION ID for Uniflow 0x01 CID: 0x88eecd622ea8ed93, 2a9cbf24ab0b4fa0890ada56b0439695
9134561c0b91d956: MP NEW CONNECTION ID for Uniflow 0x02 CID: 0xcf575df2b22497af, 4715a4860769572da317e4bce604eadf
9134561c0b91d956: ADD ADDRESS with ID 0x01 Address: 10.1.0.1
9134561c0b91d956: Crypto HS frame, offset 0, length 133: 04000081000186a0...
Here, the server advertises its IP address and provides the client with two connections IDs for two different uniflows.
Remember the provided CIDs (here 88eecd622ea8ed93 and cf575df2b22497af), you should see them soon again.
Similarly, the client does the same for the server.
9134561c0b91d956: Sending packet type: 6 (1rtt protected phi0), S1,
9134561c0b91d956: <51d29dadd7c60d25>, Seq: 0 (0)
9134561c0b91d956: Prepared 79 bytes
9134561c0b91d956: MP NEW CONNECTION ID for Uniflow 0x01 CID: 0xfbaa59f5cafb6b62, a1689ec73f96cfbbbb23dcba2bc11610
9134561c0b91d956: MP NEW CONNECTION ID for Uniflow 0x02 CID: 0x9cba2fa451844304, e1a80f8d4d5112b76fd2712df50eb87f
9134561c0b91d956: ADD ADDRESS with ID 0x01 Address: 10.0.0.1
9134561c0b91d956: ADD ADDRESS with ID 0x02 Address: 10.0.1.1
9134561c0b91d956: ACK (nb=0), 0-1
Again, note the Connection IDs for each of the uniflows (here, fbaa59f5cafb6b6 and 9cba2fa451844304).
While the QUIC transport parameters are echanged during the very first packets, PQUIC logs them quite late. Yet, you should notice one major difference compared to the single path version.
Received ALPN: hq-27
Received transport parameter TLS extension (62 bytes):
Extension list (62 bytes):
Extension type: 5, length 4 (0x0005 / 0x0004), 80200000
Extension type: 4, length 4 (0x0004 / 0x0004), 80100000
Extension type: 8, length 2 (0x0008 / 0x0002), 6710
Extension type: 1, length 2 (0x0001 / 0x0002), 7a98
Extension type: 3, length 2 (0x0003 / 0x0002), 45a0
Extension type: 2, length 16 (0x0002 / 0x0010), 671b8787ebc8766c206c8e8730c07f9b
Extension type: 9, length 2 (0x0009 / 0x0002), 6710
Extension type: 6, length 4 (0x0006 / 0x0004), 80010063
Extension type: 7, length 4 (0x0007 / 0x0004), 8000ffff
Extension type: 64, length 1 (0x0040 / 0x0001), 02
Here, the extension type 64 (or in hexadecimal 0x40) corresponds to the max_sending_uniflow_id parameter, here set to 2.
If you look at the server's log pquic_server.log, you should see that the client advertises the same value for that parameter.
Then, you should see that the client probes each of its sending uniflow using a path_challenge frame.
9134561c0b91d956: Sending packet type: 6 (1rtt protected phi0), S1,
9134561c0b91d956: <88eecd622ea8ed93>, Seq: 0 (0)
9134561c0b91d956: Prepared 40 bytes
9134561c0b91d956: path_challenge: 97f23b8acc60945c
9134561c0b91d956: ACK (nb=0), 1-2
9134561c0b91d956: Stream 4, offset 0, length 23, fin = 1: 474554202f646f63...
[...]
9134561c0b91d956: Sending 1440 bytes to 10.1.0.1:4443 at T=0.104624 (5ac3842708af4)
9134561c0b91d956: Sending packet type: 6 (1rtt protected phi0), S1,
9134561c0b91d956: <cf575df2b22497af>, Seq: 0 (0)
9134561c0b91d956: Prepared 9 bytes
9134561c0b91d956: path_challenge: 88e31e087108aa86
Note that the newly provided connection IDs are used here, meaning that the client starts using the additional sending uniflows provided by the server. Later, the server does the same
9134561c0b91d956: Receiving 1252 bytes from 10.1.0.1:4443 at T=0.165320 (5ac384271780c)
9134561c0b91d956: Receiving packet type: 6 (1rtt protected phi0), S1,
9134561c0b91d956: <fbaa59f5cafb6b62>, Seq: 0 (0)
9134561c0b91d956: Decrypted 1223 bytes
9134561c0b91d956: path_challenge: 056a9d06df422e68
9134561c0b91d956: MP ACK for uniflow 0x01 (nb=0), 0
9134561c0b91d956: path_response: 97f23b8acc60945c
9134561c0b91d956: Stream 4, offset 0, length 1195, fin = 0: 3c21444f43545950...
Select returns 1252, from length 28, after 6 (delta_t was 0)
9134561c0b91d956: Receiving 1252 bytes from 10.1.0.1:4443 at T=0.165416 (5ac384271786c)
9134561c0b91d956: Receiving packet type: 6 (1rtt protected phi0), S1,
9134561c0b91d956: <9cba2fa451844304>, Seq: 0 (0)
9134561c0b91d956: Decrypted 1223 bytes
9134561c0b91d956: path_challenge: 256a218f09929454
9134561c0b91d956: Stream 4, offset 1195, length 1210, fin = 0: 546e336f7637722e...
Once all uniflows have received their path_response frame, the multipath usage is fully set up.
Notice the usage of MP ACK frames to acknowledge the uniflows.
Note that our Multipath plugin does not use the Uniflow ID 0 anymore when other uniflows are in use. This is just an implementation choice.
If you want to observe the distribution of packets between paths, you can have a quick look at the last packet sent by the client containing MP ACK frames.
9134561c0b91d956: Sending packet type: 6 (1rtt protected phi0), S0,
9134561c0b91d956: <88eecd622ea8ed93>, Seq: 181 (181)
9134561c0b91d956: Prepared 23 bytes
9134561c0b91d956: MP ACK for uniflow 0x01 (nb=0), 0-738
9134561c0b91d956: MP ACK for uniflow 0x02 (nb=1), 62c-733, 0-62a
Since both paths have the same characteristics, it is expected that both uniflows have seen a similar maximum packet number. Then you can flow through the file to find the transfer file time at the end. You should notice that it is lower than with plain QUIC.
Many aspects of the multipath algorithms are similar between Multipath TCP and Multipath QUIC (at least when carrying a single data stream). Yet, one major difference is the notion of unidirectional QUIC flows (compared to the bidirectional Multipath TCP subflows). To explore this, let us consider the following network scenario.
/----- 10 Mbps, 40 ms RTT -----\
Client ----- 10 Mbps, 80 ms RTT ----- Router --------- Server
\----- 10 Mbps, 40 ms RTT -----/
In this experiment, each host limits itself to two sending uniflows. In the first run, both hosts follow the same uniflow assignment strategy by prefering first lower Address IDs (hence using the two upper network paths). You can check this using the following command.
$ mprun -t topo_3paths -x xp_mpquic_rttHave a look at the PCAP trace to check the addresses used by the QUIC connection (you can check this using "Statistics -> Conversations" under the "UDP" tab).
Then, we consider the case where the client and the server do not follow the same assignation strategy. While the client still prefers lower Address IDs first, the server favors the higher Address IDs, such that the client will send packets on the two upper network paths while the server will transmit data over the two lower ones. You can perform this experiment with the following command.
$ mprun -t topo_3paths -x xp_mpquic_rtt_asymUsing wireshark, you will observe that Multipath QUIC uses the upper and the lower network path in only one direction.
Unlike Multipath TCP, Multipath QUIC is implemented as a user-space program, making its updates and its tweakings easier. In addition, the PQUIC implementation relies on plugins that can be dynamically loaded on connections. In this section, we will focus on modifying the packet scheduler, in particular to transform the round-robin into a weighted round-robin.
For this, we advise you to take the following network scenario as your basis (described in the file topo).
|-------- 10 Mbps, 40 ms RTT --------|
Client Router --------- Server
|-------- 10 Mbps, 40 ms RTT --------|
For the sake of simplicity, we will directly modify the round-robin code to include the weighted notion.
For this, go to the ~/pquic/plugins/multipath/path_schedulers folder.
The file of interest is schedule_path_rr.c, so open it with your favorite command-line text editor (both nano and vim are installed in the vagrant box).
Take some time to understand what this code is doing, but it is likely that you will need to tweak the condition in line 81
} else if (pkt_sent_c < selected_sent_pkt || selected_cwin_limited) {Feel free to weight each path as you like, yet a good and simple heuristic is to rely on the parameter ì.
Be cautious that the actual Uniflow ID is i+1, as i goes from 0 included to 2 excluded.
When you are done, just compile your plugin into eBPF bytecode using
# In ~/pquic/plugins/multipath/path_schedulers
$ CLANG=clang-10 LLC=llc-10 makeAnd then, returning back to the /tutorial/06_multipath_quic folder, you can check the effects of your changes using
$ mprun -t topo -x xp_mpquic_rrand the content of pquic_client.log.
As this is a bulk transfer over symmetrical links, it is very unlikely that you will observe any difference in terms of packets sent by the server (the sending flow is limited by the congestion window).
However, the (control) packets sent by the client to the server are not.
You should see the difference in the MP ACK frames sent by the server.
With an appropriate hack, you should see lines similar to the following ones at the end of pquic_client.log
f1a28e465024f80a: Sending 40 bytes to 10.1.0.1:4443 at T=2.776148 (5ac22efd67056)
Select returns 48, from length 28, after 21202 (delta_t was 61014)
f1a28e465024f80a: Receiving 48 bytes from 10.1.0.1:4443 at T=2.797454 (5ac22efd6c390)
f1a28e465024f80a: Receiving packet type: 6 (1rtt protected phi0), S0,
f1a28e465024f80a: <48d96d9d323736ae>, Seq: 738 (738)
f1a28e465024f80a: Decrypted 19 bytes
f1a28e465024f80a: MP ACK for uniflow 0x01 (nb=0), 0-114
f1a28e465024f80a: MP ACK for uniflow 0x02 (nb=0), 0-228
assessing here that the client sent twice more packets on the uniflow 2 than on the uniflow 1.