• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.115-123
• /
• 2004

Since internet and XML has come out, Web Services are regarded as a new paradigm of next generation's IT are becoming a leading technology to integrate the distributed applications on internet using XML based Platforms and distributed computing based on component technologies independent on implementing languages. Nowadays internet is generally used and the use of wireless internet is rapidly rising. The quantities of contents on the web-sites to manage and maintain are getting larger according to these trends and the update cycles are getting shorter It is necessary to solve these Problems that developing the systems which can effectively generate, maintain and manage the contents on the web-sites. In the paper, a system which can integrates wired and wireless services is designed and implemented using the technologies like XML based components, JWSDP, Wireless Server Side Script, WML editor and etc.,

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1533-1556
• /
• 2017

The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

• Convergence Security Journal
• /
• v.20 no.2
• /
• pp.69-76
• /
• 2020

Blockchain 2.0 supports programmable smart contract for the various distributed application. However, the environment of running smart contract is limited in the blockchain, so the smart contract only get the deterministic information, such as block height, block hash, and so on. Therefore, some applications, which requires random information, such as lottery or batting, should use oracle service that supply the information outside of blockchain. This paper develops a random number generator oracle service. The random number generator oracle service use irregular big data as entropy source. This paper tests the randomness of bits sequence generated from oracle service using NIST SP800-22. This paper also describes the advantages of irregular big data in our model in perspective of cost comparing hardware entropy source.

• The Journal of Information Technology
• /
• v.4 no.2
• /
• pp.25-36
• /
• 2001

In this paper, we present the development of distributed dual real-time kernel system. This paper proposed that real-time applications should be split into small and simple parts with real-time constraints, Following this concept we have designed to preserve the properties of both hard real-time kernel and general kernel. To satisfy these properties, we designed real-time kernel and general kernel, that have their different properties. In real-time tasks, interrupt processing should be un. In general kernel, non real-time tasks or general tasks are run. We compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.5
• /
• pp.54-61
• /
• 1999

We suggested a macro medel for MOS transistors, which incorporates the distributed substrate resistance by using a method which utilizes external diodes on SPICE MOS model. By fitting the simulated s-parameters to the measures ones, we obtained a model set for the W=200TEX>$\mu\textrm{m}$ and L=0.8TEX>$\mu\textrm{m}$ NMOS transistor, and also analyzed the effects of distributed substrate resistance in the RF range. By comparing the physical parameters calculated from simulated s-parameters such as ac resistances and capacitances with the measured ones, we confirmed the validity of the simulation results. For the frequencies below 10GHz, it seems appropriated to use a simple macro model which utilizes the existing SPICE MOS model with junction diodes, after including one lumped resistor each for gate and substrate nodes.

• Journal of Computing Science and Engineering
• /
• v.11 no.3
• /
• pp.92-99
• /
• 2017

Memcached, commonly used to speed up the data access in big-data and Internet-web applications, is a system software of the distributed-cache mechanism. But it is subject to the severe challenge of the loss of recently uncommitted updates in the case where the Memcached servers crash due to some reason. Although the replica scheme and the disk-log-based replay mechanism have been proposed to overcome this problem, they generate either the overhead of the replica synchronization or the persistent-storage overhead that is caused by flushing related logs. This paper proposes a scheme of backing up the write requests (i.e., set and add) on the Memcached client side, to reduce the overhead resulting from the making of disk-log records or performing the replica consistency. If the Memcached server fails, a timestamp-based recovery mechanism is then introduced to replay the write requests (buffered by relevant clients), for regaining the lost-data updates on the rebooted Memcached server, thereby meeting the data-consistency requirement. More importantly, compared with the mechanism of logging the write requests to the persistent storage of the master server and the server-replication scheme, the newly proposed approach of backing up the logs on the client side can greatly decrease the time overhead by up to 116.8% when processing the write workloads.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1694-1701
• /
• 2013

Distributed video coding technique(DVC) is needed for several applications with low bit rate or low encoding resources. However, since conventional DVC schemes have performance limitations and so as one of the several methods to overcome this problem and to improve the coding efficiency, DVC scheme with the moving information of side information has been developed. Based on this system, in this paper, an efficient reliability estimation is introduced to evaluate the blocks composing of side information and send these blocks location to the encoder side. Then, these enable the encoder to selectively encode and to improve the coding performance. Experimental results show that the proposed scheme performs better than the conventional coding scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Journal of Sensor Science and Technology
• /
• v.15 no.6
• /
• pp.391-396
• /
• 2006

Free-standing multilayer distributed Bragg reflectors (DBR) porous silicon dielectric mirrors, prepared by electrochemical etching of crystalline silicon using square wave currents are treated with polystyrene to produce flexible, stable composite materials in which the porous silicon matrix is covered with caffeine-impregnated polystyrene. Optically encoded DBR PSi/polystyrene composite films retain the optical reflectivity. Optical characteristics of DBR PSi/polystyrene composite films are stable and robust for 2 hrs in a pH=7 aqueous buffer solution. The appearance of caffeine and change of DBR peak were simultaneously measured by UV-vis spectrometer and Ocean optics 2000 spectrometer, respectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.118-125
• /
• 1990

An optimal file allocation algorithm which seeks optimal solution of file allocation problem for efficient management and operation of information files in distributed computer system is proposed. Since file allocation time in practical applications that have many computer sites is tool long, the problem size has to be reduced and computation time is improved by using preassignment conditio. A new method which calculate appriasal value for accurrate value for accurrate representation of assigned state is proposed and the selection criteria to candidate nodes for rapid determination of allocation are given. By using selection criteria, file allocation is determined and final appraisal value represent total cost of assigned state.