pith. sign in

arxiv: 1907.04567 · v1 · pith:74EONGB3new · submitted 2019-07-10 · 💻 cs.NI

A Framework for Multiaccess Support for Unreliable Internet Traffic using Multipath DCCP

Markus Amend , Eckard Bogenfeld , MIlan Cvjetkovic , Veselin Rakocevic , Marcus Pieska , Andreas Kassler , Anna Brunstrom This is my paper

Pith reviewed 2026-05-24 23:45 UTC · model grok-4.3

classification 💻 cs.NI
keywords multipath transportDCCPmulti-access networksheterogeneous networkspacket delay variationscheduling algorithmsIP compatibility
0
0 comments X

The pith

MP-DCCP extensions let a single transport connection run simultaneously over multiple heterogeneous access networks while managing packet delay variation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a new IP-compatible multipath framework for mobile nodes equipped with multiple radios that connect to networks such as WiFi, LTE, and 5G. It builds Multipath DCCP as extensions to regular DCCP so one transport connection can use several access networks at the same time to aggregate capacity and improve reliability. Simulation and testbed results show that pluggable packet scheduling or reordering algorithms can handle the packet delay variation that arises from asymmetric path latencies.

Core claim

The paper claims that a new IP-compatible multipath framework using MP-DCCP, a set of extensions to regular DCCP, enables a transport connection to operate across multiple access networks simultaneously and manages significant packet delay variation caused by the asymmetry of network paths by applying pluggable packet scheduling or reordering algorithms, as shown in simulation and experimental testbed results.

What carries the argument

Multipath Datagram Congestion Control Protocol (MP-DCCP) as extensions to regular DCCP, which carries the argument by allowing one transport connection to use several access networks at once.

If this is right

  • The framework increases overall traffic throughput and communication reliability for mobile nodes.
  • It supports steering or switching of traffic flows among multiple interfaces.
  • Pluggable scheduling or reordering algorithms can be swapped in to address path asymmetry.
  • The solution remains compatible with existing IP infrastructure.
  • Both simulation and experimental testbed results confirm basic operation and delay management.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The design could reduce the need for applications to implement their own multi-path logic.
  • It might extend naturally to other unreliable traffic types beyond the tested cases.
  • Deployment would still require kernel or stack support for the MP-DCCP extensions on end hosts.

Load-bearing premise

That pluggable packet scheduling or reordering algorithms can manage packet delay variation from asymmetric paths without degrading application quality of service.

What would settle it

A controlled testbed run with high delay variation between paths that records application-level latency or loss metrics showing clear degradation when the MP-DCCP framework and its pluggable algorithms are active.

Figures

Figures reproduced from arXiv: 1907.04567 by Andreas Kassler, Anna Brunstrom, Eckard Bogenfeld, Marcus Pieska, Markus Amend, MIlan Cvjetkovic, Veselin Rakocevic.

Figure 1
Figure 1. Figure 1: Multipath Framework Architecture Within the new multipath framework, the DCCP tunnels serve two main purposes: (1) the integrated DCCP congestion control provides channel estimation in terms of path loss rate, bandwidth and round trip time; (2) the tunnels ensure redirection of traffic to the aggregation termination points. Layer 3 compatibility is achieved by employing virtual net￾work interfaces to easil… view at source ↗
Figure 3
Figure 3. Figure 3: Two examples pulled from Fig. 2. In each case adaptive reordering [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 2
Figure 2. Figure 2: NADA/UDP throughput using a round-robin scheduler. In the sym [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 5
Figure 5. Figure 5: Handover between network paths using the SRTT scheduler [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figure 4
Figure 4. Figure 4: Network Testbed Architecture 1) Performance Evaluation - Scheduling: To evaluate the performance of the scheduling algorithms, experiments with a fixed-rate data stream of 1Mbps have been performed. The operation of the SRTT scheduler can be illustrated by increasing the latency of the preferred path during the transmission. As soon as the new latency value exceeds that of another network path, this networ… view at source ↗
Figure 7
Figure 7. Figure 7: Packet scrambling at the receiver when using OTIAS in a moderately [PITH_FULL_IMAGE:figures/full_fig_p006_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Order of delivery for adaptive active reordering, heterogeneous [PITH_FULL_IMAGE:figures/full_fig_p006_8.png] view at source ↗
Figure 10
Figure 10. Figure 10: Packet latency variation when adaptive reordering algorithm is [PITH_FULL_IMAGE:figures/full_fig_p007_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Packet latency variation when OTIAS scheduling algorithm is applied [PITH_FULL_IMAGE:figures/full_fig_p007_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Comparison of the distribution of packet latency variations [PITH_FULL_IMAGE:figures/full_fig_p008_12.png] view at source ↗
read the original abstract

Mobile nodes are typically equipped with multiple radios and can connect to multiple radio access networks (e.g. WiFi, LTE and 5G). Consequently, it is important to design mechanisms that efficiently manage multiple network interfaces for aggregating the capacity, steering of traffic flows or switching flows among multiple interfaces. While such multi-access solutions have the potential to increase the overall traffic throughput and communication reliability, the variable latencies on different access links introduce packet delay variation which has negative effect on the application quality of service and user quality of experience. In this paper, we present a new IP-compatible multipath framework for heterogeneous access networks. The framework uses Multipath Datagram Congestion Control Protocol (MP-DCCP) - a set of extensions to regular DCCP - to enable a transport connection to operate across multiple access networks, simultaneously. We present the design of the new protocol framework and show simulation and experimental testbed results that (1) demonstrate the operation of the new framework, and (2) demonstrate the ability of our solution to manage significant packet delay variation caused by the asymmetry of network paths, by applying pluggable packet scheduling or reordering algorithms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper proposes an IP-compatible multipath framework based on extensions to DCCP (MP-DCCP) that enables a single transport connection to operate simultaneously across multiple heterogeneous access networks (e.g., WiFi, LTE, 5G). The framework is intended to support capacity aggregation, traffic steering, and flow switching while addressing packet delay variation due to path asymmetry through the use of pluggable packet scheduling or reordering algorithms. The authors claim that simulation and testbed experiments demonstrate both the basic operation of the framework and its effectiveness at managing significant delay variation without degrading application QoS.

Significance. If the evaluation claims hold with concrete metrics and reproducible details, the work would provide a practical, standards-compatible approach to multi-access support for unreliable traffic in mobile nodes. The emphasis on pluggable algorithms offers potential flexibility for different scheduling policies, which could be a useful contribution to the design of multipath transport protocols in heterogeneous environments.

major comments (1)
  1. [Abstract / Evaluation] Abstract and evaluation description: the central claim that the framework manages 'significant packet delay variation' via pluggable scheduling/reordering algorithms is load-bearing for the paper's contribution, yet the provided text supplies no description of the algorithms, no scheduling policy, no reordering mechanism, no tested delay-variation thresholds, and no QoS metrics (jitter, loss, goodput, application latency) or baseline comparisons. Without these, the demonstration cannot be evaluated.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the constructive feedback and the recommendation for major revision. We agree that the central claims regarding management of packet delay variation require more explicit detail on algorithms, mechanisms, thresholds, and metrics to allow proper evaluation, and we will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract / Evaluation] Abstract and evaluation description: the central claim that the framework manages 'significant packet delay variation' via pluggable scheduling/reordering algorithms is load-bearing for the paper's contribution, yet the provided text supplies no description of the algorithms, no scheduling policy, no reordering mechanism, no tested delay-variation thresholds, and no QoS metrics (jitter, loss, goodput, application latency) or baseline comparisons. Without these, the demonstration cannot be evaluated.

    Authors: We acknowledge that the abstract and high-level evaluation description lack the requested specifics. The manuscript describes the MP-DCCP framework as supporting pluggable algorithms for scheduling and reordering to handle path asymmetry, but does not detail the concrete policies, mechanisms, tested thresholds, or quantitative QoS results with baselines in the sections referenced by the referee. We will revise by adding: (1) explicit descriptions of the scheduling policy and reordering mechanism used in the experiments, (2) the specific delay-variation thresholds tested, and (3) concrete QoS metrics (jitter, loss, goodput, application latency) together with baseline comparisons. These additions will be placed in the evaluation section and cross-referenced from the abstract. revision: yes

Circularity Check

0 steps flagged

No circularity: design proposal with external empirical validation

full rationale

The paper presents the MP-DCCP framework design and reports simulation/testbed results showing operation and delay-variation management. No equations, fitted parameters, or derivation steps are described that reduce to self-definition, renamed inputs, or self-citation chains. The pluggable scheduling claim is an assertion of capability rather than a mathematical reduction; validation is external to any internal fit. This matches the default expectation of a non-circular engineering paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract; no free parameters, axioms, or invented entities are specified in the provided text.

pith-pipeline@v0.9.0 · 5759 in / 1121 out tokens · 30342 ms · 2026-05-24T23:45:06.718511+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    J Kua, G Armitage, P Branch, A Survey of Rate Adaptation Techniques for Dynamic Adaptive Streaming Over HTTP, IEEE Communications Surveys and Tutorials, 19(3), 2017

    work page 2017

  2. [2]

    V Singh, S Ahsan, J Ott, MPRTP: Multipath Considerations for Real- time Media, Proceedings of MMSys ’13 Proceedings of the 4th ACM Multimedia Systems Conference, 2013, Pages 190-201

    work page 2013

  3. [3]

    TR-348 Hybrid Access Broadband Network Architecture, Broadband Forum, Retrieved March 2019

    work page 2019

  4. [4]

    3GPP, TR 23.793, Study on access traffic steering, switch and splitting support in the 5G System (5GS) architecture, 2018

    work page 2018

  5. [5]

    A. Ford, C. Raiciu, M. Handley, O. Bonaventure, TCP Extensions for Multipath Operation with Multiple Addresses, IETF RFC 6824, January 2013

    work page 2013

  6. [6]

    C Paasch, G Detal, F Duchene, C Raiciu, O Bonaventure, Exploring mo- bile/WiFi handover with multipath TCP, Proceedings of the 2012 ACM SIGCOMM workshop on Cellular networks: operations, challenges, and future design, Pages 31-36, 2012

    work page 2012

  7. [7]

    Q Peng, A Walid, J Hwang, S H Low, Multipath TCP: Analysis, Design and Implementation, IEEE/ACM Transactions on Networking, 24(1), Feb. 2016

    work page 2016

  8. [8]

    J Wu, C Yuen, B Cheng, M Wang, J Chen, Streaming High-Quality Mobile Video with Multipath TCP in Heterogeneous Wireless Networks, IEEE Transactions on Mobile Computing, 15(9), Sep 2016

    work page 2016

  9. [9]

    S-Y Park, C Joo, Y Park, S Bahk, Impact of traffic splitting on the delay performance of MPTCP, IEEE International Conference on Communications (ICC) 2014

    work page 2014

  10. [10]

    R Hamilton, J Iyengar, I Swett, A Wilk, QUIC: A UDP-Based Secure and Reliable Transport for HTTP/2, IETF Draft, draft-tsvwg-quic- protocol-02, July 2016

    work page 2016

  11. [11]

    M Amend, A Brunstrom, A Kassler, V Rakocevic, DCCP Extensions for Multipath Operation with Multiple Addresses, draft-amend-tsvwg- multipath-dccp-01, IETF Internet Draft, March 2019

    work page 2019

  12. [12]

    Floyd, M

    S. Floyd, M. J. Handley, and E. Kohler, Datagram Congestion Control Protocol (DCCP), RFC 4340, March 2006

    work page 2006

  13. [13]

    S Floyd, E Kohler, IETF RFC 4341: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Conges- tion Control, March 2006

    work page 2006

  14. [14]

    Padhye, IETF RFC 4342: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP- Friendly Rate Control (TFRC), , March 2006

    S Floyd, E Kohler, J. Padhye, IETF RFC 4342: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP- Friendly Rate Control (TFRC), , March 2006

    work page 2006

  15. [15]

    S Takeuchi, H Koga, K Iida, Y Kadobayashi, S Yamaguchi, Performance Evaluations of DCCP for Bursty Traffic in Real-Time Applications, Symposium on Applications and the Internet, 2005

    work page 2005

  16. [16]

    P Navaratnam, N Akhtar, R Tafazolli, On the performance of DCCP in wireless mesh networks, MobiWac ’06 Proceedings of the 4th ACM international workshop on Mobility management and wireless access, pages 144-147

    work page

  17. [17]

    B Gorkemli, M Oguz Sunay, A Murat Tekalp, Video Streaming over Wireless DCCP, 15th IEEE International Conference on Image Process- ing, 2008

    work page 2008

  18. [18]

    M A Azad, R Mahmood, T Mehmood, A Comparative Analysis of DCCP variants (CCID2, CCID3), TCP and UDP for MPEG4 Video Applications, 2009 International Conference on Information and Com- munication Technologies

    work page 2009

  19. [19]

    M Amend, A Brunstrom, A Kassler, V Rakocevic, IP compatible multipath framework for heterogeneous access networks, draft-amend- tsvwg-multipath-framework-mpdccp-00, March 2019

    work page 2019

  20. [20]

    Y-S Lim, E M Nahum, D Towsley, R Gibbens, ECF: An MPTCP Path Scheduler to Manage Heterogeneous Paths, Proceedings of CoNEXT ’17, Pages 147-159, 2017

    work page 2017

  21. [21]

    on Advanced Information Networking and Applications, 2014

    F Yang, Q Wang, P D Amer, Out-of-Order Transmission for In-Order Arrival Scheduling for Multipath TCP, International Conf. on Advanced Information Networking and Applications, 2014

    work page 2014

  22. [22]

    X. Zhu, R. Pan, M. Ramalho, S. Mena, P. Jones, J. Fu, S. D’Aronco, NADA: A Unified Congestion Control Scheme for Real-Time Media, draft-ietf-rmcat-nada-10, Mar 2019

    work page 2019

  23. [23]

    rmcat, 16 May 2019, https://datatracker.ietf.org/wg/rmcat/about/

    work page 2019

  24. [24]

    ns3, 16 May 2019, ¡https://www.nsnam.org/¿

    work page 2019

  25. [25]

    DCE, 16 May 2019, https://github.com/direct-code-execution/ns-3-dce

    work page 2019

  26. [26]

    net-next-sim, 16 May 2019, https://github.com/direct-code- execution/net-next-sim

    work page 2019

  27. [27]

    ns3-rmcat https://github.com/cisco/ns3-rmcat

    work page

  28. [28]

    The Linux Foundation. (2018). The Datagram Congestion Control Protocol in the Linux Kernel, [Online], visited on 03/29/2018

    work page 2018

  29. [29]

    Fober, Y

    D. Fober, Y . Orlarey, and S. Letz. Real time clock skew estimation over network delays, 2005

    work page 2005