BLBo Lei

Bo Lei

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Bo Lei has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    LST-Sim: An Efficient Simulation Platform for Large-Scale Model Training

    by Siwei Ji, Yihao Sun, Bo Lei, Jing Tang, Yongchen Pan, Ziheng Xu, Xiaoting Ma, Yue Zhang

    Existing model training simulators fail to support heterogeneous GPU architectures and various intra-server high-speed interconnect protocols (e.g., NVLink, HCCS), while suffering from low efficiency in full-packet-level network simulation. In this paper, we present LST-Sim, an efficient simulator designed for large-scale model training, balancing simulation accuracy and runtime efficiency. First, the simulator takes into account the impacts of computational heterogeneity across different GPU models and inter-GPU interconnection bandwidth on training latency, and constructs a theoretical model. Furthermore, we propose a domain-based traffic management mechanism that integrates theoretical analysis with network simulation to handle different types of communication traffic, thereby improving simulation efficiency. The effectiveness of LST-Sim is well validated on the Ascend 910B training cluster. Its simulation results are in close agreement with real-world measurements. Meanwhile, the domain-based traffic management mechanism significantly reduces simulation runtime by approximately 75% while maintaining high fidelity.

  • Open Access

    Spatiotemporal Non-Uniformity-Aware Online Task Scheduling in Collaborative Edge Computing for Industrial Internet of Things

    by Yang Li, Xing Zhang, Yukun Sun, Wenbo Wang, Bo Lei

    Mobile edge computing mitigates the shortcomings of cloud computing caused by unpredictable wide-area network latency and serves as a critical enabling technology for the Industrial Internet of Things (IIoT). Unlike cloud computing, mobile edge networks offer limited and distributed computing resources. As a result, collaborative edge computing emerges as a promising technology that enhances edge networks' service capabilities by integrating computational resources across edge nodes. This paper investigates the task scheduling problem in collaborative edge computing for IIoT, aiming to optimize task processing performance under long-term cost constraints. We propose an online task scheduling algorithm to cope with the spatiotemporal non-uniformity of user request distribution in distributed edge networks. For the spatial non-uniformity of user requests across different factories, we introduce a graph model to guide optimal task scheduling decisions. For the time-varying nature of user request distribution and long-term cost constraints, we apply Lyapunov optimization to decompose the long-term optimization problem into a series of real-time subproblems that do not require prior knowledge of future system states. Given the NP-hard nature of the subproblems, we design a heuristic-based hierarchical optimization approach incorporating enhanced discrete particle swarm and harmonic search algorithms. Finally, an imitation learning-based approach is devised to further accelerate the algorithm's operation, building upon the initial two algorithms. Comprehensive theoretical analysis and experimental evaluation demonstrate the effectiveness of the proposed schemes.

  • Incentive-Driven Task Offloading and Collaborative Computing in Device-Assisted MEC Networks

    by Yang Li, Xing Zhang, Bo Lei, Qianying Zhao, Min Wei, Zheyan Qu, Wenbo Wang

    Edge computing (EC), positioned near end devices, holds significant potential for delivering low-latency, energy-efficient, and secure services. This makes it a crucial component of the Internet of Things (IoT). However, the increasing number of IoT devices and emerging services place tremendous pressure on edge servers (ESs). To better handle dynamically arriving heterogeneous tasks, ESs and IoT devices with idle resources can collaborate in processing tasks. Considering the selfishness and heterogeneity of IoT devices and ESs, we propose an incentive-driven multi-level task allocation framework. Specifically, we categorize IoT devices into task IoT devices (TDs), which generate tasks, and auxiliary IoT devices (ADs), which have idle resources. We use a bargaining game to determine the initial offloading decision and the payment fee for each TD, as well as a double auction to incentivize ADs to participate in task processing. Additionally, we develop a priority-based inter-cell task scheduling algorithm to address the uneven distribution of user tasks across different cells. Finally, we theoretically analyze the performance of the proposed framework. Simulation results demonstrate that our proposed framework outperforms benchmark methods.


  • Open Access

    Incentive-Driven Task Offloading and Collaborative Computing in Device-Assisted MEC Networks

    by Yang Li, Xing Zhang, Bo Lei, Qianying Zhao, Min Wei, Zheyan Qu, Wenbo Wang

    Edge computing (EC), positioned near end devices, holds significant potential for delivering low-latency, energy-efficient, and secure services. This makes it a crucial component of the Internet of Things (IoT). However, the increasing number of IoT devices and emerging services place tremendous pressure on edge servers (ESs). To better handle dynamically arriving heterogeneous tasks, ESs and IoT devices with idle resources can collaborate in processing tasks. Considering the selfishness and heterogeneity of IoT devices and ESs, we propose an incentive-driven multi-level task allocation framework. Specifically, we categorize IoT devices into task IoT devices (TDs), which generate tasks, and auxiliary IoT devices (ADs), which have idle resources. We use a bargaining game to determine the initial offloading decision and the payment fee for each TD, as well as a double auction to incentivize ADs to participate in task processing. Additionally, we develop a priority-based inter-cell task scheduling algorithm to address the uneven distribution of user tasks across different cells. Finally, we theoretically analyze the performance of the proposed framework. Simulation results demonstrate that our proposed framework outperforms benchmark methods.

  • Open Access

    Joint Task Partitioning and Parallel Scheduling in Device-Assisted Mobile Edge Networks

    by Yang Li, Xinlei Ge, Bo Lei, Xing Zhang, Wenbo Wang

    With the development of the Internet of Things (IoT), certain IoT devices have the capability to not only accomplish their own tasks but also simultaneously assist other resource-constrained devices. Therefore, this paper considers a device-assisted mobile edge computing system that leverages auxiliary IoT devices to alleviate the computational burden on the edge computing server and enhance the overall system performance. In this study, computationally intensive tasks are decomposed into multiple partitions, and each task partition can be processed in parallel on an IoT device or the edge server. The objective of this research is to develop an efficient online algorithm that addresses the joint optimization of task partitioning and parallel scheduling under time-varying system states, posing challenges to conventional numerical optimization methods. To address these challenges, a framework called online task partitioning action and parallel scheduling policy generation (OTPPS) is proposed, which is based on deep reinforcement learning (DRL). Specifically, the framework leverages a deep neural network (DNN) to learn the optimal partitioning action for each task by mapping input states. Furthermore, it is demonstrated that the remaining parallel scheduling problem exhibits NP-hard complexity when considering a specific task partitioning action. To address this subproblem, a fair and delay-minimized task scheduling (FDMTS) algorithm is designed. Extensive evaluation results demonstrate that OTPPS achieves near-optimal average delay performance and consistently high fairness levels in various environmental states compared to other baseline schemes.

  • Open Access

    Task Offloading with Multi-cluster Collaboration for Computing and Network Convergence

    by Yang Li, Bo Lei, Zhaojiang Li, Zheyan Qu, Xing Zhang, Wenbo Wang

    Edge computing servers have been widely deployed in recent years to address the requirements of diverse tasks that are sensitive to delays and computationally intensive. However, due to their independent nature and uneven distribution of service requests, certain clusters may be relatively idle, while others may be overloaded. This situation can result in increased latency for certain tasks, and it prevents the full utilization of resources in the edge clusters. To mitigate this problem, we design and implement a prototype testbed for task offloading, aimed at achieving computing and network convergence. This testbed facilitates collaboration among multiple edge computing clusters. We construct multiple clusters using Intel NUC mini computers and incorporate key enabling technologies into the system. We assess the testbed's performance by employing multiple video processing services that require low latency and high computational capacity. In scenarios with uneven service requests, load balancing can be achieved across the edge computing clusters, resulting in reduced response latency for user tasks.


  • Open Access

    A Consensus Approach for SDN Controllers based on Blockchain

    by Jiacong Li, Hang Lv, Bo Lei, Yunpeng Xie

    SDN has been proposed to realize flexible network management. Due to the network becomes more complex, multiple controllers are required in SDN. It brings cooperative operation problem among multiple SDN controllers. To solve this problem, common method is to set up a central SDN controller management platform, which increases the construction and operation costs. In this paper, we propose a consensus approach for SDN controllers based on blockchain. Blockchain is a decentralized distributed data management technology. Using this feature, we select the mater controller which has the most abundant resources. The master node completes the production and entry of the block, while the ordinary node accepts the block produced by the master one. To realize this approach, we propose a resource data model of the SDN controller first and a consensus method based on blockchain and this data model.