Jinlong E.

Jinlong E.

Auto-generated profile, based on publicly available information

Jinlong E.

Renmin University of China, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
8 September 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
JEJinlong E.
Jinlong E.
YCYong Cui
Yong Cui
PWPeng Wang
Peng Wang
Zhenhua LiZhenhua Li
Zhenhua Li
CZChaokun Zhang
Chaokun Zhang
Cloud storage services such as Dropbox have been widely used for file collaboration among multiple users. However, this desirable functionality is yet restricted to the “walled-garden” of each service. At present, the only feasible approach to cross-cloud file collaboration seems to be using web APIs, whose performance is known to be highly unstable and unpredictable. Now that using inefficient web APIs is inevitable, in this paper we attempt to achieve sound user-perceived performance for cross-cloud file collaboration. This attempt is enabled by two key observations from real-world measurements. First, for each cloud, we are always able to deploy one or several nearby (client) proxies which can efficiently access the web APIs. Second, during file collaboration, significant similarity exists among different versions of a file. This can be exploited to substantially reduce inter-proxy traffic and thus shorten the data sync time. Guided by the observations, we design and implement an open-source prototype system called CoCloud. Currently, it supports file collaboration among four popular cloud storage services in the US and China. Its performance is well acceptable to users under representative workloads, even approaching or exceeding that of intra-cloud collaboration in many cases.

11 September 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JEJinlong E
Jinlong E
YCYong Cui
Yong Cui
Zhenhua LiZhenhua Li
Zhenhua Li
MRMingkang Ruan
Mingkang Ruan
EZEnnan Zhai
Ennan Zhai
Today's cloud storage infrastructures typically provide two distinct types of services for hosting files: object storage like Amazon S3 and filesystem storage like Amazon EFS. In practice, a cloud storage user often desires the advantages of both--efficient filesystem operations with a low unit storage price. An intuitive approach to achieving this goal is to combine the two types of services, e.g., by hosting large files in S3 and small files together with directory structures in EFS. Unfortunately, our benchmark experiments indicate that the clients' download performance for large files becomes a severe system bottleneck. In this article, we attempt to address the bottleneck with little overhead by carefully tweaking the usages of S3 and EFS. Guided by two key observations, we design and implement an open-source system called HyCloud. It automatically invokes the data APIs of S3 and EFS on behalf of users, and intelligently schedules the data transfer among S3, EFS and the clients in a distributed manner. Real-world evaluations demonstrate that the unit storage price of HyCloud is close to that of S3, and the filesystem operations are executed as quickly as in EFS in most times (sometimes even more quickly than in EFS).

6 June 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JEJinlong E
Jinlong E
FHFangshuo Han
Fangshuo Han
LHLin He
Lin He
WXWei Xu
Wei Xu
Zhenhua LiZhenhua Li
Zhenhua Li
YLYunhao Liu
Yunhao Liu
With the desired functionality of moving object tracking, wireless pan-tilt cameras are able to play critical roles in a growing diversity of surveillance environments. However, today's pan-tilt cameras oftentimes underperform when tracking frequently moving objects like humans – they are prone to lose sight of objects and bring about excessive mechanical rotations that are especially detrimental to those energy-constrained outdoor scenarios. The ineffectiveness and high cost of all state-of-the-art tracking approaches are rooted in their adherence to the industry's simplicity principle, which leads to their stateless nature, performing gimbal rotations based only on the latest object detection. To address the issues, we design and implement WiseCam that wisely tunes the pan-tilt cameras to minimize mechanical rotation costs while maintaining long-term object tracking. This systematic tracking approach also tackles issues of motion-rotation speed gap and scattered moving objects, which is universally applicable to complex tracking scenarios. We examine the performance of WiseCam by experiments on two types of pan-tilt cameras with different motors. Results show that it significantly outperforms the state-of-the-art tracking approaches on both tracking duration and power consumption.

19 September 2022 in IEEE Network
Verified
Journal Article
Closed access
LHLin He
Lin He
GRGang Ren
Gang Ren
YLYing Liu
Ying Liu
GSGuanglei Song
Guanglei Song
EJE Jinlong
E Jinlong
MXMingwei Xu
Mingwei Xu
IP spoofing is prevalently used for anonymity and reflection attacks, e.g., distributed denial of service (DDoS) attacks, which have shown increasingly destructive power in recent years because today's Internet lacks validation on source addresses. Moreover, the fast deployment of IPv6 on the Internet may further aggravate the damages of DDoS attacks. This paper proposes a novel source address validation mechanism called SAV6, which leverages the huge IPv6 address space to validate source addresses at an inter-autonomous system (AS) granularity. In SAV6, each IPv6 address contains an AS number (ASN), whose corresponding AS announces the prefix of the address to other ASes. An AS can determine the authenticity of the source address by whether the ASN in the address matches the corresponding prefix after receiving an incoming packet. The performance evaluation of a SAV6 prototype shows that it adds little performance overhead to the deployed infrastructures and is a lightweight and deployable protocol.

2 March 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TTTao Tang
Tao Tang
CZChaokun Zhang
Chaokun Zhang
GCGong Chen
Gong Chen
JEJinlong E
Jinlong E
PLPengcheng Lyu
Pengcheng Lyu
Cooperative perception facilitated by vehicle-to-vehicle (V2V) data sharing has emerged as a crucial enabler for safe and efficient autonomous driving. However, the current state-of-the-art algorithms are unable to resolve severe performance degradation caused by communication impairments in realistic V2V scenarios. This paper models the V2V communication quality and confirms their fragile robustness under loss conditions. To this end, we propose a robust and efficient cooperative perception framework. Specifically, we propose RoCooper, a robust fusion algorithm. It leverages the lossless ego feature as an anchoring foundation, then utilizes multi-dimensional feature correlations and dynamic regional selective cross-learning. This allows it to perform multi-scale feature recovery and judiciously fuse multi-view features from neighboring vehicles. In addition, we design ReduAdapt, an efficient redundancy-aware scheduling scheme that first constructs hierarchical metadata to decompose 3D perception space, then applies dynamic multi-factor thresholds for region-specific cropping, and finally performs retention-driven adaptive compression, enabling connect vehicles to prioritize critical data streams while dynamically suppressing redundant transmissions, thereby maximizing effective throughput. Extensive evaluations of real-world datasets demonstrate that our method achieves state-of-the-art performance in varying impairment scenarios, while delivering more efficient compression-transmission at comparable levels.

18 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
DCDaguo Cheng
Daguo Cheng
LHLin He
Lin He
QYQilei Yin
Qilei Yin
GHGuangxing Han
Guangxing Han
YZYizhen Zhang
Yizhen Zhang
JYJiahai Yang
Jiahai Yang
With the large-scale deployment of IPv6, it is becoming more and more important to probe active IPv6 addresses on the global Internet. However, the vast address space and the random distribution of active addresses make the probing process full of challenges, especially for the probing of IPv6 prefixes without seed addresses. Furthermore, the widespread existence of IPv6 aliased prefixes also causes significant trouble for probing. In this paper, we present AddrProbe, an active IPv6 address probing system, which dynamically probes all global routing prefixes based on learned fine-grained address patterns from limited seed addresses and quickly detects aliased prefixes during probing. The evaluation results show that AddrProbe achieves a hit rate of 23%-45% with all routing prefixes announced by the BGP system, which is 6.6-13× that of current state-of-the-art approaches (no more than 4%). Moreover, we find 1.2×1033 aliased addresses characterized by the detected aliased prefixes, covering 6,412 routing prefixes, which is a 107× and 5.9× improvement over existing methods, respectively. Finally, an IPv6 Hitlist is constructed based on the long-term probing results, which contains 562M addresses covering 190K routing prefixes and 29K ASes. These widely distributed addresses are meaningful for analyzing IPv6 address assignments and some other IPv6 measurement activities.