• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.111-117
• /
• 2004

In distributed-computing environments, there is a strong demand for the authentication and the access control of distributed-shared resources. I have presented role-based access control (RBAC) concept that is in the spotlight recently. RBAC model shows the standardized access control of complicated organization's resources. In RBAC, senior role has junior role's permission by virtue of role hierarchy. But, junior role cannot perform the permission, which is granted to the senior or other role groups. Inheritances of permissions in role hierarchies are static. In order to tackle this problem, I propose a dynamic role assignment, which classified into passive role assignment and active role assignment, and design dynamic role assignment protocol and implement role assignment server.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.43-50
• /
• 2005

POS system that become that is supply net administration and computerization fetters of customer management that become point in istribution network constructed database and use XML-Encryption that is certificate techniques of PKI and standard of security for security that is XML's shortcoming and design distributed processing POS system using XML for data integration by introduction of Ubiquitous concept. This POS system has four advantages. First, Because there is no server, need not to attempt authentication and data transmission every time. Second, can integrate data base by XML and improve portability of program itself. Third, XML data in data transmission because transmit data after encryption data safe .Fourth, After encode whenever process data for data breakup anger of POS system client program and elevation of the processing speed, transmit at because gathering data at data transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2285-2301
• /
• 2012

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

• Journal of the Korea Society for Simulation
• /
• v.22 no.2
• /
• pp.53-62
• /
• 2013

Cloud environment is one in the field of distributed computing and it consists of physical nodes and virtual nodes. In distributed cloud environment, an optimal path search is that each node to perform a search for an optimal path. Synchronization of each node is required for the optimal path search via fast data transmission because of real-time environment. Therefore, a quantization technique is required in order to guarantee QoS(Quality of Service) and search an optimal path. The quantization technique speeds search data transmission of each node. So a main server can transfer data of real-time environment to each node quickly and the nodes can perform to search optimal paths smoothly. In this paper, we propose the quantization technique to solve the search problem. The quantization technique can reduce the total data transmission. In order to experiment the optimal path search system which applied the quantized data transmission, we construct a simulation of cloud environment. Quantization applied cloud environment reduces the amount of data that transferred, and then QoS of an application for the optimal path search problem is guaranteed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.559-569
• /
• 2004

It has become more difficult to correspond an cyber attack quickly as a pattern of attack becomes various and complex. And, current security mechanisms just have passive defense functionalities. In this paper, we propose new network security architecture to respond various cyber attacks rapidly and to chase and isolate the attackers through cooperation between security zones. The proposed architecture make possible to deal effectively with cyber attacks such as IP spoofing or DDoS(Distributed Denial of Service) using active packet technology including a mobile sensor on active network. Active Security Management System based on proposed security architecture consists of active security node and active security server in a security zone, and is designed to have more active correspondent than that of existing mechanisms. We implemented these mechanisms in Linux routers and experimented on a testbed to verify realization possibility of Active Security Management System. The experimentation results are analyzed.

• The Journal of Bigdata
• /
• v.3 no.1
• /
• pp.73-82
• /
• 2018

At the core of future medicine is the realization of Precision Medicine centered on individuals. For this, we need to have an open ecosystem that can view, manage and distribute healthcare data anytime, anywhere. However, since healthcare data deals with sensitive personal information, a significant level of reliability and security are required at the same time. In order to solve this problem, the healthcare industry is paying attention to the blockchain technology. Unlike the existing information communication infrastructure, which stores and manages transaction information in a central server, the block chain technology is a distributed operating network in which a data is distributed and managed by all users participating in the network. In this study, we not only discuss the technical and legal aspects necessary for demonstration of healthcare data distribution using blockchain technology but also introduce KOREN SDI Network-based Healthcare Big Data Distribution Demonstration Study. In addition, we discuss policy strategies for activating blockchain technology in healthcare.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.17-28
• /
• 2004

Since the Internet has grown into a large communication infrastructure, the network management system to systematically manage the large number of network components has become an essential part of the Internet. The rapid growth of network size has brought into question the scalability of the existing centralized model, such as SNMP (Simple Network Management Protocol) and CMIP (Common Management Information Protocol). Thus, for efficient network management, researches about mobile agent have also been performed recently. This paper presents analytical models of centralized approach based on SNMP protocol, distributed approach based on mobile agent, and mixed mode to make up for shortcomings of SNMP and mobile agent. We compare the performance of these analytical models based on network management response time. Experiment results show that performance of mobile agent and the mixed mode is less sensitive to the delay in WAN network environment. However, SNMP is more efficient for the simple network environment like LAN.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.616-627
• /
• 2005

In the shared storage file system, systems can directly access the shared storage device through specialized data-only subnetwork unlike in the network attached file server system. In this shared-storage architecture, data consistency is maintained by some designated set of lock servers which use control network to send and receive the lock information. Furthermore, lease mechanism is introduced to cope with the control network failure. But when the control network is partitioned, participating systems can no longer make progress after the lease term expires until the network recovers. This paper addresses this limitation and proposes a method that allows partitioned systems to make progress under the partition of control network. The proposed method works in a manner that each participating system is rotationally given a predefined lease term periodically. It is also shown that the proposed mechanism always preserves data consistency.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2092-2105
• /
• 1997

In this paper, we propose a load sharing scheme in distributed systems. In the proposed scheme, the state of each host is classified as a server or a source by its current load and, to prevent excessive state changes of each host, we used three threshold values for identifying the current state of each host. Based on the threshold values, some hosts, called brokers, manage the servers registered to them. The brokers, whose number is determined by the system utilization factor and the total number of hosts, support task migration processes from overloaded sources to lightly loaded servers. Also they can hand over the broker's role to another host when it is overloaded. Simulation studies were performed for examining the sensitivity of each system parameters such as threshold values, utilization factor, the number of hosts, and the number of brokers to the system performance indices including mean response time, mean queue length.