Ye Yu

Ye Yu

Auto-generated profile, based on publicly available information

Ye Yu

University of Kentucky

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 August 2014
Verified
Conference Paper
Open access
PDF file
YYYe Yu
Ye Yu
CQChen Qian
Chen Qian
XLXin Li
Xin Li
We propose a Distributed and Collaborative Monitoring system, DCM, with the following properties. First, DCM allow switches to collaboratively achieve flow monitoring tasks and balance measurement load. Second, DCM is able to perform per-flow monitoring, by which different groups of flows are monitored using different actions. Third, DCM is a memory-efficient solution for switch data plane and guarantees system scalability. DCM uses a novel two-stage Bloom filters to represent monitoring rules using small memory space. It utilizes the centralized SDN control to install, update, and reconstruct the two-stage Bloom filters in the switch data plane. We study how DCM performs two representative monitoring tasks, namely flow size counting and packet sampling, and evaluate its performance. Experiments using real data center and ISP traffic data on real network topologies show that DCM achieves highest measurement accuracy among existing solutions given the same memory budget of switches

19 October 2018 in Genome Biology
Verified
Journal Article
Open access
PDF file
YYYe Yu
Ye Yu
JLJinpeng Liu
Jinpeng Liu
XLXinan Liu
Xinan Liu
YZYi Zhang
Yi Zhang
EMEamonn Magner
Eamonn Magner
JLJinze Liu
Jinze Liu
We present SeqOthello, an ultra-fast and memory-efficient indexing structure to support arbitrary sequence query against large collections of RNA-seq experiments. It takes SeqOthello only 5 min and 19.1 GB memory to conduct a global survey of 11,658 fusion events against 10,113 TCGA Pan-Cancer RNA-seq datasets. The query recovers 92.7% of tier-1 fusions curated by TCGA Fusion Gene Database and reveals 270 novel occurrences, all of which are present as tumor-specific. By providing a reference-free, alignment-free, and parameter-free sequence search system, SeqOthello will enable large-scale integrative studies using sequence-level data, an undertaking not previously practicable for many individual labs.

11 April 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YYYe Yu
Ye Yu
DBDjamal Belazzougui
Djamal Belazzougui
CQChen Qian
Chen Qian
QZQin Zhang
Qin Zhang
Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm to support fast lookups. In this paper, we present a new network algorithm, Othello hashing, and its application of a FIB design called concise, which uses very little memory to support ultra-fast lookups of network names. Othello hashing and concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented concise on three platforms. Experimental results show that concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.

7 July 2017 in Bioinformatics
Verified
Journal Article
Open access
PDF file
XLXinan Liu
Xinan Liu
YYYe Yu
Ye Yu
JLJinpeng Liu
Jinpeng Liu
CECorrine F Elliott
Corrine F Elliott
CQChen Qian
Chen Qian
JLJinze Liu
Jinze Liu
Metagenomic read classification is a critical step in the identification and quantification of microbial species sampled by high-throughput sequencing. Although many algorithms have been developed to date, they suffer significant memory and/or computational costs. Due to the growing popularity of metagenomic data in both basic science and clinical applications, as well as the increasing volume of data being generated, efficient and accurate algorithms are in high demand. We introduce MetaOthello, a probabilistic hashing classifier for metagenomic sequencing reads. The algorithm employs a novel data structure, called l-Othello, to support efficient querying of a taxon using its k-mer signatures. MetaOthello is an order-of-magnitude faster than the current state-of-the-art algorithms Kraken and Clark, and requires only one-third of the RAM. In comparison to Kaiju, a metagenomic classification tool using protein sequences instead of genomic sequences, MetaOthello is three times faster and exhibits 20–30% higher classification sensitivity. We report comparative analyses of both scalability and accuracy using a number of simulated and empirical datasets. MetaOthello is a stand-alone program implemented in C ++. The current version (1.0) is accessible via https://doi.org/10.5281/zenodo.808941. Supplementary data are available at Bioinformatics online.

9 August 2017
Verified
Conference Paper
Open access
YYYe Yu
Ye Yu
XLXin Li
Xin Li
CQChen Qian
Chen Qian
Mobile Edge Computing (MEC) provides computing/storage offloading and resource virtualization to mobile devices at the network edge. A load balancer is a necessary network function to determine the destination MEC host of each packet from a mobile device, for such virtualization. Due to the new characteristics of MEC, such as resource limitation and high dynamics, existing solutions of cloud load balancer cannot be directly applied to MEC. This paper presents a new design of a Scalable and Dynamic Load Balancer, called SDLB, that satisfies the requirements of MEC. The core algorithm of SDLB is minimal perfect hashing, which provides two perfect features as a load balancer. Evaluation results show that SDLB is faster by 4x to 10x and uses much less (< 50%) memory, than a widely-used load balancer design for cloud.

1 October 2014
Verified
Conference Paper
Closed access
YYYe Yu
Ye Yu
CQChen Qian
Chen Qian
Data center applications require the network to be scalable and bandwidth-rich. Current data center network architectures often use rigid topologies to increase network bandwidth. A major limitation is that they can hardly support incremental network growth. Recent studies propose to use random interconnects to provide growth flexibility. However, routing on a random topology suffers from control and data plane scalability problems, because routing decisions require global information and forwarding state cannot be aggregated. In this paper, we design a novel flexible data center network architecture, Space Shuffle (S2), which applies greedy routing on multiple ring spaces to achieve high-throughput, scalability, and flexibility. The proposed greedy routing protocol of S2 effectively exploits the path diversity of densely connected topologies and enables key-based routing. Extensive experimental studies show that S2 provides high bisectional bandwidth and throughput, near-optimal routing path lengths, extremely small forwarding state, fairness among concurrent data flows, and resiliency to network failures.