Jindian Liu

Jindian Liu

Auto-generated profile, based on publicly available information

Jindian Liu

School of Microelectronics, Tianjin University, Tianjin, CHINA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 October 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
ZLZhuo Li
Zhuo Li
JLJindian Liu
Jindian Liu
LYLiu Yan
Liu Yan
BZBeichuan Zhang
Beichuan Zhang
PLPeng Luo
Peng Luo
KLKaihua Liu
Kaihua Liu
Name lookup is a key technology for the forwarding plane of content router in Named Data Networking (NDN). To realize the efficient name lookup, what counts is deploying a high-performance index in content routers. So far, the proposed indexes have shown good performance, most of which are optimized for or evaluated with URLs collected from the current Internet, as the large-scale NDN names are not available yet. Unfortunately, the performance of these indexes is always impacted in terms of lookup speed, memory consumption and false positive probability, as the distributions of URLs retrieved in memory may differ from those of real NDN names independently generated by content-centric applications online. Focusing on this gap, a smart mapping model named Pyramid-NN via neural networks is proposed to build an index called LNI for NDN forwarding plane. Through learning the distributions of the names retrieved in the static memory, LNI that will be trained by real NDN names offline and preset in content routers in the future can not only reduce the memory consumption and the probability of false positive, but also ensure the performance of real NDN name lookup. Experimental results show that LNI-based FIB can reduce the memory consumption to 58.258 MB. Moreover, as it can be deployed on SRAMs, the throughput is about 177 MSPS, which well meets the current network requirement for fast packet processing.

11 May 2024 in Computer Networks
Verified
Journal Article
Closed access
ZLZhuo Li
Zhuo Li
SLShuaijun Liu
Shuaijun Liu
JLJindian Liu
Jindian Liu
YZYu Zhang
Yu Zhang
TLTeng Liang
Teng Liang
KLKaihua Liu
Kaihua Liu

25 August 2024 in Computer Networks
Verified
Journal Article
Closed access
ZLZhuo Li
Zhuo Li
NZNan Zhang
Nan Zhang
HXHao Xun
Hao Xun
JLJindian Liu
Jindian Liu
PLPeng Luo
Peng Luo
WZWanli Zhao
Wanli Zhao

28 October 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
JLJindian Liu
Jindian Liu
ZLZhuo Li
Zhuo Li
HXHao Xun
Hao Xun
YZYu Zhang
Yu Zhang
PLPeng Luo
Peng Luo
KLKaihua Liu
Kaihua Liu
In network measurement, learning-based sketch is a hot topic recently, which combines traditional sketches with machine learning techniques to improve the accuracy of sketches, while reducing the deployment overhead on switches. So far, most learning-based sketches estimate the sizes of either error-prone flows or all flows using machine learning models. These models take the sketch counter values of flows as features and their real sizes as labels for training. However, the flow size distribution is highly skewed, resulting in the effect that the flow sizes estimated by models are biased toward the sizes of mouse flows, severely underestimating elephant flows. To this end, a network measurement framework via back propagation neural network (BPNN) called NeuroSketch is proposed, which can directly estimate flow sizes and flow cardinality without identifying error-prone flows. Meanwhile, in order to provide effective features for BPNNs, a novel bloom filter-based sketch named BF-Sketch is proposed in this paper. BF-Sketch not only records the count values, but also the number of hash collisions in counters as a new feature, which can efficiently reduce the underestimation of elephant flows by machine learning models. The experimental results show that NeuroSketch reduces the average absolute error (AAE) of flow size estimation by 65%, and relative errors of flow cardinality estimation by 72.23%, compared with learning-based sketches. Moreover, BF-Sketch is implemented on OVS platform and P4-programmable switch to justify its feasible deployment in commodity software and hardware switches.

1 January 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JLJindian Liu
Jindian Liu
ZLZhuo Li
Zhuo Li
HXHao Xun
Hao Xun
YZYu Zhang
Yu Zhang
PLPeng Luo
Peng Luo
KLKaihua Liu
Kaihua Liu

25 June 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
ZLZhuo Li
Zhuo Li
YPYuheng Pei
Yuheng Pei
HXHao Xun
Hao Xun
JLJindian Liu
Jindian Liu
PLPeng Luo
Peng Luo
KLKaihua Liu
Kaihua Liu
The decision tree, as an efficient data structure, is commonly used to perform packet classification due to its faster classification speed. During packet classification, all packets need to traverse each decision tree in descending order starting from the highest priority to match the rules. Therefore, the lookup performance of the decision tree with the highest priority has an important impact on the total classification performance. Moreover, reducing the number of decision trees to be accessed is an effective way to improve the classification performance further. In this regard, a new scheme called PartitionFilter is proposed in this paper. PartitionFilter adopts an adaptive rule set partition method (RSP) to reduce the lookup time of the decision trees (not only the highest-priority decision trees). A decision tree filtration method (DTF) is also proposed to reduce the number of traversals among decision trees. Experimental results show that the throughput of PartitionFilter is improved by an average of 54%, and the number of memory accesses is reduced by an average of 76% compared to PTTree.