Although network function virtualization (NFV) is a promising approach for providing elastic network functions, it faces several challenges in terms of adaptation to diverse network appliances and reduction of the capital and operational expenses of the service providers. In particular, to deploy service chains, providers must consider different objectives, such as minimizing the network latency or the operational cost, which are coupled objectives that have traditionally been addressed separately. In this paper, the problem of virtual network function (vNF) placement for service chains is studied for the purpose of energy and traffic-aware cost minimization. This problem is formulated as an optimization problem named the joint operational and network traffic cost (OPNET) problem. First, a sampling-based Markov approximation (MA) approach is proposed to solve the combinatorial NP-hard problem, OPNET. Even though the MA approach can yield a near-optimal solution, it requires a long convergence time that can hinder its practical deployment. To overcome this issue, a novel approach that combines the MA with matching theory, named as SAMA, is proposed to find an efficient solution for the original problem OPNET. Simulation results show that the proposed framework can reduce the total incurred cost by up to 19 percent compared to the existing non-coordinated approach.
Drug shortage is always a critical issue of inventory management in healthcare systems since it potentially invokes several negative impacts. In supply chain management, optimization goes hand-in-hand with inventory control to address several issues of the supply, management, and use of drugs. However, it is difficult to determine a shortage situation in a hospital due to multiple unpredictable reasons, such as manufacturing problems, supply and demand issues, and raw material problems. To avoid the shortage problem in a hospital, efficient inventory management is required to operate the system in a sustainable way and maximize the profit of the organization in the Hospital Supply Chain (HSC). In this work, we study a drug refilling optimization problem, a general model for drug inventory management in a hospital. We then investigate a Deep Reinforcement Learning (DRL) model to address this problem under an online solution that can automatically make a drug refilling decision in order to prevent a drug shortage. We further present a numerical result to verify the performance of the proposed algorithm, which outperforms the baselines (e.g., over-provisioning, ski-rental, and max-min) in terms of the refilling cost and the shortage rate.
Large-scale Internet applications, such as content distribution networks, are deployed in a geographically distributed manner and emit massive amounts of carbon footprint at the data center. To provide uniform low access latencies, Cisco has introduced Fog computing as a new paradigm which can transform the network edge into a distributed computing infrastructure for applications. Fog nodes are geographically distributed and the deployment size at each location reflects the regional demand for the application. Thus, we need to control the fraction of user traffic to data center to maximize the social welfare. In this paper, we consider the emerging problem of joint resource allocation and minimizing carbon footprint problem for video streaming service in Fog computing. To solve the largescale optimization, we develop a distributed algorithm based on the proximal algorithm and alternating direction method of multipliers (ADMM). The numerical results show that our algorithm converges to near optimum within fifteen iterations, and is insensitive to step sizes.
14 November 2019 in IEEE Transactions on Automation Science and Engineering
Recently, a rapid growth in the number of vehicles on the road has led to an unexpected surge of parking demand. Consequently, finding a parking space has become increasingly difficult and expensive. One of the viable approaches is to utilize both public and private parking lots (PLs) to effectively share the parking spaces. However, when the parking demands are not balanced among PLs, a local congestion problem occurs where some PLs are overloaded, and others are underutilized. Therefore, in this article, we formulate the parking assignment problem with two objectives: 1) minimizing parking expenses and 2) balancing parking demand among multiple PLs. First, we derive a matching solution for minimizing parking expenses. Then, we extend our study by considering both parking expenses and balancing parking demand, formulating this as a mixed-integer linear programming problem. We solve that problem by using an alternating direction method of multipliers (ADMM)-based algorithm that can enable a distributed implementation. Finally, the simulation results show that the matching game approach outperforms the greedy approach by 8.5% in terms of parking utilization, whereas the ADMM-based algorithm produces performance gains up to 27.5% compared with the centralized matching game approach. Furthermore, the ADMM-based proposed algorithm can obtain a near-optimal solution with a fast convergence that does not exceed eight iterations for the network size with 1000 vehicles.
A Medium Access Control (MAC) protocol is designed to disseminate safety messages reliably and rapidly to improve the safety and efficiency of vehicles on the road in Vehicular Ad-hoc Networks (VANETs). VANETs, which are created by moving vehicles, have specific properties such as high node mobility with constrained movements and quick topology changes. Hence, MAC protocols should be designed to adapt to the changing data traffic patterns due to vehicle densities in the VANET environment. The latest multi-channel MAC protocols based on IEEE 802.11p and IEEE 1609.4 standards have higher performance than that of single-channel MAC protocols in every Key Performance Indicator (KPI). Specifically, the multi-channel MAC protocols, which adapt themselves to different vehicular traffic densities, can guarantee a bounded transmission delay of real-time safety applications and an increased throughput for non-safety applications. In this work, we focus on the three following perspectives: First, the multi-channel MAC protocols are studied under saturated and non-saturated data traffic conditions. Second, we study the multi-dimensional Markov chains (up to three dimensions) used in the MAC protocols. Third, the considered Markov models are compared with real-life application requirements to improve the existing analytical models and protocol designs. Finally, we summarize our findings and discuss the open issues concerning multi-channel MAC protocols for VANETs as a part of the Intelligent Transportation System.
29 July 2022 in IEEE Transactions on Cloud Computing
Unmanned aerial vehicles (UAVs) are projected to be utilized in a variety of unexpected applications, including agriculture, firefighting, emergency response, intelligent transportation, and so on. Wireless communication is one of the primary facilitators in bringing UAVs into a new phase in such applications. To realize the vision in fifth-generation (5G) networks, we propose a 5G-integration of the flexible multi-UAV system and the Open Radio Access Network (O-RAN) architecture, named U-ORAN. Although different studies have been proposed to optimize the UAV trajectory and resource allocation in the radio access network (RAN), our work is the first study to investigate the benefits of adopting UAVs in the O-RAN architecture. In U-ORAN, we consider a flying base station system and propose a joint optimization problem of multi-UAV trajectory and offloading tasks (UTOT) in which UTOT can optimize the routes from users to the core network as well as resource allocation to process offloading tasks. We decompose UTOT into two sub-problems and provide learning solutions based on the multi-agent reinforcement learning and online learning methodologies, both of which are well supported by the O-RAN architecture. Our intensive numerical simulations show that the proposed approaches outperform in a variety of settings and validation scenarios.