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

Youshi Wang

dblp:164/4602 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-6520-0220ORCID · corroborated

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

Computer networks · 5 · 1 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 networks
1 paper
Routing and switching · 44% Internet of things and sensor networks · 44% Internet architecture and protocols · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing
distributed routing
0.212016
HDEER: A Distributed Routing Scheme for Energy-Efficient Networking · IEEE J. Sel. Areas Commun. 2016
Internet of things and sensor networks › energy efficiency
energy-efficient routing
0.212016
HDEER: A Distributed Routing Scheme for Energy-Efficient Networking · IEEE J. Sel. Areas Commun. 2016
Energy-efficient computing › power management
energy-efficient networking
0.212016
HDEER: A Distributed Routing Scheme for Energy-Efficient Networking · IEEE J. Sel. Areas Commun. 2016
Energy-efficient computing › power management
speed scaling
0.212016
HDEER: A Distributed Routing Scheme for Energy-Efficient Networking · IEEE J. Sel. Areas Commun. 2016

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

loop-free routing · 0.5distributed multipath finding · 0.5
YearPublicationVenuePosition
2020 An Energy Saving-Oriented Incentive Mechanism in Colocation Data Centers
abstract
The size and amount of colocation data centers (colocations, for short) have been growing rapidly with the increasing popularity of cloud services, which ultimately causes a heavy burden on the power grid and the environment. However, even a colocation owner wishes to reduce its energy consumption, it may not be able to apply some effective energy saving techniques directly to the servers, since the servers belong to and are operated by its tenants. To solve the "uncoordinated relationship" issue between owners and tenants and achieve the energy reduction with a limited cost budget, an energy saving-oriented incentive mechanism, ESCo is proposed in this paper. Different from existing mechanisms that emphasize on minimizing the cost for the owners, our mechanism emphasizes on the maximization of the amount of energy saved by the tenants given a limited budget that the owner wants to pay for the energy saving. An algorithm is developed to realize a stable assignment in the mechanism. Trace-driven simulations based on real-world data are performed to verify the effectiveness of ESCo. The results show that ESCo can achieve 14.47% more energy saving than existing colocation incentive mechanisms.
Ce Chi, Kaixuan Ji, Avinab Marahatta, Fa Zhang 0001, Youshi Wang, Zhiyong Liu 0002
ICCCN5
2020 An Incentive Mechanism for Improving Energy Efficiency of Colocation Data Centers Based on Power Prediction
abstract
Colocation data centers (colocations, for short) are developing rapidly in recent years, resulting in a heavy burden on the power grid and the environment. Due to the special management mode of colocations, even the colocation operators wish to reduce their power demand, they have no authority to control the servers because the servers belong to and are operated by the tenants themselves. To solve the "uncoordinated relationship" issue between operators and tenants, a truthful and feasible incentive mechanism MesPP is proposed in this paper. Different from existing works, MesPP aims at maximizing the energy reduction of colocations with a limited cost budget and can be applied even there is no demand response (DR) program. Meanwhile, power prediction is integrated into MesPP to further improve the energy efficiency of colocations and fairness of the mechanism. To solve the optimization problem, we develop a (1−ε)-approximation algorithm. Simulations are performed and show that MesPP can achieve 12.23% more energy saving compared with existing incentive mechanisms.
Ce Chi, Kaixuan Ji, Avinab Marahatta, Fa Zhang 0001, Youshi Wang, Zhiyong Liu 0002
ISCC5
2019 Energy-Aware Fault-Tolerant Dynamic Task Scheduling Scheme for Virtualized Cloud Data Centers
Avinab Marahatta, Youshi Wang, Fa Zhang 0001, Arun Kumar Sangaiah, Sumarga Kumar Sah Tyagi, Zhiyong Liu 0002
Mob. Networks Appl.2
2017 Real-time Task Scheduling for joint energy efficiency optimization in data centers
abstract
The high energy consumption has become one bottleneck in the development of the data centers (DCs), where the main energy consumers are the cooling system and the servers. Therefore, the joint optimization for the energy efficiency of the cooling system and the servers is a crucial problem, while most of previous works on energy saving only studies one of these two components in an isolated manner. In this paper, we propose a real-time strategy, rTCS (real-time Task Classification and Scheduling strategy), to jointly optimize the energy efficiency of these two components in the scenario where the tasks arrive dynamically. Strategy rTCS first labels the tasks to classify them according to their run time and end time with a time complexity of O(1) and a bounded space complexity. Then, rTCS schedules the tasks in real time based on their labels and the energy consumption model of the DC. Simulation results show that rTCS can effectively improve the energy efficiency of DCs.
Youshi Wang, Fa Zhang 0001, Rui Wang 0028, Yangguang Shi, Zhiyong Liu 0002
ISCC1
2016 HDEER: A Distributed Routing Scheme for Energy-Efficient Networking
abstract
The proliferation of new online Internet services has substantially increased the energy consumption in wired networks, which has become a critical issue for Internet service providers. In this paper, we target the network-wide energy-saving problem by leveraging speed scaling as the energy-saving strategy. We propose a distributed routing scheme-HDEER-to improve network energy efficiency in a distributed manner without significantly compromising traffic delay. HDEER is a two-stage routing scheme where a simple distributed multipath finding algorithm is firstly performed to guarantee loop-free routing, and then a distributed routing algorithm is executed for energy-efficient routing in each node among the multiple loop-free paths. We conduct extensive experiments on the NS3 simulator and simulations with real network topologies in different scales under different traffic scenarios. Experiment results show that HDEER can reduce network energy consumption with a fair tradeoff between network energy consumption and traffic delay.
Biyu Zhou, Fa Zhang 0001, Lin Wang 0015, Chenying Hou, Antonio Fernández 0001, Athanasios V. Vasilakos, Youshi Wang, Jie Wu 0001, Zhiyong Liu 0002
IEEE J. Sel. Areas Commun.7