30 July 2021 in IEEE Internet of Things Journal
It is well known that concurrent multipath transfer (CMT) can improve the transmission rate. However, due to multiple heterogeneous paths from users to the access network, a large number of out-of-order packets significantly degrade the overall transmission reliability. Cybertwin provides a potential solution to alleviate the packet out-of-order problem by accurately detecting and perceiving the path state. In this article, we investigate the data scheduling problem and propose a learning-based cybertwin-driven CMT algorithm to obtain the optimal data scheduling policy. In particular, we first formulate the data scheduling problem as an integer linear programming by taking the QoS metrics into account. To cope with the packet out-of-order problem in CMT, we propose a reliable cybertwin-CMT with deep reinforcement learning (CMT-DRL) algorithm to determine the data scheduling decisions. The proposed algorithm takes multipath throughput, end-to-end delay, and packet loss rate into account. Besides, CMT-DRL adopts an asynchronous learning framework to efficiently execute data collection, packet scheduling, and neural network training in sequence by decoupling model training and execution. We conduct extensive experiments in a P4-based programmable network platform. Experimental results indicate that the CMT-DRL outperforms the existing benchmarks in terms of the number of out-of-order packets, round-trip time, and throughput.
8 August 2024 in IEEE Transactions on Mobile Computing
Multipath transmission is a critical enabling technology to enhance QoE for edge users. The packet scheduler plays an irreplaceable role in overcoming heterogeneity and dynamicity in multipath transmission. However, current schedulers depend on an inaccurate delay estimation and lack systematic traffic intensity awareness, performing poorly in wireless heterogeneous networks (HetNets). In this paper, we propose a novel traffic-aware two-level packet scheduler (TA2LS) to address the problem and improve aggregated bandwidth while trading off delay. In particular, we design a multipath transmission state machine (MTSM) to perceive link traffic intensity. MTSM replaces network prediction algorithms by identifying the contribution of each link in multipath transmission in a cost-effective way. Further, we propose a scheduling mechanism based on a two-level optimal-path evaluation method (2LOSM) to adjust the packet scheduling policy adaptively. 2LOSM increases the priority of links with low traffic intensity during scheduling, improving aggregated bandwidth performance and reducing end-to-end delay. We have built a real-world 4G/5G/WiFi testbed and deployed 47 dynamic scenarios to evaluate TA2LS and other five schedulers. In 4G/5G/WiFi scenarios, TA2LS improves aggregated bandwidth by 10.32%–48.27% compared to the second-best scheduler and reduces end-to-end delay by 5.04%–39.98% under the premise of fewer or equivalent overheads.
1 December 2025 in Digital Communications and Networks
16 October 2023 in IEEE Internet of Things Journal
The convergence of Blockchain and Internet of Things (BIoT) is fully considered as a paradigm for mitigating threats related to the trust, security, and privacy of Internet of Things (IoT) data. However, because the bandwidth across nodes and time varies in practical IoT networks, it is difficult for existing BIoT mechanisms guarantee blockchain consensus performances. The consensus time could become long owing to low-bandwidth nodes taking longer to download blocks than high-bandwidth nodes. Conventional wisdom holds that removing low-bandwidth nodes can decrease the consensus time, but the nodes could have high-bandwidth at another time owing to bandwidth variability; thus, kicking which nodes out of the consensus is a great challenge. In this article, a novel lightweight BIoT convergence (namely, E-Chain) is proposed to overcome bandwidth variability. The E-Chain first decouples the blockchain into on-chain validating and off-chain voting components. In the off-chain voting part, each node incurs a one-bit communication overhead for voting on a block based on a reputation index. This voting component does not need to download the full content of the block, and is therefore not affected by bandwidth variability. The reputation index was formulated using a rating algorithm with multidimensional IoT network metrics. In addition, the voting mechanism is secure and can still reach the correct consensus when suffering from byzantine attacks. By contrast, a block is validated and stored in a dispersed manner in the on-chain validating part. The E-Chain performances were then evaluated and compared with state-of-the-art mechanisms. Experimental results show that the E-Chain mechanism can significantly decrease both the consensus time and memory resources, and incur an acceptable memory overhead for resource-constrained IoT nodes.
29 July 2025 in IEEE Transactions on Networking
Delay-sensitive applications like telemedicine and VR/AR intensify competition for network resources and elevate congestion risks, particularly in mobile networks with highly dynamic link conditions. Traditional end-to-end congestion control methods suffer from prolonged response times, rendering them ineffective for Delay-sensitive applications. To this end, this paper proposes a novel In-Network Congestion Control (INCC) mechanism that accelerates congestion control by enabling network nodes to proactively identify bottlenecks and promptly notify end-hosts. Unlike traditional end-host-centric approaches, INCC facilitates collaborative congestion decision-making between end-hosts and in-network unit. INCC classifies congestion into two phases: “yellow” and “red” based on the local queue length bottleneck awareness and global congestion flow bottleneck statistics. For the “yellow” local congestion phrase, we design an in-network local control algorithm that performs proactive packet dropping and rate adjustment to mitigate emerging congestion. For the “red” global congestion phrase, we design an end-host and network cooperative global congestion control algorithm to make precise sending rate adaptation by proactive bottleneck awareness. We implement INCC via Linux kernel modifications and design three experiments to compare with Cubic, NewReno, and BBR. Experimental results demonstrate INCC has good performance on round-trip time and throughput, achieving 99.03% scheduling fairness in flow contention scenarios. Additionally, INCC has low execution overhead on CPU utilization and realize microsecond computational latency.
6 August 2022 in Peer-to-Peer Networking and Applications