• Journal of Information Technology Services
• /
• v.22 no.6
• /
• pp.1-15
• /
• 2023

This study compares and analyzes the legal systems of Korea, the European Union, China, and the United States based on the disclosure principles and processing policies for personal data processing and provides references for seeking improvements in our legal system. Furthermore, this research aims to suggest institutional implications to overcome data transfer limitations in the upcoming digital economy. Findings on a comparative analysis of the relevant legal systems for disclosing privacy policies in four countries showed that Korea's privacy policy is under the eight principles of privacy proposed by the OECD. However, there are limitations in the current situation where personal information is increasingly transferred overseas due to direct international trade e-commerce. On the other hand, the European Union enacted the General Data Protection Regulation (GDPR) in 2016 and emphasized the transfer of personal information under the Privacy Policy. China also showed differences in the inclusion of required items in its privacy policy based on its values and principles regarding transferring personal information and handling sensitive information. The U.S. CPRA amended §1798.135 of the CCPA to add a section on the processing of sensitive information, requiring companies to disclose how they limit the use of sensitive information and limit the use of such data, thereby strengthening the protection of data providers' rights to sensitive information. Thus, we should review our privacy policies to specify detailed standards for the privacy policy items required by data providers in the era of digital economy and digital commerce. In addition, privacy-related organizations and stakeholders should analyze the legal systems and items related to the principles of personal data disclosure and privacy policies in major countries so that personal data providers can be more conveniently and accurately informed about processing their personal information.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.289-300
• /
• 2005

This paper proposed an analytical framework to compare and model the policy-based network management; centralized and distributed typed model. Policy-based network is introduced in various application fields, and a policy framework can offer different processing performance according to application. Therefore, we evaluated the performance and extensibility of each PBNM model when we apply the policy process to the models. The evaluated measurement metrics are policy provisioning time, traffic occurrence amount, PDP processing rate, and global conflict detection in qualitative simulation. The results show that the suitable structure is required according to the analysis for the careful application characteristics, when PBNM is adopted. The modeling framework presented in this paper is intended to quantify the merits and demerits among the currently suggested PBNM models.

• Journal of Information Processing Systems
• /
• v.4 no.3
• /
• pp.103-112
• /
• 2008

This paper proposes a policy adjuster-driven Grid workflow management system for collaborative healthcare platform, which supports collaborative heart disease diagnosis applications. To select policies according to service level agreement of users and dynamic resource status, we devised a policy adjuster to handle workflow management polices and resource management policies using policy decision scheme. We implemented this new architecture with workflow management functions based on policy quorum based resource management system for providing poincare geometrycharacterized ECG analysis and virtual heart simulation service. To evaluate our proposed system, we executed a heart disease identification application in our system and compared the performance to that of the general workflow system and PQRM system under different types of SLA.

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

In-Service-Monitoring을 통하여 네트웍 계층에서 성능저하와 전달되어지는 QOS의 영향을 감시하여 Pro-Active 매니지먼트가 가능하다. 그 결과로서 SLA 보증을 위반하기 전에 성능저하를 조기 발견하여 행동을 취한 수 있게 한다. 본 논문에서는 사용자의 요구조건을 만족하기 위한 네트웍의 구성과 SLA 측정의 제약조건들을 고려하고 Policy Based Routing이 적용되는 네트웍에서 Technology-Specific Parameter인 IP Packet Loss Ratio, IP 패킷전송지연, 패킷지터, 가용도등의 SLA Parameter를 측정하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.621-628
• /
• 2000

A retrieval performance of VOD sever is estimated by how quickly it services popular videos to users and how many users it is able to service. Each video data is placed on heterogeneous disks and placement techniques are various, retrieval performance is under the control of these elements, so that a retrieval performance is affected by placement policy. In this paper, we place video data considering their characteristics, especially, we place videos distributively according to their popularity. To verify our policy, we make various environment of experiment, estimate a placement policy using popularity of videos and a contrary policy, and compare them.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1770-1776
• /
• 1999

Mobile agent technology has received great attention in the last years as a new paradigm for distributed processing systems. Mobile agents are autonomous objects that can migrate from node to node of a computer network. But, due to hosts or communication nodes failures, mobile agents may be blocked or crashes even if there are other nodes available that could continue processing. To cope with above, this paper proposes an efficient policy by introducing the path reordering and backward recovery to ensure the migration of mobile agents. The proposed migration policy will be provided the migration reliability of mobile agents as autonomously as possible, and it is implemented in the MOS, a mobile object system model developed by the Java language.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.738-747
• /
• 1999

본 논문에서는 분산 실시간 시스템의 특징인 분산 처리 과정의 신뢰성을 지원하기 위한 동적 트랜잭션 처리 구조를 연구하였다. 실시간 분산 처리 환경에서 동적으로 발생하는 실시간 분산 트랜잭션 처리를 위하여 트랜잭션 내에 필수적인 3가지 언어적 특성들을 제시하였다. 첫째는 트랜잭션 내에 실시간 시스템의 가장 중요한 특징인 시간적인 제약 조건들을 정의 할 수 있는 방안을 제시하고, 둘째는 비동기적인 처리 성격을 지닌 실시간 특성을 고려한 비동기적 트랜잭션 처리 방법을 제시한다. 또한, 분산 처리 과정에서 발생되는 예외 사항들을 처리하기 위하여 긴급성을 고려한 다중레벨 우선순위 스케줄링 (Multi-Level Priotiry Scheduling)이라 부르는 트랜잭션 스케줄링 방안을 제시한다. 그리고, 제시한 실시간 분산 트랜잭션 처리 구조의 타당성 및 가능성을 입증하기 위한 실시간 트랜잭션 처리 과정을 시물레이션을 통하여 제시한 언어적 특성에 대한 고려 사항들을 보여준다.Abstract We propose a dynamic transaction processing model that supports a reliability for distributed real-time processing. For the dynamic processing in distributed real-time transaction systems, we suggest three features that are defined in programming language. First, we propose a specification model to explicitly define the time constraints, needs in real-time distributed processing. Second, we describe an asynchronous transaction processing mechanism based on the real-time characteristics. So, we suggest three communication primitives to support asynchronous transaction processing. Lastly, a scheduling policy based on urgent transaction is suggested to manage the exception occurred during the distributed processing. This scheduling policy is called multi-level priotiry scheduling (MPLS). Based on three features and scheduling policy, we describe a direction to manage a dynamic transaction processing in distributed real-time systems.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3251-3259
• /
• 1999

In this paper, we present a new mechanism applying more strict priority than RIO mechanism proposed as a drop precedence policy of AF classes in differentiated services. In this mechanism, applying strict priority to drop precedence policy, we get better performance on priority level. Simulation results indicate that the proposed mechanism may provide more efficient and more strict priority transmissions as compared to RIO regardless of traffic load.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.911-914
• /
• 2013

빅데이터가 이전의 대용량정보와 비교하여 어떠한 개념적인 의미를 지니는지 정책설계과정에 따라 이론적으로 논의하고, 이 시대 이슈가 되는 데이터 주권에 대하여 저작권과 CCL을 사례로 ICT정책의 설계방안을 제시한다. 사례분석의 결과 빅데이터 시대 데이터 주권에 대한 정책은 법, 시장, 기술, 규범 측면에서 균형 있게 설계되어야 하며 기술구조를 기초로 사회문제에 대한 규제구조를 설계하고 정책을 집행해야 한다.