• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.113-120
• /
• 2010

Video proxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate video selection method is needed to store the videos which are frequently requested by users. Thus, we present a time constraint multiple access technique to efficiently store the video in video proxy server. If the video is requested by user, it is temporarily stored during the predefined interval and then, delivered to the user. A video which is stored is deleted or moved into the storage space of video proxy server depending on the request condition. In addition, we propose a video deletion method in video proxy server for newly stored video data. The simulation results show that the proposed method performs better than other methods in terms of the block hit rate and the number of block deletion.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.337-344
• /
• 2004

Most of the virtual space constructed sufficiently realistic need a lot of memory space to navigate smoothly. And this kind of virtual space also requires real-time responsibility for the navigation as well as realism. In the off-line virtual system, real-time responsibility can be resolved by using large scale if secondary memory. In the web-based online virtual system, on the other hand, real-time responsibility is highly related to the latency time of network data communication. This induces the necessity of the algorithm for fast data loading. In this paper, we propose and verify the validity of the two methodology for cell leading algorithm. According to the results of computer simulation, the algorithm using hexagonal type cell promotes the real-time responsibility over 30％ than that of the rectangular type.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.451-460
• /
• 2006

Since low earth orbit (LEO) satellite constellations have important advantages over geosynchronous earth orbit (GEO) systems such as low propagation delay, low power requirements, and more efficient spectrum allocation due to frequency reuse between satellites and spotbeams, they are considered to be used to complement the existing terrestrial fixed and wireless networks in the evolving global mobile network. However, one of the major problems with LEO satellites is their higher speed relative to the terrestrial mobile terminals, which move at lower speeds but at more random directions. Therefore, handover management in LEO satellite networks becomes a very challenging task for supporting global mobile communication. Efficient and accurate methods are needed for LEO satellite handovers between the moving footprints. In this paper, we propose a new seamless handover management scheme for LEO satellites (SeaHO-LEO), which utilizes the handover management schemes aiming at decreasing latency, data loss, and handover blocking probability. We also present another interesting handover management model called satellite mobility pattern based handover management in LEO satellites (PatHO-LEO) which takes mobility pattern of both satellites and mobile terminals into account to minimize the handover messaging traffic. This is achieved by the newly introduced billboard manager which is used for location updates of mobile users and satellites. The billboard manager makes the proposed handover model much more flexible and easier than the current solutions, since it is a central server and supports the management of the whole system. To show the performance of the proposed algorithms, we run an extensive set of simulations both for the proposed algorithms and well known handover management methods as a baseline model. The simulation results show that the proposed algorithms are very promising for seamless handover in LEO satellites.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.17-26
• /
• 2015

In this paper, we explain a volume rendering system for client-server environment. A single GPU-equipped PC works as a server which is based on the ideas that only a few concurrent users use a volume rendering system in a small hospital. As the clients, we used Android mobile devices such as smart phones. User events are transformed to rendering requests by the client application. When the server receives a rendering request, it renders the volume using the GPU. The rendered image is compressed to JPEG or PNG format so that we can save network bandwidth and reduce transfer time. In addition, we perform an event pruning method while a user is dragging the touch to enhance latency. The server compensates the pruning by interpolating the touch positions. As the result, real-time volume rendering is possible for 5 concurrent users on single GPU-equipped commodity hardware.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.46-51
• /
• 2012

In this paper, we investigate the power allocation for cognitive relay networks. Cognitive relay networks offer not only increasing spectral efficiency by spectrum sharing but also extending the coverage through the use of relays. For spectrum sharing, conventional works have assumed that secondary users know perfect channel information between the secondary and primary users. However, this channel information may be outdated at the secondary user because of the time-varying properties or feedback latency from the primary user. This causes the violation for interference constraint, and the secondary user cannot share the spectrum of the primary after all. To overcome this problem, we propose the power allocation scheme for the secondary user under the allowable primary user's outage probability constraint. Since the proposed power allocation scheme does not use the instantaneous channel information, the secondary users have lower feedback burden. In addition, the proposed scheme is also robust to the outdated channel environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.41-52
• /
• 2008

Ubiquitous service environment is poor in reliability of connection and has a high probability that the intrusion and the system failure may occur. Therefore, in the environment, the capability of a system to collectively accomplish its mission in spite of active intrusions and various failure scenarios, that is, the survivability of services are needed. In this paper, we analyze the Jgroup/ARM framework that was developed in order to help the development of fault- tolerant Jini services. More importantly, we propose an intrusion-tolerant Jini service architecture to satisfy the security availability and quality of services on the basis of the analysis. The proposed architecture is able to protect a Jini system not only from faults such as network partitioning or server crash, but also from attacks exploiting flaws. It is designed to provides performance enough to show a low response latency so as to support seamless service usage. Through the experiment on a test-bed, we have confirmed that the architecture is able to provide high security and availability at the level that degraded services quality is ignorable.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.2
• /
• pp.1-8
• /
• 2011

An underwater robot S/W framework consists of various sub-modules such as sensory data processing module, thruster control module, cognition module and behavior control module. Performance of a robot is determined by not only the efficiency of algorithms used but also effectiveness of their implementations. One most important factor of the effective implementation is the efficiency of data sharing module, as it transmits signals and data between the sub-modules and thus is directly related to the cycles of sensing and control The ideal data sharing module enables immediate access to any data source irrespective of system configurations. In reality, however, there are lots of obstacles including limitation of processing capacity of source modules, delay over network, and scheduling latency of operating systems. The paper proposes a new data sharing architecture and programming models to effectively handle such obstacles in implementation of underwater S/W framework on a small scale distributed computing system.