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.

Yunfei Shang

dblp:79/8398 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
2since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorComputer networks · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 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
3 papers
Datacenter networks · 72% Routing and switching · 28%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Energy-efficient computing · 64% Cloud and datacenter computing · 28% Electronic design automation · 8%

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

TopicWeightPapersLastEvidence papers
Datacenter networks
data center network topology
0.212015
On the Network Power Effectiveness of Data Center Architectures · IEEE Trans. Computers 2015
Energy-efficient computing › energy-efficient communication
power-aware routing
0.212015
On the Network Power Effectiveness of Data Center Architectures · IEEE Trans. Computers 2015
Energy-efficient computing
power management
0.212015
On the Network Power Effectiveness of Data Center Architectures · IEEE Trans. Computers 2015
Routing and switching
energy-aware routing
0.212014
Software defined green data center network with exclusive routing · INFOCOM 2014
Cloud and datacenter computing
datacenter network
0.212014
Software defined green data center network with exclusive routing · INFOCOM 2014
Datacenter networks › data center network topology
fat-tree
0.112015
On the Network Power Effectiveness of Data Center Architectures · IEEE Trans. Computers 2015
Electronic design automation › physical design › routing
multipath routing
0.112014
Software defined green data center network with exclusive routing · INFOCOM 2014

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

simulation · 1.0measurement · 0.4exclusive routing · 0.4testbed experiments · 0.2
YearPublicationVenuePosition
2022 TOF Estimation of Single Antenna for Commercial Wi-Fi
abstract
With the explosive growth of mobile devices, the need for precise positioning in indoor environments is becoming more prominent. Yet these state-of-the-art solutions require either multiple devices or multiple antennas that not available on all devices. The positioning of devices with simpler structures should be investigated. In this paper, we propose a method to treat channel state information (CSI) data as a random process, construct an autocorrelation matrix and apply the MUSIC algorithm to achieve the purpose of single antenna estimation of time of flight (TOF). We study the distribution of symbol time offset (STO) errors by means of statistical tests and provide a theoretical basis for real experiments. Finally, we use Intel5300 commercial wireless network card to conduct experiments in typical indoor environments of NLOS and LOS, and the median errors of 3.3m and 1.2m are achieved respectively.
Yunfei Shang, Jianhong Dong, Diye Wang, Yubai Li
IPIN1
2022 TSomVar: a tumor-only somatic and germline variant identification method with random forest
abstract
Somatic variants act as critical players during cancer occurrence and development. Thus, an accurate and robust method to identify them is the foundation of cutting-edge cancer genome research. However, due to low accessibility and high individual-/sample-specificity of the somatic variants in tumor samples, the detection is, to date, still crammed with challenges, particularly when lacking paired normal samples as control. To solve this burning issue, we developed a tumor-only somatic and germline variant identification method (TSomVar) using the random forest algorithm established on sample-specific variant datasets derived from genotype imputation, reads-mapping level annotation and functional annotation. We trained TSomVar by using genomic variant datasets of three major cancer types: colorectal cancer, hepatocellular carcinoma and skin cutaneous melanoma. Compared with existing tumor-only somatic variant identification tools, TSomVar shows excellent performances in somatic variant detection with higher accuracy and better capability of recalling for test datasets from colorectal cancer and skin cutaneous melanoma. In addition, TSomVar is equipped with the competence of accurately identifying germline variants in tumor samples. Taken together, TSomVar will undoubtedly facilitate and revolutionize somatic variant explorations in cancer research.
Qi Wang 0072, Yunfei Shang, Congfan Bu, Mingming Lu, Meiye Jiang, Shuhuan Yu, Jingyao Zeng, Zaichao Zhang, Zhenglin Du, Jing-Fa Xiao
Briefings Bioinform.3
2015 EXR: Greening Data Center Network with Software Defined Exclusive Routing
abstract
The explosive expansion of data center sizes aggravates the power consumption and carbon footprint, which has restricted the sustainable growth of cloud services and seriously troubled data center operators. In recent years, plenty of advanced data center network architectures have been proposed. They usually employ richly-connected topologies and multi-path routing to provide high network capacity. Unfortunately, they also undergo inefficient network energy usage during the traffic valley time. To address the problem, many energy-aware flow scheduling algorithms are proposed recently, primarily considering how to aggregate traffic by flexibly choosing the routing paths, with flows fairly sharing the link bandwidths. In this paper, we leverage software defined network (SDN) technique and explore a new solution to energy-aware flow scheduling, i.e., scheduling flows in the time dimension and using exclusive routing (EXR) for each flow, i.e., a flow always exclusively utilizes the links of its routing path. The key insight is that exclusive occupation of link resources usually results in higher link utilization in high-radix data center networks, since each flow does not need to compete for the link bandwidths with others. When scheduling the flows, EXR leaves flexibility to operators to define the priorities of flows, e.g., based on flow size, flow deadline, etc. Extensive simulations and testbed experiments both show that EXR can effectively save network energy compared with the regular fair-sharing routing (FSR), and significantly reduce the average flow completion time if assigning higher scheduling priorities to smaller flows.
Yunfei Shang, Wu He, Congjie Chen
IEEE Trans. Computers2
2015 On the Network Power Effectiveness of Data Center Architectures
abstract
Cloud computing not only requires high-capacity data center networks to accelerate bandwidth-hungry computations, but also causes considerable power expenses to cloud providers. In recent years many advanced data center network architectures have been proposed to increase the network throughput, such as Fat-Tree [1] and BCube [2], but little attention has been paid to the power efficiency of these network architectures. This paper makes the first comprehensive comparison study for typical data center networks with regard to their Network Power Effectiveness(NPE), which indicates the end-to-end bps per watt in data transmission and reflects the tradeoff between power consumption and network throughput. We take switches, server NICs and server CPU cores into account when evaluating the network power consumption. We measure NPE under both regular routing and power-aware routing, and investigate the impacts of topology size, traffic load, throughput threshold in power-aware routing, network power parameter as well as traffic pattern. The results show that in most cases Flattened Butterfly possesses the highest NPE among the architectures under study, and server-centric architectures usually have higher NPEs than Fat-Tree and VL2 architectures. In addition, the sleep-on-idle technique and power-aware routing can significantly improve the NPEs for all the data center architectures, especially when the traffic load is low. We believe that the results are useful for cloud providers, when they design/upgrade data center networks or employ network power management.
Yunfei Shang, Dan Li 0001, Jing Zhu 0007, Mingwei Xu 0001
IEEE Trans. Computers1
2014 Software defined green data center network with exclusive routing
abstract
The explosive expansion of data center sizes aggravates the power consumption and carbon footprint, which has restricted the sustainable growth of cloud services and seriously troubled data center operators. In recent years, plenty of advanced data center network architectures have been proposed. They usually employ richly-connected topologies and multi-path routing to provide high network capacity. Unfortunately, they also undergo inefficient network energy usage during the traffic valley time. To address the problem, many energy-aware flow scheduling algorithms are proposed recently, primarily considering how to aggregate traffic by flexibly choosing the routing paths, with flows fairly sharing the link bandwidths. In this paper, we leverage software defined network (SDN) technique and explore a new solution to energy-aware flow scheduling, i.e., scheduling flows in the time dimension and using exclusive routing (EXR) for each flow, i.e., a flow always exclusively utilizes the links of its routing path. The key insight is that exclusive occupation of link resources usually results in higher link utilization in high-radix data center networks, since each flow does not need to compete for the link bandwidths with others. When scheduling the flows, EXR leaves flexibility to operators to define the priorities of flows, e.g., based on flow size, flow deadline, etc. Extensive simulations and testbed experiments both show that EXR can effectively save network energy compared with the regular fair-sharing routing (FSR), and significantly reduce the average flow completion time if assigning higher scheduling priorities to smaller flows.
Yunfei Shang, Congjie Chen
INFOCOM2
2013 Greening data center networks with flow preemption and energy-aware routing
abstract
Data centers are becoming a big consumer of the world's electricity because of the explosive growth of their scale, which has become a serious concern. In recent years, many advanced data center network architectures have been proposed, which employ richly-connected topologies and multi-path routing to achieve high bisection bandwidth. Unfortunately, they undergo inefficient network energy usage. To address this issue, many network-wide energy conservation techniques have been proposed in the community. In the paper, we explore a new dimension in saving data center network energy, i.e., letting flows exclusively occupy link resources when transmission and using a flow preemption algorithm to schedule them. The key insight behind this design choice is that exclusively occupying link resources usually results in higher link utilization because there is no collision among the traffic flows. By combining both flow preemption and energy-aware routing, we can save much more network power than with traditional ways.
Yunfei Shang
LANMAN1
2013 Greening data center networks with throughput-guaranteed power-aware routing
Yunfei Shang, Xin Wang 0001
Comput. Networks2