A Game-Based Scheduler for Reducing Protocol Delay in Multipath Communication

Multipath communication has become a viable alternative to costly quality-of-service networking solutions. Despite multiple advantages, multipath transport protocols suffer from aggravated protocol delay and jitter originating from path heterogeneity. The algorithms responsible for splitting the data over the channels developed so far rely on the evaluation of the most recent channel properties. Taking into account the time lag between the decision on the path allocation and experiencing its effects, the standard approaches are vulnerable to the temporal fluctuations of transmission delays. The paper shows how to use the past and current information about the receiver state to form a zero-sum game among the paths. Contrary to the typical scheduler logic, the path is rewarded and penalized by the receiver irrespective of the channel-related readings. As a result, a prompt reaction to the changes in networking conditions is obtained, and the surges of protocol delay owing to Head-of-Line blocking are mitigated.

Authors

Institutions

Publication Details

Published
2024-12-12
DOI
https://doi.org/10.1109/icarcv63323.2024.10821630
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Game-Based Scheduler for Reducing Protocol Delay in Multipath Communication

Michał Morawski, Przemysław Ignaciuk
Network Traffic and Congestion Control
article

A Game-Based Scheduler for Reducing Protocol Delay in Multipath Communication

Michał Morawski, Przemysław Ignaciuk
article en

Abstract

Multipath communication has become a viable alternative to costly quality-of-service networking solutions. Despite multiple advantages, multipath transport protocols suffer from aggravated protocol delay and jitter originating from path heterogeneity. The algorithms responsible for splitting the data over the channels developed so far rely on the evaluation of the most recent channel properties. Taking into account the time lag between the decision on the path allocation and experiencing its effects, the standard approaches are vulnerable to the temporal fluctuations of transmission delays. The paper shows how to use the past and current information about the receiver state to form a zero-sum game among the paths. Contrary to the typical scheduler logic, the path is rewarded and penalized by the receiver irrespective of the channel-related readings. As a result, a prompt reaction to the changes in networking conditions is obtained, and the surges of protocol delay owing to Head-of-Line blocking are mitigated.

Lodz University of Technology (PL)
Affordable and clean energy
Openalex Percentile: Top 71%
Network Traffic and Congestion Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.