Xudong Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xudong Zhu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Hanxiao Shi
School of Management and E-Business, Zhejiang Gongshang University, Hangzhou 310018, China
1 shared publication - Ji Qi
China Mobile (Suzhou) Software Technology Co., Ltd
1 shared publication Jinhang Wang
School of Computer Science & Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
1 shared publication- Lijun Yao
School of Management and E-Business, Zhejiang Gongshang University, Hangzhou 310018, China
1 shared publication Ping Zhu
Zhejiang Gongshang UniversityHangzhou310018China
1 shared publication- Renjie Wang
School of Management and E-Business, Zhejiang Gongshang University, Hangzhou 310018, China
1 shared publication
Latest Publications
- Open Access
- 15 September 2021
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2021, 1-16
A Novel Convex Hull Coverage Algorithm for the Deployment of Electric Taxi Swap Stations Based on Urban Traffic Flow
Electric taxis have been adopted as a new energy public transportation tool as opposed to traditional taxis in modern city. Designing an efficient swapping station deployment scheme has become an important issue to improve the endurance capability of electric taxis. In this study, based on real operation trajectory data from 3997 taxis in Suzhou city, the battery swapping demand of taxis based on urban traffic flow is obtained to construct a network coverage deployment model under rule constraints, where the main optimization goal is to minimize the number of swapping stations and load balancing. According to this model, a traffic drive planning algorithm based on computational geometry is presented. The experimental results illustrate that the deployment scheme obtained by the proposed algorithm is significantly optimized in terms of the deployment cost and service load and has a lower algorithm time complexity than the typical unified deployment scheme. Therefore, the proposed method can be applied to improve the operating efficiency of the urban electric taxi system.
- 15 September 2021
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2021, 1-16
Open AccessA Novel Convex Hull Coverage Algorithm for the Deployment of Electric Taxi Swap Stations Based on Urban Traffic Flow
Electric taxis have been adopted as a new energy public transportation tool as opposed to traditional taxis in modern city. Designing an efficient swapping station deployment scheme has become an important issue to improve the endurance capability of electric taxis. In this study, based on real operation trajectory data from 3997 taxis in Suzhou city, the battery swapping demand of taxis based on urban traffic flow is obtained to construct a network coverage deployment model under rule constraints, where the main optimization goal is to minimize the number of swapping stations and load balancing. According to this model, a traffic drive planning algorithm based on computational geometry is presented. The experimental results illustrate that the deployment scheme obtained by the proposed algorithm is significantly optimized in terms of the deployment cost and service load and has a lower algorithm time complexity than the typical unified deployment scheme. Therefore, the proposed method can be applied to improve the operating efficiency of the urban electric taxi system.
- Open Access
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 26 (4) , 710-719
Rabbet: Using Layout‐Aware Backup for RAID Reconstruction
Once a disk of storage system is failed, RAID mechanism will reconstruct to keep the reliability. The reconstruction leads to a sharp deterioration in I/O performance of RAID, and the storage system cannot provide high performance service for the applications. The Multi-TB disk capacity and high load of the application make the reconstruction last for a very long time. This paper proposes Rabbet, a method accelerating RAID reconstruction using data of backup. Rabbet includes a new RAID reconstruction frame, a RAID layout-aware mapping mechanism for backup, and a reconstruction algorithm. The result of experiments shows that, comparing to the classic DOR methods Rabbet shortens the RAID5 reconstruction process to 13.9%–42.8% and decreases the average response time for applications during reconstruction by 3.2%–14.6%. Rabbet also improves the reliability of storage systems.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 26 (4) , 710-719
Open AccessRabbet: Using Layout‐Aware Backup for RAID Reconstruction
Once a disk of storage system is failed, RAID mechanism will reconstruct to keep the reliability. The reconstruction leads to a sharp deterioration in I/O performance of RAID, and the storage system cannot provide high performance service for the applications. The Multi-TB disk capacity and high load of the application make the reconstruction last for a very long time. This paper proposes Rabbet, a method accelerating RAID reconstruction using data of backup. Rabbet includes a new RAID reconstruction frame, a RAID layout-aware mapping mechanism for backup, and a reconstruction algorithm. The result of experiments shows that, comparing to the classic DOR methods Rabbet shortens the RAID5 reconstruction process to 13.9%–42.8% and decreases the average response time for applications during reconstruction by 3.2%–14.6%. Rabbet also improves the reliability of storage systems.
- Open Access
- 9 March 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
A Lightweight Neighbor-Info-Based Routing Protocol for No-Base-Station Taxi-Call System
Since the quick topology change and short connection duration, the VANET has had unstable routing and wireless signal quality. This paper proposes a kind of lightweight routing protocol-LNIB for call system without base station, which is applicable to the urban taxis. LNIB maintains and predicts neighbor information dynamically, thus finding the reliable path between the source and the target. This paper describes the protocol in detail and evaluates the performance of this protocol by simulating under different nodes density and speed. The result of evaluation shows that the performance of LNIB is better than AODV which is a classic protocol in taxi-call scene.
- 9 March 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
Open AccessA Lightweight Neighbor-Info-Based Routing Protocol for No-Base-Station Taxi-Call System
Since the quick topology change and short connection duration, the VANET has had unstable routing and wireless signal quality. This paper proposes a kind of lightweight routing protocol-LNIB for call system without base station, which is applicable to the urban taxis. LNIB maintains and predicts neighbor information dynamically, thus finding the reliable path between the source and the target. This paper describes the protocol in detail and evaluates the performance of this protocol by simulating under different nodes density and speed. The result of evaluation shows that the performance of LNIB is better than AODV which is a classic protocol in taxi-call scene.