EDBT 2026 Demo / reviewers in the wild / expert
Dehui Ou
dblp:427/1972
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 |
Software-defined and programmable networks · 70% Edge and fog computing · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Edge and fog computing
mobile edge computing |
1.0 | 1 | 2026 | PAAP: A Graph-Based VNF Deployment Framework for Embedding Bidirectional SFC in Mobile Edge Networks · IEEE Trans. Mob. Comput. 2026 |
Software-defined and programmable networks › network function virtualization
service function chain deployment |
1.0 | 1 | 2026 | PAAP: A Graph-Based VNF Deployment Framework for Embedding Bidirectional SFC in Mobile Edge Networks · IEEE Trans. Mob. Comput. 2026 |
Software-defined and programmable networks › network function virtualization
virtual network function placement |
1.0 | 1 | 2026 | PAAP: A Graph-Based VNF Deployment Framework for Embedding Bidirectional SFC in Mobile Edge Networks · IEEE Trans. Mob. Comput. 2026 |
Software-defined and programmable networks
network function virtualization |
0.3 | 1 | 2026 | PAAP: A Graph-Based VNF Deployment Framework for Embedding Bidirectional SFC in Mobile Edge Networks · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
three-phase algorithm · 1.0graph-based framework · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PAAP: A Graph-Based VNF Deployment Framework for Embedding Bidirectional SFC in Mobile Edge NetworksabstractIn the realm of Mobile Edge Computing (MEC) networks, mobile interactive applications, such as multiplayer online games, federated learning, and interactive multi-view video, are becoming increasingly popular. The embedding of Bidirectional Service Function Chains (BSFCs) for these applications has been studied. However, existing BSFC embedding research only considers static users, and the prevailing Virtual Network Functions (VNFs) placement methods do not account for the impact of individual node resources on the path, thus failing to maximize node resource utilization at the network level. Considering the aforementioned issues, we introduce a framework for BSFC embedding tailored for mobile users, named Path as a Point (PAAP). This framework integrates the resources of the paths and then globally considers the impact of the computing resources of edge nodes on the paths connecting them, maximizing edge node resource utilization across the entire network. We propose a three-phase algorithm within the PAAP framework. In the first phase, we introduce a singleuser algorithm for VNFs deployment during BSFC embedding. In the second phase, this optimization is extended to multiple users by establishing inter-user association rules. In the third phase, candidate application placement positions are evaluated across the entire network, culminating in the determination of optimal placement strategies. Empirical evaluations confirm the effectiveness of the proposed algorithm, demonstrating significant performance improvements over baseline methods. Dehui Ou, Zhen Zhang 0017, Yuhui Deng 0001, Geyong Min, Lin Cui 0001 |
IEEE Trans. Mob. Comput. | 2 |