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

Yujie Liu 0010

dblp:60/7006-10 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0002-2372-8737ORCID · corroborated

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

Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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 · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
network function virtualization
0.412020
Consistent State Updates for Virtualized Network Function Migration · IEEE Trans. Serv. Comput. 2020
Software-defined and programmable networks › network function virtualization
virtual network function migration
0.412020
Consistent State Updates for Virtualized Network Function Migration · IEEE Trans. Serv. Comput. 2020

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

tagging-based scheme · 0.4controller-forwarding scheme · 0.4
YearPublicationVenuePosition
2020 Consistent State Updates for Virtualized Network Function Migration
abstract
Combining Network Functions Virtualization (NFV) with Software-Defined Networking (SDN) is an emerging and promising solution to provide scalable and elastic network control and service. In such a system, virtualized Network Functions (NFs) need to be consistently migrated from one instance to another for various purposes, such as resource optimization, fault tolerance, load balancing, etc. These migrations involve simultaneously coordinating updates to the NF state and SDN forwarding state. To solve this problem, we design two consistent NF state update schemes: a controller-forwarding based scheme and a tagging-based scheme. Through analysis of the update process, we demonstrate that they both guarantee loss-free and order-preserving migrations. We further implement a prototype and carry out experiments with diverse traffic settings. Results demonstrate that the controller-forwarding based solution achieves 77 percent migration time compared with the state-of-the-art solution OpenNF, while correcting an error of it. Moreover, the tagging-based solution not only achieves 4.4 percent migration time, but also reduces up to 75 percent controller overhead compared with OpenNF at the cost of adding a tag in the unused fields of packet header.
Yujie Liu 0010, Jiaqiang Liu, Yong Li 0008, Haoyu Song 0001, Yue Wang 0007
IEEE Trans. Serv. Comput.2
2015 Optimal scheduling for multi-flow update in Software-Defined Networks
Yujie Liu 0010, Yong Li 0008, Yue Wang 0007
J. Netw. Comput. Appl.1