DBSCAN inspired task scheduling algorithm for cloud infrastructure

Cloud computing in today\u27s computing environment plays a vital role, by providing efficient and scalable computation based on pay per use model. To make computing more reliable and efficient, it must be efficient, and high resources utilized. To improve resource utilization and efficiency in cloud, task scheduling and resource allocation plays a critical role. Many researchers have proposed algorithms to maximize the throughput and resource utilization taking into consideration heterogeneous cloud environments. This work proposes an algorithm using DBSCAN (Density-based spatial clustering) for task scheduling to achieve high efficiency. The proposed DBScan-based task scheduling algorithm aims to improve user task quality of service and improve performance in terms of execution time, average start time and finish time. The experiment result shows proposed model outperforms existing ACO and PSO with 13% improvement in execution time, 49% improvement in average start time and average finish time. The experimental results are compared with existing ACO and PSO algorithms for task scheduling

Dynamic Radio Cooperation for Downlink Cloud-RANs with Computing Resource Sharing

A novel dynamic radio-cooperation strategy is proposed for Cloud Radio Access Networks (C-RANs) consisting of multiple Remote Radio Heads (RRHs) connected to a central Virtual Base Station (VBS) pool. In particular, the key capabilities of C-RANs in computing-resource sharing and real-time communication among the VBSs are leveraged to design a joint dynamic radio clustering and cooperative beamforming scheme that maximizes the downlink weighted sum-rate system utility (WSRSU). Due to the combinatorial nature of the radio clustering process and the non-convexity of the cooperative beamforming design, the underlying optimization problem is NP-hard, and is extremely difficult to solve for a large network. Our approach aims for a suboptimal solution by transforming the original problem into a Mixed-Integer Second-Order Cone Program (MI-SOCP), which can be solved efficiently using a proposed iterative algorithm. Numerical simulation results show that our low-complexity algorithm provides close-to-optimal performance in terms of WSRSU while significantly outperforming conventional radio clustering and beamforming schemes. Additionally, the results also demonstrate the significant improvement in computing-resource utilization of C-RANs over traditional RANs with distributed computing resources.Comment: 9 pages, 6 figures, accepted to IEEE MASS 201

VIRTUALIZED BASEBAND UNITS CONSOLIDATION IN ADVANCED LTE NETWORKS USING MOBILITY- AND POWER-AWARE ALGORITHMS

Virtualization of baseband units in Advanced Long-Term Evolution networks and a rapid performance growth of general purpose processors naturally raise the interest in resource multiplexing. The concept of resource sharing and management between virtualized instances is not new and extensively used in data centers. We adopt some of the resource management techniques to organize virtualized baseband units on a pool of hosts and investigate the behavior of the system in order to identify features which are particularly relevant to mobile environment. Subsequently, we introduce our own resource management algorithm specifically targeted to address some of the peculiarities identified by experimental results