• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.17-26
• /
• 2003

Mobile agent system comes into the spotlight since it contributes largely to mobile computing on distributed network environment. However, this system has a number of significant security Problems. In this Paper, we analyze suity attacks to mobile agent system Presented by NIST[3]. In order to protect this system from them, we suggest a security protocol for mobile agent system by employing R based key distribution and digital multi-signature scheme. To solve these problems described in NIST, securities for mobile agent and agent platform shouid be accomplished. Comparing with other protocols, our protocol performs both of these securities, while other protocols mentioned only one of them. Proposed Protocol satisfies simplicity of key management, providing security service such as confidentiality, integrity, authentication and preventing reputation, liveness guarantee, protection of excution-result data and preventing replay attack. Furthermore, it is designed to detect message modification immediately by verifying each step of agent execution at a corresponding server.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.84-91
• /
• 2005

Recently comparison-shopping agent systems are promising to support purchase of buyers in online-shopping environment. This paper proposes a comparison-shopping agent system considered easy access and buyer's preference. Easy access is achieved by minimizing questions to buyer. Buyer's preference is considered by using pairwise comparison of products attributes. Procedure of the proposed system is explained with a case of notebook. Finally a prototype has been implemented.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.309-320
• /
• 2001

This paper deals with security issues in a mobile agent system, especially protecting agent data from malicious agent servers. For this purpose, one-time key generation system, OKGS in short, is proposed. In OKGS, we integrate notions of a one-way hash function and a coupler. One-way function plays a major role in ensuring confidentiality and integrity of agent data. And the notion of a coupler is used to establish inter-relationship among consecutive encryption keys for agent data, i.e. all agent keys form a unidirectional chain. With these two features of OKGS, therefore, only the agent owner, who creates the agent bearing data, can decrypt and protect all the agent data which are gathered in the itinerary.

• 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.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.290-298
• /
• 2015

This paper suggests a multi-agent message transport architecture based on the message-oriented middleware ZeroMQ. Compared with the other middlewares such as CORBA, Ice, and Thrift, ZeroMQ receives a good score in the evaluation of performance, QoS (Quality of Service), patterns, user friendliness, and resources. The suggested message transfer architecture borrowed many basic concepts like agent platform, AMS (Agent Management System), and MTS (Message Transfer System) from FIPA (Foundation for Intelligent Physical Agents) standard multi-agent specifications, and the architecture inherited the strength of the architecture from the multi-agent framework SMAF (Smart Multi-Agent Framework). The architecture suggested in this paper is a novel peer-to-peer architecture which is not known to the ZeroMQ community. In the suggested architecture, every MTS agent uses only one ZeroMQ router socket to support peer-to-peer communication among MTS agents. The suggested architecture can support closely collaborating software areas such as intelligent robots as well as the traditional application areas of multi-agent architecture. The suggested architecture has interoperability and scalability with the ZeroMQ devices and patterns.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.78-85
• /
• 2008

In this paper, we propose the extension of cooperation protocol which realizes the autonomous control of QoS and show its effectiveness with implementation and experiments of our agent-based videoconference system. The autonomous QoS control in the agent-based videoconference system means the framework of adjusting its functions/abilities by itself to cope with the changes of user requirements and system resource situations. But, the original cooperation protocol used by the agent-based videoconference system is not enough to perform cooperation closely to use the limited resources effectively. In our proposal, the cooperation protocol is offended in the following points: (1) introducing a cooperation states, (2) extension of performatives, (3) introducing compromise levels. We embedded the proposed protocol to the agent-based videoconference system and experimented the behavior of the system. According to the experiments on this prototype system, we confirmed that the flexibility of the system is improved.

• Journal of Advanced Navigation Technology
• /
• v.11 no.3
• /
• pp.313-318
• /
• 2007

This paper explains the design and implementation of the FDA(Fault Detection Agent). FDA is a system that is suitable for detecting software error for multimedia distance education based on home network environment. This system consists of an ED, and ES. ED is an agent that detects an error by hooking techniques for multimedia distance education based on home network environment. ES is an agent that is an error sharing system for multimedia distance education based on home network environment. From the perspective of multimedia collaborative environment, an error application becomes another interactive presentation error is shared with participants engaged in a cooperative work. Performance analysis is done by Comparison of Hooking with Snatching Method.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.147-156
• /
• 2003

교통문제는 사회시스템이 복잡해짐에 따라 더욱 대처하기 어려운 국면으로 가고 있다. 따라서 교통시스템의 변화 예측도 용이하지 않다. 복잡계(complex system)의 하나로 볼 수 있는 교통시스템을 대처하는데 있어 전통적인 상의하달(上意下達) 접근에 한계가 있음을 부인할 수 없다. 지난 10여년 동안 물리학, 시스템공학, 컴퓨터공학 분야 등 다양한 분야에서 복잡계에 대한 활발한 연구가 진행되고 있다. 복잡계의 해석을 위한 새로운 개념과 접근기법들이 도입되고 있는데, 그들 중 에이젠트기반모형(agent-based modelling)은 교통분야에 적용 가능한 매우 흥미를 있는 기법으로 보인다. 본 글에서는 에이젠트기반모형이 무엇이며, 어떻게 사용되고 있으며, 교통분야에서의 적용가능성을 검토하였다. 본 글에서 제시한 에이젠트기반접근은 기존 방법과는 다른 하의상달(下意上達) 방식의 기법이다. 이는 시스템의 개별 구성원인 에이젠트의 행태와 에이젠트간의 상호작응에 초점을 둔다. 에이젠트의 행태와 상호작용의 규칙이 변함에 따라 전 에이젠트시스템에 나타나는 변화를 추적할 수 있다. 오늘날 교통문제의 복잡성은 교통시스템의 더욱 세분화된 하부시스템의 다양화와 상호작용, 그리고 개별 차량 또는 운전자의 행태와 상호작용에서 기인된다고 볼 수 있다. 따라서 에이젠트기반의 접근은 아직 연구는 미흡하지만 복잡한 교통시스템의 운영과 분석에 적용잠재력이 큰 기법으로 판단된다.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.225-230
• /
• 2022

The intelligent home network system integrates various devices in the home into one communication network to provide information sharing, control, and operation environment between devices. This intelligent home network system operates around a home server. Home appliances in the era of the 4th industrial revolution will have numerous home servers in logical areas as the intelligent home network in the home accelerates. Therefore, the need for systematic management of home servers is emerging. We propose an agent system for efficient intelligent smart home server management. The agent system monitors the home server and operating environment for home server management of the intelligent smart home network. By referring to this monitored information, the service module of the home server is managed, and the home server is dealt with whether it is normal or not. In addition, by referring to the information collected by the service agent created in the group management server while migrating the home server, it is possible to deal with integrated meter reading, crime prevention, and topics. And when a new service is applied to the home server, it is registered in the management server and distributed to the home server through the agent, so that the intelligent smart home network can be efficiently managed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.