• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.117-124
• /
• 2006

In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.5
• /
• pp.91-98
• /
• 2020

The mobile agent, which handles a given task while migrating between the sensor nodes, moves including the execution commands and task processing results. This increases the size of the mobile agent, causing the network to load, leading to the migration time delay and the loss of migration reliability. This paper presents the method of lightening the mobile agent using distributed object technology and the algorithm for exploring and providing the optimal migration path that is actively performed in the event of network traffic, and it proposes a method to ensure the reliability of the mobile agent migration by applying them. In addition, through the comparative analysis experiments based on agent size and network traffic for the migration time of mobile agent equipped with active rules in sensor network-based mobile agent middleware environment, applying the proposed methods proves to ensure the autonomy and migration reliability of the mobile agent.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.7
• /
• pp.993-1000
• /
• 2002

In this paper, we design the CORBA-based Mobile Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(below node) routing schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent m()del that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separates the existing mobile agent object by mobile agent including only agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it reduces the required time for round works of mobile agent through the optimal path search of migration nodes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1421-1435
• /
• 2004

When various work was given from user, the existing mobile agent model migrated from node to node and process the work at the point that much traffics according to passive routing schedule are happened, until it makes service the work result, time cost of round work process for the distributed nodes are increased. Therefore, the existing agent systems need migration method to solve the problems of agent size increment or a lack of interoperability among agent systems. To solve these problems in this thesis, we design and implement an CORBA-based Mobile Agent Model(CMAM) for the efficient work process into the distributed nodes, when the mobile agents are migrated among the nodes, using an optimal path search by sensing of network traffic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4787-4807
• /
• 2016

Although the dense interconnection datacenter networks (DCNs) (e.g. FatTree) provide multiple paths and high bisection bandwidth for each server pair, the single-path TCP (SPT) and ECMP which are widely used currently neither achieve high bandwidth utilization nor have good load balancing. Due to only one available transmission path, SPT cannot make full use of all available bandwidth, while ECMP's random hashing results in many collisions. In this paper, we present OFPT, an OpenFlow based Parallel Transport framework, which integrates precise routing and scheduling for better load balancing and higher network throughput. By adopting OpenFlow based centralized control mechanism, OFPT computes the optimal path and bandwidth provision for each flow according to the global network view. To guarantee high throughput, OFPT dynamically schedules flows with Seamless Flow Migration Mechanism (SFMM), which can avoid packet loss in flow rerouting. Finally, we test OFPT on Mininet and implement it in a real testbed. The experimental results show that the average network throughput in OFPT is up to 97.5% of bisection bandwidth, which is higher than ECMP by 36%. Besides, OFPT decreases the average flow completion time (AFCT) and achieves better scalability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.362-366
• /
• 2008

본 논문에서는 이동 에이전트의 이주 노드들에 대한 최적 경로 탐색을 통한 적응적 이주 경로 기법을 설계한다. 적응적 이주 경로 기법은 이동 에이전트가 사용자로부터 동일한 작업 요청을 부여 받았을 경우 일반적으로 전체 노드를 순회하지 않고 이주할 노드를 선택함으로써 수행되어진다. 그러나 이주 수행시 네트워크 환경 변화 및 부하로 인해 트래픽이 증가된 경우에는 스케줄링된 목적 노드로의 이주가 원활히 수행되지 못하므로 노드 순회 시간 비용이 증가하게 된다. 따라서 본 논문에서는 이러한 상황을 해결하기 위해 최적으로 이주 노드들의 경로를 지정하는 경로 탐색 알고리즘을 통해 에이전트의 노드 이주 시간 비용을 최소화할 수 있는 이주 기법을 제안한다. 제안된 기법은 이동 에이전트의 이주 신뢰성을 확보하며 순회 작업 처리 시 효율성을 높일 수 있다.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.78.1-78.1
• /
• 2021

A Lunar observatory not only provides ideas and experiences for space settlements from the Moon to Mars, but also puts the telescope in an optimal position to compete with space telescopes. Earth observation on the Moon's surface has the advantage of no atmospheric scattering or light pollution and is a stable fuel-free observation platform, allowing all longitude and latitude of the Earth to be observed for a month. Observing the entire globe with a single observation instrument, which has never been attempted before, and calculating the global albedo will significantly help predict the weather and climate change. Spectropolarimetric observations can reveal the physical and chemical properties of the Earth's atmosphere, track the global distribution and migration path of aerosols and air pollutants, and can also help detect very small space debris of which the risk has increased recently. In addition, the zodiacal light, which is difficult to observe from Earth, is very easy to observe from the lunar observatory, so it will be an opportunity to reveal the origin of the solar system and take a step closer to understanding the exoplanet system. In conclusion, building and developing a lunar observatory will be a groundbreaking study to become the world's leader that we have never tried before as a first step in expanding human experience and intelligence.