HDHaojiang Deng

Haojiang Deng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Haojiang Deng has a total of 31 co-authors. Here are the top co-authors by number of shared publications:

  • Rui Han

    National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China

    4 shared publications
  • Chi Zhang

    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

    2 shared publications
  • Jiaqi Li

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

    2 shared publications
  • Mengchi Xing

    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

    2 shared publications
  • Botao Ma

    National Network New Media Engineering Research Center, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China

    1 shared publication
  • Chengqi Cheng

    Center for Data Science, Peking University, Beijing 100871, China

    1 shared publication

Latest Publications

  • Open Access

    Accelerating CNN Inference via In-Network Computing in Information-Centric Networking

    by Kaiwei Hu, Haojiang Deng, Botao Ma

    Although Convolutional Neural Networks (CNNs) have achieved remarkable accuracy in intelligent tasks, their increasing complexity hinders low-latency execution. While edge computing mitigates the wide-area network delays typical of cloud-based inference, it remains constrained by limited computational resources when processing complex models under high concurrency. Collaborative inference has emerged as a promising paradigm to address these limitations; however, existing approaches often struggle with rigid routing, limited scalability, and inefficient resource utilization. In this paper, we propose a novel collaborative inference acceleration mechanism that integrates In-Network Computing (INC) within an Information-Centric Networking (ICN) framework. By leveraging the name-based resolution capability of ICN, our approach dynamically harnesses underutilized computational resources across distributed INC nodes, enabling flexible layer-wise offloading that transcends the limitations of static IP paths. Furthermore, a distributed decision-making and node-selection algorithm is designed to orchestrate CNN layer assignment based on real-time network conditions and node workloads. Extensive simulations on representative models demonstrate the effectiveness of the proposed method. Specifically, for the computationally intensive VGG16 model under high concurrency, the average task completion time is reduced by 43.3% and 60.2% relative to IP-based and Edge-Cloud baselines, respectively, with a load balancing fairness index maintained above 0.86.


  • Open Access

    Hop-by-Hop Multipath Overlay Routing for Optimizing Network Resource Allocation in WANs

    by Yibing Zhao, Chenhui Wang, Haojiang Deng

    The widespread deployment and rapid expansion of data centers have intensified the traffic between data centers and users, which highlights the need to improve Wide Area Network (WAN) link utilization. Existing centralized traffic control methods based on Software-Defined Wide Area Networks(SD-WAN) often rely on source-based routing, resulting in limited path diversity and inefficient network resource allocation. To address these issues, we propose a hop-by-hop multipath routing method for overlay networks, leveraging the routing decision-making capabilities of intermediate nodes. First, we introduce a Multipath Overlay node Placement (MOP) algorithm to establish an overlay network for hop-by-hop multipath transmission. The spatial relationships among overlay nodes are considered to enhance the diversity of multi-hop multipath overlay routing. Next, we propose an Overlay Next-Hop Selection (ONHS) algorithm for intermediate overlay nodes. This algorithm adjusts transmission paths at intermediate overlay nodes by sensing the network congestion state of overlay tunnels, enhancing the efficiency of network resource utilization. The results demonstrate that, under various topologies and with different numbers of overlay nodes, MOP significantly improves both end-to-end path diversity and link utilization for hop-by-hop multipath transmission. Additionally, ONHS effectively mitigates congestion escalation during next-hop selection.


  • Open Access

    An Efficient Multi-Topology Construction Method for Scheduling Mobile Data Flows in Software-Defined Networking

    by Chi Zhang, Haojiang Deng, Rui Han

    In mobile networks, a content server can provide multiple services simultaneously to a mobile device, generating multiple data flows. As the device moves, the transmission path in the wired network may need to be switched to maintain service continuity. However, a single switching path may not be able to accommodate all the flows, potentially leading to congestion and a degraded user experience. To address this challenge, we propose a multi-topology routing-based mobile data scheduling method that dynamically switches flows across multiple paths to enhance flexibility and load balancing. The performance of this method is significantly influenced by the construction of logical topologies. Well-designed topologies provide high-bandwidth, low-latency paths to all possible destination nodes, while poorly designed topologies waste switch capacity and fail to achieve these goals. In this paper, we introduce an efficient multi-topology construction method for scheduling mobile data flows in software-defined networking (SDN). Our approach optimizes and balances transmission capacity for each destination node while adhering to the flow entry constraints of switches. Simulations demonstrate that our method consistently outperforms the single-path switching method and the other two multi-topology construction methods in terms of packet delay, packet loss rate, and network throughput, regardless of the device’s new location.


  • Open Access

    A Mobility Handover Decision Method Based on Multi-Topology

    by Chi Zhang, Haojiang Deng, Rui Han

    With the emergence of new applications in mobile networks, users demand higher network stability and lower data transmission delays. When the network address of a mobile user changes, the data transmission path in the wired network may need to be switched to maintain service continuity. Traditional mobility support methods typically rely on a single switching path for all mobile data flows. However, if this path cannot meet the requirements of all the flows, it may lead to network congestion or a decline in user experience. To overcome this limitation, this paper proposes a mobility handover decision method based on multi-topology. It enables the dynamic allocation of mobile data flows across different switching paths within multiple logical topologies. The method models a multi-topology selection problem aimed at minimizing average packet transmission delay and packet loss rate, while considering network conditions and the Quality of Service (QoS) requirements for each flow. By solving the dual problem of the original optimization, a near-optimal solution is achieved. The proposed scheme and algorithm were implemented and tested using the Mininet network simulator. Results show that the proposed approach achieves low average packet transmission delay, low average packet loss rate, and high throughput, compared to traditional single-path switching methods and existing multipath routing methods.

  • Open Access

    A Method for 5G–ICN Seamless Mobility Support Based on Router Buffered Data

    by Mengchi Xing, Haojiang Deng, Rui Han

    The 5G core network adopts a Control and User Plane Separation (CUPS) architecture to meet the challenges of low-latency business requirements. In this architecture, a balance between management costs and User Experience (UE) is achieved by moving User Plane Function (UPF) to the edge of the network. However, cross-UPF handover during communication between the UE and the remote server will cause TCP/IP session interruption and affect continuity of delay-sensitive real-time communication continuity. Information-Centric Networks (ICNs) separate identity and location, and their ability to route based on identity can effectively handle mobility. Therefore, based on the 5G-ICN architecture, we propose a seamless mobility support method based on router buffered data (BDMM), making full use of the ICN’s identity-based routing capabilities to solve the problem of UE cross-UPF handover affecting business continuity. BDMM also uses the ICN router data buffering capabilities to reduce packet loss during handovers. We design a dynamic buffer resource allocation strategy (DBRAS) that can adjust the buffer resource allocation results in time according to network traffic changes and business types to solve the problem of unreasonable buffer resource allocation. Finally, experimental results show that our method outperforms other methods in terms of average packet delay, weighted average packet loss rate, and network overhead. In addition, our method also has good performance in average handover delay.


  • Open Access

    An On-Demand Fault-Tolerant Routing Strategy for Secure Key Distribution Network

    by Zhiwei Wu, Haojiang Deng, Yang Li

    The point-to-point key distribution technology based on twinning semiconductor superlattice devices can provide high-speed secure symmetric keys, suitable for scenarios with high security requirements such as the one-time pad cipher. However, deploying these devices and scaling them in complex scenarios, such as many-to-many communication, poses challenges. To address this, an effective solution is to build a secure key distribution network for communication by selecting trusted relays and deploying such devices between them. The larger the network, the higher the likelihood of relay node failure or attack, which can impact key distribution efficiency and potentially result in communication key leakage. To deal with the above challenges, this paper proposes an on-demand fault-tolerant routing strategy based on the secure key distribution network to improve the fault tolerance of the network while ensuring scalability and availability. The strategy selects the path with better local key status through a fault-free on-demand path discovery mechanism. To improve the reliability of the communication key, we integrate an acknowledgment-based fault detection mechanism in the communication key distribution process to locate the fault, and then identified the cause of the fault based on the Dempster–Shafer evidence theory. The identified fault is then isolated through subsequent path discovery and the key status is transferred. Simulation results demonstrate that the proposed method outperforms OSPF, the adaptive stochastic routing and the multi-path communication scheme, achieving an average 20% higher packet delivery ratio and lower corrupted key ratio, thus highlighting its reliability. Additionally, the proposed solution exhibits a relatively low local key overhead, indicating its practical value.

  • Open Access

    An Intelligent UAV Path-Planning Method Based on the Theory of the Three-Dimensional Subdivision of Earth Space

    by Guoyi Sun, Qian Xu, Guangyuan Zhang, Tengteng Qu, Chengqi Cheng, Haojiang Deng

    With the rapid development of the big data era, Unmanned Aerial Vehicles (UAVs) are being increasingly adopted for various complex environments. This has imposed new requirements for UAV path planning. How to efficiently organize, manage, and express all kinds of data in complex scenes and intelligently carry out fast and efficient path planning for UAVs are new challenges brought about by UAV application requirements. However, traditional path-planning methods lack the ability to effectively integrate and organize multivariate data in dynamic and complicated airspace environments. To address these challenges, this paper leverages the theory of the three-dimensional subdivision of earth space and proposes a novel environment-modeling approach based on airspace grids. In this approach, we carried out the grid-based modeling and storage of the UAV flight airspace environment and built a stable and intelligent deep-reinforcement-learning grid model to solve the problem of the passage cost of UAV path planning in the real world. Finally, we designed multiple sets of experiments to verify the efficiency of the global subdivision coding system as an environmental organization framework for path planning compared to a longitude–latitude system and to demonstrate the superiority of the improved deep-reinforcement-learning model in specific scenarios.


  • Open Access

    ICN-Oriented Mobility Support Method for Dynamic Allocation of Mobile Data Flows

    by Mengchi Xing, Haojiang Deng, Rui Han

    Information-centric networking (ICN) is a promising solution that can meet the challenges of IP-based networks. ICN adopts the solution of separating name and address to solve the dual semantics problem of IP addresses, which has natural advantages in supporting mobility. These mobility support methods in ICN have realized route optimization to a certain extent. In fact, due to these methods not considering the real-time network environment, such as the bandwidth of the switching path and the characteristics of different mobile data flows, these approaches adopt the same routing optimization solution for all data flows generated by mobile users, resulting in a single switching path. The bandwidth of a single switching path may not meet the transmission requirements of mobile data flows, which will greatly affect the performance of mobile users. Therefore, how to efficiently allocate switching paths for multiple mobile data flows generated by mobile users is an urgent problem in ICN mobility support. In this paper, we first propose a mobility support method for dynamically allocating mobile data flows (DAFM) based on the ICN mobility support architecture and model the mobile data flow allocation problem as a late-binding node selection problem. We then propose a double-constraints heuristic algorithm (DCHA) based on the Moser algorithm. By simultaneously adjusting the bandwidth resource constraints of the switching path and the space resource constraints of the Mobility Flow Table (MFT), we achieve late-binding node selection to minimize average packet delay. Finally, experimental results show that our proposal can achieve mobility support. Under the guarantee of a low-latency Name Resolution System (NRS), our method outperforms other methods in terms of average packet delay, packet loss rate, and handover delay.


  • Open Access

    A Multipath Transmission System for Information-Centric Networking Based on Standalone Name Resolution

    by Lin Jiang, Haojiang Deng, Shoujiang Dang

    Information-Centric Networking (ICN) essentially supports multipath transmission. However, current multipath schemes in ICN either necessitate major network infrastructure updates or necessitate specific network settings for terminal devices. To solve these problems, we propose MPTS-ICN, a multipath transmission system for ICN that realizes end-to-end multipath transmission. Taking the ICN architecture based on the standalone name resolution approach as a basis, MPTS-ICN is easier to implement and deploy than other ICN multipath schemes. Moreover, we have extended the original network layer protocol to support multipath data transmission in ICN. To set up concurrent transmission multipath efficiently, we propose a heuristic algorithm for the selection of multipath service nodes. Extensive experimental comparisons with existing data transmission methods show that in bandwidth-constrained scenarios, MPTS-ICN outperforms the best-route method by 83.6% and the ECMP method by 79.7% in average flow completion time.


  • A Multimodal Deep Fusion Network for Mobile Traffic Classification

    by Shuai Ding, Yifei Xu, Hao Xu, Haojiang Deng, Jingguo Ge