Resource Allocation and Provision for Bandwidth/Networks on Demand in SINET3

2008 ◽  
Author(s):  
Shigeo Urushidani ◽  
Kensuke Fukuda ◽  
Yusheng Ji ◽  
Shunji Abe ◽  
Michihiro Koibuchi ◽  
...  
Keyword(s):  
Resource Allocation ◽  
On Demand

On Demand Resource Allocation for LTE Uplink Transmission Based on Logical Channel Groups

2017 ◽  
Vol 22 (5) ◽  
pp. 868-879 ◽  
Author(s):  
Fang-Chang Kuo ◽  
Kuo-Chang Ting ◽  
Hwang-Cheng Wang ◽  
Chih-Cheng Tseng
Keyword(s):  
Resource Allocation ◽  
On Demand ◽  
Logical Channel ◽  
Lte Uplink

Resource Allocation Policies in Cloud Computing Environment

2017 ◽  
pp. 115-132 ◽  
Author(s):  
Suvendu Chandan Nayak ◽  
Sasmita Parida ◽  
Chitaranjan Tripathy ◽  
Prasant Kumar Pattnaik
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Utilization ◽  
Service Level Agreement ◽  
Service Level ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
On Demand ◽  
Different Types ◽  
Cloud Datacenter

The basic concept of cloud computing is based on “Pay per Use”. The user can use the remote resources on demand for computing on payment basis. The on-demand resources of the user are provided according to a Service Level Agreement (SLA). In real time, the tasks are associated with a time constraint for which they are called deadline based tasks. The huge number of deadline based task coming to a cloud datacenter should be scheduled. The scheduling of this task with an efficient algorithm provides better resource utilization without violating SLA. In this chapter, we discussed the backfilling algorithm and its different types. Moreover, the backfilling algorithm was proposed for scheduling tasks in parallel. Whenever the application environment is changed the performance of the backfilling algorithm is changed. The chapter aims implementation of different types of backfilling algorithms. Finally, the reader can be able to get some idea about the different backfilling scheduling algorithms that are used for scheduling deadline based task in cloud computing environment at the end.

Resource Allocation in Cloud Computing Environment using AHP Technique

2014 ◽  
Vol 4 (1) ◽  
pp. 33-44 ◽  
Author(s):  
Anil Singh ◽  
Kamlesh Dutta ◽  
Avtar Singh
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Synthesis Methods ◽  
Computing Environment ◽  
Computing Technology ◽  
Method Error ◽  
Cloud Computing Environment ◽  
Mps Method ◽  
On Demand ◽  
Hierarchy Process

Cloud Computing has changed the strategy of the way of providing different services to business and government agent as well as to sole users. Cloud Computing provides scalable and on demand services to users irrespective of their physical area. But this computing technology has many challenges. One of them is on demand resource allocation. In this paper a resource allocation method is proposed based on Analytical Hierarchy Process (AHP) called Multicriteria Preference Synthesis (MPS) method. MPS method combines many AHP synthesis methods (Additive Normalization, EigenVector, Multicriteria Synthesis etc.) to assign the priorities to the users' tasks. In MPS method Error Criteria is used to provide the consistency in providing the priorities to users' tasks if any violation is there.

Architectural Elements of Resource Sharing Networks

2012 ◽  
pp. 153-184 ◽  
Author(s):  
Marcos Dias de Assunção ◽  
Rajkumar Buyya
Keyword(s):  
Resource Allocation ◽  
Grid Computing ◽  
Resource Sharing ◽  
Extensive Literature ◽  
Architectural Elements ◽  
On Demand ◽  
Operational Models ◽  
Scalable Network ◽  
Future Work

This chapter first presents taxonomies on approaches for resource allocation across resource sharing networks such as Grids. It then examines existing systems and classifies them under their architectures, operational models, support for the life-cycle of virtual organisations, and resource control techniques. Resource sharing networks have been established and used for various scientific applications over the last decade. The early ideas of Grid computing have foreseen a global and scalable network that would provide users with resources on demand. In spite of the extensive literature on resource allocation and scheduling across organisational boundaries, these resource sharing networks mostly work in isolation, thus contrasting with the original idea of Grid computing. Several efforts have been made towards providing architectures, mechanisms, policies and standards that may enable resource allocation across Grids. A survey and classification of these systems are relevant for the understanding of different approaches utilised for connecting resources across organisations and virtualisation techniques. In addition, a classification also sets the ground for future work on inter-operation of Grids.

Practical and analytical approaches for designing scalable on-demand policy-based resource allocation in stateless IP networks

2011 ◽  
Vol 22 (2) ◽  
pp. 131-149 ◽  
Author(s):  
Kamel Haddadou ◽  
Samir Ghamri-Doudane ◽  
Yacine Ghamri-Doudane ◽  
Nazim Agoulmine
Keyword(s):  
Resource Allocation ◽  
Ip Networks ◽  
On Demand ◽  
Analytical Approaches
Sign in / Sign up

Export Citation Format

Share Document