• Title/Summary/Keyword: network provisioning

Search Result 169, Processing Time 0.025 seconds

Optimizing Performance and Energy Efficiency in Cloud Data Centers Through SLA-Aware Consolidation of Virtualized Resources (클라우드 데이터 센터에서 가상화된 자원의 SLA-Aware 조정을 통한 성능 및 에너지 효율의 최적화)

  • Elijorde, Frank I.;Lee, Jaewan
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.1-10
    • /
    • 2014
  • The cloud computing paradigm introduced pay-per-use models in which IT services can be created and scaled on-demand. However, service providers are still concerned about the constraints imposed by their physical infrastructures. In order to keep the required QoS and achieve the goal of upholding the SLA, virtualized resources must be efficiently consolidated to maximize system throughput while keeping energy consumption at a minimum. Using ANN, we propose a predictive SLA-aware approach for consolidating virtualized resources in a cloud environment. To maintain the QoS and to establish an optimal trade-off between performance and energy efficiency, the server's utilization threshold dynamically adapts to the physical machine's resource consumption. Furthermore, resource-intensive VMs are prevented from getting underprovisioned by assigning them to hosts that are both capable and reputable. To verify the performance of our proposed approach, we compare it with non-optimized conventional approaches as well as with other previously proposed techniques in a heterogeneous cloud environment setup.

Fast Multi-Phase Packet Classification Architecture using Internal Buffer and Single Entry Caching (내부 버퍼와 단일 엔트리 캐슁을 이용한 다단계 패킷 분류 가속화 구조)

  • Kang, Dae-In;Park, Hyun-Tae;Kim, Hyun-Sik;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.9
    • /
    • pp.38-45
    • /
    • 2007
  • With the emergence of new applications, packet classification is essential for supporting advanced internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, internet routers need to classify incoming packet quickly into flows. In this paper, we present multi-phase packet classification architecture using an internal buffer for fast packet processing. Using internal buffer between address pair searching phase and remained fields searching phases, we can hide latency from the characteristic that search times of source and destination header fields are different. Moreover we guarantee the improvement by using single entry caching. The proposed architecture is easy to apply to different needs owing to its simplicity and generality.

An Efficient VM-Level Scaling Scheme in an IaaS Cloud Computing System: A Queueing Theory Approach

  • Lee, Doo Ho
    • International Journal of Contents
    • /
    • v.13 no.2
    • /
    • pp.29-34
    • /
    • 2017
  • Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

Efficient Data Pre-fetching Scheme for InfiniBand based High Performance Clusters (인피니밴드 기반 고성능 클러스터를 위한 효율적인 데이터 선반입 기법)

  • Kim, Bongjae;Jung, Jinman;Min, Hong;Heo, Junyoung;Jung, Hyedong
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.5
    • /
    • pp.293-298
    • /
    • 2017
  • Recently, much research has been devoted to implementing and provisioning high-performance computing environment using clusters with multiple computers and high-performance networking technologies. In-memory based Key-Value stores, such as Redis or Memcached, are widely used in high performance cluster environments to improve the data processing performance. We can distribute data at different storage nodes, and each computing node can access it at a high speed using these In-memory based Key-Value stores. InfiniBand is a de-facto technology that is widely used to interconnect each node of a cluster. In this paper, we propose a new data pre-fetching scheme for Key-Value store based on high performance clusters to improve the performance. The proposed scheme utilizes the data transfer characteristics of InfiniBand. The results of the simulation show that the proposed scheme can reduce the data transfer time by up to about 28%.

A Predictive Connection Admission Control Using Neural Networks for Multiclass Cognitive Users Radio Networks (멀티 클래스 인지 사용자 네트워크에서 신경망을 이용한 예측 연결수락제어)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.4
    • /
    • pp.435-441
    • /
    • 2013
  • This paper proposes a neural net based-predictive connection admission control (CAC) scheme for multiclass users in wireless cognitive radio networks. We classifies cognitive users(cu) into real and non real time services, and then permit only real time services to reserve the demanded resource for spectrum handoff in guard channel for provisioning the desired QoS. Neural net is employed to predict primary user's arrival on time and demanded channels. Resource scheduling scheme is based on $C_IA$(cognitive user I complete access) shown in this paper. For keeping primary users from interference, the CAC is performed on only cognitive user not primary user. Simulation results show that our schemes can guarantee the desired QoS by cognitive real time services.

A Hybrid Cloud-P2P Architecture for Scalable Massively Multiplayer Online Games (확장가능한 대규모 멀티플레이어 온라인 게임을 위한 클라우드와 P2P 하이브리드 구조)

  • Kim, Jin-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.3
    • /
    • pp.73-81
    • /
    • 2020
  • Today's massively multiplayer online games(MMOGs) can contain millions of synchronous players scattered across the world and participating with each other within a single shared game. The increase in the number of players in MMOGs has led to some issues with the demand of server which generates a significant increase in costs for the game industry and impacts to the quality of service offered to players. In dealing with a considerable scale of MMOGs, we propose a cloud computing and peer-to-peer(P2P) hybrid architecture in this paper. Given the two nearly independent functionalities of P2P and cloud architectures, we consider the possibility of fusing these two concepts and researching the application of the resultant amalgamation in MMOGs. With an efficient and effective provisioning of resources and mapping of load, the proposed hybrid architecture relieves a lot of computational power and network traffic, the load on the servers in the cloud while exploiting the capacity of the peers. The simulation results show that MMOGs based on the proposed hybrid architecture have better performance and lower traffic received compared with MMOGs based on traditional client-server system.

A Research on the Cloud Computing Security Framework (클라우드 컴퓨팅 정보보호 프레임워크에 관한 연구)

  • kim, Jung-Duk;Lee, Seong-Il
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.6
    • /
    • pp.1277-1286
    • /
    • 2013
  • Cloud computing's unique attributes such as elasticity, rapid provisioning and releasing, resource pooling, multi-tenancy, broad-network accessibility, and ubiquity bring many benefits to cloud adopters(company and organization), but also entails specific security risks associated with the type of adopted cloud and deployment mode. To minimize those types of risk, this paper proposed cloud computing security framework refered to strategic alliance model. The cloud computing security framework has main triangles that are cloud threat, security controls, cloud stakeholders and compose of three sides that are purposefulness, accountability, transparent responsibility. Main triangles define purpose of risk minimization, appointment of stakeholders, security activity for them and three sides of framework are principles of security control in the cloud computing, provide direction of deduction for seven service packages.

Web Service Migration based on Contexts (컨텍스트에 기반한 웹 서비스 이동)

  • Kim, Yeon-Seok;Lee, Kyong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.106-116
    • /
    • 2008
  • It is difficult to provide Web services on a mobile environment because of the intermittent disconnection of a wireless network and the frequent change of context information. To resolve this, Web services must be migrate to devices, which can provide services to users seamlessly. However, researches on hosting, migrating, and replicating Web services on mobile devices are still in an early stage. This paper presents a lightweight Web service framework and an efficient method for establishing a policy of migrating Web services. Based on the WS-Policy standard, the proposed method defines a policy schema, which provides constructs for describing various kinds of contextual information. Specifically, the schema is designed to be extensible enough for different service providers to use different vocabularies to describe their policies. To show the validity, the proposed method for establishing a migration policy has been applied to our mobile Web services framework, resulting in a seamless provisioning of services.

  • PDF

A Control Platform Scheme for Seamless Service Provisioning During Handover on FMC Networks (유무선 통합망에서 핸드오버시 끊김없는 서비스 제공을 위한 제어 플랫품)

  • Maeng, Doo-Lyel;Park, Jong-Kae;Kim, Sung-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.857-866
    • /
    • 2009
  • Recently, IP mobility study of infra's common elements is undergoing processes to achieve FMC based on All-IP. Existing typical mobility technology based on IP is IETF's Mobile IP. However, it faced to limitations due to packet loss, delays when MN is moving on Mobile IP, also existing network infra - routers (FA)-needed to add/change the functions to support Mobile IP. In this paper, existing mobility problems based on IP and the suggested improvements for platforms which support mobility, quality, security are proposed. It discusses the performance on the current existing IP infrastructure derived from simulation analysis on mobility packet loss and delay. From the resulting data, improvements will also be outlined for optimal performance.

Analysis on the upper bound of strong Roman-domination in grid networks (그리드 네트워크의 강한 Roman 지배수 상계에 대한 해석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.8
    • /
    • pp.1114-1122
    • /
    • 2018
  • In this paper, we propose a theoretical framework for provisioning marginal resources in wired and wireless computer networks which include Internet. In more detail, we propose a mathematical model for the upper bounds of marginal capacity in grid networks, where the resource is designed a priori by normal traffic estimation and marginal resource is prepared for unexpected events such as natural disasters and abrupt flash crowd in public affairs. To be specific, we propose a method to evaluate an upper bound for minimum marginal capacity for an arbitrary grid topology using the concept of a strong Roman domination number. To that purpose, we introduce a graph theory to model and analyze the characteristics of general grid structure networks. After that we propose a new tight upper bound for the strong Roman domination number. Via a numerical example, we show the validity of the proposition.