LAMPS: A Loss Aware Scheduler for Multipath TCP over Highly Lossy Networks

Dong, Enhuan; Xu, Mingwei; Fu, Xiaoming; Cao, Yu

doi:10.1109/lcn.2017.69

Cited by 18 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Round robin-based [31] and loss-based [32] scheduling schemes have also been proposed, but fail when there is a strong imbalance between the subflows. The most effective schedulers, such as the Slide Together Multipath Scheduler (STMS) [33] and Delay Aware Packet Scheduling (DAPS) [34], try to explicitly model the connection to send packets out-of-order on unbalanced paths so that they will arrive in-order at the receiver.…”

Section: B Schedulingmentioning

confidence: 99%

The HOP Protocol: Reliable Latency-Bounded End-to-End Multipath Communication

Chiariotti

Zanella

Kučera

et al. 2021

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Section: B Schedulingmentioning

confidence: 99%

The HOP Protocol: Reliable Latency-Bounded End-to-End Multipath Communication

Chiariotti

Zanella

Kučera

et al. 2021

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

“…The most basic MPTCP scheduler, currently used in the Linux implementation of the protocol, is the Lowest RTT First (LowRTT) policy: packets are simply sent in the order in which they are written by the application, on the path with the lowest measured Round-Trip Time (RTT) among those with enough available space in their congestion window. Round robin [15] and loss-based [16] scheduling schemes have also been proposed, but fail when there is a strong imbalance between the subflows. These heuristics are often inefficient [17] and can lead to significant performance losses [18].…”

Section: Related Workmentioning

confidence: 99%

Optimal Latency-Oriented Scheduling in Parallel Queuing Systems

Bedin,

Chiariotti,

Kucera

et al. 2021

Preprint

View full text Add to dashboard Cite

Today, more and more interactive applications, such as augmented/virtual reality, haptic Internet, and Industrial Internet of Things, require communication services with guaranteed end-to-end latency limits, which are difficult to provide over shared communication networks, particularly in the presence of wireless links. Robustness against disturbances affecting individual links can be obtained by coding the information flow in multiple streams to be forwarded across parallel transmission links. This approach, however, requires coding and scheduling algorithms that can adapt to the state of links to take full advantage of path diversity and avoid self-induced congestion on some links. To gain some fundamental insights on this challenging problem, in this paper we resort to Markov Decision Process (MDP) theory and abstract the parallel paths as independent queuing systems, whose arrival processes are managed by a common controller that determines the amount of redundancy to be applied to the source messages and the number of (coded) packets to be sent to each queue. The objective is to find the joint coding and scheduling policy that maximizes a certain utility function, e.g., the fraction of source blocks delivered to the destination within a predetermined deadline, despite the variability of the individual connections.We find the optimal redundancy and scheduling strategies by using policy iteration methods. We then analyze the optimal policy in a series of scenarios, highlighting its most important aspects and analyzing ways to improve existing heuristics from the literature.

show abstract

“…Kimura et al [17] presented three alternative packet scheduling decisions for MPTCP, which are called "largest congestion window (CW)-based scheduler", "smallest time (ST)-based scheduler", and "highest sending rate (SR)-based scheduler", respectively. Dong et al [18] designed a novel packet lossaware scheduler for MPTCP in order to enhance the MPTCP performance while significantly reducing extra bandwidth consumption in a high packet loss network condition. Le et al [19] developed a new MPTCP scheduler, which leverages per-path's forward delay as metric to send data.…”

Section: A Mptcp Scheduler Optimization Casesmentioning

confidence: 99%

Can Multipath TCP be Robust to Cyber Attacks With Incomplete Information?

et al. 2020

View full text Add to dashboard Cite

Promoted by the advancements in the various wireless access technologies, modern mobile devices equipped with multiple network interfaces are rapidly becoming the norm, and this provides a driving force for the large-scale deployment of the Multipath Transmission Control Protocol (MPTCP) in the current and future Internet. However, the simultaneous use of multiple network paths for concurrent multipath data transmission can make MPTCP have a larger attack surface than the traditional single-path transport protocols, and this may be likely to pose a risk of MPTCP being much more susceptible to cyber attacks. In this paper, we present a measurement method to investigate the vulnerability and robustness of MPTCP under cyber attacks with incomplete network information, by considering the fact that most cyber attacks normally lack of real-time information with respect to various MPTCP attributes. We mathematically characterize cyber attacks with incomplete network information from the viewpoints of both the cyber attacker and the MPTCP communication system, and then we introduce a mixed attack strategy, by jointly considering the features of both the random attacks and the selective attacks, to evaluate the robustness of MPTCP.

show abstract

LAMPS: A Loss Aware Scheduler for Multipath TCP over Highly Lossy Networks

Cited by 18 publications

References 23 publications

The HOP Protocol: Reliable Latency-Bounded End-to-End Multipath Communication

The HOP Protocol: Reliable Latency-Bounded End-to-End Multipath Communication

Optimal Latency-Oriented Scheduling in Parallel Queuing Systems

Can Multipath TCP be Robust to Cyber Attacks With Incomplete Information?

Contact Info

Product

Resources

About