Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhan-Lun Chang

dblp:259/3676 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-1226-966XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 62% Edge and fog computing · 38%
Network and information security
1 paper
Network security · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing
mobile edge computing
0.812024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024
Network optimization and economics
resource allocation
0.812024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024
Network security › attack resilience › attack mitigation › denial-of-service defense
DDoS defense
0.812024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024
Network security › intrusion detection and prevention › intrusion detection
intrusion prevention system
0.812024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024
Network optimization and economics › resource allocation
game-theoretic resource allocation
0.212024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024
Network optimization and economics › game theory › dynamic game
stackelberg equilibrium
0.212024
Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing · IEEE Trans. Serv. Comput. 2024

Methods — techniques the papers use, named apart from their topics

stackelberg equilibrium · 1.5game theory · 1.5
YearPublicationVenuePosition
2024 Joint Resource Allocation and Intrusion Prevention System Deployment for Edge Computing
abstract
Distributed Denial-of-Service (DDoS) attack is critical to latency-critical systems such as Multi-Access Edge Computing (MEC) as it significantly increases the response delay of the victim service. An intrusion prevention system (IPS) is a promising solution to defend against such attacks. Still, there will be a trade-off between IPS deployment and application resource reservation as IPS deployment will reduce the computational resources for MEC applications. In this work, we propose a game-theoretic framework to study the joint computational resource allocation and IPS deployment in the MEC architecture. Given the expected attack strength and end-user demands, we study the pricing strategy of the MEC platform operator (MPO) and purchase strategy of the application service providers (ASPs). The best responses of both MPO and ASPs are derived theoretically. Based on the best responses, we propose an efficient algorithm to derive the Stackelberg equilibrium. The properties and optimality in the efficiency of the equilibrium are analyzed through simulations. The results confirm that the proposed solutions significantly increase the social welfare of the system.
Chun-Yen Lee, Zhan-Lun Chang, Chih-Yu Wang 0001, Hung-Yu Wei 0001
IEEE Trans. Serv. Comput.3
2021 Game-Theoretic Intrusion Prevention System Deployment for Mobile Edge Computing
abstract
The network attack such as Distributed Denial-of-Service (DDoS) attack could be critical to latency-critical systems such as Mobile Edge Computing (MEC) as such attacks significantly increase the response delay of the victim service. Intrusion prevention system (IPS) is a promising solution to defend against such attacks, but there will be a trade-off between IPS deployment and application resource reservation as the deployment of IPS will reduce the number of computation resources for MEC applications. In this paper, we proposed a game-theoretic framework to study the joint computation resource allocation and IPS deployment in the MEC architecture. We study the pricing strategy of the MEC platform operator and purchase strategy of the application service provider, given the expected attack strength and end user demands. The best responses of both MPO and ASPs are derived theoretically to identify the Stackelberg equilibrium. The simulation results confirm that the proposed solutions significantly increase the social welfare of the system.
Zhan-Lun Chang, Chun-Yen Lee, Chih-Yu Wang 0001, Hung-Yu Wei 0001
GLOBECOM1
2021 Flat-Rate Pricing and Truthful Offloading Mechanism in Multi-Layer Edge Computing
abstract
Mobile Edge Computing (MEC) is a promising paradigm to ease the computation burden of Internet-of-Things (IoT) devices by leveraging computing capabilities at the network edge. With the yearning needs for resource provision from IoT devices, the queueing delay at the edge nodes not only poses a colossal impediment to achieving satisfactory quality of experience (QoE) for the IoT devices but also to the benefits of the edge nodes owing to escalating energy expenditure. Moreover, since the service providers may differ, computationally competent entities' computing services should entail economic compensation for the incurred energy expenditure and the capital investment. Therefore, the workload allocation mechanism, where we consider flat-rate and dynamic pricing schemes in the multi-layer edge computing structure, is much-needed. We use Stackelberg game to capture the inherent hierarchy and interdependence between the second-layer edge node (SLEN) and first-layer edge nodes (FLENs). A truthful admission control mechanism grounded on the optimal workload allocation is designed for FLENs without violating end-to-end (E2E) latency requirements. We prove that a Stackelberg equilibrium with the E2E latency guarantee and truthfulness exists and can be reached through proposed algorithm. Simulation results confirm the effectiveness of our scheme and illustrate several insights.
Zhan-Lun Chang, Chih-Yu Wang 0001, Hung-Yu Wei 0001
IEEE Trans. Wirel. Commun.1
2019 Flat-Rate Pricing for Green Edge Computing with Latency Guarantee: A Stackelberg Game Approach
abstract
Mobile Edge Computing (MEC) is a promising paradigm to ease the computation burden of mobile devices by leveraging computing capabilities at the network edge. With the yearning needs for resource provision from the comparatively limited edge servers, an admission control charging a flat-rate price and resistant from self-interested manipulations is proposed to both utilize the scarce resources to the fullest and guarantee end- to-end latency for served mobile devices. Besides, to achieve energy sustainability and maximize profit, edge servers can lessen the energy consumption, and thus the energy expenditure by offloading certain requests to the cloud with a payment. Nonetheless, the cloud can reduce its energy consumption and enlarge the revenue through raising the service price to maximize its profit as well. The inherent hierarchy and interdependence between edge servers and the cloud are captured by Stackelberg game where the unique Stackelberg equilibrium is reached. The utility maximization problems for determining the optimal offloading ratio of edge servers and setting the optimal pricing of the cloud are investigated by exploiting the strict convexity and KKT conditions. Simulation results confirm the effectiveness of our scheme and several insights are illustrated.
Zhan-Lun Chang, Hung-Yu Wei 0001
GLOBECOM1