Electrical and Electronic Engineering - Research Publications
Permanent URI for this collection
Search Results
1 - 8 of 8
-
ItemNetwork Resource Allocation for Industry 4.0 with Delay and Safety Constraints(Institute of Electrical and Electronics Engineers, 2023)In this paper, we model a futuristic factory floor equipped with Automated Guided Vehicles (AGVs), cameras, and a Virtual Reality (VR) surveillance system; and connected to a 5G network for communication purposes. Motion planning of AGVs and VR applications is offloaded to an edge server for computational flexibility and reduced hardware on the factory floor. Decisions on the edge server are made using the video feed provided by the cameras in a controlled manner. Our objectives are to ensure factory floor safety and provide smooth VR experience in the surveillance room. Providing proper and timely allocation of network resources is of utmost importance to maintain the end-to-end delay necessary to achieve these objectives. We provide a statistical analysis to estimate the bandwidth required by a factory to satisfy the delay requirements 99.999 percent of the time. We formulate a nonconvex integer nonlinear problem aiming to minimize the safety and delay violations. To solve it, we propose a real-time network resource allocation algorithm that has linear time complexity in terms of the number of components connected to the wireless network. Our algorithm significantly outperforms existing solvers (genetic algorithm, surrogate optimizer) and meets the objectives using less bandwidth compared to existing methods.
-
ItemAchieving QoS for Real-Time Bursty Applications over Passive Optical Networks( 2021-09-05)Emerging real-time applications such as those classified under ultra-reliable low latency (uRLLC) generate bursty traffic and have strict Quality of Service (QoS) requirements. Passive Optical Network (PON) is a popular access network technology, which is envisioned to handle such applications at the access segment of the network. However, the existing standards cannot handle strict QoS constraints. The available solutions rely on instantaneous heuristic decisions and maintain QoS constraints (mostly bandwidth) in an average sense. Existing works with optimal strategies are computationally complex and are not suitable for uRLLC applications. This paper presents a novel computationally-efficient, far-sighted bandwidth allocation policy design for facilitating bursty traffic in a PON framework while satisfying strict QoS (age of information/delay and bandwidth) requirements of modern applications. To this purpose, first we design a delay-tracking mechanism which allows us to model the resource allocation problem from a control-theoretic viewpoint as a Model Predictive Control (MPC). MPC helps in taking far-sighted decisions regarding resource allocations and captures the time-varying dynamics of the network. We provide computationally efficient polynomial-time solutions and show its implementation in the PON framework. Compared to existing approaches, MPC reduces delay violations by approximately 15% for a delay-constrained application of 1ms target. Our approach is also robust to varying traffic arrivals.
-
ItemAchieving AI-enabled Robust End-to-End Quality of Experience over Radio Access Networks( 2022-01-13)Emerging applications such as Augmented Reality, the Internet of Vehicles and Remote Surgery require both computing and networking functions working in harmony. The End-to-end (E2E) quality of experience (QoE) for these applications depends on the synchronous allocation of networking and computing resources. However, the relationship between the resources and the E2E QoE outcomes is typically stochastic and non-linear. In order to make efficient resource allocation decisions, it is essential to model these relationships. This article presents a novel machine-learning based approach to learn these relationships and concurrently orchestrate both resources for this purpose. The machine learning models further help make robust allocation decisions regarding stochastic variations and simplify robust optimization to a conventional constrained optimization. When resources are insufficient to accommodate all application requirements, our framework supports executing some of the applications with minimal degradation (graceful degradation) of E2E QoE. We also show how we can implement the learning and optimization methods in a distributed fashion by the Software-Defined Network (SDN) and Kubernetes technologies. Our results show that deep learning-based modelling achieves E2E QoE with approximately 99.8\% accuracy, and our robust joint-optimization technique allocates resources efficiently when compared to existing differential services alternatives.
-
Item
-
ItemAchieving AI-Enabled Robust End-to-End Quality of Experience Over Backhaul Radio Access Networks(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2022-09)Emerging applications such as Augmented Reality, the Internet of Vehicles and Remote Surgery require both computing and networking functions working in harmony. The End-to-end (E2E) quality of experience (QoE) for these applications depends on the synchronous allocation of networking and computing resources. However, the relationship between the resources and the E2E QoE outcomes is typically stochastic and non-linear. In order to make efficient resource allocation decisions, it is essential to model these relationships. This article presents a novel machine-learning based approach to learn these relationships and concurrently orchestrate both resources for this purpose. The machine learning models further help make robust allocation decisions regarding stochastic variations and simplify robust optimization to a conventional constrained optimization. When resources are insufficient to accommodate all application requirements, our framework supports executing some of the applications with minimal degradation (graceful degradation) of E2E QoE. We also show how we can implement the learning and optimization methods in a distributed fashion by the Software-Defined Network (SDN) and Kubernetes technologies. Our results show that deep learning-based modelling achieves E2E QoE with approximately 99.8% accuracy, and our robust joint-optimization technique allocates resources efficiently when compared to existing differential services alternatives.
-
ItemAchieving QoS for bursty uRLLC applications over passive optical networks(Optica Publishing Group, 2022-05)Emerging real-time applications such as those classified under ultra-reliable low latency (uRLLC) generate bursty traffic and have strict quality of service (QoS) requirements. The passive optical network (PON) is a popular access network technology, which is envisioned to handle such applications at the access segment of the network. However, the existing standards cannot handle strict QoS constraints for such applications. The available solutions rely on instantaneous heuristic decisions and maintain QoS constraints (mostly bandwidth) in an average sense. Existing proposals in generic networks with optimal strategies are computationally complex and are, therefore, not suitable for uRLLC applications. This paper presents a novel computationally efficient, far-sighted bandwidth allocation policy design for facilitating bursty uRLLC traffic in a PON framework while satisfying strict QoS (age of information/delay and bandwidth) requirements. To this purpose, first we design a delay-tracking mechanism, which allows us to model the resource allocation problem from a control-theoretic viewpoint as a model predictive control (MPC) problem. MPC helps in making far-sighted decisions regarding resource allocations and captures the time-varying dynamics of the network. We provide computationally efficient polynomial time solutions and show their implementation in the PON framework. Compared to existing approaches, MPC can improve delay violations by 15% and 45% at loads of 0.8 and 0.9, respectively, for delay-constrained applications of 1 ms and 4 ms. Our approach is also robust to varying traffic arrivals.
-
ItemInformation Constrained and Finite-Time Distributed Optimisation Algorithms(IEEE, 2017)This paper studies the delay-accuracy trade-off for an unconstrained quadratic Network Utility Maximization (NUM) problem, which is solved by a distributed, consensus based, constant step-size, gradient-descent algorithm. Information theoretic tools such as entropy power inequality are used to analyse the convergence rate of the algorithm under quantised inter-agent communication. A finite-time distributed algorithm is proposed to solve the problem under synchronised message passing. For a system with N agents, the algorithm reaches any desired accuracy within 2N iterations, by adjusting the step-size, α. However, if N is quite large or if the agents are constrained by their memory or computational capacities, asymptotic convergence algorithms are preferred to arrive within a permissible neighbourhood of the optimal solution. The analytical tools and algorithms developed shed light to delay-accuracy trade-off required for many real-time IoT applications, e.g., smart traffic control and smart grid. As an illustrative example, we use our algorithm to implement an intersection management application, where distributed computation and communication capabilities of smart vehicles and road side units increase the efficiency of an intersection.
-
ItemDistributed Real-Time IoT for Autonomous Vehicles(Institute of Electrical and Electronics Engineers, 2019-02-01)Real-time Internet of Things (IoT) applications have stringent delay requirements when implemented over distributed sensing and communication networks in smart traffic control. They require the system to reach a permissible neighbourhood of an optimum solution with a tolerable delay. The performance of such applications mostly depends on the delay introduced by the underlying optimization algorithms, with the localized computational capability. In this paper, we study a smart traffic control scenario-a real-time IoT application, where a group of autonomous vehicles independently decide on their lane velocities, in collaboration with road-side units to efficiently utilize intersections with minimal environmental impact. We decompose this problem as an unconstrained network utility maximization problem. A consensus-based, constant step-size gradient descent algorithm is proposed to obtain a near-optimal solution. We analyze the delay-accuracy tradeoff in reaching a near-optimal velocity. Delay is measured in terms of the number of iterations required before the scheduling operation can be done for a particular tolerance. The operation of the algorithm under quantized message passing is also studied. On contrary to the existing methods to intersection management problems, our approach studies the limit at which an optimization algorithm fails to cater for the requirements of a real-time application and must fall back for a pareto-optimal solution, due to the communication constraints. We used simulation of urban mobility to incorporate the microscopic behavior of traffic flows to our simulations and compared our solution with traditional and state-of-the-art intersection management techniques.