Qiaolun Zhang

Prof. Qiaolun Zhang

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
QZQiaolun Zhang
Qiaolun Zhang
OAOMRAN AYOUB
OMRAN AYOUB
Alberto GattoAlberto Gatto
Alberto Gatto
Jun WuJun Wu
Jun Wu
FMFrancesco Musumeci
Francesco Musumeci
MTMassimo Tornatore
Massimo Tornatore
Quantum Key Distribution (QKD) is currently being explored as a solution to the threats posed to current cryptographic protocols by the evolution of quantum computers and algorithms. However, single-photon quantum signals used for QKD permit to achieve key rates strongly limited by link performance (e.g., loss and noise) and propagation distance, especially in multi-node QKD networks, making it necessary to design a scheme to efficiently and timely distribute keys to the various nodes. In this work, we introduce the new problem of joint Routing, Channel, Key-rate and Time-slot Assignment (RCKTA), which is addressed with four different network settings, i.e., allowing or not the use of optical bypass (OB) and trusted relay (TR). We first prove the NP-hardness of the RCKTA problem for all network settings and formulate it using a Mixed Integer Linear Programming (MILP) model that combines both quantum channels and quantum key pool (QKP) to provide an optimized solution in terms of number of accepted key rate requests and key storing rate. To deal with problem complexity, we also propose a heuristic algorithm based on an auxiliary graph, and show that it is able to obtain near-optimal solutions in polynomial time. Results show that allowing OB and TR achieves an acceptance ratio of 39% and 14% higher than that of OB and TR, respectively. Remarkably, these acceptance ratios are obtained with up to 46% less QKD modules (transceivers) compared to TR and only few (less than 1 per path) additional QKD modules than OB.

7 December 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
QZQiaolun Zhang
Qiaolun Zhang
OAOMRAN AYOUB
OMRAN AYOUB
Jun WuJun Wu
Jun Wu
FMFrancesco Musumeci
Francesco Musumeci
Gaolei LiGaolei Li
Gaolei Li
MTMassimo Tornatore
Massimo Tornatore
In presence of multiple failures affecting their network infrastructure, operators are faced with the Progressive Network Recovery (PNR) problem, i.e., deciding the best sequence of repairs during recovery. With incoming deployments of 5G networks, PNR must evolve to incorporate new recovery opportunities offered by network slicing. In this study, we introduce the new problem of Progressive Slice Recovery (PSR), which is addressed with eight different strategies, i.e., allowing or not to change slice embedding during the recovery, and/or by enforcing different versions of slice connectivity (i.e., network vs. content connectivity). We propose a comprehensive PSR scheme, which can be applied to all recovery strategies and achieves fast recovery of slices. We first prove the PSR’s NP-hardness and design an integer linear programming (ILP) model, which can obtain the best recovery sequence and is extensible for all the recovery strategies. Then, to address scalability issues of the ILP model, we devise an efficient two-phases progressive slice recovery (2-phase PSR) meta-heuristic algorithm, small optimality gap, consisting of two main steps: i) determination of recovery sequence, achieved through a linear-programming relaxation that works in polynomial time; and ii) slice-embedding recovery, for which we design an auxiliary-graph-based column generation to re-embed failed slice nodes/links to working substrate elements within a given number of actions. Numerical results compare the different strategies and validate that amount of recovered slices can be improved up to 50% if operators decide to reconfigure only few slice nodes and guarantee content connectivity.

22 February 2021 in IEEE Consumer Electronics Magazine
Verified
Journal Article
Closed access
QZQiaolun Zhang
Qiaolun Zhang
Jun WuJun Wu
Jun Wu
MZMichele Zanella
Michele Zanella
WYWu Yang
Wu Yang
Ali Kashif BashirAli Kashif Bashir
Ali Kashif Bashir
William FornaciariWilliam Fornaciari
William Fornaciari
In large-scale emergency scenarios, massive content for searching, asking for help, and rescue will be generated and transmitted in intelligent Internet of vehicular things (IIoVT). However, IP-networks-based emergency systems make rescue decisions on remote emergency centers, leading to inefficient content dissemination and a high-latency response. Moreover, a few previous works address trust issues in the emergency systems, resulting in fake content and malicious emergency services. To address abovementioned challenges, we propose an emergent semantic-based information-centric fog system, which realizes trustworthy and intelligent emergency analysis and management. First, we design an efficient emergency content dissemination network for aggregating and analyzing emergency information. Besides, we propose a semantic-based trustworthy routing scheme that filters fake content from malicious entities. Moreover, we implement a real testbed and a simulator to evaluate the benefit and performance of the proposed system. The results show that the proposed system achieves a short average semantic analyzing time and a low failure rate of emergency services.

12 November 2024 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
QZQiaolun Zhang
Qiaolun Zhang
AMAnnalisa Morea
Annalisa Morea
PLPatricia Layec
Patricia Layec
MIMemedhe Ibrahimi
Memedhe Ibrahimi
FMFrancesco Musumeci
Francesco Musumeci
MTMassimo Tornatore
Massimo Tornatore
Operators are constantly faced with the need to increase optical-network capacity to accommodate rapid traffic growth while minimizing the cost-per-bit and power-per-bit. The drastic reduction of the power consumption of IP routers and ZR/ZR+ pluggable transponders seen in the past several years has renewed the interest in “opaque” optical-network architectures, where no optical bypassing is allowed. In this work, we aim to quantify and compare the power consumption of four “IP over wavelength division multiplexing” (IPoWDM) transport network architectures employing ZR/ZR+ modules versus long-haul muxponders, considering different grooming, regeneration, and optical bypassing capabilities. We first propose a power consumption model for different IPoWDM node architectures with ZR/ZR+ modules and long-haul muxponders. Then, to obtain the power consumption of different architectures, we propose a compact auxiliary-graph-based network-design algorithm extensible to different network architectures. Moreover, we investigate how the continuous decrease in the power consumption of ZR/ZR+ and IP routers can impact the power consumption of different architectures through a sensitivity analysis. Illustrative numerical results on networks of different sizes show that, despite drastic reductions of power consumption at the IP layer, optical bypassing is still the most power-efficient solution, reducing consumption by up to 48%.

24 July 2018 in IEEE Access
Verified
Journal Article
Open access
Gaolei LiGaolei Li
Gaolei Li
QZQiaolun Zhang
Qiaolun Zhang
JLJianhua Li
Jianhua Li
Jun WuJun Wu
Jun Wu
PZPeng Zhang
Peng Zhang
Although the ways to protect vehicular location privacy have been actively studied in recent years, the locations of vehicles are frequently submitted for authentication during accessing location-based services (LBS), which makes it easier for attackers to launch attacks by threaten the location privacy of vehicles. Moreover, the rapid deployment of electric vehicles requires location privacy-preserving to be more energy-efficient. In this paper, we proposed a novel energy-efficient location privacy preserving (ELPP) scheme in vehicular networks using social intimate fogs (SIF). ELPP is based on three novel techniques. Firstly, ELPP deal with large bursts of LBS requests by transferring them to their SIF. The key insight is that computing efficiency for location privacy preserving can be gained at the price of some communication delay. Secondly, ELPP introduces a travel plan-based LBS content pre-caching mechanism, which enables quick and exible retrieval and distribution of the LBS contents. Thirdly, to guarantee confidentiality, ELPP randomly encrypted the data by access control encryption (ACE). ELPP is deployable on existing devices, without modifying protocols in vehicular networks. We present a implementation case of ELPP and validate that it is energy-efficient, fast and secure.

14 August 2024 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
MLMengyao Li
Mengyao Li
QZQiaolun Zhang
Qiaolun Zhang
Alberto GattoAlberto Gatto
Alberto Gatto
SBStefano Bregni
Stefano Bregni
Giacomo VerticaleGiacomo Verticale
Giacomo Verticale
MTMassimo Tornatore
Massimo Tornatore
With progressive network recovery, operators restore network connectivity after massive failures along multiple stages, by identifying the optimal sequence of repair actions to maximize carried live traffic. Motivated by the initial deployments of quantum-key-distribution (QKD) over optical networks appearing in several locations worldwide, in this work we model and solve the progressive QKD network recovery (PQNR) problem in QKD networks to accelerate the recovery after failures. We formulate an integer linear programming (ILP) model to optimize the achievable accumulative key rates during recovery for four different QKD network architectures, considering different capabilities of using trusted relay and optical bypass. Due to the computational limitations of the ILP model, we propose a deep reinforcement learning (DRL) algorithm based on a twin delayed deep deterministic policy gradients (TD3) framework to solve the PQNR problem for large-scale topologies. Simulation results show that our proposed algorithm approaches well compared to the optimal solution and outperforms several baseline algorithms. Moreover, using optical bypass jointly with trusted relay can improve the performance in terms of the key rate by 14% and 18% compared to the cases where only optical bypass and only trusted relay are applied, respectively.