Jun Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jun Lu has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Kaiping Xue
University of Science and Technology of China, Hefei, Anhui, China
32 shared publications - Qibin Sun
University of Science and Technology of China
31 shared publications - Jian Li
University of Science and Technology of China
18 shared publications - Jiangping Han
School of Cyber Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
11 shared publications - Nenghai Yu
University of Science and Technology of China, Hefei, China
10 shared publications - Ruidong Li
Institute of Science and Engineering, Kanazawa University, Kakuma, Kanazawa, Japan
10 shared publications
Latest Publications
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3316-3330
FESCAT: Function Secret Sharing Based Efficient Secure Collaborative Analysis of Time Series Data
Time series data analysis, employing dynamic time warping (DTW) algorithms, has a wide range of applications in fields such as medicine and economics. Given the widespread distribution of data across different domains, integrating and analyzing these datasets through outsourced cloud computing can enhance analytics, though privacy concerns arise. Privacy preserving data analysis, underpinned by secure multi-party computing, emerges as a crucial approach to address this challenge. However, existing efforts face high communication costs and increased interactions, resulting in significant efficiency constraints in practical applications. In this paper, we propose a function secret sharing (FSS)-based framework for secure collaborative analysis of time series data using the DTW algorithm. Utilizing the distributed comparison function, we develop efficient building blocks with minimal online interaction and communication, enhancing the practicability of security protocols. To address the challenges of FSS key generation due to uncertain computational topology when cascading multiple distances, we adopt a modular design and decompose the analysis process into several critical modules. Furthermore, our framework efficiently supports various constraint methods for DTW. We implement and evaluate our framework using publicly available datasets. The results demonstrate a significant reduction in communication costs and the number of interactions during the online phase.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 3316-3330
FESCAT: Function Secret Sharing Based Efficient Secure Collaborative Analysis of Time Series Data
Time series data analysis, employing dynamic time warping (DTW) algorithms, has a wide range of applications in fields such as medicine and economics. Given the widespread distribution of data across different domains, integrating and analyzing these datasets through outsourced cloud computing can enhance analytics, though privacy concerns arise. Privacy preserving data analysis, underpinned by secure multi-party computing, emerges as a crucial approach to address this challenge. However, existing efforts face high communication costs and increased interactions, resulting in significant efficiency constraints in practical applications. In this paper, we propose a function secret sharing (FSS)-based framework for secure collaborative analysis of time series data using the DTW algorithm. Utilizing the distributed comparison function, we develop efficient building blocks with minimal online interaction and communication, enhancing the practicability of security protocols. To address the challenges of FSS key generation due to uncertain computational topology when cascading multiple distances, we adopt a modular design and decompose the analysis process into several critical modules. Furthermore, our framework efficiently supports various constraint methods for DTW. We implement and evaluate our framework using publicly available datasets. The results demonstrate a significant reduction in communication costs and the number of interactions during the online phase.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 73 (11) , 8981-8991
A Novel Miniaturized 2.5-D Frequency-Selective Structure With Cross-Resonance Design for Enhanced Wide Passband and High Stopband Suppression
This paper introduces an innovative filter circuit by building upon a foundational broadband filter model, incorporating novel resonators and cross-coupling between them to achieve a filter with both a wide passband and high stopband suppression. Leveraging this advanced circuit design, a novel miniaturized 2.5-D Frequency Selective Surface (FSS) is developed, featuring five planar layers and two vertical layers. The planar layers are designed with a unique miniaturization approach, while the vertical layers enable efficient cross-coupling between resonators, significantly improving the overall performance. Simulation results demonstrate that the proposed FSS achieves an average insertion loss of just 0.43 dB within the 1.5–3.7 GHz range, corresponding to a passband fractional bandwidth of 84.6%. Notably, the stopband spans 0.69–1.19 GHz with a suppression of −15 dB at 1.05 GHz, and the high-frequency stopband maintains −10 dB at 4 GHz. Additionally, the FSS maintains excellent passband performance and stopband suppression even under oblique incidence angles ranging from 0° to 60°. A prototype of the FSS was fabricated and experimentally tested, and the results closely match the simulations, confirming that the proposed FSS outperforms conventional broadband FSS designs in terms of stopband suppression, insertion loss, and angular stability. This innovative circuit and structural design provide a significant solution for achieving high-performance electromagnetic shielding, particularly in complex electromagnetic environments.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 73 (11) , 8981-8991
A Novel Miniaturized 2.5-D Frequency-Selective Structure With Cross-Resonance Design for Enhanced Wide Passband and High Stopband Suppression
This paper introduces an innovative filter circuit by building upon a foundational broadband filter model, incorporating novel resonators and cross-coupling between them to achieve a filter with both a wide passband and high stopband suppression. Leveraging this advanced circuit design, a novel miniaturized 2.5-D Frequency Selective Surface (FSS) is developed, featuring five planar layers and two vertical layers. The planar layers are designed with a unique miniaturization approach, while the vertical layers enable efficient cross-coupling between resonators, significantly improving the overall performance. Simulation results demonstrate that the proposed FSS achieves an average insertion loss of just 0.43 dB within the 1.5–3.7 GHz range, corresponding to a passband fractional bandwidth of 84.6%. Notably, the stopband spans 0.69–1.19 GHz with a suppression of −15 dB at 1.05 GHz, and the high-frequency stopband maintains −10 dB at 4 GHz. Additionally, the FSS maintains excellent passband performance and stopband suppression even under oblique incidence angles ranging from 0° to 60°. A prototype of the FSS was fabricated and experimentally tested, and the results closely match the simulations, confirming that the proposed FSS outperforms conventional broadband FSS designs in terms of stopband suppression, insertion loss, and angular stability. This innovative circuit and structural design provide a significant solution for achieving high-performance electromagnetic shielding, particularly in complex electromagnetic environments.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 7521-7534
Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management
The widespread adoption of cloud storage has raised considerable data privacy concerns for outsourced databases. In recent years, Structured Encryption (STE) has emerged as a promising solution to build encrypted databases that efficiently handle queries while preserving privacy through underlying structures called Encrypted Multi-Maps (EMMs). However, current STE-based schemes primarily focus on static settings, and their direct extensions to dynamic settings introduce significant challenges in client storage overhead and update efficiency with join condition. In this paper, we present an efficient dynamic encrypted database scheme supporting large-scale data. To address the challenges in dynamic settings, we first propose a novel dynamic EMM design with constant client storage that utilizes a global counter to reduce client storage overhead. We then introduce an algorithm for dynamically handling join queries based on tags generated from values of the join attribute, significantly reducing update overhead. We implement our scheme and conduct comparative analyses with existing dynamic STE schemes. The experimental results demonstrate that our scheme offers significant advantages in terms of client storage overhead and update performance.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 7521-7534
Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management
The widespread adoption of cloud storage has raised considerable data privacy concerns for outsourced databases. In recent years, Structured Encryption (STE) has emerged as a promising solution to build encrypted databases that efficiently handle queries while preserving privacy through underlying structures called Encrypted Multi-Maps (EMMs). However, current STE-based schemes primarily focus on static settings, and their direct extensions to dynamic settings introduce significant challenges in client storage overhead and update efficiency with join condition. In this paper, we present an efficient dynamic encrypted database scheme supporting large-scale data. To address the challenges in dynamic settings, we first propose a novel dynamic EMM design with constant client storage that utilizes a global counter to reduce client storage overhead. We then introduce an algorithm for dynamically handling join queries based on tags generated from values of the join attribute, significantly reducing update overhead. We implement our scheme and conduct comparative analyses with existing dynamic STE schemes. The experimental results demonstrate that our scheme offers significant advantages in terms of client storage overhead and update performance.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6406-6421
Privacy-Preserving Truth Discovery of Evolving Truths for Mobile Crowdsensing Systems
Privacy-preserving truth discovery (PPTD) enables the crowdsensing platform to extract reliable inferred truths from unreliable user sensory data. While mobile crowdsensing systems have driven the emergence of many applications, continuously extracting inferred truths of evolving objects over streaming data (continuous PPTD) remains a challenge. Most existing works focus on static scenarios and cannot handle the new challenges in continuous PPTD, such as accuracy decrease, user dynamics, real-time requirements, and outliers. To address these challenges, we present PTET, a PPTD framework for continuous PPTD. By mining evolving patterns, PTET extracts accurate inferred truths of evolving objects even when some epochs lack sufficient user sensory data. PTET ensures the privacy of both users and data requesters while achieving high accuracy. Furthermore, we present PTET-P for practical applications. It employs a virtual user combined with evolving patterns to effectively eliminate the impact of user dynamics in continuous PPTD. Meanwhile, PTET-P achieves “immediate on-arrival processing” to improve real-time performance significantly. In addition, we address the outliers problem with the help of evolving patterns. We provide security analysis to prove that our frameworks protect the privacy of both users and data requesters. Extensive experiments demonstrate that our frameworks dramatically outperform the existing schemes in extracting inferred truths of evolving objects in continuous PPTD.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6406-6421
Privacy-Preserving Truth Discovery of Evolving Truths for Mobile Crowdsensing Systems
Privacy-preserving truth discovery (PPTD) enables the crowdsensing platform to extract reliable inferred truths from unreliable user sensory data. While mobile crowdsensing systems have driven the emergence of many applications, continuously extracting inferred truths of evolving objects over streaming data (continuous PPTD) remains a challenge. Most existing works focus on static scenarios and cannot handle the new challenges in continuous PPTD, such as accuracy decrease, user dynamics, real-time requirements, and outliers. To address these challenges, we present PTET, a PPTD framework for continuous PPTD. By mining evolving patterns, PTET extracts accurate inferred truths of evolving objects even when some epochs lack sufficient user sensory data. PTET ensures the privacy of both users and data requesters while achieving high accuracy. Furthermore, we present PTET-P for practical applications. It employs a virtual user combined with evolving patterns to effectively eliminate the impact of user dynamics in continuous PPTD. Meanwhile, PTET-P achieves “immediate on-arrival processing” to improve real-time performance significantly. In addition, we address the outliers problem with the help of evolving patterns. We provide security analysis to prove that our frameworks protect the privacy of both users and data requesters. Extensive experiments demonstrate that our frameworks dramatically outperform the existing schemes in extracting inferred truths of evolving objects in continuous PPTD.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3024-3039
An Asynchronous Key Relay Protocol Design for Large-Scale Quantum Key Distribution Networks
Quantum key distribution (QKD) networks can provide information-theoretically secure key distribution between distant end nodes through key relaying. In QKD networks, the key relay protocol is vital since it provides the coordination specifications between nodes for key relaying and thus directly determines the performance, especially as the network scale expands. However, most existing protocols adopt a synchronous contend-and-relay approach, where the contention and consumption of quantum keys occur simultaneously, neglecting the storable nature of quantum keys and presenting significant challenges in reliability and quantum key utilization. To tackle these challenges, in this paper, we propose an asynchronous key relay protocol (AKRP). AKRP considers the storable nature of quantum keys, and adopts a reserve-then-relay approach to achieve lossless and zero-queuing key relaying through precise management of quantum keys and requests. On this basis, to further improve the performance of the proposed AKRP, we design two enhanced mechanisms, i.e., collision detection and resolution mechanism and multipath routing extension. The former enhances the consensus efficiency of AKRP and provides fine-grained key utilization on each link, and the latter utilizes quantum keys on possible relay paths and thus effectively copes with quantum key exhaustion. By conducting extensive experiments on a semi-physical real QKD network platform, results demonstrate that AKRP is superior to existing schemes in terms of end-to-end key throughput, quantum key consumption, and relaying latency.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3024-3039
An Asynchronous Key Relay Protocol Design for Large-Scale Quantum Key Distribution Networks
Quantum key distribution (QKD) networks can provide information-theoretically secure key distribution between distant end nodes through key relaying. In QKD networks, the key relay protocol is vital since it provides the coordination specifications between nodes for key relaying and thus directly determines the performance, especially as the network scale expands. However, most existing protocols adopt a synchronous contend-and-relay approach, where the contention and consumption of quantum keys occur simultaneously, neglecting the storable nature of quantum keys and presenting significant challenges in reliability and quantum key utilization. To tackle these challenges, in this paper, we propose an asynchronous key relay protocol (AKRP). AKRP considers the storable nature of quantum keys, and adopts a reserve-then-relay approach to achieve lossless and zero-queuing key relaying through precise management of quantum keys and requests. On this basis, to further improve the performance of the proposed AKRP, we design two enhanced mechanisms, i.e., collision detection and resolution mechanism and multipath routing extension. The former enhances the consensus efficiency of AKRP and provides fine-grained key utilization on each link, and the latter utilizes quantum keys on possible relay paths and thus effectively copes with quantum key exhaustion. By conducting extensive experiments on a semi-physical real QKD network platform, results demonstrate that AKRP is superior to existing schemes in terms of end-to-end key throughput, quantum key consumption, and relaying latency.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6104-6120
PSAC: Privacy-Preserving Statistical Analysis Framework for Crowdsourcing Using Histograms
Crowdsourcing has emerged as an effective paradigm for large-scale data collection and statistical analysis. However, the paramount concern about worker privacy has driven the development of privacy-preserving statistical analysis methods. We propose PSAC, a novel framework that leverages histograms to facilitate privacy-preserving statistical analysis in crowdsourcing. PSAC integrates secure statistical analysis protocols based on homomorphic encryption and secure two-party computation, addressing the limitations of a single cryptographic technique. It introduces innovative algorithms using histograms for statistical operations, including functions such as quantile estimation, outlier elimination, contingency table construction for $\chi ^{2}$ test, and the Mann-Whitney $U$ test. These algorithms exhibit minimal overhead growth with respect to data volume, demonstrating exceptional scalability for large numbers of data. Moreover, through a key-separation design, PSAC ensures that only the requester can decrypt the final results independently, even if the ciphertexts of data are exposed. Comprehensive evaluations validate the security, efficiency, and scalability of the PSAC framework.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 6104-6120
PSAC: Privacy-Preserving Statistical Analysis Framework for Crowdsourcing Using Histograms
Crowdsourcing has emerged as an effective paradigm for large-scale data collection and statistical analysis. However, the paramount concern about worker privacy has driven the development of privacy-preserving statistical analysis methods. We propose PSAC, a novel framework that leverages histograms to facilitate privacy-preserving statistical analysis in crowdsourcing. PSAC integrates secure statistical analysis protocols based on homomorphic encryption and secure two-party computation, addressing the limitations of a single cryptographic technique. It introduces innovative algorithms using histograms for statistical operations, including functions such as quantile estimation, outlier elimination, contingency table construction for $\chi ^{2}$ test, and the Mann-Whitney $U$ test. These algorithms exhibit minimal overhead growth with respect to data volume, demonstrating exceptional scalability for large numbers of data. Moreover, through a key-separation design, PSAC ensures that only the requester can decrypt the final results independently, even if the ciphertexts of data are exposed. Comprehensive evaluations validate the security, efficiency, and scalability of the PSAC framework.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4070-4082
RGuide: Fast and Accurate Congestion Control Guided via Explicit Rate Control in Data Center Networks
Congestion control (CC) is crucial in data center networks (DCNs), providing high throughput and low latency transmission services for diverse applications. Existing CC schemes typically rely on iterative rate adjustment at ends, and suffer from performance issues such as slow convergence, throughput fluctuations, and fairness defects. Explicit rate control (ERC) promises to address these challenges by allowing switches to directly allocate rates for each flow, freeing senders from heuristic detection of available bandwidth. However, current ERC-based schemes employ inefficient feedback control to regulate the allocated rates, resulting in sub-optimal performance. In this paper, we propose RGuide, a fast and accurate CC scheme based on ERC. RGuide can calculate accurate fair share rates in real-time at switches with the consideration of low latency, and utilize the rate to guide host adjustments instead of the need for end-to-end iteration processes. We meticulously design the ERC trigger conditions, enabling switches to recognize the different congestion states of flows and rectify flows that deviate from the fair share rate at sub-RTT timescales. We conduct actual testbed experiments and extensive simulations to evaluate RGuide comprehensively. The results demonstrate the significant advantages of RGuide in terms of convergence speed, throughput stability, and fairness.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4070-4082
RGuide: Fast and Accurate Congestion Control Guided via Explicit Rate Control in Data Center Networks
Congestion control (CC) is crucial in data center networks (DCNs), providing high throughput and low latency transmission services for diverse applications. Existing CC schemes typically rely on iterative rate adjustment at ends, and suffer from performance issues such as slow convergence, throughput fluctuations, and fairness defects. Explicit rate control (ERC) promises to address these challenges by allowing switches to directly allocate rates for each flow, freeing senders from heuristic detection of available bandwidth. However, current ERC-based schemes employ inefficient feedback control to regulate the allocated rates, resulting in sub-optimal performance. In this paper, we propose RGuide, a fast and accurate CC scheme based on ERC. RGuide can calculate accurate fair share rates in real-time at switches with the consideration of low latency, and utilize the rate to guide host adjustments instead of the need for end-to-end iteration processes. We meticulously design the ERC trigger conditions, enabling switches to recognize the different congestion states of flows and rectify flows that deviate from the fair share rate at sub-RTT timescales. We conduct actual testbed experiments and extensive simulations to evaluate RGuide comprehensively. The results demonstrate the significant advantages of RGuide in terms of convergence speed, throughput stability, and fairness.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4950-4963
From an In-Depth Understanding of Multipath TCP Enhancement Schemes to an Adaptive Control Framework in Wireless Networks
Multipath TCP (MPTCP) has gained popularity to enhance data transmission. From the last decade, proposed MPTCP enhancement schemes for congestion control, path management, and packet scheduling, have been used to benefit transmission performance. However, despite their efforts, they are exigent with a comprehensive understanding of real-world performance to guide the implementation of MPTCP to a more complex wireless network. To that end, we conduct a measurement-driven study of MPTCP enhancement schemes, providing insights and in-depth demonstrations of their performance with a comprehensive real-world platform. Our finding indicates that the enhancement schemes struggle to consistently maintain high performance at all times. One can achieve optimal efficiency in its specific scenarios, but suffers extreme degradation at times. To eliminate this transmission uncertainty in wireless networks, we further propose an adaptive control framework OLSch to integrate different schemes, emphasizing their strengths to provide consistently high performance. To be specific, OLSch is implemented with different scheduling schemes and leverages an online-learning-driven approach to choose one that best fits the current network conditions. Evaluations show that OLSch obviously improves the stability of transmission in harsh network scenarios, eliminates performance degradation, and increases the 95% tail throughput by 1.45×-2.39×.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4950-4963
From an In-Depth Understanding of Multipath TCP Enhancement Schemes to an Adaptive Control Framework in Wireless Networks
Multipath TCP (MPTCP) has gained popularity to enhance data transmission. From the last decade, proposed MPTCP enhancement schemes for congestion control, path management, and packet scheduling, have been used to benefit transmission performance. However, despite their efforts, they are exigent with a comprehensive understanding of real-world performance to guide the implementation of MPTCP to a more complex wireless network. To that end, we conduct a measurement-driven study of MPTCP enhancement schemes, providing insights and in-depth demonstrations of their performance with a comprehensive real-world platform. Our finding indicates that the enhancement schemes struggle to consistently maintain high performance at all times. One can achieve optimal efficiency in its specific scenarios, but suffers extreme degradation at times. To eliminate this transmission uncertainty in wireless networks, we further propose an adaptive control framework OLSch to integrate different schemes, emphasizing their strengths to provide consistently high performance. To be specific, OLSch is implemented with different scheduling schemes and leverages an online-learning-driven approach to choose one that best fits the current network conditions. Evaluations show that OLSch obviously improves the stability of transmission in harsh network scenarios, eliminates performance degradation, and increases the 95% tail throughput by 1.45×-2.39×.
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4083-4095
An Efficient and Robust Resource Allocation Method for Quantum Key Distribution Networks
Quantum Key Distribution (QKD) technology leverages its inherent security advantages to ensure information-theoretic security for data transmission in networks. However, existing QKD networks still face critical challenges, including network congestion that stems from limited key resources and uneven resource allocation methods. Thus, in this paper, we focus on the issue of network congestion caused by bottleneck links and aim to achieve load balancing. Considering the limited key resources, we first introduce the key resource utilization ratio as an indicator of bottleneck links and formulate the resource allocation problem as an Integer Linear Programming (ILP) problem. To deal with the complexity of the ILP problem, especially in large-scale network scenarios, we design a heuristic algorithm that can obtain near-optimal solutions within polynomial time. Finally, we implement the proposed key resource allocation scheme in various real-world network topologies using a full-stack quantum network simulator. Compared to the existing algorithms, extensive results show that our method can reduce key resource consumption by up to 50% on bottleneck links and improve the robustness of QKD networks when facing burst quantum key agreement requests.
- 6 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4083-4095
An Efficient and Robust Resource Allocation Method for Quantum Key Distribution Networks
Quantum Key Distribution (QKD) technology leverages its inherent security advantages to ensure information-theoretic security for data transmission in networks. However, existing QKD networks still face critical challenges, including network congestion that stems from limited key resources and uneven resource allocation methods. Thus, in this paper, we focus on the issue of network congestion caused by bottleneck links and aim to achieve load balancing. Considering the limited key resources, we first introduce the key resource utilization ratio as an indicator of bottleneck links and formulate the resource allocation problem as an Integer Linear Programming (ILP) problem. To deal with the complexity of the ILP problem, especially in large-scale network scenarios, we design a heuristic algorithm that can obtain near-optimal solutions within polynomial time. Finally, we implement the proposed key resource allocation scheme in various real-world network topologies using a full-stack quantum network simulator. Compared to the existing algorithms, extensive results show that our method can reduce key resource consumption by up to 50% on bottleneck links and improve the robustness of QKD networks when facing burst quantum key agreement requests.
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (4) , 1826-1839
Toward High-Quality Real-Time Video Streaming: An Efficient Multi-Stream and Multi-Path Scheduling Framework
Real-time video streaming requires high throughput and low delivery time for enhanced user’s Quality of Experience (QoE). This motivates the use of multi-path transmission to improve performance. However, ensuring target performance within specified deadlines and priorities for video frames is particularly crucial for real-time communication and video quality, especially in scenarios with limited resources. To address this challenge, we propose a novel framework, vStreamPth, to guarantee high-quality real-time video streaming through multi-path transmission. For essential quality assurance, vStreamPth incorporates key requirement indicators that guide the transmission decisions of video frames across predefined multiple paths. In this framework, lightweight and robust decision-making is achieved through the collaboration of application-oriented and network-oriented data scheduling. Specifically, it employs robustness estimation to maintain the non-blocking delivery of frames, and further applies online fine-tuning to correct variations caused by changes in end-to-end transmission and multi-path network conditions. We implement a prototype of vStreamPth in Linux user space and conduct a thorough evaluation. Experimental results demonstrate the absolute improvement of vStreamPth in achieving high QoE and deadline satisfaction ratio compared to existing multi-path solutions.
- 18 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (4) , 1826-1839
Toward High-Quality Real-Time Video Streaming: An Efficient Multi-Stream and Multi-Path Scheduling Framework
Real-time video streaming requires high throughput and low delivery time for enhanced user’s Quality of Experience (QoE). This motivates the use of multi-path transmission to improve performance. However, ensuring target performance within specified deadlines and priorities for video frames is particularly crucial for real-time communication and video quality, especially in scenarios with limited resources. To address this challenge, we propose a novel framework, vStreamPth, to guarantee high-quality real-time video streaming through multi-path transmission. For essential quality assurance, vStreamPth incorporates key requirement indicators that guide the transmission decisions of video frames across predefined multiple paths. In this framework, lightweight and robust decision-making is achieved through the collaboration of application-oriented and network-oriented data scheduling. Specifically, it employs robustness estimation to maintain the non-blocking delivery of frames, and further applies online fine-tuning to correct variations caused by changes in end-to-end transmission and multi-path network conditions. We implement a prototype of vStreamPth in Linux user space and conduct a thorough evaluation. Experimental results demonstrate the absolute improvement of vStreamPth in achieving high QoE and deadline satisfaction ratio compared to existing multi-path solutions.