• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.571-573
• /
• 2001

정보화 시대로의 전환에 대한 요구를 충실하게 지원하고 점차적으로 인터넷을 이용한 비즈니스 거래와 분산 업무 처리 요구에 따른 e-commerce 환경으로부터 intranet과 extranet, 즉 고객 공급자 동업자 기업, 기관, 고용인등의 비즈니스에서 필요한 관계가 포함되어 통합되어진 e-busienss로의 어플리케이션이 요구되고 있다. 따라서 본 논문에서는 e-business 환경에서 사용자가 원하는 웹 애플리케이션이 정확하고 빠르게 구축될 수 있도록 e-business 컴포넌트 프로세스를 제안하며, 기존의 컴포넌트를 재사용 가능하도록 비즈니스 측면에서 컴포넌트 카테고리를 정하여 분류하고 통합을 통해 솔루션을 구축할 수 있도록 한다. 이는 e-business 컴포넌트 프로세스를 통해 이는 결국 분석된 모든 e-business 컴포넌트를 등록하고 검색 및 다운로드 할 수 있는 통합 시스템으로 제시되어진다. 기존의 컴포넌트는 분류를 통해 비지니스 측면의 컴포넌트로 재사용 가능하도륵 하며 현재의 B2B(Business to Business)를 원활히 하는데 목적을 둔다.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.131-140
• /
• 2011

File pollution (i.e., sharing of corrupted files, or contaminating index information with bogus index records) is a de facto problem in many file sharing Peer-to-Peer (P2P) systems in use today. Since pollution squanders network resources and frustrates users with unprofitable downloads (due to corrupted files) and unproductive download trials (due to bogus index records), the viability of P2P systems (and similar distributed information-sharing applications) is questionable unless properly addressed. Thus, developing effective anti-pollution mechanisms is an immediate problem in this literature. This paper provides useful information and deep insight with future researchers who want to design an effective anti-pollution mechanism throughout an extensive measurement study of user behavior and file pollution in a representative DHT-based P2P system, the Kad network.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.25 no.2
• /
• pp.99-107
• /
• 2023

Recently, the abnormal weather events and crop damages occurred frequently likely due to climate change. The importance of meteorological data in agricultural research is increasing. Researchers can download weather observation data by accessing the websites provided by the KMA (Korea Meteorological Administration) and the RDA (Rural Development Administration). However, there is a disadvantage that multiple inquiry work is required when a large amount of meteorological data needs to be received. It is inefficient for each researcher to store and manage the data needed for research on an independent local computer in order to avoid this work. In addition, even if all the data were downloaded, additional work is required to find and open several files for research. In this study, data collected by the KMA and RDA were uploaded to GitHub, a remote storage service, and a package was created that allows easy access to weather data using Python. Through this, we propose a method to increase the accessibility and usability of meteorological data for agricultural personnel by adopting a method that allows anyone to take data without an additional authentication process.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.457-459
• /
• 2003

과거 하나의 컴퓨터에 집중화되어 있던 컴퓨팅 환경이 디바이스 기술의 발달로 인하여 분산 환경으로 변화하고 있다. 분산된 디바이스 간에 통신이나 자원의 이용을 지원하는 네트워크 컴퓨팅 기술이 지니이다. 1999 년에 썬 마이크로 시스템즈에서는 지니 룩업서비스를 발표하였는데, 이 지니는 소형 디바이스에서 사용하기에는 부적합하다. 본 논문에서는 기존의 룩업서비스를 모듈별로 나누어 모듈이 필요할 때만 다운로드하게하여 실행시 메모리 요구량을 줄여 경량 미들웨어로서 최적화된 룩업서비스를 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.370-372
• /
• 2002

최근 네트워크에 대한 관심이 고조되면서 클라이언트／서버 방식을 통한 자료의 업ㆍ다운로드로 인하여 서버에 트래픽이 증가하는 문제점이 나타나고 있다. 그러므로, 기존의 단일 서버 형태에서 탈피하여 P2P 구조로 변화하여 가고 있다. 이때 중앙서버에 걸리는 부하를 줄이기 위하여 근거리의 클라이언트들을 결합하여 하나의 가상서버를 설정하여 중앙서버의 트래픽을 분산시키는 역할을 수행하는 서버 분산 시스템을 구축하여 설정된 가상서버들 중에서 근거리부터 검색하는 형태로 더 빠른 검색을 하도록 하는 것이 본 연구의 목적이다. 본 연구에서는 중앙서버에 최초로 접속한 사용자가 동일 라우터 대역에서 가상서버 역할을 맡게 하고 가상서버의 능력을 고려하여 접속자 수의 제한을 두고, 제한된 수를 초과하는 접속한 사용자가 동일 라우터 대역에서 가상서버 역할을 맡게 하고 가상서버의 능력을 고려하여 접속자 수의 제한을 두고, 제한된 수를 초과하는 접속자를 다른 가상서버로 설정하여 서비스를 이어갈 수 있도록 가상서버 시스템을 구축한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.227-240
• /
• 2003

When we develop and use the java-based distributed object system, the system developer must deploy distributed object, which is implemented to predefined interface, to network and the system user acquires reference about distributed object and changes reference to interface type. Sharing of interface is essential for these works In this paper, we propose the IRSJ(interface repository service based on jim) to improve efficiency of interface sharing at the JINI system development. the IRSJ is consisted of the java classes for JINI system and interface sharing service. If development teams perform collaborative work in short distance, the IRSJ can search interface file without information of lookup server or interface writer If development teams perform collaborative work in long distance, the IRJS can search interface with only an address of server that executes lookup service. Although the interface object not requires additional search, the interface object that failed search interface can download interface and use interface using remote event model. When the message service fails in interface search, the message service sends interface request message to a development team member who use the IRSJ automatically, so that interface sharing may be possible in short time.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.573-581
• /
• 2004

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.93-102
• /
• 2005

Excessive traffic of P2P applications in the limited communication environment is considered as a network bandwidth problem. Moreover, Though P2P systems search a resource in the phase of search using weakly connected systems(peers' connection to P2P overlay network is very weakly connected), it is not guaranteed to download the very peer's resource in the phase of download. In previous P2P search algorithm (1), we had adopted the heuristic peer selection method based on Random Walks to resolve this problems. In this paper, we suggested an adaptive P2P search algorithm based on the previous algorithm(1) to reform the node distribution rate which is affected in unit peer ability. Also, we have adapted the discriminative replication method based on a query ratio to reduce traffic amount additionally. In the performance estimation result of this suggested system, our system works on a appropriate point of compromise in due consideration of the direction of searching and distribution of traffic occurrence.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.73-80
• /
• 2003

The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.6
• /
• pp.97-105
• /
• 2021

In this paper, we propose BCON, a service that allows individuals to store personal contents safely, and reliably guarantee their ownership of contents, certifying their identities with DIDs(Decentralized identifiers). DID technology, which supports decentralized identification service based on a blockchain that cannot forgery or alter data, allows users to selectively provide their information, controlling personal information and reinforcing their sovereignty over their identity. BCON stores information about the content specified by a user on the blockchain and Authenticates the user's identity based on DID technology. It also provides functions for the user to safely upload and download the user's content to a distributed database. BCON consists of the content service verifier, the content storage service, the content management contract, and the user application, administrating rhe DID registry for Authority management.