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

Yu Wu 0003

dblp:22/0-3 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-8977-3912ORCID · verified

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

Computer networks · 3 · 2 first-author

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 architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › virtualization › network virtualization › network function virtualization
virtual network function placement
0.412020
Cost-Efficient VNF Placement and Scheduling in Public Cloud Networks · IEEE Trans. Commun. 2020
Cloud and datacenter computing › cloud deployment model
public cloud
0.112020
Cost-Efficient VNF Placement and Scheduling in Public Cloud Networks · IEEE Trans. Commun. 2020

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

mixed integer linear programming · 0.4heuristic algorithm · 0.4
YearPublicationVenuePosition
2020 Cost-Efficient VNF Placement and Scheduling in Public Cloud Networks
abstract
Following successful adoption of cloud computing, many service providers (SPs) are now using high-performance Virtual Machines (VMs) located in large datacenters owned by public cloud infrastructure providers to deploy their virtual network functions (VNFs). Since using these VMs has a cost depending on utilization time, a complex problem of VNF placement and scheduling (VPS) must be addressed to achieve satisfactory network performance (e.g., latency) while minimizing the cost paid to lease VMs. In this study, a cost-efficient VPS scheme (CE-VPS) is proposed to address the VPS problem in public cloud networks considering dynamic requests of ordered sequences of VNFs. Our CE-VPS scheme goes beyond existing solutions as it models some important practical aspects such as an additional latency incurred by booting a VM and installing a VNF instance. Also, CE-VPS considers that VNFs can be multi-threaded or single-threaded, and that their throughput as a function of allocated computing resources must be modeled differently. CE-VPS is formulated as a mixed inter linear program (MILP) and also as an efficient heuristic algorithm. CE-VPS achieves lower cost and latency than conventional Best-Availability and Cost-Efficient Proactive VNF Placement schemes, and a better trade-off between resource consumption and latency performance than a conventional Low-Latency scheme.
Xin Li 0041, Yu Wu 0003, Weixia Zou, Shanguo Huang, Massimo Tornatore, Biswanath Mukherjee
IEEE Trans. Commun.3
2017 TDM EPON Fronthaul Upstream Capacity Improvement via Traffic Classification and Sifting
abstract
Mobile Fronthaul (MF) is defined as the connection between Remote Radio Head (RRH) and Baseband Processing Unit (BBU) in a Cloud Radio Access Network (C-RAN). Dedicated MF connections between RRH and BBU would be very costly. Thus, Time Division Multiplexing Ethernet Passive Optical Network (TDM EPON) is a promising solution to reduce cost as it can enable multiplexing gain. Note that, even though mobile users transmit intermittently, in the upstream channel RRH is sampling radio signal all the time, limiting the achievable multiplexing gain. Our study enhances the conventional TDM EPON architecture by introducing traffic classification, sifting of useless data to avoid the transmission of unnecessary EPON frames, and hence increasing the multiplexing gain in the upstream channel. We also propose a Hybrid Bandwidth Allocation (HBA) scheme to exploit the traffic usefulness classification information. Simulation results show significant improvements in terms of load and number of connected RRHs that can be supported by same EPON, while keeping the end-to-end delay under 100 μs.
Yu Wu 0003, Massimo Tornatore, Yongli Zhao 0001, Biswanath Mukherjee
GLOBECOM1
2016 Green and Low-Risk Content Placement in optical content delivery networks
abstract
With the rapid growth of content-based network services, there is increasing interest in reducing the emissions associated with brown-energy consumption in Content Delivery Networks (CDNs). At the same time, content needs to be placed in safe Data Center (DC) locations, which are unlikely to be hit by disasters. Further risk reduction is achieved using content replication which provides inter-DC content redundancy. Unfortunately, there is contention between the objectives of brown-energy minimization and risk reduction since replicating content increases brown-energy consumption. To address these contradictory issues, we leverage the concept of content fragmentation used inside DCs and propose an inter-DC Content Fragmentation (CF) scheme which aims to achieve brown-energy saving by reducing storage overhead while maintaining low risk compared to basic replication schemes. We also propose a Green and Low-Risk Content Placement approach (GR-CP) to address the tradeoff between brown-energy consumption and disaster risk. Both CF and replication schemes are implemented in GR-CP and evaluated over a range of content popularity and redundancy levels. Our results show that CF outperforms replication scheme except when content popularity is high and the risk constraint is stringent. When popularity and risk are both low, CF can save more brown energy by using low-redundancy fragmentation techniques.
Yu Wu 0003, Massimo Tornatore, Chip Martel, Biswanath Mukherjee
ICC1