Dis iscrete Water Fil illi ling Mult lti-Path Packet Scheduli - - PowerPoint PPT Presentation
Dis iscrete Water Fil illi ling Mult lti-Path Packet Scheduli ling IEEE ISIT 2020 Arno Schneuwly * Derya Malak Muriel Mdard Oracle Labs Rensselaer Polytechnic Institute Massachusetts Institute of Technology arno.schneuwly@oracle.com
Derya Malak
Rensselaer Polytechnic Institute malakd@rpi.edu 1
IEEE ISIT 2020
Arno Schneuwly*
Oracle Labs arno.schneuwly@oracle.com *The presented work had been implemented when Arno Schneuwly was a visiting student at MIT and MSc student at EPFL.
Muriel Médard
Massachusetts Institute of Technology medard@mit.edu
WiFi Download 1 2 3 4 5
Connected to WiFi… Download running…
Packet
Podcast App
The example download starts over a home wireless connection.
2
3
Download Interruption
Switch to Cellular… Download interrupted…
The switch from wireless to cellular causes a download interruption.
Cellular Download 1 2 3 4 5 The download resumes and completes over the cellular network connection.
4
5
1 2 3 4 5 MPTCP faces head-of-line (HOL) blocking and requires packet retransmission for the handover.
6
1 2 3 4 5 RLNC Through the FEC structure MPTCP/NC mitigates delays caused by retransmission and HOL.
Sender Receiver Bucket of K packets RLNC Coding Vector Coded Packets Z Paths Erasure Vector Cumulative perfect feedback
7
The individual paths are modelled as packet erasure channels (PEC) which transmit DoFs.
8
How to allocate the coded packets to the different paths?
9
The path with the maximum transmission delay determines the system’s performance.
Problem: has no closed form.
10
The optimization problem allocates DoFs.
11
Apply Jensen’s Inequality to simplify MinDeliv: Applying Jensen’s inequality gives the opimization problem a simple structure.
Optimal Allocation Vector Minimized Delivery Time Multi-Path Rate
12
DWF balances the allocation of DoFs among the Z paths to minimize the delivery time.
13
No DoFs scheduled. No paths activated.
14
1 DoF scheduled. Path 1 activated. 2 slots occupied in the path with the longest delay.
15
2 DoFs scheduled. Paths 1 & 2 activated. 3 slots occupied in the path with the longest delay.
16
3 DoFs scheduled. Paths 1 & 2 activated. 4 slots occupied in the path with the longest delay.
17
4 DoFs scheduled. Paths 1, 2 & 3 activated. 4 slots occupied in the path with the longest delay.
18
5 DoFs scheduled. Paths 1, 2, 3 & 4 activated. 5 slots occupied in the path with the longest delay.
19
76 DoFs scheduled. Paths 1, 2, 3 & 4 activated. 60 slots occupied in the path with the longest delay.
20
The packets in the network are random linear combinations of the original K packets.
21
The DWF MP system achieves better rates.
22
Thank you.
Slides 2-6: