• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.752-760
• /
• 2009

Emerging peer-to-peer systems benefit from the large amount of resources provided by many peers. However, many peer-to-peer systems or applications suffer from malicious peers and it is not guaranteed that peers are always online. Micropayment systems are accounting and charging mechanism for buying services, so we can apply them to solve these problems. In the past the majority of micropayment system uses a centralized broker but the problem with most existing micropayment system is a heavy load on the broker. For instance, when an owner of the coin is offline, the broker delegates the owner and handles payment messages. It occurs frequently because of characteristic of peer-to-peer system and is another load of the broker. In this paper we introduce DPay, a peer-to-peer micropayment system that uses distributed hash table (DHT) for storing encrypted payment messages and increases scalability and reduces the load of broker by removing downtime protocol. We show the idea of real-time double spending detection in DPay and report the results of several evaluations in order to compare DPay and other payment scheme. In simulation result, the load of broker in DPay is reduced by 30% on average of other previous payment scheme. We expect that DPay can apply various peer-to-peer systems because it provides a real-time double spending detection and stores more secure payment messages.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.510-519
• /
• 2011

Intra mode decision is a useful coding tool in Distributed Video Coding (DVC) for improving DVC coding efficiency for video sequences having fast motion. A major limitation associated with the existing intra mode decision methods, however, is that its efficiency highly depends on user-specified thresholds or modeling parameters. This paper proposes an entropy-based method to address this problem. The probabilities of intra and Wyner?Ziv (WZ) modes are determined firstly by examining correlation of pixels in spatial and temporal directions. Based on these probabilities, entropy of the intra and the WZ modes are computed. A comparison based on the entropy values decides a coding mode between intra coding and WZ coding without relying on any user-specified thresholds or modeling parameters. Experimental results show its superior rate-distortion performance of improvements of PSNR up to 2 dB against a conventional Wyner?Ziv coding without intra mode decision. Furthermore, since the proposed method does not require any thresholds or modeling parameters from users, it is very attractive for real life applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.87-103
• /
• 2009

Grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because Grid middleware does not have common sharable information system. In order to use Grid computing environment efficiently which consists of various Grid middlewares, it is necessary to have application-independent information system which can share information description and services, and expand them easily. Thus, in this paper, we propose a semantic information system framework based on web services and ontology for Grid computing environment, called WebSIS. It makes application and middleware developer easy to build sharable and extensible information system which is easy to share information description and can provide ontology based platform-independent information services. We present efficient ontology based information system architecture through WebSIS. Discovering appropriate resource for task execution on Grid needs more high-level information processing because Grid computing environment is more complex than other traditional distributed computing environments and has various considerations which are needed for Grid task execution. Thus, we design and implement resource information system and services by using WebSIS which enables high-level information processing by ontology reasoning and semantic-matching, for automation of task execution on Grid.

• Journal of Korea Water Resources Association
• /
• v.33 no.4
• /
• pp.437-446
• /
• 2000

THe drought analysis is performed by applications of truncation level method and conditional probability concept for hydrologic time series in Han river basin. The distributed trend of conditional probability is determined using kriging method for the time series. This study uses daily flowrate, monthly rainfall, and daily high temperature data sets. The daily flowrate data of 12 years(1986~1997) is used for the analysis. Also, the 14 years' data sets(1986~1999) for monthly rainfall and daily high temperature obtained from the National Weather Service of Korea are used in this study. In the cases of flowrate and rainfall data sets, the estimated value corresponding to the truncation level is decreased as the truncation level is increased but in the high temperature data, the value is increased as the truncation level is increased. The conditional probability varies according to the observations and sites. However, the distributed trend of drought is similar over the basin. As a result, the possibility of the drought is high in the middle and lower parts of Han river basin and thus it is recommended the distributed trend of drought be considered when the plan or measures for drought are established.

• Journal of Korea Water Resources Association
• /
• v.46 no.11
• /
• pp.1041-1052
• /
• 2013

In this study, we estimate parameters of a distributed hydrologic model, GRM (grid based rainfall-runoff model), using a model-independent parameter estimation tool, PEST. We implement auto calibration of model parameters such as initial soil moisture, multipliers of overland roughness and soil hydraulic conductivity in the Geumho River Catchment and the Gamcheon Catchment using radar rainfall estimates and ground-observed rainfall represented by Thiessen interpolation. Automatic calibration is performed by GRM-MP (multiple projects), a modified version of GRM without GUI (graphic user interface) implementation, and "Parallel PEST" to improve estimation efficiency. Although ground rainfall shows similar or higher cumulative amount compared to radar rainfall in the areal average, high spatial variation is found only in radar rainfall. In terms of accuracy of hydrologic simulations, radar rainfall is equivalent or superior to ground rainfall. In the case of radar rainfall, the estimated multiplier of soil hydraulic conductivity is lower than 1, which may be affected by high rainfall intensity of radar rainfall. Other parameters such as initial soil moisture and the multiplier of overland roughness do not show consistent trends in the calibration results. Overall, calibrated parameters show different patterns in radar and ground rainfall, which should be carefully considered in the rainfall-runoff modelling applications using radar rainfall.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1637-1648
• /
• 2004

When digital libraries are developed by the traditional client/sever system using a single agent on the distributed environment, several problems occur. First, as the search method is one dimensional, the search results have little relationship to each other. Second, the results do not reflect the user's preference. Third, whenever a client connects to the server, users have to receive the certification. Therefore, the retrieval of documents is less efficient causing dissatisfaction with the system. I propose a new platform of mobile multiagents for a personal digital library to overcome these problems. To develop this new platform I combine the existing DECAF multiagents platform with the Voyager mobile ORB and propose a new negotiation algorithm and scheduling algorithm. Although there has been some research for a personal digital library, I believe there have been few studies on their integration and systemization. For searches of related information, the proposed platform could increase the relationship of search results by subdividing the related documents, which are classified by a supervised neural network. For the user's preference, as some modular clients are applied to a neural network, the search results are optimized. By combining a mobile and multiagents platform a new mobile, multiagents platform is developed in order to decrease a network burden. Furthermore, a new negotiation algorithm and a scheduling algorithm are activated for the effectiveness of PDS. The results of the simulation demonstrate that as the number of servers and agents are increased, the search time for PDS decreases while the degree of the user's satisfaction is four times greater than with the C/S model.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.149-156
• /
• 2005

The HLA is the simulation architecture standard that the civilian and military simulation communities are deeply interested in. We can find various successful practices applying HLA to constructive simulations such as war games in domestics and overseas. However, any case of real-time distributed simulations has not been reported. The reason is that a message transmission period via RTI in a network layer varies according to computing power, simulation nodes, transmission types, and packet size; further a message processing time in an application layer depends on its processing methods, thus too difficult to set up real-time constraints for the enhancement of a real-time resolution. Hence, in this paper we have studied the real-time constraints of RTI for the development of the M-SAM simulator. Thus we have developed a HLA based pilot simulator using 6 PC's in LAN and then measured and analysed the performance of the RTI. As the results of our work, we could obtain the quantitative values for message delay, RTI overhead and RTI packet transmission ratio by a real operation scenario and loads, which are not shown in the previous works. We also expect that the results can be used as a guideline to set up the number of targets, transmission frequency and message processing method in the development of the M-SAM simulator and similar applications.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1359-1371
• /
• 1999

대규모 네트워크 상에서 동작하는 분산 시스템의 구현을 위해 제시된 방법 중의 하나인 이동 코드 개념은 네트워크 공유 자원에 접근할 수 있는 효과적인 방법을 제시하였고 이 개념을 지원하는 많은 언어들의 개발을 가져왔다. 개발된 언어들이 가지고 있는 이동 코드를 지원하기 위한 언어 구문과 적용하려는 문제 영역의 특성을 반영한 언어 구문은 네트워크 프로그래밍을 하는데 있어서 효율과 문제 중심의 프로그램의 두 가지를 모두 가능하게 하고 있다. 본 논문에서는 현재 분산 컴퓨팅 환경에서 가장 많이 사용되고 있는 클라이언트-서버 모델을 확장하여 서버의 자원에 접근할 수 있는 또 다른 방법을 가진 모델을 제시하고, 이 모델을 표현할 수 있는 언어를 설계하였다. 설계된 언어는 이동 코드의 개념을 지원함으로써 대규모 네트워크에서 수행되는 프로그램의 작성을 가능하게 하고, 분산 범위 규칙을 채택함으로써 이동 코드의 기술을 일반 함수를 기술하듯 명확한 관점에서 할 수 있도록 하였다. 또한 네트워크 관련 자원들을 언어 구문으로 채택하여 네트워크 프로그래밍을 언어 수준에서 할 수 있도록 하였다. 언어의 이론적인 설계에 그치지 않고 설계된 언어를 수행할 수 있는 실행 시간 지원 시스템을 구현하였다. 실행 시간 지원 시스템은 언어를 해석하고 실행하는 코드 해석기와 이동 코드를 지원하는 네트워크 감독으로 구성되며 설계된 언어를 사용하여 실제로 네트워크 응용 프로그램을 작성하고 테스트 해 볼 수 있다.Abstract Some studies bring up a concept of code mobility as an innovative way to access network resources in order to develop distributed systems working on a large scale network. After that, many languages are suggested to support this concept. In these languages, language constructors for their particular application domains and mobile codes provide both problem-oriented views to the programmer and reasonable performance to the system. In this thesis, we extend the client-server model that is the most popular model in developing distributed systems these days. We propose a model to have another method to access server's resources and extend the C language to implement the proposed model for the large scale network. The new language has capability to build a software working on a large scale network by supporting mobile code and gives a consistent network programming view to the programmer by adapting distributed semantics. The language also makes network programming easy by providing network primitives at the language level. We implement a prototype of run-time system to support this language. The run-time system is composed of two major parts: code-interpreter that interprets and executes the language and network-daemon that supports mobile codes.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.165-172
• /
• 2020

In this paper we propose an uses on-device-based edge computing technology and big data analysis methods through the use of on-device-based edge computing technology and analysis of big data, which are distributed computing paradigms that introduce computations and storage devices where necessary to solve problems such as transmission delays that occur when data is transmitted to central centers and processed in current general smart factories. However, even if edge computing-based technology is applied in practice, the increase in devices on the network edge will result in large amounts of data being transferred to the data center, resulting in the network band reaching its limits, which, despite the improvement of network technology, does not guarantee acceptable transfer speeds and response times, which are critical requirements for many applications. It provides the basis for developing into an AI-based facility prediction conservation analysis tool that can apply deep learning suitable for big data in the future by supporting intelligent facility management that can support productivity growth through research that can be applied to the field of facility preservation and smart factory industry with integrated hardware technology that can accommodate these requirements and factory management and control technology.