• 제목/요약/키워드: Multi-Cloud

검색결과 389건 처리시간 0.025초

클라우드 기지국에서의 조정 다중점 송수신 운용 방법 (The Operation Method of Coordinated Multi-point Transmission/Reception in Cloud Base Station)

  • 박순기;신연승;송평중;김대영
    • 한국통신학회논문지
    • /
    • 제38B권10호
    • /
    • pp.775-784
    • /
    • 2013
  • 이동통신 사업자들은 자신의 망 총소유비용을 줄이면서 데이터 폭증에 대처하기 위한 다양한 기술적인 대책 들을 강구하고 있다. 이 논문에서는 그러한 기술적인 대책의 하나로써 클라우드 기지국이란 새로운 기지국 구조에서 조정 다중점 송수신 운용에 따른 시스템 용량 및 이동성 성능에 관련된 모의실험 결과를 도출한다. 그 결과는 조정 다중점 송수신이 적용되는 클라우드 기지국의 규모 및 적용 영역에 따라 시스템 용량 및 이동성 성능도 개선될 수 있다는 것을 관찰할 수 있었으며 이러한 상호 인과 관계들은 실제 이동통신 사업자의 망 운용에 있어서 하나의 실용적 지침을 제공할 수 있다.

An improved Multi-server Authentication Scheme for Distributed Mobile Cloud Computing Services

  • Irshad, Azeem;Sher, Muhammad;Ahmad, Hafiz Farooq;Alzahrani, Bander A.;Chaudhry, Shehzad Ashraf;Kumar, Rahul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5529-5552
    • /
    • 2016
  • Mobile cloud computing (MCC) has revolutionized the way in which the services can be obtained from the cloud service providers. Manifold increase in the number of mobile devices and subscribers in MCC has further enhanced the need of an efficient and robust authentication solution. Earlier, the subscribers could get cloud-computing services from the cloud service providers only after having consulted the trusted third party. Recently, Tsai and Lo has proposed a multi-server authenticated key agreement solution for MCC based on bilinear pairing, to eliminate the trusted third party for mutual authentication. The scheme has been novel as far as the minimization of trusted party involvement in authenticating the user and service provider, is concerned. However, the Tsai and Lo scheme has been found vulnerable to server spoofing attack (misrepresentation attack), de-synchronization attack and denial-of-service attack, which renders the scheme unsuitable for practical deployment in different wireless mobile access networks. Therefore, we have proposed an improved model based on bilinear pairing, countering the identified threats posed to Tsai and Lo scheme. Besides, the proposed work also demonstrates performance evaluation and formal security analysis.

멀티클라우드 환경에서 중개기관을 이용한 의료정보 통합 및 인증 기법 (An Authentication Scheme and Integration of Medical Information Using Broker in Multi-Cloud Environment)

  • 유미경;우성희
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2014년도 춘계학술대회
    • /
    • pp.603-605
    • /
    • 2014
  • 의료정보 기술의 빠른 발전으로 의료 산업은 의료 정보 활용 및 통합에 관한 연구가 활발히 진행되고 있다. 현재 의료정보 통합을 위해서는 각 의료기관 시스템의 전반적인 변화가 있어야 하므로 의료기관의 부담이 적지 않다. 이에 최근 클라우드 기반에 EMR 시스템을 도입하는 환경으로 발전하고 있다. 클라우드 환경에서 사용자의 모든 의료정보를 하나로 통합하여 관리하는 중앙집중적 시스템은 의료정보 노출등 많은 문제점이 있을 수 있다. 따라서 본 논문에서는 멀티클라우드 환경에서 중개기관을 이용한 각 의료기관의 의료정보 통합 및 인증에 관한 기법을 제안하려 한다.

  • PDF

Dynamic Collaborative Cloud Service Platform: Opportunities and Challenges

  • Yoon, Chang-Woo;Hassan, Mohammad Mehedi;Lee, Hyun-Woo;Ryu, Won;Huh, Eui-Nam
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.634-637
    • /
    • 2010
  • This letter presents a model for a dynamic collaboration (DC) platform among cloud providers (CPs) that prevents adverse business impacts, cloud vendor lock-in and violation of service level agreements with consumers, and also offers collaborative cloud services to consumers. We consider two major challenges. The first challenge is to find an appropriate market model in order to enable the DC platform. The second is to select suitable collaborative partners to provide services. We propose a novel combinatorial auction-based cloud market model that enables a DC platform among CPs. We also propose a new promising multi-objective optimization model to quantitatively evaluate the partners. Simulation experiments were conducted to verify both of the proposed models.

A Constrained Multi-objective Computation Offloading Algorithm in the Mobile Cloud Computing Environment

  • Liu, Li;Du, Yuanyuan;Fan, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4329-4348
    • /
    • 2019
  • Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

Enabling Dynamic Multi-Client and Boolean Query in Searchable Symmetric Encryption Scheme for Cloud Storage System

  • Xu, Wanshan;Zhang, Jianbiao;Yuan, Yilin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1286-1306
    • /
    • 2022
  • Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.

Optimization of Data Placement using Principal Component Analysis based Pareto-optimal method for Multi-Cloud Storage Environment

  • Latha, V.L. Padma;Reddy, N. Sudhakar;Babu, A. Suresh
    • International Journal of Computer Science & Network Security
    • /
    • 제21권12호
    • /
    • pp.248-256
    • /
    • 2021
  • Now that we're in the big data era, data has taken on a new significance as the storage capacity has exploded from trillion bytes to petabytes at breakneck pace. As the use of cloud computing expands and becomes more commonly accepted, several businesses and institutions are opting to store their requests and data there. Cloud storage's concept of a nearly infinite storage resource pool makes data storage and access scalable and readily available. The majority of them, on the other hand, favour a single cloud because of the simplicity and inexpensive storage costs it offers in the near run. Cloud-based data storage, on the other hand, has concerns such as vendor lock-in, privacy leakage and unavailability. With geographically dispersed cloud storage providers, multicloud storage can alleviate these dangers. One of the key challenges in this storage system is to arrange user data in a cost-effective and high-availability manner. A multicloud storage architecture is given in this study. Next, a multi-objective optimization problem is defined to minimise total costs and maximise data availability at the same time, which can be solved using a technique based on the non-dominated sorting genetic algorithm II (NSGA-II) and obtain a set of non-dominated solutions known as the Pareto-optimal set.. When consumers can't pick from the Pareto-optimal set directly, a method based on Principal Component Analysis (PCA) is presented to find the best answer. To sum it all up, thorough tests based on a variety of real-world cloud storage scenarios have proven that the proposed method performs as expected.

De-Centralized Information Flow Control for Cloud Virtual Machines with Blowfish Encryption Algorithm

  • Gurav, Yogesh B.;Patil, Bankat M.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권12호
    • /
    • pp.235-247
    • /
    • 2021
  • Today, the cloud computing has become a major demand of many organizations. The major reason behind this expansion is due to its cloud's sharing infrastructure with higher computing efficiency, lower cost and higher fle3xibility. But, still the security is being a hurdle that blocks the success of the cloud computing platform. Therefore, a novel Multi-tenant Decentralized Information Flow Control (MT-DIFC) model is introduced in this research work. The proposed system will encapsulate four types of entities: (1) The central authority (CA), (2) The encryption proxy (EP), (3) Cloud server CS and (4) Multi-tenant Cloud virtual machines. Our contribution resides within the encryption proxy (EP). Initially, the trust level of all the users within each of the cloud is computed using the proposed two-stage trust computational model, wherein the user is categorized bas primary and secondary users. The primary and secondary users vary based on the application and data owner's preference. Based on the computed trust level, the access privilege is provided to the cloud users. In EP, the cipher text information flow security strategy is implemented using the blowfish encryption model. For the data encryption as well as decryption, the key generation is the crucial as well as the challenging part. In this research work, a new optimal key generation is carried out within the blowfish encryption Algorithm. In the blowfish encryption Algorithm, both the data encryption as well as decryption is accomplishment using the newly proposed optimal key. The proposed optimal key has been selected using a new Self Improved Cat and Mouse Based Optimizer (SI-CMBO), which has been an advanced version of the standard Cat and Mouse Based Optimizer. The proposed model is validated in terms of encryption time, decryption time, KPA attacks as well.

Energy-aware Multi-dimensional Resource Allocation Algorithm in Cloud Data Center

  • Nie, Jiawei;Luo, Juan;Yin, Luxiu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권9호
    • /
    • pp.4320-4333
    • /
    • 2017
  • Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.

Task Scheduling and Resource Management Strategy for Edge Cloud Computing Using Improved Genetic Algorithm

  • Xiuye Yin;Liyong Chen
    • Journal of Information Processing Systems
    • /
    • 제19권4호
    • /
    • pp.450-464
    • /
    • 2023
  • To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.