• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.368-371
• /
• 2000

The distributed object computing is possible to distributed computing on same or heterogeneous machine environment with growth of distributed computing and object-oriented technology. The typical of model, CORBA is int solved the interoperability in heterogeneous machine environment over the network But, the CORBA has a problem that the server is can't rely on request of client occurs network overhead by extinction of network A plan was on the rise to solve the problem that is combination of mobile agent and distributed computing technology.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.4-6
• /
• 2003

시스템의 구조는 확장 또는 부하 균형을 위해 재구성 및 재구조화가 필요하다. 이러한 상황에서, 다수의 새로운 시스템이 기존의 시스템에 추가되며 이전의 시스템이 담당하고 있던 역할의 일부분이 새로 추가된 시스템으로 분산된다. 이러한 자원 관리는 몇 가지 문제를 야기시키는데, 가장 큰 문제점은 일부 시스템 또는 전체 시스템의 재구조화를 위해 일정기간 동안 서비스 제공이 중단된다는 점이다. 이 논문에서는 동적인 자원관리가 요구되는 변화하는 환경에서 자동적으로 새로운 시스템을 추가하고 적응적으로 시스템의 부하를 재조정할 수 있는 이동 컴퓨팅 모델을 제안한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.2
• /
• pp.168-175
• /
• 1999

본 논문은 클라이언트/서버 모델을 기반으로 한 분산 시스템(Distributed System)의문제들을 해결하기 위해 자바(Java)객체를 위한 이동 시스템을 설계 구현한다. 이를 위해, 자바 객체가 이동 객체 모델이 되기 위한 특성을 제시한다. 그리고 , 제안된 이동 시스템은 이동 객체들이 인트라넷(Intranet)상의 노드 등으로 이동되었을 때 해당 객체들을 수용할 뿐 아니라 자율적으로 실행할수 있는 가상 장소를 제공하는 환경이다. 따라서, 자바 객체에 대해 객체 이동 및 이동 투명성을 제공할 뿐만 아니라 이동 객체로서 분산 처리가 가능한 컴퓨팅 환경을 제공하므로, 기존 분산 시스템 구조로 인한 성능 및 통신 오버헤드(Overhead)문제등을 효율적으로 개선한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.125-128
• /
• 2001

이동 통신 기술의 발전은 사용자로 하여금 이동 중에도 정보를 공유할 수 있는 토대를 제공하였다. 하지만, 이동 컴퓨팅 환경에서 기존의 유선 환경에서와 같은 수준의 서비스를 제공하기 위해서는 이질적이며 분산되어 있는 다수의 정보 자원을 사용할 수 있어야 한다. 따라서, 고정된 네트워크 상의 상호 이질적인 데이터베이스에 접근하여 이동 컴퓨팅 환경의 특성에 맞게 정보를 효과적으로 처리할 수 있는 트랜잭션 모델 및 표준화된 아키텍쳐에 관한 연구가 필요하다. 본 연구에서는 표준 미들웨어에 기반 하여 위와 같은 요구사항을 만족시키는 이동 트랜잭션 모델을 제시하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.269-271
• /
• 2000

이동 컴퓨팅 환경은 분산 컴퓨팅 환경과는 달리 네트웍의 낮은 신뢰성과 제한된 대역폭을 가지고, 이동 호스트 또한 제한된 저장장치와 배터리만을 사용할 수 있으며 트랜잭션(transaction)은 장시간에 결쳐 수행되는 특성을 가진다. 이동 컴퓨팅 환경에서는 전통적인 트랜잭션의 동시성 제어 기법 대신, 트랜잭션의 시맨틱스(semantics)를 이용하여 동시성을 향상시킬 수 있다. 본 연구에서는 중첩된 트랜잭션의 구조를 단순화시킨 단계분할(step- decomposition) 기법을 사용하여, 서브트랜잭션(sub-transaction)의 시맨틱 타입(semantic type) 별로 인터리빙(interleaving)을 제어함으로써 트랜잭션의 동시성을 향상시키는 기법을 제안하고자 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.263-274
• /
• 2010

Mutual exclusion that applied on existing systems was designed for static distributed systems. but now computing environments are going to mobile computing environments. Therefore a mutual exclusion algorithm in static distributed environments should be designed for new computing environments. So this paper proposes a mobile mutual exclusion algorithm to support the mutual exclusion of shared resources in mobile computer environments. Mobile computing resources as wireless hosts cause new issues because of their mobility and weakness and made mutual exclusion problem more complex than stationary distributed environments. So we proposed a new mobile token mutual exclusion algorithm with deadlock-free and starvation-free in mobile computing environments based on spanning tree topology and extend for mobile computing environments. The proposed algorithm minimizes message complexity in case of free hopping in cellular networks.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.815-820
• /
• 2001

This paper presents a distributed mobile architecture aimed to support the mobility of mobile station. The proposed architecture considers three significant objects；mobile station (MS), mobile agent (MA) which logically represents mobile station in the wireline network, and trace agent (TA) to represent application server (AS) providing application service to mobile station. The mobile agent is made closely coupled with the mobile station while the trace agent is made closely coupled with the application server. During the handoff process, a flow control mechanism is considered to correct packet loss and out-of-sequence packets problem. The result of analytic additional time delay due to handoff processing is presented and simulation was performed to check the additional time delay as well as the correctness of handoff algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.528-538
• /
• 2000

Mobile computing system requires both precise identification and secure authentication scheme on remote mobile entities, which is based on the distributed mobile node. In this paper, existing discrete logarithm based $Schnorr^{[7]}$ like entity authentication schemes are improved by the analysis of performance and security on the hi-directional interactive proofs. And $EIGamal^{[14]}$ like efficient authentication schemes are also proposed. Then, these are enhanced with oblivious transfer based mono directional authentication schemes based on trusted third party for applying to the mobile agent based computing systems. Therefore, proposed schemes provide compatible performance and safety on mobile entity authentication processes.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.53-62
• /
• 2008

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.