• 한국정보처리학회논문지
• /
• 제6권7호
• /
• pp.1770-1776
• /
• 1999

최근 몇 년 동안 이동 에이전트(Mobile Agent) 기술은 분산 처리 시스템(Distributed Processing System)의 새로운 패러다임(Paradigm)으로 많은 관심이 되어왔다. 이동 에이전트는 통신망 노드에서 노드로 이주 가능한 자율적인 객체이다. 그러나, 통신망에 연동된 호스트(host)나 노드 결손 등으로 인해 이동 에이전트는 계속 처리할 수 있는 다른 노드들이 있을 지라도 무한 대기하거나 파괴될 수 있다. 이를 위해서, 본 논문은 이동 에이전트의 이주를 보장하기 위한 경로 재조정과 후위복구 기법을 통한 효율적인 이주 정책을 제안한다. 제안된 이주 정책은 가능한 한 자율적으로 이동 에이전트의 이주 신뢰를 제공하고, 자바(Java) 언어로 개발된 이동 시스템 모델인 MOS에서 이를 구현한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.965-968
• /
• 2000

We develop the Multi-Mobile-agents system for realizing effective cooperative task processing in the network environment. In this system, agents are separated / fused by the Place and migrated to another computer. A Place can assign agents to other places by agents migration to be flat the time to execute agents’ action. In this paper, the effectiveness of this system is shown by experimental results applying an agent given simple task.

• Journal of Information Processing Systems
• /
• 제11권1호
• /
• pp.148-164
• /
• 2015

The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

• 한국정보처리학회논문지
• /
• 제7권5S호
• /
• pp.1657-1665
• /
• 2000

Mobile agents based e-commerce system has many advantage than traditional e-commerce-information gathering on goods, price settlement and payment, delivery of the goods purchased, and so on. However, due to the security vulnerability that stems from mobile agent's mobility, mobile agents based e-commerce system has additional security problems. Therefore, in order to do e-commerce securely in th system, first of al the security issues on mobile agents must be addressed. It this paper, we propose a mobile agent transfer protocol that provides confidentiality and integrity of mobile agent in transit and mutual authentication for communicating hosts. We further show the security of the protocol against many possible attacks. Also, we suggest the location management mechanism of mobile agents based on the trust center. This mechanism is capable of finding their locations transparently and detecting mobile agent clones.

• 지능정보연구
• /
• 제6권1호
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• 한국정보처리학회논문지
• /
• 제7권8호
• /
• pp.2514-2519
• /
• 2000

이동 에이전트의 응용 분야가 다양해짐에 따라 그룹에이전트를 이용한 에이전트 협력 작업이 요구되고 있다. 이런 협력 작업은 에이전트간의 정보 공유 및 작업 제어를 위해 빈번한 통신을 필요로 한다. 본 논문은 그룹에이전트(group agent)들의 효율적인 협력 작업을 위한 CMP를 제안한다. CMP는 동기적/비동기적으로 에이전트 상호간에 보다 융통성있는 정보 전달을 수행한다. 또한, 제안된 CMP 접근 메소드는 1 : 1 통신뿐만 아니라 다 : 다 통신을 지원하기 때문에 그룹에이전트 모델에서도 효율적인 수행이 가능하다.

• 한국정보처리학회논문지
• /
• 제6권5호
• /
• pp.1332-1341
• /
• 1999

Rapid expansion of network and increment of computer system access cause computer security to be an important issue. Hence, the researches in intrusion detection system(IDS)are active to reduce the risk from hackers. Considering IDS, we propose a new IDS model(DABIDS : Distributed Agent Based Intelligent intrusion Detection System) based on distributed intrusion detecting agents. The DABIDS dynamically collects intrusion behavior knowledge from each agents when some doubtable behaviors of users are detected and make new agents codes using intrusion scenario data base, and broadcast the detector codes to the distributed intrusion detecting agent of all node. This DABIDS can efficiently solve the problem to reduce the overhead for training detecting agent for intrusion behavior patterns.

• 한국정보처리학회논문지
• /
• 제6권12호
• /
• pp.3477-3489
• /
• 1999

이 연구는 웹 기반 화상회의 시스템에서 지능적인 에이전트들을 통해 회의 소집에 들이는 노력을 최소화함으로써 여러 참여자들에게 동기적 협력을 보다 편리한 형태로 지원해 주는 시스템에 대해 연구하는 것이다. 이 시스템은 멀티 에이전트 구조를 가지며, 에이전트들 사이의 통신은 KQML을 이용한다. 이것은 시스템에 새로운 에이전트를 추가할 때에 에이전트들 사이의 이형질성을 극복찬 수 있도록 해준다. 이 논문에서는 웹 화상회의 시스템을 위한 멀티 에이전트들의 전체적인 구조를 제안하고, 이들 에이전트돈 사이의 KQML 메시지들의 흐름에 대하여 자세하게 소개한다.

• 정보처리학회지
• /
• 제7권1호
• /
• pp.56-62
• /
• 2000

• Journal of Information Processing Systems
• /
• 제3권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.