• Journal of the Korea Society of Computer and Information
• /
• v.29 no.9
• /
• pp.115-123
• /
• 2024

This paper proposes a method to reduce the delay time caused by control message conflicts in VADAMA (Virtual Allocation Demand Assigned Multiple Access) technology, which is a virtual allocation based on-demand multiple access technology in MF-TDMA (Multi-Frequency Time Division Multiple Access) satellite network. Traditionally, satellite networks have had the problem that all network transmissions have long delay times due to control messages. In this study, in order to improve the delay time caused by terminal control message conflicts in VADAMA technology, the concept of virtual allocation is used to reduce the delay time. VADAMA-PTR (VADAMA Periodic Transmission) divides all terminals into subnets and transmits control. The method is proposed, and the performance analysis of the existing DAMA technology, delay time and data processing rate is performed using Matlab. The results show that the performance is improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.5
• /
• pp.443-450
• /
• 2013

We consider user pairing and resource allocation for the uplink of cellular systems employing virtual multiple input multiple output (MIMO). As a multiple access scheme, discrete Fourier transform spread orthogonal frequency division multiple access (DFTS-OFDMA) is adopted for more flexible resource allocation than single carrier (SC)-OFDMA adopted in the Long Term Evolution (LTE) system. We formulate the optimization problems of user pairing and resource allocation to maximize the throughput of the DFTS-OFDMA system under different constraints. The DFTS-OFDMA allowing non-contiguous subcarrier allocation and redundant user assignment provides a better throughput than the SC-FDMA at lower complexity in finding the optimal solution but at the cost of the increased control information indicating the allocated resources.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.167-170
• /
• 2006

Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W $N^3$) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W $N^2$) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.137-148
• /
• 2012

Cloud service users request dedicated virtual computing resource from the cloud service provider to process jobs in independent environment from other users. To optimize this process with automated method, in this paper we proposed a framework for workflow scheduling in the cloud environment, in which the core component is the middleware called broker mediating the interaction between users and cloud service providers. To process jobs in on-demand and virtualized resources from cloud service providers, many papers propose scheduling algorithms that allocate jobs to virtual machines which are dedicated to one machine one job. With this method, the isolation of being processed jobs is guaranteed, but we can't use each resource to its fullest computing capacity with high efficiency in resource utilization. This paper therefore proposed a cost-efficient job scheduling algorithm which maximizes the utilization of managed resources with increasing the degree of multiprogramming to reduce the number of needed virtual machines; consequently we can save the cost for processing requests. We also consider the performance degradation in proposed scheme with thrashing and context switching. By evaluating the experimental results, we have shown that the proposed scheme has better cost-performance feature compared to an existing scheme.

• Survey Research
• /
• v.7 no.2
• /
• pp.39-52
• /
• 2006

Most of Korean survey institutions adopt quota sampling for telephone surveys based on region, gender and age-band. In weekdays, it is well blown that there exist substantial differences in day time in-house rate by individual's socio-demographic attributes. So, quota sampling may induce systematic respondent selection bias. To solve the problem, we propose "time-balanced quota sampling" in which interviewer's call time-band is added as an quota variable. Furthermore, we propose "time-balanced quasi-quota sampling" which is derived by partially relaxing evening time quotas in time-balanced quota sampling. We compare the conventional and the newly proposed quota sampling schemes by drawing Monte Carlo samples from the hypothetical population for which the Korea 2004 time use survey data is assumed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.06a
• /
• pp.953-956
• /
• 1998

• Annual Conference of KIPS
• /
• 2013.05a
• /
• pp.123-124
• /
• 2013

비용대비 작업 처리의 효율을 위해서는 사용자들의 작업 요구사항에 적절한 자원을 선택하고 요구 작업을 적절한 할당된 자원에 스케쥴링하는 플랫폼이 필수적이다. 또한 이러한 플랫폼은 사용자의 SLA 에 따라 작업 처리 기한 안에 요구 비용 이내로 작업을 처리할 수 있도록 결정을 내릴 수 있어야 하고 요구 작업량의 변화에 따라 즉각 대응을 하기 위하여 실시간적인 결정을 내릴 수 있어야 한다. 이러한 복잡한 결정 사항들을 최적 판단으로 대신 처리해주는 미들웨어로 클라우드 자원 브로커 시스템을 사용할 수 있다. 클라우드 자원 브로커 시스템은 작업 스케쥴링과 자원 프로비저닝 등이 가격, 처리시간에 중요한 선택 및 수행을 한다. 기존의 많은 논문들에서의 작업 스케줄링은 다중 테넌트 정책의 클라우드가 제공하는 사용자들간의 가상 머신 독립에 초점을 두어 하나의 가상 머신이 하나의 작업에 한정되도록 처리하는 방식이었다. 이는 병렬화의 정도가 낮은 어플리케이션의 경우 시스템 활용률이 낮아 자원 활용율이 떨어진다. 이를 다수의 작업을 멀티 태스킹, 멀티 스레드의 방법으로 하나의 가상 머신에서 처리하도록 하여 스레드 레벨 병렬화의 이점을 이용해 자원 이용률을 높임으로 효율을 높이고자 한다.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.439-448
• /
• 2017

The workloads of large high-performance computing (HPC) scientific applications are steadily becoming "bursty" due to variable resource demands throughout their execution life-cycles. However, the over-provisioning of virtual resources for optimal performance during execution remains a key challenge in the scheduling of scientific HPC applications. While over-provisioning of virtual resources guarantees peak performance of scientific application in virtualized environments, it results in increased amounts of idle resources that are unavailable for use by other applications. Herein, we proposed a memory resource reconfiguration approach that allows the quick release of idle memory resources for new applications in OS-level virtualized systems, based on the applications resource-usage pattern profile data. We deployed a scientific workflow application in Docker, a light-weight OS-level virtualized system. In the proposed approach, memory allocation is fine-tuned to containers at each stage of the workflows execution life-cycle. Thus, overall memory resource utilization is improved.

• Smart Media Journal
• /
• v.12 no.11
• /
• pp.113-124
• /
• 2023

With the advent of 5G and B5G (Beyond 5G) networks, network virtualization technology that can overcome the limitations of existing networks is attracting attention. The purpose of network virtualization is to provide solutions for efficient network resource utilization and various services. Existing heuristic-based VNE (Virtual Network Embedding) techniques have been studied, but the flexibility is limited. Therefore, in this paper, we propose a GNN-based network slicing classification scheme to meet various service requirements and a RL-based VNE scheme for optimal resource allocation. The proposed method performs optimal VNE using an Actor-Critic network. Finally, to evaluate the performance of the proposed technique, we compare it with Node Rank, MCST-VNE, and GCN-VNE techniques. Through performance analysis, it was shown that the GNN and RL-based VNE techniques are better than the existing techniques in terms of acceptance rate and resource efficiency.

• Annual Conference of KIPS
• /
• 2014.11a
• /
• pp.26-29
• /
• 2014

가상 데스크탑 서비스 사용자는 데스크탑이나 다양한 모바일 기기를 이용해 할당 받은 계정으로 인증하고 로그인하면 언제 어디서든 인터넷용 가상화 PC 또는 업무용 가상화 PC 를 자신만의 가상 데스크탑처럼 사용할 수 있다. 이러한 가상 데스크탑 서비스가 대중화됨에 따라 라이선스 및 구축 비용, 서비스의 최적화와 같은 사항을 만족시키는 대규모 플랫폼 가상화 기술이 요구된다. 본 논문에서는 클라우드 인프라 상에서 가상 플랫폼을 대규모의 모바일 및 경량 단말 사용자에게 네트워크를 통해 끊김없이 전송하는 빅 가상 플랫폼 인프라 시스템을 설계 및 구현한다.