3 September 2020 in IEEE Transactions on Wireless Communications
Edge computing is a promising technology that offers data analysis and computing for Internet of Things (IoT) services at the network edge. It has the potential to significantly reduce the latency and improve the reliability of IoT services by allowing computation workloads and local data generated by IoT devices to be offloaded to edge nodes. This paper aims to develop algorithms for efficient provision of both job assignment and resource allocation for edge computing networks. The main objective is to minimize the long-term average of the response time delay subject to constraints on computation resources and power consumption. We apply a drift-plus-penalty based Lyapunov optimization approach to convert the original problem into an upper bound optimization problem. We then relax the latter to a convex optimization problem. Finally, a distributed algorithm based on branch-and-bound approach is provided and the gap between the distributed algorithm solution and the optimal solution of the original problem is theoretically analyzed. Numerical results based on extensive experiments have demonstrated that our distributed algorithm can achieve the required performance of edge computing that supports IoT systems, under static traffic conditions as well as under dynamic environments with time-varying traffic.
30 May 2022 in IEEE Internet of Things Journal
Edge computing is an indispensable technology that overcomes delay limitations of cloud computing. In edge computing, computational resources are deployed at the network edge, and computational tasks and data of end terminals can be efficiently processed by edge nodes. Considering the computational resource limitations of edge nodes, collaborative edge computing integrates computational resources of edge nodes and provides more efficient computing services for end terminals. This article considers a computation offloading problem in collaborative edge computing networks, where computation offloading and resource allocation are optimized by means of a collaborative load shedding approach: a terminal can offload a computing task to an edge node, which either can process the task with its computing resource or further offload the task to other edge nodes. Long-term objectives and long-term constraints are considered, and Lyapunov optimization is applied to convert the original nonconvex computation offloading problem into a second problem that approximate the original problem and it is still nonconvex but has a special structure, which gives rise to a new distributed algorithm that optimally solves the second problem. Finally, the performance and provable bound of the distributed algorithm is theoretically analyzed. Numerical results demonstrate that the distributed algorithm can achieve a guaranteed long-term performance, and also demonstrate the improvement in performance achieved over the case of computation offloading without collaborating edge nodes.
25 March 2022 in IEEE Transactions on Services Computing
Network function virtualization (NFV) is a networking paradigm based on decoupling network functions from dedicated hardware, so these network functions can be run as pieces of software on general-purpose computation servers. In addition to guarantee the service qualities provided by NFV networks comparable to those provided by traditional telecommunication networks, energy consumption becomes one of the challenges faced by NFV. This is due to a large number of general computation servers that consume a significant amount of energy. We address here the problem of how to provide an energy-aware service function chaining (SFC) embedding in NFV networks with a hierarchical resource allocation, where an SFC has a set of network functions to be executed in a sequential order providing a specific network service. Assuming a dynamic traffic scenario, we introduce for this new problem an integer linear programming (ILP) and three polynomial heuristic algorithms for resource allocation. All three heuristic algorithms achieve energy savings by shutting down idle devices and balance the tradeoff between energy cost and SFC request acceptance ratio. Numerical results demonstrate the quality of the proposed heuristic algorithms by comparing them with the ILP method and a method extended from an existing algorithm.
12 June 2024 in Digital Signal Processing
2 December 2019 in IEEE Access
The growing popularity of unmanned aerial vehicle (UAV) attracts significant research interests and applications including low-altitude and airborne vehicles. Since there is no declared spectrum allocated to UAV communications, opportunistic transmission has been commonly considered as an important way for supporting UAV communications. When sharing the same spectrum with other users such as satellites and mobile base stations, accurate spectrum sensing and allocation are of critical importance for UAV communications to avoid serious interference. As the UAVs can constantly move to different locations with various spectrum environments, the spectrum decision may be invalid only in a short period, leading to require fast spectrum sensing. Furthermore, an UAV needs to predict possible temporal and spatial vacations of the spectrum. In this case, the spectrum prediction has a high dimensional state space which is notoriously difficult to solve. In this paper, some other issues such as how to determine the spectrum processing time and how to detect the primary signals with high priority to avoid interference, are also discussed. Finally, a fast spectrum sensing algorithm is proposed to improve the energy detection performance by optimizing the error estimation and a constant ratio of missed detection. Our proposed algorithm does not require high computational capability and can achieve relatively accurate sensing in low signal-to-noise ratio scenarios.
23 October 2017 in Journal of Lightwave Technology
Network virtualization has been proposed as a promising method to mitigate the ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) to coexist on a shared substrate network. One of the major challenges in this method is the VN embedding (VNE) problem of how to map efficiently the virtual nodes and links onto the substrate network considering constraints associated with different substrate networks. This paper aims to solve the VNE problem with geographical constraints in the context of flexi-grid optical networks where modulation modes can be selected optimally. We provide an integer linear programming (ILP) formulation for the problem with the objective function of minimizing the embedding cost of an arriving VN. To achieve scalability, we also propose three polynomial-time heuristic algorithms where virtual links are embedded sequentially by three different sequences, respectively. We find that the sequence considering the bandwidth requirements of the virtual links outperforms the others. Such a sequence leads to a cost-effective VNE solution in terms of spectrum resource usage, which aims to optimize modulation modes and transmission distances of the virtual links that have high bandwidth requirements. Numerical results show that the heuristic algorithm with the sequence considering the bandwidth requirements performs closely to the ILP for a small size network, and we also demonstrate its applicability to larger networks.