• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.77-84
• /
• 2003

A mobile agent is a program which represents a user in a network and is capable of migrating from one node to another node, performing computations on behalf of the user. In this paper, we suggest a scheme that can safely recover mobile agent using the checkpoint that is saved at the platform that it visited previously and restart its execution from the abnormal termination point of the mobile agent. For security, mobile agent uses its public key to encrypt the checkpoint and the home platform uses the private key of the mobile agent to decrypt the encrypted checkpoints at the recovery stage. When home platform receives the checkpoint of the mobile agent, home platform verifies the checkpoint using message digest. Home platform verifies the correctness of the checkpoint by comparing the message digest generated at checkpoint mention time with the message digest generated at mobile agent recovery time.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.66-75
• /
• 2007

The traditional centralized network management method using the SNMP has problems, such as, increase of communication traffic and severe bottleneck phenomena at the specific manager-node caused by a frequent polling mechanism. Several mobile agent based network management methods have been studied to solve and overcome these problem. However, in these mobile agent based methods, as the number of nodes to be managed is increased, the mobile data are increased accumulatively and the effectiveness of the network management is decreased. In this paper, we propose the split management method by using mobile agents to handle these problems. In our method, the nodes are divided into groups to be handled by separate mobile agents. Each mobile agent visits its own nodes and gets management information from them. We demonstrate the effectiveness of our proposed method using experimental results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.71-78
• /
• 2001

In this paper, we describe the vulnerabilities against mobile agent and analyze existing schemes to cope with them. Also we propose a new scheme which protects the executed information by mobile agent and simultaneously traces the executions of mobile agent. The proposed scheme provides non-repudiation between participations for the executions of mobile agent, forward integrity against modification and protection against code insertion or deletion attack.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.577-579
• /
• 2004

Mobile IP는 이동노드(Mobile node)들에게 이동성 서비스를 지원하기 위해 제안된 것으로 이동노드가 자신의 IP주소를 이용하여 현재 위치에 관계없이 이동성 에이전트(mobility Agent)메 등록함으로 인터넷에 접근 할 수 있는 프로토콜이다. 애드 혹 네트워크는 하부구조 없이 이동노드들 끼리 패킷을 교환 할 수 있는 네트워크이다. 본 논문에서는 Mobile IP의 에이전트가 주기적으로 에이전트 광고 메시지를 전달하여 자신의 서비스 영역 내부에 있는 애드 혹 네트워크의 이동노드들에게 인터넷에 접속할 수 있는 MAAM (Mobility Agent Advertisement Mechanism) 및 AMAAM(Aggregation based Mobility Agent Advertisement Mechanism)을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.261-267
• /
• 2011

One of powerful software paradigms for distributed systems is a mobile agent system. Since the usage of mobile agent systems is increased, a software development model to construct softwares efficiently for these systems is needed. Currently, UML is a widely used software development model. However, existing UML can not describe the necessary mobility of the mobile agent based software systems in explicit way. In this paper, the interaction diagrams of UML(sequence diagrams and communication diagrams) are extended and used to express the mobility of the mobile agents including the functions of platforms of mobile agent systems in three ways. For a case study, we applied the extended diagrams to a distributed file searching using mobile agents, and we confirmed these diagrams can describe the function and mobility of mobile agents very well.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.257-266
• /
• 2004

Mobile agents are defined as processes which can be autonomously delegated or transferred among the hosts in a network in order to perform some computations on behalf of the user and co-operate with other agents. Currently, mobile agents are used in various fields, such as electronic commerce, mobile communication, parallel processing, search of information, recovery, and so on. In pure P2P network environment, if mobile agents that require computing resources rashly migrate to another peers without consideration on the peer's capacity of resources, the peer may have a problem that the performance of the peer is degraded due to lack of resources. To solve this problem, we propose resource reservation based load balancing scheme of using RMA(Resource Management Agent) that monitors workload information of the peers and that decides migrating agents and destination peers. In mobile agent migrating procedure, if the resource of specific peer is already reserved, our resource reservation scheme prevents other mobile agents from allocating the resource.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.351-360
• /
• 2004

Most mobile agents are migrated to many mobile agent systems by the sequential node migration method. However. in this case, if some problems such as host's fault or obstacle etc. happened, mobile agent falls infinity walt or orphan states. Therefore, it is difficult to get an expectation effect as use of other distribution technologies because the required time for networking between nodes increases. And so, many researches have been performed to solve this problems. However, most of methods decide node migration based on passive routing table or detour hosts which have some problems. Actually, the researches for reducing the total required time for networking are insufficient yet. In this paper, to reduce the required time for networking of mobile agent we design an active routing table based on the information of implemented objects which are registered in the meta-table of naming agent. And also, for user's keyword, we propose an replication model that replicates many agent object according to the information and number of object references corresponding to meta-table. Replicated objects are migrated to mobile agent systems in parallel and it provides minimized required time for networking.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.333-340
• /
• 2007

In multi agent systems, various inter agent communication models have been proposed, and, especially, there are several group communication schemes proposed so far, where some schemes guarantees transparent communication among the agents. However, in mobile agent environments, we require new group communication schemes that consider topology changes caused by mobile agent migrations. Also, these group communication schemes should be secure in order for them to be practical. In this paper, we propose a secure group communication scheme using the hierarchical overlay ring structure of mobile agents. The proposed scheme uses the ring channel in order to cope adaptively with the change of ring topology. The ring channel has basic information for construction of the ring and is managed only by the mobile agent platforms. Therefore, each mobile agent need not directly handle the ring channel and it can perform group communication without any consideration on the change of the ring topology.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.550-552
• /
• 2001

최근에 네트워크 환경이 좋아지고 인터넷 사용이 급증함에 따라 이동 에이전트(Mobile Agent) 기술이 정보검색, 네트워크 관리 , 전자상거래, 병렬/분산처리 등의 분야에 널리 활용되고 있다. 이동 에이전트 시스템에서 전체 수행시간은 이동 에이전트의 코드 크기, 이동 에이전트의 데이터 크기 , 이동 에이전트의 전송 방법에 따라 좌우된다. 본 논문에서는 이동 에이전트 환경에 참여하는 모든 노드들에게 보다 빠르게 에이전트를 전송하는 방법들을 실험적으로 평가하고 에이전트 이동시 노드의 결함(Fault)이 발생할 때 그 해결방안을 연구한화. 에이전트 전송 및 결함 허용에 대한 성능평가는 IBM's Aglets Software Development Kit 환경을 이용하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.104-109
• /
• 2005

Context-awareness is an important element that can provide service of good quality according to users' surrounding environment and status in ubiquitous computing environment. Information gathering tools for context-awareness use small size mobile devices which have easy movement and a mobile agent in mobile device. Now, Mobile agents are consuming much times and expense to collect and recognize each users' context information. Therefore, needs research about structure for users' context information awareness in early time to reduce mobile agent's load. This paper proposes a P2P mobile agent structure that mikes filtering techniques and a P2P agent in mobile agent. The proposed structure analyzes each user's context information in same area, and groups users who have similar preference degree. Grouped users share information using a P2P mobile agent. Also this structure observes and learns to continue on users' action and service, and measures new interrelation.