• 제목/요약/키워드: Resource management scheme

Search Result 313, Processing Time 0.023 seconds

ECPS: Efficient Cloud Processing Scheme for Massive Contents (클라우드 환경에서 대규모 콘텐츠를 위한 효율적인 자원처리 기법)

  • Na, Moon-Sung;Kim, Seung-Hoon;Lee, Jae-Dong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.4
    • /
    • pp.17-27
    • /
    • 2010
  • Major IT vendors expect that cloud computing technology makes it possible to reduce the contents service cycle, speed up application deployment and skip the installation process, reducing operational costs, proactive management etc. However, cloud computing environment for massive content service solutions requires high-performance data processing to reduce the time of data processing and analysis. In this study, Efficient_Cloud_Processing_Scheme(ECPS) is proposed for allocation of resources for massive content services. For high-performance services, optimized resource allocation plan is presented using MapReduce programming techniques and association rules that is used to detect hidden patterns in data mining, based on levels of Hadoop platform(Infrastructure as a service). The proposed ECPS has brought more than 20% improvement in performance and speed compared to the traditional methods.

A Service Discovery Scheme Based on NAPTR Resource Record (NAPTR 자원레코드 기반의 서비스 탐색기법)

  • 권성호;김희철
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.3
    • /
    • pp.69-75
    • /
    • 2003
  • NAPRT(Naming Authority Pointer) is a type of resource record specified in IETF RFC 2915. NAPTR enables to register various services in the Domain Name Systems and thus provides a way to discover services available on specific hosts. This paper describes the design and implementation of a Proxy DNS system aimed at supporting NAPTRs. The goal of this work is to study on the feasibility of the service discovery registered in DNS via NAPTR records and provides the result for simplicity and extensibility of implementation through the implementation of a actual Test-bed system This research result can be applied to service discovery in the resource information management for high performance GRE environments as well as to the implementation of DNS infrastructure for the ENUM.

  • PDF

Modular approach to Petri net modeling of flexible assembly system

  • Park, T.K.;Choi, B.K.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1992.04b
    • /
    • pp.436-443
    • /
    • 1992
  • Presented in the paper is a systematic approach to constructing a Petri net model of FAS (flexible assembly system). Petri net is widely used in modeling automated manufacturing systems. But, it found to be very difficult for an FA engineer to build a correct model of an FAS with Petri net symbols (ie, place, transition, and token) from the beginning. An automated manufacturing system in general is built from a set of "standard" hardware components. An FAS in particular is usually composed of assembly robots, work tables, conveyor lines, buffer storages, part feeders, etc. In the proposed modeling scheme, each type of standard resources is represented as a standard "module" which is a sub Petri net. Then, the model of a FAS can be conveniently constructed using the predefined modules the same way the FAS itself is built from the standard components. The network representation of a FAS is termed a JR-net (job resource relation net) which is easy to construct. This JR net is then mechanically converted to a formal Petri net (to simulate the behavior of the FAS). The proposed modeling scheme may easily be extended to the modeling of other types of automated manufacturing systems such as FMS and AS/RS.ch as FMS and AS/RS.

  • PDF

A Data Aggregation Scheme based on Designated Path for Efficient Energy Management of Sensor Nodes in Geosensor Networks (지오센서 네트워크에서 센서 노드의 효율적인 에너지 관리를 위한 지정 경로 기반 데이터 집계 처리 기법)

  • Yoon, Min;Kim, Yong-Ki;Bista, Rabindra;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.12 no.1
    • /
    • pp.10-17
    • /
    • 2010
  • Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).

Design and Verification of Flow Mobility Scheme tn the AIMS System (AIMS 시스템에서 플로우 이동성 기법의 설계와 검증)

  • Lee, Sung-Kuen;Lee, Kyoung-Hee;Min, Sung-Gi;Lee, Hyo-Beom;Lee, Hyun-Woo;Han, Youn-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.760-770
    • /
    • 2011
  • The existing mobility management schemes do not fully support the next generation network, which is composed of IP-based core network and various access networks. Currently, ETRI has been developing the AIMS (Access Independent Mobility Service) system which satisfies the ITU-T requirements of mobility management in the next generation network. The AIMS system is designed to provide a mobile host with a fast and reliable mobility service among heterogeneous access networks. Recently, many user devices have multiple communication interfaces, e.g., 3G and WLAN, and thus they can make two or more network connections at the same time. In this paper, we design a scheme of flow mobility, i.e., the movement of selected data flows from one access technology to another, to be applied in the AIMS system, and verify the proposed scheme through the NS-3 simulation study. From the simulation results, we can know that the proposed flow mobility scheme can utilize the network resource efficiently in the heterogeneous mobile networks.

Fast Micro-mobility Management Scheme without DAD Session in HMIPv6 Networks (계층적 Mobile IPv6 기반의 빠른 Micromobility 관리 프로토콜)

  • Lee, Sung-Kuen;Kim, Eal-Lae;Lim, Tae-Hyung;Jeong, Seok-Jong;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7A
    • /
    • pp.746-754
    • /
    • 2007
  • In this paper, we propose a fast handoff algorithm for micromobility management enhancement in HMIPv6 networks, which eliminates the DAD procedure involved in the regular HMIPv6 in order to o decrease handoff latency and increase the resource utilization efficiency. In the proposed scheme, the MAP is designed to guarantee the uniqueness of MN's interface identifier within a MAP domain as long as the MN moves in a MAP domain, so that the MN configures the new address without the DAD procedure resulting in the decreased handoff latency significantly When the MN resides in a subnet, MIPv6 is used adaptively as a mobility management protocol, which is to reduce bandwidth waste from the IP packet header overhead of IP-in-IP tunneling from the regular HMIPv6. We evaluate the performance of the proposed handoff micromobility algorithm in terms of handoff delay and packet loss thru computer simulation. Thru various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes, MIPv6 and HMIPv6.

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.

An Efficient Memory Allocation Scheme for Space Constrained Sensor Operating Systems (공간 제약적인 센서 운영체제를 위한 효율적인 메모리 할당 기법)

  • Yi Sang-Ho;Min Hong;Heo Jun-Youg;Cho Yoo-Kun;Hong Ji-Man
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.626-633
    • /
    • 2006
  • The wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Sensor operating systems that run on tiny sensor nodes are the key to the performance of the distributed computing environment for the wireless sensor networks. Therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. In this paper, we present an efficient memory allocation scheme to improve the time and space efficiency of memory management for the sensor operating systems. Our experimental results show that the proposed scheme performs efficiently in both time and space compared with existing memory allocation mechanisms.

Analysis of CO2 Reduction effected by GHG·Energy Target Management System (TMS) and Korea Emissions Trading Scheme (ETS) (온실가스·에너지 목표관리제 및 배출권거래제 대상 기업의 명세서를 이용한 온실가스 감축 실적 분석)

  • Lee, Serim;Cho, Yongsung;Lee, Sue Kyoung
    • Journal of Climate Change Research
    • /
    • v.8 no.3
    • /
    • pp.221-230
    • /
    • 2017
  • There are two main policies to meet the national goal of reducing Greenhouse Gases (GHGs) emissions in Korea towards Paris Agreement. From 2012 to 2014, Target Management System (TMS) was operated and the Emissions Trading Scheme (ETS) has been established since 2015. To compare the impact of TMS and ETS on reducing GHGs, we collected annual GHGs emission reports submitted by individual business entities, and normalized them using a z-variant normalized function. In order to evaluate the impact of those policies, we calculated the amount of GHGs emissions of 73 business entities from 15 business sectors. Those entities emitted $508million\;CO_2eq$, which is 74% of total national GHGs emissions in 2014. The main results of analysis indicate that accumulated GHGs emissions during the period 2012 to 2014 affected by TMS was higher than the national goal of GHGs emission reduction, and only the GHGs emissions in 2014 were in the range of allowed GHGs emissions, set by the Government. In 2015, when ETS initiated, total GHGs emission trading was $4.84million\;tCO_2eq$, which is only 0.9% of total allowance in 2015. However, more than 50% of business entities, who got the allowance of GHGs emission given by the Government, met the goal of GHGs emissions. Particularly, 27 of 73 business entities reduced GHGs more under the ETS rather than the TMS. Even though we analyzed only 4 years' data to demonstrate the impact of TMS and ETS, it is expected to commit the national goal of GHGs reduction target by TMS and ETS.

Design of Integrated Management System for Electronic Library Based on SaaS and Web Standard

  • Lee, Jong-Hoon;Min, Byung-Won;Oh, Yong-Sun
    • International Journal of Contents
    • /
    • v.11 no.1
    • /
    • pp.41-51
    • /
    • 2015
  • Management systems for electronic library have been developed on the basis of Client/Server or ASP framework in domestic market for a long time. Therefore, both service provider and user suffer from their high cost and effort in management, maintenance, and repairing of software as well as hardware. Recently in addition, mobile devices like smartphone and tablet PC are frequently used as terminal devices to access computers through the Internet or other networks, sophisticatedly customized or personalized interface for n-screen service became more important issue these days. In this paper, we propose a new scheme of integrated management system for electronic library based on SaaS and Web Standard. We design and implement the proposed scheme applying Electronic Cabinet Guidelines for Web Standard and Universal Code System. Hosted application management style and software on demand style service models based on SaaS are basically applied to develop the management system. Moreover, a newly improved concept of duplication check algorithm in a hierarchical evaluation process is presented and a personalized interface based on web standard is applied to implement the system. Algorithms of duplication check for journal, volume/number, and paper are hierarchically presented with their logic flows. Total framework of our development obeys the standard feature of Electronic Cabinet Guidelines offered by Korea government so that we can accomplish standard of application software, quality improvement of total software, and reusability extension. Scope of our development includes core services of library automation system such as acquisition, list-up, loan-and-return, and their related services. We focus on interoperation compatibility between elementary sub-systems throughout complex network and structural features. Reanalyzing and standardizing each part of the system under the concept on the cloud of service, we construct an integrated development environment for generating, test, operation, and maintenance. Finally, performance analyses are performed about resource usability of server, memory amount used, and response time of server etc. As a result of measurements fulfilled over 5 times at different test points and using different data, the average response time is about 62.9 seconds for 100 clients, which takes about 0.629 seconds per client on the average. We can expect this result makes it possible to operate the system in real-time level proof. Resource usability and memory occupation are also good and moderate comparing to the conventional systems. As total verification tests, we present a simple proof to obey Electronic Cabinet Guidelines and a record of TTA authentication test for topics about SaaS maturity, performance, and application program features.