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

Linxiao Jin

dblp:148/1965 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 5

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
2 papers
Energy-efficient computing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer networks
2 papers
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › probabilistic data structures
bloom filter
0.312018
Low Computational Cost Bloom Filters · IEEE/ACM Trans. Netw. 2018
Algorithms and data structures
probabilistic data structures
0.312018
Low Computational Cost Bloom Filters · IEEE/ACM Trans. Netw. 2018
Routing and switching › IP lookup
longest prefix matching
0.322016
Towards zero-time wakeup of line cards in power-aware routers · INFOCOM 2014
Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers · IEEE/ACM Trans. Netw. 2016
Routing and switching
router architecture
0.212016
Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers · IEEE/ACM Trans. Netw. 2016
Energy-efficient computing
power management
0.212016
Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers · IEEE/ACM Trans. Netw. 2016
Energy-efficient computing › energy-aware scheduling
sleep scheduling
0.212016
Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers · IEEE/ACM Trans. Netw. 2016
Routing and switching › routing tables
routing table management
0.112014
Towards zero-time wakeup of line cards in power-aware routers · INFOCOM 2014

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

measurement study · 0.5FPGA prototyping · 0.5hash function design · 0.3
YearPublicationVenuePosition
2018 Low Computational Cost Bloom Filters
Jianyuan Lu, Tong Yang 0003, Yi Wang 0004, Huichen Dai, Linxiao Jin, Haoyu Song 0001, Bin Liu 0001
IEEE/ACM Trans. Netw.6
2016 Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers
abstract
As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve the power efficiency of network devices. Many schemes put links to sleep when idle and wake them up when needed. A presumption in these schemes, though, is that router's line cards can be waken up very quickly. However, through systematic measurement of a major vendor's high-end routers, we find that it takes minutes to get a line card ready under the current design. To address this issue, we propose a new line card design that 1) keeps the host processor in a line card standby, which only consumes a small fraction of power but will save considerable wakeup time, and 2) downloads a slim slot of popular prefixes with higher priority, so that the line card will be ready for forwarding most of the traffic much earlier. We design algorithms as well as architecture that ensure fast and correct longest prefix match during prioritized routing prefix download. Experiments on an FPGA-based prototype show that the customized hardware can be ready to forward packets in 127.27 ms, which is 0.3% of the time the original design takes. This can better support numerous power-saving schemes based on the sleep/wakeup mechanism.
Tian Pan 0001, Ting Zhang 0010, Junxiao Shi, Yang Li 0062, Linxiao Jin, Fuliang Li, Jiahai Yang 0001, Beichuan Zhang 0001, Xueren Yang, Mingui Zhang, Huichen Dai, Bin Liu 0001
IEEE/ACM Trans. Netw.5
2015 FlowShadow: a Fast Path for Uninterrupted Packet Processing in SDN Switches
abstract
Updating rules in the flow tables of SDN switches are complex and time-consuming. Therefore, we propose a cache-based scheme (named FlowShadow) to improve the packet processing performance and keep continuous operating while updating rules in the flow tables. FlowShadow caches the microflows in the hash table to build a fast path for packet processing. By leveraging the Action Table, FlowShadow achieves update consistency and good update performance. In order to examine the reliability, validity, utility and scalability of FlowShadow, we implement FlowShadow on the Open VSwitch and conduct numerous experiments with different settings to measure the performance of FlowShadow. The experimental results demonstrate that FlowShadow achieves a lookup speed of 75 million packets per second on a commodity PC under the real backbone traces; the system with FlowShadow speeds up 3.4× times of the original Open VSwitch.
Yi Wang 0004, Dongzhe Tai, Ting Zhang 0010, Linxiao Jin, Huichen Dai, Bin Liu 0001
ANCS4
2015 One-hashing bloom filter
abstract
Bloom filters are widely used in many network applications but the high computation cost limits the system performance. In this paper, we introduce a new variation of Bloom filter named One-Hashing Bloom Filter (OHBF) to solve the problem. OHBF requires only one base hash function plus a few simple operations to implement a Bloom filter. While keeping nearly the same theoretical false positive ratio as an ideal Bloom filter, OHBF significantly reduces the hash computation overhead. We show that the false positive performance of a standard Bloom filter implementation strongly relies on the selection of hash functions, even if these hash functions are considered good. In contrast, OHBF presents consistently better performance with a proven mathematical foundation. OHBF is ideal for high throughput and low latency applications. As OHBF is a fundamental technique in Bloom filter theory, it can be applied to many other Bloom filter variations, such as Counting Bloom Filter and Space-Code Bloom Filter.
Jianyuan Lu, Tong Yang 0002, Yi Wang 0004, Huichen Dai, Linxiao Jin, Haoyu Song 0001, Bin Liu 0001
IWQoS5
2014 Towards zero-time wakeup of line cards in power-aware routers
abstract
As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve power efficiency of network devices. Many schemes put links to sleep when idle and wake them up when needed. A presumption in these schemes, though, is that router's line cards can be waken up quickly. However, through systematic measurement of a major vender's high-end router, we find that it takes minutes to get a line card ready under the current implementation. To address this issue, we propose a new line card design that (1) keeps the host processor in a line card always up, which only consumes a small fraction of power, and (2) downloads a slim slot of popular prefixes with higher priority, so that the line card will be ready for forwarding most of the traffic much earlier. We design algorithms that ensure fast and correct longest prefix match lookup during prioritized routing prefix download. Experiments on real hardware show that the wakeup time can be reduced to 127.27ms, which is 0.3% of the original line card wakeup time, well supporting many power-saving schemes.
Tian Pan 0001, Ting Zhang 0010, Junxiao Shi, Yang Li 0062, Linxiao Jin, Fuliang Li, Jiahai Yang 0001, Beichuan Zhang 0001, Bin Liu 0001
INFOCOM5