• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.153-156
• /
• 2003

기존 푸시 기술의 제품들이 가지는 상호 운용성을 해결하기 위한 CORBA 기반의 푸시 에이전트 모델(CPAM: CORBA-based Push Agen Model)은 사용자 요구에 적합한 정보만을 수집한 후 이를 사용자에게 전송하여주는 에이전트 프레임웍(Framework)이다. 이러한 푸시 에이전트는 푸시 에이전트 서버가 제공하는 정보의 양과 종류, 그리고 이를 이용하는 동시 사용자 수가 증가함에 다라 서버 시스템의 과부하 및 네트워크 트래픽의 증가가 초래된다. 이를 위해 본 논문에서는 푸시 에이전트 모델에 캐싱 기법을 적용함으로써 자주 요청되어지는 동일한 데이터에 대한 서버 시스템의 과부하를 감소시키도록 한다. 또한 클라이언트 푸시 에이전트의 상태 정보와 주제 분류에 따른 검색 키워드를 포함하고 있는 사용자 프로파일을 통해 효율적인 캐쉬 메모리 접근을 제공하도록 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.153-166
• /
• 2005

Existing single cache structure has shown difference of hit-ratio according to individually replacement strategy However. It needs new improved cache structure for reducing network traffic and providing advanced hit-ratio. Therefore, this Paper design push agent model using dual cache for increasing hit-ratio by reducing server overload and network traffic by repetition request of persistent and identical information. In this model proposes dual cache structure to do achievement replace gradual cache using by two caches storage space for reducing server overload and network traffic. Also, we show new cache replace techniques and algorithms which executes data update and delete based on replace strategy of Log(Size) +LRU, LFU and PLC for effectiveness of data search in cache. And through an experiment, it evaluates Performance of dual cache push agent model.

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