Refining the estimation of the available bandwidth in inter-cloud links for task scheduling

Genez, Thiago A. L.; Bittencourt, Luiz F.; Fonseca, Nelson L. S. da; Madeira, Edmundo Roberto Mauro

doi:10.1109/glocom.2014.7036960

Cited by 7 publications

(12 citation statements)

References 17 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [28], an algorithm of optimizing VM's number in CRANs is proposed by scheduling multiple VMs to a user task and allocating an RRH to multiple users. In [29], the authors attempt to assess the impact of inaccurate information on workflow scheduling due to the available bandwidth of inter-cloud links. Then, a workflow scheduling input mechanism using imprecise information is proposed.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Rounding Algorithm of Minimizing Executing and Transmitting Time in Multiple CRANs

Liu

Pan

2021

IEEE Access

View full text Add to dashboard Cite

Recently, Cloud Radio Access Network (CRAN) is a technology for reducing communication load and improving the performance of user tasks. In a CRAN, remote radio heads (RRHs) are densely set up to enable users to connect to the network nearby, and baseband unit (BBU) pools are used to store and execute user contents and tasks. In this paper, our goal is to perform joint optimization when scheduling user tasks and assigning RRH to users in a multiple CRAN infrastructure. The joint problem is NP-hard and modeled as a 0/1 integer linear programming (ILP) with the objective of minimizing the total time of executing user tasks and transmitting user output contents under the constraints of RRH linked capacities and BBU pool computing resources. Then, an algorithm is designed by adopting the rounding technology to solve the 0/1 ILP. We will prove its approximation ratio competitively. The conducted simulations further show that the difference between its solution and the optimal one of the 0/1 ILP is very small, and its approximation ratio is between 1.09 and 1.17. In the conducted experiments, the results demonstrate that the proposed algorithm is indeed practical to be implemented in a multiple CRAN infrastructure.INDEX TERMS Cloud Radio Access Network (CRAN), resource allocation, task scheduling.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Recently, some research works [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29] focused on similar issues mentioned above. However, most of them solve one of the two problems respectively, and their purpose is to focus on the energy optimization of user equipment.…”

Section: Introductionmentioning

confidence: 99%

Rounding Algorithm of Minimizing Executing and Transmitting Time in Multiple CRANs

Liu

Pan

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…This paper deals with interoperability of multiple clouds, which can also call as inter-cloud computing or cloud federation. Thiago et al [10], evaluates the impact of imprecise knowledge about the available bandwidth and its impacts on cost estimates and the makespan. it proposes a mechanism in which a deflating factor on the bandwidth value given as input to the scheduler.…”

Section: Literature Reviewmentioning

confidence: 99%

Efficient Task Scheduling for Quality of Service in Cloud Computing Network

Srikar*,

Manoranjitham

2020

IJRTE

View full text Add to dashboard Cite

Task scheduling in cloud is the process of allocating a resource to a task at specific time. The allocation of limited cloud resources to large number of tasks to satisfy the required quality of service is the key challenge in cloud. Allocation of a resource with less capability to a task increases the response time, makespan of the task and waiting time of the entire tasks in the waiting queue. This problem will result to an unsatisfied Quality of Service. In this paper we proposed an efficient task scheduling that uses three threshold values to specify the resource to be allocated to a task at a given time. This method ensures that a capable resource is allocated to task such that the response time and makespan of the all task are minimized. The proposed method was simulated using CloudSim and the result shows a better response time and makespan than the well known Min-Min and Max-Min Method.

show abstract

“…Its estimate is used for route selection, quality of service (QoS) verification, and traffic engineering. More recently, AB estimation has increased its importance with respect to new demanding scenarios like cloud computing, voice-over-IP (VoIP), and multimedia networks, where support tools for traffic shaping and traffic policing as well as developing network management strategies are crucial [2][3][4][5][6][7]. Moreover, available bandwidth can directly affect the performance of distributed systems and clocks [8,9].…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of a DEKF for Available Bandwidth Measurement

Santoro

Vadursi

2016

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

The paper presents a characterisation analysis of a measurement algorithm based on a Discrete-time Extended Kalman Filter (DEKF), which has recently been proposed for the estimation and tracking of end-to-end available bandwidth. The analysis is carried out by means of simulations for different rates of variations of the available bandwidth and permits assessing the performance of the measurement algorithm for different values of the filter parameters, that is, the covariance matrixes of the measurement and process noise.

show abstract

Refining the estimation of the available bandwidth in inter-cloud links for task scheduling

Cited by 7 publications

References 17 publications

Rounding Algorithm of Minimizing Executing and Transmitting Time in Multiple CRANs

Rounding Algorithm of Minimizing Executing and Transmitting Time in Multiple CRANs

Efficient Task Scheduling for Quality of Service in Cloud Computing Network

Performance Analysis of a DEKF for Available Bandwidth Measurement

Contact Info

Product

Resources

About