• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.33 no.4
• /
• pp.73-92
• /
• 2022

This study intends to design a model that can effectively service policy data necessary for the implementation of new national agenda in order to provide high-quality policy information services that go beyond those of the existing Policy Information Portal (POINT) of National Sejong Library. To this end, it was determined that providing an integrated search environment, in lieu of data search through individual access, was necessary. Subsequently, four possible models for a national agenda service model were presented. First, designing a computerized system for both interface and electronic information source aspects was proposed for the national agenda service system operation. Second, designing the Linked Open Data system and the time-series service system for national policy information, providing the translation service of overseas original data, and securing the researcher's desired data were presented for the national agenda service information source operation. Third, strengthening public relations for policy users, building and promoting the site brand, operating SNS channels, and reinforcing the activation of auxiliary materials and the accessibility of external services were proposed for public relations of national agenda service. Fourth, expanding the information network with Open API, cloud service, and overseas libraries was proposed for collaborating and cooperating with the agenda service.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.943-952
• /
• 2005

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to users' requests within a specified domain whereas the proposed caching policy runs by utilizing a number of users' requests across several domains. So, the proposed policy is applicable to random requests in mobile environments. Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit: object or segment. The result of performance evaluation tells that segment sizes, ratio of users' mobility and weights are major factors for the efficient operation of the cooperative caching.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.691-700
• /
• 2004

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to user's requests within a specified domain whereas the proposed caching policy runs by utilizing a number of user's requests across several domains. So, the proposed policy is applicable to random requests in mobile environments Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit object or segment. The result of performance analyze tells what a ratio of user's mobility is are major factors for the efficient operation of the cooperative caching.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.59-75
• /
• 2006

In this paper, we propose a congestion control scheme to control the congestion due to the mobility of ubiquitous devices on ubiquitous computing environment. Especially, this congestion control scheme provides a reverse congestion avoidance state which can classify between packet error by features of wireless network and packet dropping by congestion. Also, it provides a slow stop state which can minimize bandwidth waste due to congestion control. The proposed congestion control scheme controls more adaptive than existing congestion control schemes. The proposed congestion control scheme is designed based on DCCP(Datagram Congestion Control Protocol) being proposed by IETF(Internet Engineering Task Force) and implemented on the Linux kernel. In simulation results, the proposed congestion control scheme provides good bandwidth throughput in wireless network as well as in wired network.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.2
• /
• pp.49-61
• /
• 2017

Transactional Memory (TM) has greatly changed the parallel programming paradigm for transaction processing and is classified into STM, HTM, HyTM according to hardware or software frameworks. However, the existing studies have a problem that they provide static retry policy for all workloads. To solve the problems, we propose an hybrid transactional memory scheme using sampling-based adaptive retry policy in multi-core environment. First, the proposed scheme determines whether to use STM or HTM according to the characteristic of a transaction. Otherwise, it executes HTM and STM concurrently by using a bloom filter. Second, the proposed scheme provides adaptive retry policy for HTM according to the characteristic of transactions in each workload. Finally, through the experimental performance evaluation using STAMP, the proposed scheme shows 10~20% better performance than the existing schemes.

• Journal of Digital Contents Society
• /
• v.12 no.2
• /
• pp.141-150
• /
• 2011

Recently the Solid State Drive (SSD) is widely used for storage system of various mobile devices. In this case, existing buffer replacement algorithms based on the hard disk do not consider characteristics of flash memory, so it caused performance degradation of the system. This paper proposes a novel buffer replacement policy called ABM (Asymmetric Buffer Management) policy. ABM policy separates read and write buffer space and applies different replacement unit and replacement algorithm for each buffer. In addition, write buffer delay scheme and dynamic size adaptation algorithm is applied for better performance. ABM outperforms other replacement policies, especially ABM-LRU-CLC shows 32% better performance than normal LRU policy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.13-18
• /
• 2023

As the number of mobile applications increases rapidly, the overhead of swapping in smartphone memory systems keeps increasing. Unlike desktop or server systems, the basic setting of smartphones does not support swapping, so applications are killed when available memory is exhausted. This is because swapping in smartphones incurs excessive storage I/O overhead. In this article, we propose a swapping policy for smartphones, which significantly reduces storage I/Os. The proposed policy categorizes mobile applications based on their functional characteristics, and controls the number of applications to be swapped based on application priorities and memory situations. Measurement experiments with Android reference devices show that the proposed swapping policy dramatically reduces the overhead of swapping in various mobile applications.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.887-890
• /
• 2001

최근 인터넷 이용의 확산으로 도메인의 크기와 규모가 방대해짐에 따라 정보시스템의 관리는 더욱더 복잡해졌다. 또한, 개별적인 네트워크 기술의 개발과 운용으로 인해 시스템간의 정보 공유와 정보 보안 정책의 일관성과 정책 표현 기법의 공동화가 어렵게 되자, 체계적이고 일관된 네트워크 보안과 정책 적용에 대한 요구가 증대 되었다. 이러한 정책적용과 관리상의 문제점들을 해결하기 위해 이 논문에서는 유연성을 갖추면서, 일관된 정책을 집행한 수 있는 정책관리의 구조와 속성을 설계하고 정책상속을 이용한 계층화된 정책 관리모델을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.350-352
• /
• 2003

일반적인 접근제어 모델이 메커니즘 내에 보안 정책을 미리 설계함에 따라 보안 요구사항의 추가나 변경에 어려움이 있는 반면에, 다중 접근제어 정책 모델은 기업 환경에 필요한 다양한 보안 정책들을 융통성 있게 지원하기 위해, 권한 명세 언어를 기반으로 positive/negative 권한을 모두 표현할 뿐만 아니라, 권한의 예외적 수행, 권한의 전파와 충돌 해결 정책 등을 구현함으로써, 접근제어의 권한 적용에 유연성을 강화하였다. 그러나, 기존의 권한 전파 및 충돌 해결 정책은 권한 전파의 모든 가능한 path를 고려하지 않거나, 충돌 문제를 해결하지 않는 부분이 있는데, 이것은 특히 서로 다른 정책의 어플리케이션 통합 환경에서 권한의 남용이나 상실 등 의도하지 않은 부당한 권한의 실행을 야기시킨다. 따라서, 본 논문에서는 다수의 정책의 영향을 받은 주체에 대해서 권한의 독립적 수행을 보장하면서, 추가적인 충돌 상황을 발생시키기 않는 권한 전파 정책을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.1084-1088
• /
• 2000

현재 인터넷에서 QoS(Quality of Service )를 보장하기 위해 다양한 메커니즘이 제안되고 있다. 통신망에서 QoS를 지원하기 위해서는 해당 응용 서비스마다 적절한 자원을 할당하고 자원 사용을 모니터링 및 제어하며, 이례적인 사건이 발생하였을 경우 자원을 재할당할 수 있도록 지원하는 자원관리 기능이 요구된다. 본 논문에서는 차등서비스를 제공하는 인터넷에서 QoS를 제공하기 위해 망자원을 관리 및 제어하는 정책기반 자원관리시스템의 설계 및 구현에 대해 기술한다. 정책기반 자원관리 시스템은 도메인 내의 사용자나 망 관리자로부터 QoS 요구를 받으면 도메인 내의 자원사용량과 자원사용정책에 따라서 내부자원을 할당하고, 이웃도메인과는 QoS가 보장되도록 SLA(Service Level Agreement)를 체결하는 기능을 수행한다. 구현한 정책기반 자원관리시스템은 정책정보를 PIB(Policy Information Base)의 형태로 정책 데이터베이스에 저장하며, 정책서버와 정책 클라이언트 사이에는COPS(Common Open Policy Service)프로토콜을 사용하여 정책 정보를 송수신함을 특징으로 한다.