• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.75-88
• /
• 2004

Condor is a distributed batch system for sharing the workload among the computers connected by a network. Condor distributed system was developed on the basis that every machine in a Condor pool is always connected by a network to run a Condor Job. Due to advances in wireless communication and mobile computing technology, conventional distributed computer systems can now include “mobile” clients as well as “fixed” clients. Moreover, mobile users want to lower their power consumption by off-loading potentially power and resource consuming jobs. In this paper, we describe the design and implementation of mobile interface for mobile clients in Condor distributed batch system. The main purpose of this work is to enable users on mobile computers to interact with Condor environment any time anywhere regardless of their connection to a Condor pool. The mobile Condor distributed system also aims to provide mobile users the same Condor services without making any significant changes to the existing Condor system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.5
• /
• pp.3421-3425
• /
• 2015

In sensor networks, sensor nodes are usually distributed to manage the networks in continuous unique area, however as by the network property nodes can be located in several areas. The data gathering of distributed nodes to several areas can be different with current continuous area. Hence, the distributed networks can be differently managed to the current continuous networks. In this paper, we describe the data gathering of sensor nodes in distributed sensor areas. It is possible that sensor nodes cannot instantly connect the mobile sink, and the node operation should be considered. The real time data sending to the instant connection scheme of mobile sink can be implemented, but the property of mobile sink should be considered for the sink connection of distributed areas. In this paper, we analyze the proposed scheme by the simulation results. The simulation results show that the overall lifetime to the periodic data gathering method is longer than the threshold method.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.207-216
• /
• 2002

This paper present a design and implementation of a distributed audio, Video stream service framework based on CORBA for efficient processing and control of audio/video stream. We design software components which support processing, control and transmission of audio/video streams as distributed objects. For optimization of stream transmission performance, we separate the transmission path of control data and media data. Distributed objects are defined by IDL and implemented using JAVA. And device dependent facilities like media capturing, playing and communication channels are implemented using JMF (Java Media Framework) components. We show a connection establishment and control procedure of streams communication. And for evaluation, we implement a test system and experiment a system performance. Our experiments show that test system has somewhat longer connection latency time compared to TCP connection establishment, but has optimized media transmission time compared to CORBA IIOP. Also test system show acceptable service quality of media transmission.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.131-141
• /
• 2006

Recently, many researchers have been studied several high performance data transmission techniques such as TCP buffer Tuning, XCP and Parallel Sockets. The Parallel Sockets is an application level library for parallel data transfer, while TCP tuning, XCP and DRS are developed on kernel level. However, parallel socket is not analyzed in detail yet and need more enhancements, In this paper, we verify performance of parallel transfer technique through several experiments and analyze character of traffic interference among socket connections. In order to enhance parallel transfer management mechanism, we predict the number of socket connections to obtain SLA of the network resource and at the same time, affected network bandwidth of existing connections is measured mathematically due to the interference of other parallel transmission. Our analytical scheme predicts very well network bandwidth for applications using the parallel socket only with 8% error.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.640-642
• /
• 2005

분산된 컴퓨팅 환경은 프로세서의 개수를 적응적으로 활용하는 병렬 처리 환경으로 활용할 수 있다. 병렬 처리예 의한 수행 시간 단축 효과에 가장 많은 영향을 주는 것은 활용되는 프로세서의 개수와 병렬 처리 요소 상호 간의 통신 오버헤드이다. 분산된 컴퓨팅 환경으로 구성한 병렬 처리는 통신 오버헤드에 의한 단점과 프로세서의 개수를 자유롭게 활용할 수 있다는 장점이 상반되는 특성을 가지며 레이트레이싱에 의한 렌더링과 같이 계산량이 많고 병렬 처리 요소 상호 간의 통신량이 적은 응용 분야에 효과적이다. 분산된 컴퓨팅 환경을 병렬 처리에 활용하기 위하여 기존의 분산 처리 모델을 적웅용면 통신 오버헤드 이외에 부수적인 오버헤드(프로그래밍 및 확용 절차)로 인하여 실효성을 발휘하기 어렵다. 단일 컴퓨팅 환경을 위한 절차와 서비스를 그대로 적용하여 분산된 컴퓨팅 환경을 구성하는 여러 대의 컴퓨터를 통합하여 활용하는 방안은 이와 같은 부수적인 오버헤드를 해결할 수 있으며 본 연구팀에서 이미 발표한 TORB(Transparent Object Request Broker)는 프로그래밍 투명성의 제공을 통하여 분산된 컴퓨팅 환경을 활용하기 위한 프로그램을 단일 컴퓨팅 환경을 위한 프로그래밍 기법을 적응하여 작성할 수 있도록 지원한다. 지속적인 연구를 통하여 프로그래밍 투명성의 범위를 확장함과 동시에 활용 절차의 투명성을 지원하는 방안을 추가하였고 새로운 분산 처리 모델을 설계하여 이러한 절차와 서비스를 체계적으로 정립하였다. 인터넷에 연결된 컴퓨터는 적절한 수준의 컴퓨팅 능력을 갖추고 있고 상호 간의 정보 교환을 할 수 있는 상태이므로 "TORB"와 같이 잘 정의된 패러다임으로 이들을 통합하여 운영하면 병렬 처리에 참여하는 프로세서의 개수를 자유롭게 활용하여 수행시간 감소 효과(병렬 처리에 의한)를 극대화할 수 있다. 그러나 인터넷을 기반으로 하는 분산된 병렬 처리를 지원하기 위해서는 "TORB"가 이미 제공하는 투명성 외에 불특정한 타인이 작성한 프로그램 코드가 "TORB"를 통하여 자신의 컴퓨터에서 실행되어도 악의적인 동작을 수행하지 못하게 하는 보안 기능과 인터넷에 연결된 방대한 수의 컴퓨터를 "TORB"에 의해 구성되는 분산된 컴퓨팅 환경에 참여시키는 시나리오가 필요하다.

• Korean Journal of Cognitive Science
• /
• v.28 no.2
• /
• pp.111-131
• /
• 2017

The connectionist model is one approach to studying language processing from a computational perspective. And building a representation in the connectionist model study is just as important as making the structure of the model in that it determines the level of learning and performance of the model. The connectionist model has been constructed in two different ways: localist representation and distributed representation. However, the localist representation used in the previous studies had limitations in that the unit of the output layer having a rare target activation value is inactivated, and the past distributed representation has the limitation of difficulty in confirming the result by the opacity of the displayed information. This has been a limitation of the overall connection model study. In this paper, we present a new method to induce distributed representation with local representation using abstraction of information, which is a feature of restricted Boltzmann machine, with respect to the limitation of such representation of the past. As a result, our proposed method effectively solves the problem of conventional representation by using the method of information compression and inverse transformation of distributed representation into local representation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.929-935
• /
• 2008

As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.2
• /
• pp.367-374
• /
• 2017

This paper discusses management problems of Hadoop distributed node, which is a platform for big data processing, and proposes a novel technique for enabling flexible node management of Hadoop Distributed File System. Hadoop cannot configure Hadoop cluster dynamically because it judges temporarily unavailable nodes as a failure. Delayed block replication scheme proposed in this paper delays the removal of unavailable node as much as possible so as to be easily rejoined. Experimental results show that the proposed scheme increases flexibility of node management with little impact on distributed processing performance when the cluster size changes.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.9-18
• /
• 1995

객체지향 프로그래밍의 발달과 필요성에 따라 분산된 통신망에도 객체지향 기술이 적용되는 분산객체 컴퓨팅이 새로운 버젼으로 대중화되고 있다 따라서 분산 객체간의 자원을 효율적으로 이용하고 다른 통신망의 사용자들과 원활한 통신을 하기 위해서는 자원의 공유가 필연적이다. 그러나 이러한 정보와 자원의 공유는 불완전한 통신 채널을 통해 이루어지기 때문에 불법적인 사용자들이 정보를 악용하는 보안상의 문제가 발생한다. 본 논문은 다양한 컴퓨팅 자원들이 통신망으로 연결되어 있는 개방형 분산 객체 컴퓨팅 환경에서 운영되는 컴퓨터 통신망의 정보를 보호하고 정당한 사용자에게 자원을 효율적으로 제공할 수 있는 인증 메카니즘으로 CORBA 환경에서 티켓을 사용하지 않은 Kerberos 인증을 제안하였다.

• Review of KIISC
• /
• v.7 no.2
• /
• pp.15-34
• /
• 1997

분산 시스템 환경은 다수의 컴퓨터가 네트워크에 연결되어 있고, 다양한 사용자가 공통적으로 접근할 수 있기 때문에 심각한 보안 문제를 안고 있다. 본 논문은 개방형 분산 시스템 환경에서 각종 위협에 대응할 수 있는 인증 메커니즘에 관하여 다룬다. 기본적인 위협 요소, 인증 요구조건 및 서비스를 검토하고 관련된 메커니즘들을 조사 분석함으로써 분산 시스템의 응용에서 암호학적인증 메커니즘의 설계 기준을 마련할 수 있을 것이다. 본 논문에서는 Kerberos, X.509, SPX 및 SESAME 인증 메커니즘을 실체 인증의 개념적 관점에서 분석하였다.