scholarly journals Learning-based Resource Allocation for Backscatter-aided Vehicular Networks

Author(s):  
Wali Ullah Khan ◽  
Tu N. Nguyen ◽  
Furqan Jameel ◽  
Muhammad Ali Jamshed ◽  
Haris bin Pervaiz ◽  
...  

This work sheds light on a novel learning-based optimization framework for heterogeneous backscatter vehicular networks. More specifically, the article presents a resource allocation and user association scheme for large-scale heterogeneous backscatter vehicular networks by considering a collaboration centric spectrum sharing mechanism. In the considered network setup, multiple network service providers (NSPs) own the resources to serve several legacy and backscatter vehicular users in the network. For each NSP, the legacy vehicle user operates under the macro cell, whereas, the backscatter vehicle user operates under small private cells using leased spectrum resources. A joint power allocation, user association, and spectrum sharing problem has been formulated with an objective to maximize the utility of NSPs. In order to overcome challenges of high dimensionality and non-convexity, the problem is divided into two subproblems. Subsequently, a reinforcement learning and a supervised deep learning approach have been used to solve both subproblems in an efficient and effective manner.

2021 ◽  
Author(s):  
Wali Ullah Khan ◽  
Tu N. Nguyen ◽  
Furqan Jameel ◽  
Muhammad Ali Jamshed ◽  
Haris bin Pervaiz ◽  
...  

This work sheds light on a novel learning-based optimization framework for heterogeneous backscatter vehicular networks. More specifically, the article presents a resource allocation and user association scheme for large-scale heterogeneous backscatter vehicular networks by considering a collaboration centric spectrum sharing mechanism. In the considered network setup, multiple network service providers (NSPs) own the resources to serve several legacy and backscatter vehicular users in the network. For each NSP, the legacy vehicle user operates under the macro cell, whereas, the backscatter vehicle user operates under small private cells using leased spectrum resources. A joint power allocation, user association, and spectrum sharing problem has been formulated with an objective to maximize the utility of NSPs. In order to overcome challenges of high dimensionality and non-convexity, the problem is divided into two subproblems. Subsequently, a reinforcement learning and a supervised deep learning approach have been used to solve both subproblems in an efficient and effective manner.


2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  

A coupling of wireless access via non-orthogonal multiple access and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, ultra-dense deployment of radio access points in macrocell and user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Then we solve each subproblem through Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.<br>


2021 ◽  
Author(s):  
◽  
Kyle Chard

<p>The computational landscape is littered with islands of disjoint resource providers including commercial Clouds, private Clouds, national Grids, institutional Grids, clusters, and data centers. These providers are independent and isolated due to a lack of communication and coordination, they are also often proprietary without standardised interfaces, protocols, or execution environments. The lack of standardisation and global transparency has the effect of binding consumers to individual providers. With the increasing ubiquity of computation providers there is an opportunity to create federated architectures that span both Grid and Cloud computing providers effectively creating a global computing infrastructure. In order to realise this vision, secure and scalable mechanisms to coordinate resource access are required. This thesis proposes a generic meta-scheduling architecture to facilitate federated resource allocation in which users can provision resources from a range of heterogeneous (service) providers. Efficient resource allocation is difficult in large scale distributed environments due to the inherent lack of centralised control. In a Grid model, local resource managers govern access to a pool of resources within a single administrative domain but have only a local view of the Grid and are unable to collaborate when allocating jobs. Meta-schedulers act at a higher level able to submit jobs to multiple resource managers, however they are most often deployed on a per-client basis and are therefore concerned with only their allocations, essentially competing against one another. In a federated environment the widespread adoption of utility computing models seen in commercial Cloud providers has re-motivated the need for economically aware meta-schedulers. Economies provide a way to represent the different goals and strategies that exist in a competitive distributed environment. The use of economic allocation principles effectively creates an open service market that provides efficient allocation and incentives for participation. The major contributions of this thesis are the architecture and prototype implementation of the DRIVE meta-scheduler. DRIVE is a Virtual Organisation (VO) based distributed economic metascheduler in which members of the VO collaboratively allocate services or resources. Providers joining the VO contribute obligation services to the VO. These contributed services are in effect membership “dues” and are used in the running of the VOs operations – for example allocation, advertising, and general management. DRIVE is independent from a particular class of provider (Service, Grid, or Cloud) or specific economic protocol. This independence enables allocation in federated environments composed of heterogeneous providers in vastly different scenarios. Protocol independence facilitates the use of arbitrary protocols based on specific requirements and infrastructural availability. For instance, within a single organisation where internal trust exists, users can achieve maximum allocation performance by choosing a simple economic protocol. In a global utility Grid no such trust exists. The same meta-scheduler architecture can be used with a secure protocol which ensures the allocation is carried out fairly in the absence of trust. DRIVE establishes contracts between participants as the result of allocation. A contract describes individual requirements and obligations of each party. A unique two stage contract negotiation protocol is used to minimise the effect of allocation latency. In addition due to the co-op nature of the architecture and the use of secure privacy preserving protocols, DRIVE can be deployed in a distributed environment without requiring large scale dedicated resources. This thesis presents several other contributions related to meta-scheduling and open service markets. To overcome the perceived performance limitations of economic systems four high utilisation strategies have been developed and evaluated. Each strategy is shown to improve occupancy, utilisation and profit using synthetic workloads based on a production Grid trace. The gRAVI service wrapping toolkit is presented to address the difficulty web enabling existing applications. The gRAVI toolkit has been extended for this thesis such that it creates economically aware (DRIVE-enabled) services that can be transparently traded in a DRIVE market without requiring developer input. The final contribution of this thesis is the definition and architecture of a Social Cloud – a dynamic Cloud computing infrastructure composed of virtualised resources contributed by members of a Social network. The Social Cloud prototype is based on DRIVE and highlights the ease in which dynamic DRIVE markets can be created and used in different domains.</p>


2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  

A coupling of wireless access via non-orthogonal multiple access (NOMA) and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, the ultra-dense deployment of radio access points in macrocell and the user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of the sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Furthermore, we solve each subproblem through the Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.


2021 ◽  
Author(s):  
◽  
Kyle Chard

<p>The computational landscape is littered with islands of disjoint resource providers including commercial Clouds, private Clouds, national Grids, institutional Grids, clusters, and data centers. These providers are independent and isolated due to a lack of communication and coordination, they are also often proprietary without standardised interfaces, protocols, or execution environments. The lack of standardisation and global transparency has the effect of binding consumers to individual providers. With the increasing ubiquity of computation providers there is an opportunity to create federated architectures that span both Grid and Cloud computing providers effectively creating a global computing infrastructure. In order to realise this vision, secure and scalable mechanisms to coordinate resource access are required. This thesis proposes a generic meta-scheduling architecture to facilitate federated resource allocation in which users can provision resources from a range of heterogeneous (service) providers. Efficient resource allocation is difficult in large scale distributed environments due to the inherent lack of centralised control. In a Grid model, local resource managers govern access to a pool of resources within a single administrative domain but have only a local view of the Grid and are unable to collaborate when allocating jobs. Meta-schedulers act at a higher level able to submit jobs to multiple resource managers, however they are most often deployed on a per-client basis and are therefore concerned with only their allocations, essentially competing against one another. In a federated environment the widespread adoption of utility computing models seen in commercial Cloud providers has re-motivated the need for economically aware meta-schedulers. Economies provide a way to represent the different goals and strategies that exist in a competitive distributed environment. The use of economic allocation principles effectively creates an open service market that provides efficient allocation and incentives for participation. The major contributions of this thesis are the architecture and prototype implementation of the DRIVE meta-scheduler. DRIVE is a Virtual Organisation (VO) based distributed economic metascheduler in which members of the VO collaboratively allocate services or resources. Providers joining the VO contribute obligation services to the VO. These contributed services are in effect membership “dues” and are used in the running of the VOs operations – for example allocation, advertising, and general management. DRIVE is independent from a particular class of provider (Service, Grid, or Cloud) or specific economic protocol. This independence enables allocation in federated environments composed of heterogeneous providers in vastly different scenarios. Protocol independence facilitates the use of arbitrary protocols based on specific requirements and infrastructural availability. For instance, within a single organisation where internal trust exists, users can achieve maximum allocation performance by choosing a simple economic protocol. In a global utility Grid no such trust exists. The same meta-scheduler architecture can be used with a secure protocol which ensures the allocation is carried out fairly in the absence of trust. DRIVE establishes contracts between participants as the result of allocation. A contract describes individual requirements and obligations of each party. A unique two stage contract negotiation protocol is used to minimise the effect of allocation latency. In addition due to the co-op nature of the architecture and the use of secure privacy preserving protocols, DRIVE can be deployed in a distributed environment without requiring large scale dedicated resources. This thesis presents several other contributions related to meta-scheduling and open service markets. To overcome the perceived performance limitations of economic systems four high utilisation strategies have been developed and evaluated. Each strategy is shown to improve occupancy, utilisation and profit using synthetic workloads based on a production Grid trace. The gRAVI service wrapping toolkit is presented to address the difficulty web enabling existing applications. The gRAVI toolkit has been extended for this thesis such that it creates economically aware (DRIVE-enabled) services that can be transparently traded in a DRIVE market without requiring developer input. The final contribution of this thesis is the definition and architecture of a Social Cloud – a dynamic Cloud computing infrastructure composed of virtualised resources contributed by members of a Social network. The Social Cloud prototype is based on DRIVE and highlights the ease in which dynamic DRIVE markets can be created and used in different domains.</p>


2013 ◽  
Vol 5 (2) ◽  
pp. 72-91 ◽  
Author(s):  
Ashiqur Md. Rahman ◽  
Rashedur M Rahman

Computational Grids are a promising platform for executing large-scale resource intensive applications. This paper identifies challenges in managing resources in a Grid computing environment and proposes computational economy as a metaphor for effective management of resources and application scheduling. It identifies distributed resource management challenges and requirements of economy-based Grid systems, and proposes an economy based negotiation system protocol for cooperative and competitive trading of resources. Dynamic pricing for services and good level of Pareto optimality make auctions more attractive for resource allocation over other economic models. In a complex Grid environment, the communication demand can become a bottleneck; that is, a number of messages need to be exchanged for matching suitable service providers and consumers. The Fuzzy Trust integrated hybrid Capital Asset Pricing Model (CAPM) shows the higher user centric satisfaction and provides the equilibrium relationship between the expected return and risk on investments. This paper also presents an analysis on the communication requirements and the necessity of the CAPMAuction in Grid environment.


2013 ◽  
Vol 9 (2) ◽  
pp. 1068-1079
Author(s):  
Ibrahim A. Cheema ◽  
Mudassar Ahmad ◽  
Fahad Jan ◽  
Shahla Asadi

The Cloud Computing (CC) provides access to the resources with usage based payments model. The application service providers can seamlessly scale the services. In CC infrastructure, a different number of virtual machine instances can be created depending on the application requirements. The capability to scale Software-as-a-Service (SaaS) application is very attractive to the providers because of the potential to scale application resources to up or down, the user only pay for the resources required. Even though the large-scale applications are deployed on cloud infrastructures on pay-per-use basis, the cost of idle resources (memory, CPU) is still charged to application providers. The issues of saturation and wastage of cloud resources are still unresolved. This paper attempts to propose the resource allocation models for SaaS applications deployments over CC platforms. The best balanced resource allocation model is proposed keeping in view cost and user requirements.


Data ◽  
2018 ◽  
Vol 3 (4) ◽  
pp. 38 ◽  
Author(s):  
Altaf Hussain ◽  
Muhammad Aleem

Developers of resource-allocation and scheduling algorithms share test datasets (i.e., benchmarks) to enable others to compare the performance of newly developed algorithms. However, mostly it is hard to acquire real cloud datasets due to the users’ data confidentiality issues and policies maintained by Cloud Service Providers (CSP). Accessibility of large-scale test datasets, depicting the realistic high-performance computing requirements of cloud users, is very limited. Therefore, the publicly available real cloud dataset will significantly encourage other researchers to compare and benchmark their applications using an open-source benchmark. To meet these objectives, the contemporary state of the art has been scrutinized to explore a real workload behavior in Google cluster traces. Starting from smaller- to moderate-size cloud computing infrastructures, the dataset generation process is demonstrated using the Monte Carlo simulation method to produce a Google Cloud Jobs (GoCJ) dataset based on the analysis of Google cluster traces. With this article, the dataset is made publicly available to enable other researchers in the field to investigate and benchmark their scheduling and resource-allocation schemes for the cloud. The GoCJ dataset is archived and available on the Mendeley Data repository.


2020 ◽  
Author(s):  
Long Zhang ◽  
Guobin Zhang ◽  
Xiaofang Zhao ◽  
Yali Li ◽  
Chuntian Huang ◽  
...  

A coupling of wireless access via non-orthogonal multiple access and wireless backhaul via beamforming is a promising way for downlink user-centric ultra-dense networks (UDNs) to improve system performance. However, ultra-dense deployment of radio access points in macrocell and user-centric view of network design in UDNs raise important concerns about resource allocation and user association, among which notably is energy efficiency (EE) balance. To overcome this challenge, we develop a framework to investigate the resource allocation problem for energy efficient user association in such a scenario. The joint optimization framework aiming at the system EE maximization is formulated as a large-scale non-convex mixed-integer nonlinear programming problem, which is NP-hard to solve directly with lower complexity. Alternatively, taking advantages of sum-of-ratios decoupling and successive convex approximation methods, we transform the original problem into a series of convex optimization subproblems. Then we solve each subproblem through Lagrangian dual decomposition, and design an iterative algorithm in a distributed way that realizes the joint optimization of power allocation, sub-channel assignment, and user association simultaneously. Simulation results demonstrate the effectiveness and practicality of our proposed framework, which achieves the rapid convergence speed and ensures a beneficial improvement of system-wide EE.<br>


Sign in / Sign up

Export Citation Format

Share Document