Xuewen Zeng

Xuewen Zeng

Auto-generated profile, based on publicly available information

Xuewen Zeng

National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, No. 21, North Fourth Ring Road, Haidian District, Beijing 100190, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
23 May 2022 in Information
Verified
Journal Article
Open access
PDF file
SJSHI JIA
SHI JIA
XZXuewen Zeng
Xuewen Zeng
RHRui Han
Rui Han
How to achieve secure content distribution and accountability in information-centric networking (ICN) is a crucial problem. Subscribers need to verify whether the data came from a reliable source, rather than from a spoofing adversary. Public key cryptography was introduced to achieve a method of authentication that binds the data packet to its owner. In existing prototypes, PKIs, identity-based signatures (IBSs) and recommendation networks are the common schemes used to ensure the authenticity and availability of public keys. However, CA-based PKIs and KGC-based IBSs have been proven to be weak when it comes to resisting security attacks, with recommendation networks being too complex to deploy. In this respect, we designed a novel distributed authentication model as a secure scheme to support public key cryptography. Our model establishes a decentralized public key infrastructure by combining the smart contracts of blockchain and optimized zero-knowledge proof-verifiable presentations by utilizing the DID project, which realizes the management of public key certificates through blockchain and ensures the authenticity and availability of public keys in decentralized infrastructure. Our scheme fundamentally solves the issues of security and feasibility in existing schemes and provides a more scalable solution with respect to authenticating data sources. An experiment demonstrated that our proposal is 20% faster than the original zero knowledge proof scheme in registration.

28 May 2017 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
XHXingwang Huang
Xingwang Huang
XZXuewen Zeng
Xuewen Zeng
RHRui Han
Rui Han
Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this problem. To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been employed. The numeric results obtained by benchmark functions experiment prove that the proposed approach greatly outperforms the original BBA and binary particle swarm optimization (BPSO). Compared with several other heuristic algorithms on zero-one knapsack problems, it also verifies that the proposed algorithm is more able to avoid local minima.

29 October 2022 in Micromachines
Verified
Journal Article
Open access
PDF file
MSMeng Sha
Meng Sha
ZGZhichuan Guo
Zhichuan Guo
YGYunfei Guo
Yunfei Guo
XZXuewen Zeng
Xuewen Zeng
Software-defined networking has been developing in recent years and the separation of the control plane and the data plane has made networks more flexible. Due to its flexibility, the software method is used to implement the data plane. However, with increasing network speed, the CPU is becoming unable to meet the requirements of high-speed packet processing. FPGAs are usually used as dumb switches to accelerate the data plane, with all intelligence centralized in the remote controller. However, the cost of taking the intelligence out of the switch is the increased latency between the controller and the switch. Therefore, we argue that the control decisions should be made as locally as possible. In this paper, we propose a novel architecture with high performance and flexibility for accelerating SDN based on the MPSoC platform. The control plane is implemented in the on-chip CPU and the data plane is implemented in the FPGA logic. The communication between the two components is performed using Ethernet communication. We design a high-performance TCAM based on distributed RAM. The architecture employs a pipeline design with modules connected via the AXI Stream interface. The designed architecture is flexible enough to support multiple network functions while achieving high performance at 100 Gbps. As far as we know, the architecture is the first proposed in the design of a 100 Gbps system.

16 September 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
XTXinxin Tang
Xinxin Tang
XZXuewen Zeng
Xuewen Zeng
LSLei Song
Lei Song
The advances in software-defined networking (SDN) have recently promoted the development of Programmable Data Planes (PDP). PDP is famous in various network environments that need to support new protocols due to its flexibility and protocol independence. Protocol-oblivious forwarding (POF) is an implementation of PDP that uses to describe the match fields and mixes the protocol parsing into the pipeline, so there is no need for a pre-defined packet header parser. Current cache schemes for the data plane, such as Microflow Cache/Megaflow Cache, are primarily implemented based on the pre-defined packet header parser. In this paper, we first analyzed the two difficulties of generating cache tables on POF PDP. Then we analyzed the advantages and disadvantages of the single flow table cache system and multiple flow tables cache system from the perspective of time overhead. Finally, we propose a pipeline-oriented cache system to accelerate POF PDP. Aiming at the pipeline with multiple branches and multiple matching paths, we design algorithms to obtain all cache tables. Then our design leveraged the incremental calculation feature of the hash function to reduce the time overhead of cache lookup. In addition, the sorting mechanism and sleep mechanism for multiple cache tables were proposed according to the locality of traffic. Our design is implemented in a real POF PDP environment. The experimental results show that our pipeline-oriented cache scheme can effectively accelerate the programmable data plane, reducing packet forwarding latency and improving the throughput.

7 March 2022 in Electronics
Verified
Journal Article
Open access
PDF file
SJSHI JIA
SHI JIA
XZXuewen Zeng
Xuewen Zeng
YLYang Li
Yang Li
The various integration systems of blockchain and information-centric network (ICN) have been applied to provide a trusted and neutral approach to cope with large-scale content distribution in IoT, AR/VR, or 5G/6G scenarios. As a result, the scalability problem of blockchain has been an increasing concern for researchers. The sharding mechanism is recognized as a promising approach to address this challenge. However, there are still many problems in the existing schemes. Firstly, real-time processing speed trades off security of validation. Secondly, simply randomly assigning nodes to the shards may make nodes located very far from each other, which increases the block propagation time and reduces the efficiency advantage brought by the sharding mechanism. Therefore, we optimize a reputation-based sharding consensus model by multi-dimension trust and leverage the affinity propagation (AP) algorithm for gathering consensus nodes into shards. Given the minimal possibility to be at fault in the security of validation, clients can achieve real-time processing speed with assurance. The evaluation results show that the normalized mean square error (NMSE) between the estimated reputation value and the real reputation value of our reputation scheme is less than 0.02. Meanwhile, compared with the classical sharding scheme Omniledger, TPS performance can achieve 1.4 times promotion in the case of a large-scale blockchain network of 1000 nodes.

24 June 2022 in Electronics
Verified
Journal Article
Open access
PDF file
MSMeng Sha
Meng Sha
ZGZhichuan Guo
Zhichuan Guo
KWKe Wang
Ke Wang
XZXuewen Zeng
Xuewen Zeng
Network monitoring is important to improve network performance and security. The separation of the data plane and the control plane of SDN gives the network flexibility. This flexibility facilitates network management and gives rise to the need for accurate and fine-grained management of networks. However, the traditional software-based flow monitoring cannot easily keep up with today’s high-speed networks such as 100 GbE, even with the help of high-performance frameworks such as DPDK. To meet the need for fine-grained management of high-speed networks, an accurate hardware-based flow monitor design is presented in this paper. In our design, the FPGA-based pipelined cuckoo hashing is used to achieve efficient storage of flow entries. The flow information is accurately recorded without any sampling. The proposed design can achieve a higher performance than the non-sketch CPU-based methods and higher accuracy than sketch methods. Compared with other state-of-the-art flow monitors, the proposed design can achieve a performance of 100 Gbps while maintaining high accuracy.