• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.965-974
• /
• 2003

Today's network consists of a large number of routers and servers running a variety of applications. In this paper, we have designed and constructed the general simulation environment of network security model composed of multiple IDSs agent and a firewall agent which coordinate by CNP (Contract Net Protocol). The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls the execution of agents or a contractee, who performs intrusion detection. In the knowledge-based network security model, each model of simulation environment is hierarchically designed by DEVS (Discrete Event system Specification) formalism. The purpose of this simulation is the application of rete pattern-matching algorithm speeding up the inference cycle phases of the intrusion detection expert system. we evaluate the characteristics and performance of CNP architecture with rete pattern-matching algorithm.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1085-1094
• /
• 1999

이동 분산 환경에서는 무선 데이타 전송 기법을 통하여 사용자들에게 다양한 정보들을 전달하게 된다. 본 논문은 균등 무선 데이타 방송 환경에서, 빠른 시간에 방송데이타를 접근할 수 있는 방법에 대하여 기술한다. 이를 위하여 무선 방송 데이타의 스케쥴링 문제를 정의하고, 어떤 질의가 접근하는 데이타들의 응집 정도를 나타내는 `질의 거리(Query Distance: QD)'라는 측정 기준을 제시한다. 제안한 질의 거리를 사용하여 각 질의의 우선 순위에 따라 해당 질의가 접근하는 데이타 집합을 방송 스케쥴에 추가하면서 스케쥴을 구성하는 데이타 스케쥴링 기법을 제시한다. 데이타 집합의 스케쥴 구성 과정에서 우선 순위가 높은 질의의 질의 거리를 최소화하면서 낮은 우선 순위 질의들의 질의 거리를 줄이는 스케쥴 확장 규칙들을 사용한다. 예를 이용하여 제안하는 방법에 대하여 설명한 후, 실험을 통해 제안한 방법의 성능을 평가한다.Abstract In mobile distributed systems the data on the air can be accessed by a lot of clients. This paper describes the way clients access the broadcast data in short latency in uniform wireless broadcasting environment. We define the problem of wireless data scheduling and propose a measure, named Query Distance(QD), which represents the coherence degree of data set accessed by a query. By using the measure, we give a data scheduling method that constructs the broadcast schedule by appending each query's data set in greedy way. When constructing the schedule, we use schedule expansion rules that reduce the QD's of lower-frequency queries while minimizing the QD's of the higher-frequency ones. With the use of examples we illustrate the mechanism of the proposed method and we test the performance of our method.

• Journal of KIISE:Software and Applications
• /
• v.33 no.5
• /
• pp.460-469
• /
• 2006

To integrate heterogeneous distributed systems, there exist various researches and developments for the purpose of its adoption into enterprise environment. However, when web service technologies are applied, it is difficult to adopt directly existing software system development methodologies, because of the peculiar architecture of web services, such as service provider, service requester, and service repository. M4WSD(Method for Wes Services Development) is a web service development process model and involves procedures and guidelines to develop web services based on a Use Case model that is elicited from a business domain in requirement analysis. In this paper, we focus on how to determine key realization decisions for each service. The assessment guidelines help you to structure the problem of determining implementation strategy.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.6
• /
• pp.2707-2712
• /
• 2012

Desktop-based computing environment is changed into mobile computing using smart phone and cloud computing providing common behavior and big data by network. Because of this transformation software development and operating environment is changed into heterogeneous distributed environment. As a result, dynamic service composition or changement is required. However, there is few research of techniques supporting service composition or changement dynamically in this situation. This paper suggests a technique for customizing services dynamically of mobile applications based on android platform. Especially we propose a customization technique of service by applying ontology technique to improve sharing and reuse of service. We applied proposed technique into meeting notification system, and obtain that it can be customized into various services such as email, sms, twitter service, and so on.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.129-136
• /
• 2005

WebDAV extends the web communication protocol HTTP/1.1 to provide a distributed authoring and versioning across the Internet. A property management, the principal ability of WebDAV, has many advantages for managing and utilizing additional information of server resources as well as supports a role of storage. Most WebDAV Application systems currently available are using WebDAV for providing simple storage space, not for the functionality of property management. However, to develop an advanced application such as a collaborative system based on WebDAV, it is very important to design and utilize user-defined WebDAV properties. In this paper, we propose DavSUDP(WebDAV Simple User-defined Property Definition Protocol) that describes XML-based configurations representing WebDAV user-defined properties and their processing steps. DavSUDP enables WebDAV servers to effectively manage user-defined properties in developing WebDAV-based applications. To show this, we extended the Apache mod_dav module to support DavSVDP and developed the OpenSpace in the iPlace collaborative system using the extended Apache web server.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1177-1188
• /
• 2004

Multi-agent systems have been developed for supporting intelligent collaboration of distributed and independent software entities and are be-ing widely used for various applications. For the collaboration among agents, conversation policies (or interaction protocols) mutually agreed by agents are used. In today's dynamic electronic market environment, there can be frequent changes in conversation policies induced by the changes in transaction methods in the market, and thus, the importance of ad hoc conversation policies is increasing. In existing agent platforms, they allow the use of only several standard or fixed conversation policies, which requires inevitable re implementation for ad hoc conversation policies and leads to inefficiency and intricacy. This paper designs an agent platform that supports ad hoc conversation policies and presents the prototype implementation. The suggested system includes an exchangeable and interpretable conversation policy model, a meta conversation procedure for exchanging new conversation policies, and a mechanism for performing actual transactions with exchanged conversation policies in run time in an adaptive way.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.482-490
• /
• 2004

Recently, XML has been emerging as a standard for storing and exchanging of data for various distributed applications based on the Internet. Since there are increasing demands to store and manage XML documents, a lot of research works are going on this area to develop new took and techniques based on the XHL. However, most of the researches are concentrated on mapping techniques based on instance or DTD, and the main focus is on structural transformation. Current trend of research is toward the usage of XML documents based on XML schema, and demands not only conversion of structure but also preservation of the semantic constraints. This paper sets up the using of DIDL standing on the basis of XML schema from MPEG-21 as an application domain, and proposes the mapping model that can preserve semantic constraints in addition. We expand previous research techniques in the preprocessing step for the specific domain, and then, apply various new mapping methods in the postprocessing step. We present and discuss the system architecture for implementation, and introduce the algorithms and present implementation environment and semantic extension methodology in detail. Finally we show actual table and query processing based on our proposal.

• Journal of Information Processing Systems
• /
• v.3 no.2
• /
• pp.43-53
• /
• 2007

The use of agent paradigm in today's applications is hampered by the security concerns of agents and hosts alike. The agents require the presence of a secure and trusted execution environment; while hosts aim at preventing the execution of potentially malicious code. In general, hosts support the migration of agents through the provision of an agent server and managing the activities of arriving agents on the host. Numerous studies have been conducted to address the security concerns present in the mobile agent paradigm with a strong focus on the theoretical aspect of the problem. Various proposals in Intrusion Detection Systems aim at securing hosts in traditional client-server execution environments. The use of such proposals to address the security of agent hosts is not desirable since migrating agents typically execute on hosts as a separate thread of the agent server process. Agent servers are open to the execution of virtually any migrating agent; thus the intent or tasks of such agents cannot be known a priori. It is also conceivable that migrating agents may wish to hide their intentions from agent servers. In light of these observations, this work attempts to bridge the gap from theory to practice by analyzing the security mechanisms available in Aglet. We lay the foundation for implementation of application specific protocols dotted with access control, secured communication and ability to detect tampering of agent data. As agents exists in a distributed environment, our proposal also introduces a novel security framework to address the security concerns of hosts through collaboration and pattern matching even in the presence of differing views of the system. The introduced framework has been implemented on the Aglet platform and evaluated in terms of accuracy, false positive, and false negative rates along with its performance strain on the system.

• Journal of the Korean Society for Railway
• /
• v.12 no.6
• /
• pp.1043-1048
• /
• 2009

PES (Programmable Electronic System) is used by software development for the train control system. PES has been widely used in real world and consists of hardware, firmware and application software. The PES are easily apply to many applications because its implementation has high flexibility. Many safety critical functions are realized through software in safety critical system. Normally, it is difficult to detect failures for PES system because the PES is too sophisticated to identify sources of the failure. So, the reliability analysis is needed by using software fault tolerance techniques. Currently, there are the recovery block, distributed recovery block, N-version programming, N self-checking programming in fault tolerance techniques. In this paper, the models of recovery block and N-version programming in software fault tolerance techniques are suggested by using the Markov model. Also, the reliability in the train control system is analyzed through changing time. The fault occupancy rates of the program, adjustment test and voter are stationary. So, the relation between time and reliability is presented by using Matlab program. In the result of reliability, the reliability of recovery block is more high than N-version programming in case of the same number of substitution block.