• 한국정보시스템학회지:정보시스템연구
• /
• 제4권
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 춘계학술대회 논문집
• /
• pp.152-157
• /
• 1999

In this paper, we introduce the concept of web-based simulation and some reviews on the distributed simulation on the World Wide Web (WWW) and classify the features of current web-based simulation under the distributed way. And then we suggest the structure of distributed web-based simulation which can achieve parallel simulation and reduce simulation run time and show how the callback mechanism works to enable the distributions of jobs to clients with push service in Remote Method Invocation (RMI). Finally we present a prototype of distributed web-based simulation.

• Advances in robotics research
• /
• 제1권2호
• /
• pp.171-183
• /
• 2014

Distributed planning and decision making can be beneficial from the robustness, adaptability and fault tolerance in multi-robot systems. Distributed mechanisms have not been employed in three dimensional transportation systems namely aerial and underwater environments. This paper presents a distributed cooperation mechanism on multi robot transportation problem in three dimensional environments. The cooperation mechanism is based on artificial capital market, a newly introduced market based negotiation protocol. In the proposed mechanism contributing in transportation task is defined as asset. Each robot is considered as an investor who decides if he is going to invest on some assets. The decision is made based on environmental constraint including fuel limitation and distances those are modeled as capital and cost. Simulations show effectiveness of the algorithm in terms of robustness, speed and adaptability.

• 한국통신학회논문지
• /
• 제16권4호
• /
• pp.382-395
• /
• 1991

범용의 분산 프로세스 통신제어 메커니즘은 통신하는 병렬 프로세스들을 동기시키는 데에 사용될 수 있는 일반적인 접근 방식이다. 이 메카니즘음 계층화된 통신구조와 프로토콜을 효율적으로 구현하기 위한 프레임워크를 제공할 수 있다. 모니터 설비가 제공되지 않는 제약된 환경에서 세마퍼를 이용하는 시뮬레이션을 통하여 이 메커니즘을 구현하였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
• /
• pp.124-126
• /
• 2006

Mobile Ad hoc networking is an emerging technology and in these days many applications are being developed to run on these networks. In these networks lookup services are very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Reliable and efficient scheme should be available for lookup services due to limited bandwidth and low computing power of devices in mobile ad hoc networks. Due to mobility and rapid change in network topology, lookup mechanism used in wired network is not appropriate. Service discovery mechanism can be divided into two main categories Centralized and Distributed. Centralized mechanism is not reliable as there is no central node in these networks. Secondly centralized mechanism leads toward single point failure. We can handle the service discovery mechanism by distributing server's information to each node. But this approach is also not appropriate due to limited bandwidth and rapid change in network. In this paper, we present reliable lookup service scheme which is based on distributed mechanism. We are not using replication approach as well due to low bandwidth of wireless networks. In this scheme service discovery mechanism will be handled through different lookup servers. Reliability is the key feature of our proposed scheme.

• International Journal of Contents
• /
• 제2권2호
• /
• pp.29-31
• /
• 2006

Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

• ETRI Journal
• /
• 제30권4호
• /
• pp.618-620
• /
• 2008

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However, it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.

• International Journal of Contents
• /
• 제12권2호
• /
• pp.6-11
• /
• 2016

We developed a pilot-job based large-scale distributed computing system to support HTC and MTC, called HTCaaS (High-Throughput Computing as a Service), which helps scientists solve large-scale scientific problems in areas such as pharmaceutical domains, high-energy physics, nuclear physics and bio science. Since most of these problems involve critical data that affect the national economy and activate basic industries, data privacy is a very important issue. In this paper, we implement a privacy enhanced data security mechanism to support HTC and MTC in a large-scale distributed computing system and show how this technique affects performance in our system. With this mechanism, users can securely store data in our system.

• 한국컴퓨터정보학회논문지
• /
• 제3권4호
• /
• pp.110-119
• /
• 1998

본 논문은 개방형 분산 Computing system에서 여러 분산 어플리케이션 프로그래머들에게 범용 암호 서비스 제공을 위한 C-API(Cryptographic-Application Program Interface) Mechanism개발에 대하여 설명한다. C-API Mechanism는 응용 프로그래머에게 공통적으로 사용 할 수 있는 암호 알고리즘 및 인터페이스를 제공함으로써 프로그래머가 암호 알고리즘을 알지 못하여도 분산 어플리케이션이 보안 서비스를 제공할 수 있다. 따라서,본 논문에서는 다양한 응용 환경 또는 시스템 하부구조에 독립적으로 사용될 수 있는 공용암호 서비스 구조를 설계하여 공통적으로 이용할 수 있도록 하였다. 이러한 구조는 응용 프로그래머에게 각종 암호화 관련서비스 및 키관리 서비스를 응용 프로그램과 운영체제의 제약없이 사용할 수 있는 장점이다.

• 한국정보통신학회논문지
• /
• 제5권3호
• /
• pp.475-482
• /
• 2001

본 논문에서 소켓 기반의 분산리스트와 RMI 기반의 분산리스트 구현을 중심으로 기술한다. 먼저 소켓 기반 분산리스트에 있어서 메시지를 포장할 때 객체 스트림을 사용하여 분산리스트 인터페이스를 분산환경에 맞게 구현하고 기술한다. 둘째로 RMI로 분산리스트를 구현하는 가장 큰 목적은 약간 복잡한 애플리케이션을 구현함으로써 다른 네트워킹 메카니즘과의 장단점을 비교하는 것으로 RMI를 사용할 때의 가장 큰 장점은 애플리케이션 레벨 프로토콜을 사용하지 않고도 프로그램을 간단하게 구현할 수 있다는 것이다. 프로그램의 효율이 라는 측면에서 살펴본다면 RMI를 사용한 애플리케이션은 매 업데이트마다 생성되는 많은 TCP/IP 연결로 인해 성능이 매우 떨어질 수 있다[1]. TCP/IP 연결은 RMI에 비해 매우 적은 비용을 요구하며 비록 RMI가 하나의 네트워크 연결을 사용해서 여러 메소드 호출을 처리해 주는 메카니즘을 가지고 있기는 하지만 직접 소켓을 사용하는 것보다는 효율이 떨어진다. 그러나 RMI는 HTTP 프록싱 메카니즘을 사용하여 방화벽을 넘어 통신하는 것이 가능하다[2]. 따라서 두 시스템을 비교 분석함으로써 최적화 해법을 모색하여 네트워킹 메카니즘 모델링을 제시하고자 한다.