• Title/Summary/Keyword: Resource provisioning

Search Result 115, Processing Time 0.028 seconds

Survey on the Performance Enhancement in Serverless Computing: Current and Future Directions (성능 향상을 위한 서버리스 컴퓨팅 동향과 발전 방향)

  • Eunyoung Lee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.2
    • /
    • pp.60-75
    • /
    • 2024
  • The demand of users, who want to focus on the core functionality of their applications without having to manage complex virtual environments in the cloud environment, has created a new computing model called serverless computing. Within the serverless paradigm, resource provisioning and server administration tasks are delegated to cloud services, facilitating application development exclusively focused on program logic. Serverless computing has upgraded the utilization of cloud computing by reducing the burden on cloud service users, and it is expected to become the basic model of cloud computing in the future. A serverless platform is responsible for managing the cloud virtual environment on behalf of users, and it is also responsible for executing serverless functions that compose applications in the cloud environment. Considering the characteristics of serverless computing in which users are billed in proportion to the resources used, the efficiency of the serverless platform is a very important factor for both users and service providers. This paper aims to identify various factors that affect the performance of serverless computing and analyze the latest research trends related to it. Drawing upon the analysis, the future directions for serverless computing that address key challenges and opportunities in serverless computing are proposed.

Quality of Service Parameters Estimation Model for Adaptive Bandwidth Service in Mobile Cellular Networks (적응형 서비스를 제공하는 이동통신망에서의 서비스 품질 척도 추정 모델)

  • Jung, Sung Hwan;Hong, Jung Wan;Lie, Chang Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.1
    • /
    • pp.153-163
    • /
    • 2007
  • An adaptive framework paradigm where the bandwidth values of the ongoing calls vary according to the trafficsituations is one of the promising concepts for overcoming poor resource conditions due to handoffs in mobilecellular networks. However, quantifying the level of bandwidth degradation of the ongoing calls in an adaptiveframework is important in view of Quality of Service (QoS) Provisioning. Therefore we introduce new QoSparameters, the Degradation Degree Ratio (DDR), which represents the average portion of the degradationdegree during degradation pehod of a call, and the Degradation Area Ratio (DAR), which represents the averageratio of a call's degradation level considering both the period and the degree of degradation jointly in multi-levelbandwidth service. We also develop a new analytical model for estimating the QoS measures such as theDegradation Pehod Ratio (DPR), DDR and DAR. We show how to calculate the QoS measures and illustrate themethod by numerical examples. The proposed model can be used to determine the optimal parameter of theCAC scheme and analyze the sensitivity ofthe QoS parameters in adaptive networks.

Determination of Optimal Cell Capacity for Initial Cell Planning in Wireless Cellular Networks

  • Hwang, Young-Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • v.2 no.2
    • /
    • pp.88-94
    • /
    • 2006
  • In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

Estimating Position of Mobiles by Multi-Criteria Decision Making (다기준 의사 결정을 이용한 이동체 위치 추정)

  • Kim, Jung-Eun;Kang, Il-Go;Lee, Jong-Chan;Lee, Yang-Weon;Oh, Jae-Chul
    • Journal of Internet Computing and Services
    • /
    • v.6 no.5
    • /
    • pp.167-175
    • /
    • 2005
  • In the microcell or picocell-based system the frequent movements of mobiles bring about excessive traffics Into the networks. A mobile location estimation mechanism can facilitate both efficient resource allocation and better QoS provisioning through handoff optimization. Existing location estimation schemes consider only LOS model and have poor performance in presence of multi-path and shadowing. In this paper we study multi-criteria decision making which can increase estimation accuracy by considering other multiple decision parameters than the received signal strength.

  • PDF

A game theory approach for efficient power control and interference management in two-tier femtocell networks based on local gain

  • Al-Gumaei, Y. A.;Noordin, K. A.;Reza, A. W.;Dimyati, K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2530-2547
    • /
    • 2015
  • In the recent years, femtocell technology has received a considerable attention due to the ability to provide an efficient indoor wireless coverage as well as enhanced capacity. However, under the spectrum sharing between femtocell user equipment (FUEs) and the owner of spectrum macrocell user equipment (MUEs), both may experience higher uplink interference to each other. This paper proposes a novel distributed power control algorithm for the interference management in two-tier femtocell networks. Due to the assignment of licensed radio frequency to the outdoor macrocell users, the access priority of MUEs should be higher than FUEs. In addition, the quality of service (QoS) of MUEs that is expressed in the target signal-to-interference-plus-noise ratio (SINR) must always be achieved. On the other hand, we consider an efficient QoS provisioning cost function for the low-tier FUEs. The proposed algorithm requires only local information and converges even in cases where the frontiers of available power serve the target SINRs impossible. The advantage of the algorithm is the ability to implement in a distributed manner. Simulation results show that the proposed algorithm based on our cost function provides effective resource allocation and substantial power saving as compared to the traditional algorithms.

An Intelligent Handover Scheme for the Next Generation Personal Communication Systems

  • Ming-Hui;Kuang, Eric-Hsiao;Chao-Hsu
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.245-257
    • /
    • 2004
  • Driven by the growing number of the mobile subscribers, efficient channel resource management plays a key role for provisioning multimedia service in the next generation personal communication systems. To reuse limited channel resources, diminishing the coverage areas of cells seems to be the ultimate solution. Thus, however, causes more handover events. To provide seamless connection environment for mobile terminals and applications, this article presents a novel handover scheme called the intelligent channel reservation (ICR) scheme, which exploits the location prediction technologies to accurately reserve channel resources for handover connections. Considering the fact that each mobile terminal has its individual mobility characteristic, the ICR scheme utilizes a channel reserving notification procedure (CRNP) to collect adequate parameters for predicting the future location of individual mobile terminals. These parameters will be utilized by the handover prediction function to estimate the expected handover blocking rate and the expected number of idle channels. Based on the handover prediction estimations, a cost function for calculating the damages from blocking the handover connections and idling channel resources, and a corresponding algorithm for minimizing the cost function are proposed. In addition, a guard channel decision maker (GCDM) determines the appropriate number of guard channels. The experimental results show that the ICR scheme does reduce the handover-blocking rate while keeping the number of idle channels small.

Bayes Rule for MAC State Sojourn Time Supporting Packet Data Service in CDMA Wireless Celluar Networks

  • Park, Cheon-Won;Kim, Dong-Joon;Shin, Woo-Cheol;Ju, Jee-Hwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1606-1609
    • /
    • 2002
  • MAC state models appeared with an effort to overcome technical demerits of CDMA in provisioning packet data service. In the scenario of sojourn and transition on MAC states, the design of state sojourn time is a critical issue for an efficient utilization of limited recource; a longer sojourn time leads to more resource being preserved for inactive stations, while more connection components should be recovered with a shorter sojourn time. Thus, the sojourn time at each MAC state must be optimized in consideration of these two conflicting arguments. In this paper, we first present a generic MAC state model. Secondly, based on the generic model, we reveal a relation of inactive period and the delay time of the last packet served in pre- ceding active period and specify a loss function reflect-ing two antinomic features that result from a change of state sojourn time. Using the proposed loss function, we construct a decision problem to find an optima3 rule for state sojourn times. Finally, we present a way of computing Bayes rule by use of the posterior distribution of inactivity duration for given observation on the delay time of last packet. Furthermore, Bayes rules are explicitly expressed for special arrival processes and investigated with respect to traffic load and loss parameters.

  • PDF

Scalable Service Placement in the Fog Computing Environment for the IoT-Based Smart City

  • Choi, Jonghwa;Ahn, Sanghyun
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.440-448
    • /
    • 2019
  • The Internet of Things (IoT) is one of the main enablers for situation awareness needed in accomplishing smart cities. IoT devices, especially for monitoring purposes, have stringent timing requirements which may not be met by cloud computing. This deficiency of cloud computing can be overcome by fog computing for which fog nodes are placed close to IoT devices. Because of low capabilities of fog nodes compared to cloud data centers, fog nodes may not be deployed with all the services required by IoT devices. Thus, in this article, we focus on the issue of fog service placement and present the recent research trends in this issue. Most of the literature on fog service placement deals with determining an appropriate fog node satisfying the various requirements like delay from the perspective of one or more service requests. In this article, we aim to effectively place fog services in accordance with the pre-obtained service demands, which may have been collected during the prior time interval, instead of on-demand service placement for one or more service requests. The concept of the logical fog network is newly presented for the sake of the scalability of fog service placement in a large-scale smart city. The logical fog network is formed in a tree topology rooted at the cloud data center. Based on the logical fog network, a service placement approach is proposed so that services can be placed on fog nodes in a resource-effective way.

Flow Handover Management Scheme based on QoS in SDN Considering IoT (IoT를 고려한 SDN에서 QoS 기반 플로우 핸드오버 관리 방법)

  • Kyung, Yeun-Woong;Kim, Tae-Kook
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.2
    • /
    • pp.45-50
    • /
    • 2020
  • In this paper, we propose a QoS-based handover management scheme in SDN. Even though there have been lots of recent services such as IoT, the conventional networks provide a monolitic handover method without considerations on flow-specific QoS features. For example, the conventional Internet provides a handover method which only considers IP continuity. On the other hand, 4G and 5G networks use a strict handover method for all kinds of flows with resource reservations. This means that it is difficult to guarantee the QoS requirements for the flow with a strict QoS requirement in Internet and the inefficient resource utilization can occur in the 4G and 5G because of the strict QoS-based handover management. The proposed scheme proposes the flow handover management scheme based on QoS requirements according to the SDN controller's management. From the network operators' perspective, the proposed scheme can provide the efficient resource utilization as well as QoS provisioning.

Advance Reservation Framework with Protection Management for Virtual Circuit Services (가상회선 서비스를 위해 보호 관리 기능을 갖는 사전 예약 프레임워크)

  • Lim, Huhnkuk;Lee, Kyungmin;Cha, Youngwook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.902-910
    • /
    • 2013
  • The most representative research network in Korea, KREONET, has developed DynamicKL, an advance reservation based Network Service Agent (NSA) for user driven virtual circuit services. DynamicKL provides reservation, provisioning, release, termination, and inquiry web services for network resources by using an open standard network service interface (NSI), as well as web services for network resources by using a GUI interface. In addition, it has the RICE interface to support a protection management function per VC for virtual circuits and reservations. In this article, a protection management per VC for provisioned VCs and reservations is addressed in the DynamicKL framework, as a contribution to the VC protection management issue, which results in more manageable and reliable VC services compared to other advance reservation frameworks. An administrator can detect successful or unsuccessful VC protections in the event of a primary link failure and successful or unsuccessful VC retrievals after a primary link repair, by using RICE.