Giang Truong Nguyen

Prof. Dr. Giang Truong Nguyen

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
21 March 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZXZuo Xiang
Zuo Xiang
FGFrank Gabriel
Frank Gabriel
EUElena Urbano
Elena Urbano
GNGiang Truong Nguyen
Giang Truong Nguyen
Martin ReissleinMartin Reisslein
Martin Reisslein
Frank Prof. FitzekFrank Prof. Fitzek
Frank Prof. Fitzek
Software-defined networking (SDN) and network function virtualization (NFV) processed in multi-access edge computing (MEC) cloud systems have been proposed as critical paradigms for achieving the low latency requirements of the tactile Internet. While virtual network functions (VNFs) allow greater flexibility compared to hardware-based solutions, the VNF abstraction also introduces additional packet processing delays. In this paper, we investigate the practical feasibility of NFV with respect to the tactile Internet latency requirements. We develop, implement, and evaluate Chain-based Low latency VNF ImplemeNtation (CALVIN), a low-latency management framework for distributed Service Function Chains (SFCs). CALVIN classifies VNFs into elementary, basic, and advanced VNFs; moreover, CALVIN implements elementary and basic VNFs in the kernel space, while the advanced VNFs are implemented in the user space. Throughout, CALVIN employs a distributed mapping with one VNF per Virtual Machine (VM) in a MEC system. Furthermore, CALVIN avoids the metadata structure processing and batch processing of packets in the conventional Linux networking stack so as to achieve short per-packet latencies. Our rigorous measurements on off-the-shelf conventional networking and computing hardware demonstrate that CALVIN achieves round-trip times from a MEC ingress point via two elementary forwarding VNFs (one in kernel space and one in user space) and a MEC server to a MEC egress point on the order of 0.32 ms. Our measurements also indicate that MEC network coding and encryption are feasible for small 256 byte packets with an MEC latency budget of 0.35 ms; whereas, large 1400 byte packets can complete the network coding, but not the encryption within the 0.35 ms.

13 April 2023 in IEEE Networking Letters
Verified
Journal Article
Open access
PSPaul Schwenteck
Paul Schwenteck
GNGiang Truong Nguyen
Giang Truong Nguyen
HBHolger Boche
Holger Boche
WKWolfgang Kellerer
Wolfgang Kellerer
Frank Prof. FitzekFrank Prof. Fitzek
Frank Prof. Fitzek
The first release of 5G technology is being rolled out worldwide. In parallel, 3GPP is constantly adding new features to upcoming releases covering well-known use cases. This raises the questions i.) when will 6G be introduced?, ii.) how can 6G be motivated for the stakeholders, and iii.) what are the 6G use cases? In this work, we present the perspective of these stakeholders, namely the network operators, manufacturers, and verticals, identifying potential 5G shortcomings and the remaining 6G solution space. We will highlight the Metaverse as the enabler for 6G addressing omnipresent daily challenges and the upcoming energy problem.

8 September 2023 in IEEE Access
Verified
Journal Article
Open access
MHMarco Hoffmann
Marco Hoffmann
GKGerald Kunzmann
Gerald Kunzmann
TDTorsten Dudda
Torsten Dudda
RIRalf Irmer
Ralf Irmer
AJAdmela Jukan
Admela Jukan
AVAndra M. Voicu
Andra M. Voicu
The 6th generation of wireless mobile networks is emerging as a paradigm shifting successor to unifying the experience across the physical, digital, and human worlds, pushing boundaries on performance in capacity, throughput, latency, scalability, flexibility, and reliability, while prominently addressing new major factors, including sustainability, security and privacy, as well as digital inclusion. Many research institutions and initiatives worldwide have started investigations to make 6G a reality by approximately 2030. In Germany, federal funding from the German Ministry of Education and Research (BMBF) supports a large-scale 6G initiative, with its lighthouse project, called 6G-ANNA. The core aim of this project is to develop the key aspects of a holistic, sustainable, secure, and resilient 6G system design that will simplify and improve the interaction between humans, digital assets, and the physical environment. This paper shares the vision of the project’s main technical working areas and advances, spanning topics from radio access, integration of multiple networks, as well as automation and simplification in networking to new applications and testbed scenarios, including real-time digital twins and extended reality. The industrial impact and relevance of standardization makes 6G-ANNA uniquely positioned to lead and realize the vision of next-generation wireless mobile network technologies, systems, and applications.

17 August 2021 in IEEE Access
Verified
Journal Article
Open access
TDTung V. Doan
Tung V. Doan
GNGiang Truong Nguyen
Giang Truong Nguyen
Martin ReissleinMartin Reisslein
Martin Reisslein
Frank Prof. FitzekFrank Prof. Fitzek
Frank Prof. Fitzek
Mobile Edge Computing (MEC) brings the benefits of cloud computing, such as computation, networking, and storage resources, close to end users, thus reducing end-to-end latency and enabling various novel use cases, such as vehicle platooning, autonomous driving, and the tactile internet. However, frequent user mobility makes it challenging for the MEC to guarantee the close proximity to the users. To tackle this challenge, the underlying network has to be capable of seamlessly migrating applications between multiple MEC sites. This application migration requires the quick and flexible migration of the application states without service interruption, while minimizing the state transfer cost. In this article, we first study the state transfer optimization problem in the MEC. To solve this problem, we propose a metaheuristic algorithm based on Tabu search. We then propose Flexible and Low-Latency State Transfer in Mobile Edge Computing (FAST), the first programmable state forwarding framework. FAST flexibly and directly forwards states between source instance and destination instance based on Software-Defined Networking (SDN). Both simulation results and practical testbed results demonstrate the favorable performance of the proposed Tabu search algorithm and the FAST framework compared to the state-of-the-art schemes.

24 August 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
TDTung V. Doan
Tung V. Doan
GNGiang Truong Nguyen
Giang Truong Nguyen
Martin ReissleinMartin Reisslein
Martin Reisslein
Frank Prof. FitzekFrank Prof. Fitzek
Frank Prof. Fitzek
Existing Network Function Virtualization (NFV) service placements that reuse existing network functions either reuse an entire Service Function Chain (SFC) or only individual network functions while ignoring the chain configuration cost for configuring the SFC traffic steering and ignoring the reliability of the network functions. Also, the Mobile Edge Cloud (MEC) frameworks that are required to implement an NFV service placement should ideally seamlessly cooperate with the various existing NFV Management and Orchestration (MANO) frameworks. However, the existing MEC frameworks lack multi-MANO support. We formulate the novel Subchain-Aware NFV service Placement (SAP) optimization model that accounts for the configuration cost for stitching together reused network functions to an SFC and strives to reuse existing subchains of consecutive network functions (with already deployed SFC traffic steering), while accounting for the recovery cost of network functions with limited reliability. We develop Tabu-SAP, a Tabu search approach to solve the SAP optimization problem. Furthermore, we introduce the novel Automated Provisioning framework for MEC (APMEC) with open-source OpenStack implementation to enable the deployment of Tabu-SAP in real networks; APMEC supports multiple MANOs through a loose coupling MANO-MEC design. Our Tabu-SAP evaluations indicate an around eightfold increase of the number of supported SFCs compared to the state-of-the-art reuse of individual network functions, while substantially reducing the total cost, which includes the chain configuration cost. Also, for long SFCs of seven or more network functions, the Tabu-SAP total cost is less than 10% higher than the optimal solution (which requires over ten times longer execution time).

22 April 2020 in IEEE Access
Verified
Journal Article
Open access
VNVu Nguyen
Vu Nguyen
ETElif Tasdemir
Elif Tasdemir
GNGiang Truong Nguyen
Giang Truong Nguyen
DLDaniel E. Lucani
Daniel E. Lucani
Frank Prof. FitzekFrank Prof. Fitzek
Frank Prof. Fitzek
Martin ReissleinMartin Reisslein
Martin Reisslein
Fulcrum coding combines a high-field outer Random Linear Network Coding (RLNC) that generates outer coding expansion packets with a small-field inner RLNC that combines the source packets and the outer coding expansion packets. This two-layer Fulcrum coding allows flexible decoding in receivers with heterogeneous computational capabilities. However, Fulcrum coding has so far only been studied for conventional dense RLNC, which randomly selects all coding coefficients, and only for a statically fixed number of outer expansion packets. However, the probability that the coding coefficient row of a newly received packet is linearly independent of prior received coding coefficient rows (a prerequisite for successful decoding) is highly dynamic. We propose to exploit the dynamics of this probability to reduce the computational complexity of Fulcrum coding. In particular, we vary the density of non-zero coding coefficients, i.e., equivalently, the sparsity of coding coefficients, and the number of outer expansion packets to keep the complexity low while maintaining a reasonably high decoding probability. We introduce the general principles of dynamic sparsity and expansion packets (DSEP) for Fulcrum coding as well as two specific example DSEP policies. Our evaluations indicate that DSEP Fulcrum can increase the encoding throughput tenfold and increase the decoding throughput 1.4 to 4.3 fold while achieving decoding probabilities that are typically only 1–3% lower than the conventional Fulcrum decoding probabilities. We also find that DSEP achieves somewhat higher encoding and decoding throughputs than the CodornicesRq (Release 2.1) implementation of RaptorQ block coding for small blocks (generations) of source packets, while RaptorQ is substantially faster for large generation sizes. Furthermore, we develop and evaluate an elementary DSEP recoding mechanism that achieves a recoding throughput more than double the decoding throughput.