• Title/Summary/Keyword: Virtual resource allocation

Search Result 75, Processing Time 0.021 seconds

Migration and Energy Aware Network Traffic Prediction Method Based on LSTM in NFV Environment

  • Ying Hu;Liang Zhu;Jianwei Zhang;Zengyu Cai;Jihui Han
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.896-915
    • /
    • 2023
  • The network function virtualization (NFV) uses virtualization technology to separate software from hardware. One of the most important challenges of NFV is the resource management of virtual network functions (VNFs). According to the dynamic nature of NFV, the resource allocation of VNFs must be changed to adapt to the variations of incoming network traffic. However, the significant delay may be happened because of the reallocation of resources. In order to balance the performance between delay and quality of service, this paper firstly made a compromise between VNF migration and energy consumption. Then, the long short-term memory (LSTM) was utilized to forecast network traffic. Also, the asymmetric loss function for LSTM (LO-LSTM) was proposed to increase the predicted value to a certain extent. Finally, an experiment was conducted to evaluate the performance of LO-LSTM. The results demonstrated that the proposed LO-LSTM can not only reduce migration times, but also make the energy consumption increment within an acceptable range.

Honey Bee Based Load Balancing in Cloud Computing

  • Hashem, Walaa;Nashaat, Heba;Rizk, Rawya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5694-5711
    • /
    • 2017
  • The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

Workflow Scheduling Using Heuristic Scheduling in Hadoop

  • Thingom, Chintureena;Kumar R, Ganesh;Yeon, Guydeuk
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.4
    • /
    • pp.264-270
    • /
    • 2018
  • In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

SLA-Aware Resource Management for Cloud based Multimedia Service

  • Hasan, Md. Sabbir;Islam, Md. Motaharul;Park, Jun Young;Huh, Eui-Nam
    • Annual Conference of KIPS
    • /
    • 2013.05a
    • /
    • pp.171-174
    • /
    • 2013
  • Virtualization technology opened a new era in the field of Data intensive, Grid and Cloud Computing. Today's Data centers are smarter than ever leveraging the Virtualization technology. In response to that, Dynamic consolidations of Virtual Machines (VMs) allow efficient resource management by live migration of VMs in the hosts. Moreover, each client typically has a service level agreement (SLA), leads to stipulation in dealing with energy-performance trade-off as aggressive consolidation may lead to performance degradation beyond the negotiation. In this paper we propose a Cloud Based CDN approach for allocation of VM that aims to maximize the client-level SLA. Our experiment result demonstrates significant enhancement of SLA at certain level.

A study on live vertical scale-up in a cloud environment (클라우드 환경에서의 무중단 수직 확장에 관한 연구)

  • Jun-Seok Park;Dae-Sik Ko
    • Journal of Platform Technology
    • /
    • v.10 no.4
    • /
    • pp.70-81
    • /
    • 2022
  • In this paper, we proposed a Virtual Machine Placement (VMP) method to provide live vertical scaling services for cloud resources. Since free space on the physical server must be secured in advance for vertical scaling, a "general-mixed-vertical" mode conversion algorithm based on the FirstFit placement strategy that variably adjusts the allocation ratio of virtual servers to physical servers for this purpose is presented. Simulations were performed using parameters such as vertical scaling ratio, virtualization ratio, and free resource ratio. When the vertical scaling ratio is 50%, considering free space, 150% of resources are required as a whole, but simulation results of the proposed algorithm show that only up to 125% of free space is required.

A Subcarrier-based Virtual Multiple Antenna Technique for OFDM Cellular Systems (OFDM 셀룰러 시스템에서 부반송파 기반의 가상 다중안테나 기법)

  • Lee, Kyu-In;Ko, Hyun-Soo;Woo, Kyung-Soo;Ko, Yo-Han;Kim, Yeong-Jun;Ahn, Jae-Young;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10C
    • /
    • pp.981-990
    • /
    • 2006
  • In this paper, we introduce the concept of a subcarrier-based virtual multiple antennas (SV-MIMO) for OFDM cellular systems, where the multiple antenna techniques are performed on a set of subcarriers, not on the actual multiple antennas. The virtual multiple antenna system can support multiple users simultaneously as well as reduce inter-cell interference (ICI) form adjacent cells with a single antenna. Also, this technique is easily extended to multiple antenna environments. The virtual multiple antenna techniques can be divided into a virtual smart antenna technique and a virtual MIMO technique. Especially, this method effectively reduces ICI at cell boundary with frequency reuse factor equal to 1, and can support flexible resource allocation depending on the amount of interference. It is shown by simulation that the proposed method is superior to conventional method under the same condition of data transmission.

Thread Block Scheduling for GPGPU based on Fine-Grained Resource Utilization (상세 자원 이용률에 기반한 병렬 가속기용 스레드 블록 스케줄링)

  • Bahn, Hyokyung;Cho, Kyungwoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.49-54
    • /
    • 2022
  • With the recent widespread adoption of general-purpose GPUs (GPGPUs) in cloud systems, maximizing the resource utilization through multitasking in GPGPU has become an important issue. In this article, we show that resource allocation based on the workload classification of computing-bound and memory-bound is not sufficient with respect to resource utilization, and present a new thread block scheduling policy for GPGPU that makes use of fine-grained resource utilizations of each workload. Unlike previous approaches, the proposed policy reduces scheduling overhead by separating profiling and scheduling, and maximizes resource utilizations by co-locating workloads with different bottleneck resources. Through simulations under various virtual machine scenarios, we show that the proposed policy improves the GPGPU throughput by 130.6% on average and up to 161.4%.

A Load-Balancing Approach Using an Improved Simulated Annealing Algorithm

  • Hanine, Mohamed;Benlahmar, El-Habib
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.132-144
    • /
    • 2020
  • Cloud computing is an emerging technology based on the concept of enabling data access from anywhere, at any time, from any platform. The exponential growth of cloud users has resulted in the emergence of multiple issues, such as the workload imbalance between the virtual machines (VMs) of data centers in a cloud environment greatly impacting its overall performance. Our axis of research is the load balancing of a data center's VMs. It aims at reducing the degree of a load's imbalance between those VMs so that a better resource utilization will be provided, thus ensuring a greater quality of service. Our article focuses on two phases to balance the workload between the VMs. The first step will be the determination of the threshold of each VM before it can be considered overloaded. The second step will be a task allocation to the VMs by relying on an improved and faster version of the meta-heuristic "simulated annealing (SA)". We mainly focused on the acceptance probability of the SA, as, by modifying the content of the acceptance probability, we could ensure that the SA was able to offer a smart task distribution between the VMs in fewer loops than a classical usage of the SA.

A Study on System Configuration of Grid-connected CTTS System with Soft Switching (소프트 절환이 가능한 계통 연계형 CTTS 시스템 구성에 관한 연구)

  • Lee, Hyoung-Mook;Yang, Ji-Hoon;Lee, Jung-Hwan;Park, Seong-Mi;Park, Sung-Jun
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.21 no.6
    • /
    • pp.361-368
    • /
    • 2018
  • This paper proposes a grid - connected CTTS system that can be soft switched to meet the government's effective resource allocation policy for emergency generator. In order to eliminate the system instability caused by the large inrush current generation in the system switching, a new virtual rotation coordinate method for the dissimilar power source is proposed. The proposed virtual rotation coordinate method improves the voltage detection accuracy of the voltage difference of the dissimilar power supply, and it is proved that the synchronous switching characteristic is excellent. In addition, zero current and system stabilization can be achieved by realizing zero current when blocking CTTS with instantaneous reactive power control. Simulation was carried out to verify the validity of the proposed method, and the 500[kVA] system was fabricated and verified to demonstrate the superiority of the proposed method.

A Study on Operation Problems for the Emergency Medical Process Using Real-Time Data (실시간데이터를 활용한 응급의료 프로세스 운영에 관한 연구)

  • Kim, Daebeom
    • Journal of the Korea Society for Simulation
    • /
    • v.26 no.3
    • /
    • pp.125-139
    • /
    • 2017
  • Recently, interest in improving the quality of EMS(emergency medical services) has been increasing. Much effort is being made to innovate the EMS process. The rapid progress of ICT technology has accelerated the automation or intelligence of EMS processes. This study suggests an emergency room management method based on real-time data considering resource utilization optimization, minimization of human error and enhancement of predictability of medical care. Emergency room operation indices - Emergency care index, Short stay index, Human error inducing index, Waiting patience index - are developed. And emergency room operation rules based on these indices are presented. Simulation was performed on a virtual emergency room to verify the effectiveness of the proposed operating rule. Simulation results showed excellent performance in terms of length of stay.