• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.729-736
• /
• 2003

With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.

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

Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes cannot adequately manage to balance parallel tasks generated from a single application. Dynamic loop scheduling methods are known to be useful in balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for the relatively small number of processors in a network of workstations because of order-of-magniture differences in communication overheads. Moreover, improvements of basis loops scheduling methods have not effectively dealt with irregularly distributed workloads in parallel loops, which commonly occur in applications for a network of workstation. In this paper, we present a new reconfigurable and decentralized balancing method for parallel loops on a network of workstations. Since our method supplements performance balancing with those tranditional load balancing methods, it minimizes the overall execution time.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5C
• /
• pp.519-533
• /
• 2006

The number of channels specified in IEEE 802.15.4 Low-Rate Wireless Personal Area Networks(LRWPANs) is too few to operate many applications of WPANs in the same area. To overcome this limit, we introduce Virtual Channel, a novel concept to increase the number of available channels when various WPAN applications coexist. Basically, a virtual channel is a newly-created channel via superframe scheduling within the inactive period of a logical channel preoccupied by other WPANs. To maximize the coexistence capability of WPANs using virtual channels, we propose Least Collision superframe scheduler(LC-scheduler), its less complex heuristics both for a given single channel, and Virtual Channel Selector(VCS) to efficiently manage multiple available logical channels. In addition, a simple but practical synchronization method is developed to compensate different time drifts among coexisting WPANs. The simulation results demonstrate that a remarkable improvement on the coexistence capability of the 802.15.4 can be achieved through the proposed schemes.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2009.10a
• /
• pp.75-80
• /
• 2009

Despite its flexibility to complex geometry, three-dimensional (3D) electromagnetic(EM) modeling schemes using finite element method (FEM) have been faced to practical limitation due to the resulting large system of equations to be solved. An efficient 3D FEM modeling scheme has been developed, which can adopt either direct or iterative solver depending on the problems. The direct solver PARDISO can reduce the computing time remarkably by incorporating parallel computing on multi-core processor systems, which is appropriate for single frequency multi-source configurations. When limited memory, the iterative solver BiCGSTAB(1) can provide fast and stable convergence. Efficient 3D simulations can be performed by choosing an optimum solver depending on the computing environment and the problems to be solved. This modeling includes various types of controlled-sources and can be exploited as an efficient engine for 3D inversion.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.12
• /
• pp.142-149
• /
• 2015

Most of the mono-camera based lane detection systems are fragile on poor illumination conditions. In order to compensate limitations of single sensor utilization, lane information fusion system using multiple lane sensors is an alternative to stabilize performance and guarantee high precision. However, conventional fusion schemes, which only concerns object detection, are inappropriate to apply to the lane information fusion. Even few studies considering lane information fusion have dealt with limited aids on back-up sensor or omitted cases of asynchronous multi-rate and coverage. In this paper, we propose a lane information fusion scheme utilizing multiple lane sensors with different coverage and cycle. The precise lane information fusion is achieved by the proposed fusion framework which considers individual ranging capability and processing time of diverse types of lane sensors. In addition, a novel lane estimation model is proposed to synchronize multi-rate sensors precisely by up-sampling spare lane information signals. Through quantitative vehicle-level experiments with around view monitoring system and frontal camera system, we demonstrate the robustness of the proposed lane fusion scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5537-5555
• /
• 2017

Having the characteristics of unlinkability, anonymity, and unforgeability, blind signatures are widely used for privacy-related applications such as electronic cash, electronic voting and electronic auction systems where to maintain the anonymity of the participants. Among these applications, the blinded message is needed for a certain purpose by which users delegate signing operation and communicate with each other in a trusted manner. This application leads to the need of proxy blind signature schemes. Proxy blind signature is an important type of cryptographic primitive to realize the properties of both blind signature and proxy signature. Over the past years, many proxy blind signature algorithms have been adopted to fulfill such task based on the discrete logarithm problem (DLP) and the elliptic curve discrete log problem (ECDLP), and most of the existing studies mainly aim to provide effective models to satisfy the security requirements concerning a single blinded message. Unlike many previous works, the proposed scheme applies the signcryption paradigm to the proxy blind signature technology for handling multiple blinded messages at a time based on elliptic curve cryptography (ECC). This innovative method thus has a higher level of security to achieve the security goals of both blind signature and proxy signature. Moreover, the evaluation results show that this proposed protocol is more efficient, consuming low communication overhead while increasing the volume of digital messages compared to the performance from other solutions. Due to these features, this design is able to be implemented in small low-power intelligent devices and very suitable and easily adoptable for e-system applications in pervasive mobile computing environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2042-2051
• /
• 1998

VBR compressed, pre-recorded video is known to exhibit significant, multiple time-scale bit rate variability. To reduce the variability and burstiness of the aggregated transmission rate as low as possible, in this paper, we present an adaptive bandwidth smoothing algorithm, that can be effectively applicalble for VoD services over a shared-medium channel. For these environments where many clients are connected to a single server, by introducing the conventional MVBA(minimum variability bandwidth allocation) algorithm and controlling adaptively the conventional MVBA(minimum variability bandwidth asllocation) algorithm and controlling adaptively the aggregated transmission rate whenever a new clients request is arrived at the server side, the proposed algorithm effectively reduces the burstiness and variability of the aggregated transmission rate. Through computer experiments, it is shown that the proposed method perporms better than the convertional non-aggregated bandwidth smoothing schemes in terms of the peak rate, standard deviation, number of rate changes for the aggregated traffic.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.5
• /
• pp.248-254
• /
• 2001

The traction power demand highly varies with time and train positions and the traction load is a large-capacity current at single phase converted from 3-phase power system. Subsequently, each phase current converted from 3-phase power system cannot be maintained in balance any longer and thus the traction load can bring about imbalance in three-phase voltage. Therefore, the exact assessment of voltage unbalance must be carried out preferentially as well as load forecast at stages of designing and planning for electric railway system. The evaluation of unbalance voltage in areas, such as electric railway depots should be a prerequisite with more accuracy. The conventional researches on voltage unbalance have dealt with connection schemes of the transformers used in ac AT-fed electric railroads system and induced formulas to briefly evaluate voltage unbalance in the system(3). These formulas are still being used widely due to their easy applicabilities on voltage unbalance evaluation. Meanwhile, they don't take into account detailed characteristics of ac AT-fed electric railroads system, being founded on some assumptions. Accordingly. accuracy still remains in question. This paper proposes a new method to more effectively estimate voltage unbalance index. In this method, numerous diverted circuits in electric railway depots are categorized in three components and each component is defined as a two-port network model. The equivalent circuit for the entire power supply system is also described into a two-port network model by making parallel and/or series connections of these components. Efficiency and accuracy in voltage unbalance calculation as well can be promoted by simplifying the circuits into two-port network models.

• The Journal of the Korea Contents Association
• /
• v.13 no.9
• /
• pp.28-38
• /
• 2013

During the past decades, the B+-tree has been most widely used as an index file structure for disk-resident databases. For the disk based B+-tree, a node update can be cheaply performed just by modifying its associated disk page in place. However, in case that the B+-tree is stored on flash memory, the traditional algorithms of the B+-tree come to be useless due to the prohibitive cost of in-place updates on flash memory. For this reason, the earlier schemes for flash memory B+-trees usually take an approach that saves B+-tree changes from real-time updates into extra temporary storage. Although that approach can easily prevent frequent in-place updates in the B+-tree, it can suffer from a waste of storage space and prolonged search times. Particularly, it is not allowable to process range searches on the leaf node level. To resolve such problems, we devise a new scheme in which the leaf nodes and their parent node are stored together in a single flash block, called the p-node block.