Tuan-Minh Pham

Dr. Tuan-Minh Pham

Phenikaa University
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
25 September 2020 in IEEE Access
Verified
Journal Article
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
TNThi-Thuy-Lien Nguyen
Thi-Thuy-Lien Nguyen
The Internet of Things (IoT) has been envisioned as an enabler of the digital transformation that can enhance different features of people’s daily lives, such as healthcare, home automation, and smart transportation. The vast amount of data generated by a massive number of devices in an IoT system could lead to a severe performance problem. Edge cloud computing and network function virtualization (NFV) technologies are potential approaches to improve the efficiency of resource use and the flexibility of responsive services in an IoT system. In this paper, we consider the joint optimization problem of gateway placement and multihop routing in the IoT layer, the problem of service placement in the edge and cloud layers of an NFV-enabled IoT system in edge cloud computing (NIoT). We propose three optimization models (i.e., GMO, SP1O, SP2O) that allow an IoT service provider to find the optimal deployment of gateways, the optimal resource allocation for service functions, and the optimal routing according to a cost function with a performance constraint in a NIoT system. We then develop three approximation algorithms (i.e., GMA, SP1A, SP2A) for tackling the problems in a large-scale NIoT system. The evaluation results under a set of scenarios with various topologies and parameters show that the approximation algorithms can obtain results close to the optimal solution with a significant reduction in computation time. We also derive new insights into the strategy for an IoT provider to optimize its objectives. Specifically, the results suggest that an IoT provider should select an appropriate service placement strategy with regard to a charging agreement with an NFV infrastructure provider, and only deploy service functions with a strict delay requirement on the edge of networks for optimizing its cost.

1 September 2013
Verified
Conference Paper
Closed access
FKF. Kocak
F. Kocak
GKG. Kesidis
G. Kesidis
TPTuan-Minh Pham
Tuan-Minh Pham
SFS. Fdida
S. Fdida
In this paper, we consider a game between an Internet Service (access) Provider (ISP) and content provider (CP) on a platform of end-user demand. A price-convex demand-response is motivated based on the delay sensitive applications that are expected to be subjected to the assumed usage-priced priority service over best-effort service. Thus, we are considering a two-sided market with multiclass demand wherein one class (that under consideration herein) is delay-sensitive. Both the Internet and proposed Information Centric Network (ICN, encompassing Content Centric Networking (CCN)) scenarios are considered. For our purposes, the ICN case is basically different in the polarity of the side-payment (from ISP to CP in an ICN) and, more importantly here, in that content caching by the ISP is incentivized. A price-convex demand-response model is extended to account for content caching. The corresponding Nash equilibria are derived and studied numerically.

1 July 2019 in IEEE Access
Verified
Journal Article
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
NCNam Hoai Chu
Nam Hoai Chu
Resource orchestration has a major impact on improving the performance of network services and reducing the system cost composed of both capital expenditures and operational expenses in Network Functions Virtualization (NFV). In this paper, we consider the optimal resource orchestration problem in a multi-domain NFV system under the competition among multiple NFV service providers (NSPs). In particular, we analyze a game on a NFV platform where a NSP can reserve different types of resources including the virtual computing, storage and network resources as well as the non-virtualized resources allocated by various NFV domains, for optimizing the utility in an individual manner. We also derive a necessary and sufficient condition for equilibrium under the competition among NSPs. We further investigate the equilibrium in a scenario of cooperation where NSPs build their own NFV infrastructure and join together to create a federation. Our numerical results illustrate the best response in resource reservation of a provider with respect to the strategy of other providers, and the effect of number of domains on the utility obtained by NSPs in the competition. Importantly, we demonstrate that a NSP is able to make a profit when the number of domains in a NFV infrastructure increases until a threshold, beyond which the utility of a NFV provider falls down, which is useful for designing a multi-domain NFV platform, especially in a multi-provider scenario. Another observation is that the best strategy of NSPs in the competition is opposite to that in the scenario of cooperation, which is significant for NSPs in the optimization of their utility.

31 August 2021 in IEEE Access
Verified
Journal Article
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
Network Function Virtualization (NFV) is an approach that provides a network service provider with agility and cost-efficiency in managing 6G network services. Standard traffic engineering rules are known limited in assuring a very stringent delay requirement in NFV when a traffic flow is required to follow a sequence of network functions scattered in data center networks. This paper proposes an innovative model and algorithm of traffic engineering for service function chaining (SFC) to maximize cost-efficiency under a delay-guarantee constraint. We first formulate the problem as a mixed-integer linear programming model for obtaining the optimal solution. We then propose an algorithm based on the reinforcement learning principles for finding an approximation solution in a large-scale problem with the dynamics of service demands. Numerical results under both real-world datasets and synthetic network topologies demonstrate that our proposed model and algorithm allow an NFV service provider (NSP) to place a virtual network function and steer a traffic flow efficiently in terms of energy cost for a delay-guarantee SFC. Importantly, the results provide an insight into the optimal and approximation solutions for an NSP to select a suitable traffic engineering approach with regard to network dynamics.

9 February 2022 in IEEE Access
Verified
Journal Article
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
Network Function Virtualization (NFV) can support customized on- demand network services with flexibility and cost-efficiency. Virtual Network Function (VNF) instances need to be scaled out, scaled in, and reallocated across the NFV infrastructure (NFVI) to avoid a violation of service agreements when the demand traffic changes. However, selecting the new placement of VNFs for migrating a service function chain (SFC) is an issue of efficient NFV control. We propose two novel integer linear programming (ILP) models and two approximation algorithms for SFC placement and migration to maximize the cost-efficiency of an NFV network regarding the changes of service demands and dynamic routing. The ILP models allow us to obtain the optimal solutions of SFC placement and migration with explicit dynamic paths. The approximation migration results provided by our proposed heuristic and reinforcement learning algorithms are close to the optimal solution. Evaluation results carried out with real datasets and synthetic network topologies provide a helpful suggestion of a migration strategy for an NFV service provider to optimize the operating cost of an NFV network in the long term.

1 May 2017
Verified
Conference Paper
Open access
TPTuan-Minh Pham
Tuan-Minh Pham
TNThi-Thuy-Lien Nguyen
Thi-Thuy-Lien Nguyen
SFSerge Fdida
Serge Fdida
HBHuynh Thi Thanh Binh
Huynh Thi Thanh Binh
Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this paper, we propose a solution to address this issue. We analyze and solve the online load balancing problem using multipath routing in NFV to optimize network performance in response to the dynamic changes of user demands. In particular, we first formulate the optimization problem of load balancing as a mixed integer linear program for achieving the optimal solution. We then develop the ORBIT algorithm that solves the online load balancing problem. The performance guarantee of ORBIT is analytically proved in comparison with the optimal offline solution. The experiment results on real-world datasets show that ORBIT performs very well for distributing traffic of each service demand across multipaths without knowledge of future demands, especially under high-load conditions.