• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.765-774
• /
• 2013

In this paper, we present a cooperative compressed spectrum sensing scheme for correlated signals in decentralized wideband cognitive radio networks. Compressed sensing is a signal processing technique that can recover signals which are sampled below the Nyquist rate with high probability, and can solve the necessity of high-speed analog-to-digital converter problem for wideband spectrum sensing. In compressed sensing, one of the main issues is to design recovery algorithms which accurately recover original signals from compressed signals. In this paper, in order to achieve high recovery performance, we consider the multiple measurement vector model which has a sequence of compressed signals, and propose a cooperative sparse Bayesian recovery algorithm which models the temporal correlation of the input signals.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2637-2642
• /
• 2015

The low-density parity check(LDPC) code is being widely used due to its outperformed error-correction ability. The decoder of the quasi-cyclic LDPC(QC-LDPC) codes, a kind of LDPC codes, requires a multi-size cyclic shifter(MSCS) performing rotation of various sizes. The MSCS can be implemented with a Benes network, which requires a $3{\times}3$ switch if the number of data to be rotated is a multiple of 3. This paper proposes a control signal generation with lower complexity and a faster $3{\times}3$ switch. For the experiment, the proposed schemes are applied to the MSCS of an IEEE 802.16e WiMAX QC-LDPC code decoder. The result shows that the delay is reduced by about 8.7%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.549-560
• /
• 2001

Cluster system provides attractive scalability in terms of compution power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive MPPs (massively parallel processors). Load balancing is very important issue since an inappropriate scheduling of tasks cannot exploit the true potential of the system and can offset the gain from parallelization. In parallel processing program, it is difficult to predict the load of each task before running the program. Furthermore, tasks are interdependent each other in many ways. The dynamic load balancing algorithm, which evaluates each processor's load in runtime, partitions each task into the appropriate granularity and assigns them to processors in proportion to their performance in cluster systems. However, if the communication cost between processing nodes is expensive, it is not efficient for all nodes to attend load balancing process. In this paper, we restrict a processor that attend load balancing by the communication cost and the deviation of its load from the average. We simulate various models of the cluster system with parameters such as communication cost, node number, and range of workload value to compare existing load balancing methods with the proposed dynamic algorithms.

• KNOM Review
• /
• v.21 no.2
• /
• pp.26-34
• /
• 2018

With the proliferation of cloud computing and services, the internet traffic and the demand for better quality of service are increasing. For this reason, server virtualization and network virtualization technology, which uses the resources of internal servers in the data center more efficiently, is receiving increased attention. However, the existing hardware Test Access Port (TAP) equipment is unfit for deployment in the virtual datapaths configured for server virtualization. Virtual TAP (vTAP), which is a software version of the hardware TAP, overcomes this problem by duplicating packets in a virtual switch. However, implementation of vTAP in a virtual switch has a performance problem because it shares the computing resources of the host machines with virtual switch and other VMs. We propose a vTAP implementation technique based on the extended Berkeley Packet Filter (eBPF), which is a high-speed packet processing technology, and compare its performance with that of the existing vTAP.

• Journal of Digital Convergence
• /
• v.19 no.3
• /
• pp.211-216
• /
• 2021

Information from various heterogeneous devices is steadily increasing in distributed cloud environments. This is because high-speed network speeds and high-capacity multimedia data are being used. However, research is still underway on how to minimize information errors in big data sent and received by heterogeneous devices. In this paper, we propose a deep learning-based asymmetric storage management technique for minimizing bandwidth and data errors in networks generated by information sent and received in cloud environments. The proposed technique applies deep learning techniques to optimize the load balance after asymmetric hash of the big data information generated by each device. The proposed technique is characterized by allowing errors in big data collected from each device, while also ensuring the connectivity of big data by grouping big data into groups of clusters of dogs. In particular, the proposed technique minimizes information errors when storing and managing big data asymmetrically because it used a loss function that extracted similar values between big data as seeds.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.7
• /
• pp.17-26
• /
• 2016

This work proposes a 12b 60MS/s 0.18um CMOS Flash-SAR ADC for various systems such as wireless communications and portable video processing systems. The proposed Flash-SAR ADC alleviates the weakness of a conventional SAR ADC that the operation speed proportionally increases with a resolution by deciding upper 4bits first with a high-speed flash ADC before deciding lower 9bits with a low-power SAR ADC. The proposed ADC removes a sampling-time mismatch by using the C-R DAC in the SAR ADC as the combined sampling network instead of a T/H circuit which restricts a high speed operation. An interpolation technique implemented in the flash ADC halves the required number of pre-amplifiers, while a switched-bias power reduction scheme minimizes the power consumption of the flash ADC during the SAR operation. The TSPC based D-flip flop in the SAR logic for high-speed operation reduces the propagation delay by 55% and the required number of transistors by half compared to the conventional static D-flip flop. The prototype ADC in a 0.18um CMOS demonstrates a measured DNL and INL within 1.33LSB and 1.90LSB, with a maximum SNDR and SFDR of 58.27dB and 69.29dB at 60MS/s, respectively. The ADC occupies an active die area of $0.54mm^2$ and consumes 5.4mW at a 1.8V supply.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.105-119
• /
• 2006

The car navigation system to be accompanied to the car on-board equipment system or the development of mobile communication technique, the demand in information communication which connects an interior and the car outside is coming to be high, As applications, ETC/VISC/AHS classes get deceived supply are advanced. The research of DSRC radio systems actively, with medium of communication between the automobile and road, is advanced. DSRC radio systems are appropriate in massive data transfer, in the case which the traffic accident evasion is urgent, the notarization of the preferential control function which is necessary to a medium of communication, guarantee and security are suitable in the high-speed network. Accompanied to the cellular phone which is to be supplied recently suddenly, By complementing and coexisting each other, and it will be developed simultaneously. However, in a connection of this kind of communication system and high-speed DSRC radio system, Hand-over technique (network, radio transmission hand-over), there is a technical subject of the high-speed transmission techniques against the mobile devices and the realization is expected to be difficult in near, until 2010 year is becoming the plan of putting to practical use. Also as the next generation DSRC with 5.8GHz built-on board equipment and the road-side equipment are expected in near. In this paper DSRC systems which will be developed are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.954-961
• /
• 2010

Stream cipher was worse than block cipher in terms of security, but faster in execution speed as an advantage. However, since so far there have been many algorithm researches about the execution speed of block cipher, these days, there is almost no difference between them in the execution speed of AES. Therefore an secure and fast stream cipher development is urgently needed. In this paper, we propose a 32bit output fast stream cipher, AA32, which is composed of ASR(Arithmetic Shifter Register) and simple logical operation. Proposed algorithm is a cipher algorithm which has been designed to be implemented by software easily. AA32 supports 128bit key and executes operations by word and byte unit. As Linear Feedback Sequencer, ASR 151bit is applied to AA32 and the reduction function is a very simple structure stream cipher, which consists of two major parts, using simple logical operations, instead of S-Box for a non-linear operation. The proposed stream cipher AA32 shows the result that it is faster than SSC2 and Salsa20 and satisfied with the security required for these days. Proposed cipher algorithm is a fast stream cipher algorithm which can be used in the field which requires wireless internet environment such as mobile phone system and real-time processing such as DRM(Digital Right Management) and limited computational environments such as WSN(Wireless Sensor Network).

• Journal of the Korean Society for Railway
• /
• v.19 no.4
• /
• pp.539-546
• /
• 2016

It is over 12 years since the launch of Korea Train eXpress (KTX) services. Demand for the KTX has been on the increase continuously but few studies have been produced related to this phenomenon. KTX passenger demand has been constantly increasing due to influencing factors such as the expansion of network, rise of oil prices, etc. In this study, our main focus is to verify that there are other types of elements that are causing an increase in KTX demand; our approach looks at changes in social and psychological aspect that have occurred due to the reduction of travel time and cost, as well as the imposition of a five-day workweek. In other words, we considered diffusion theory in the marketing area, which affects product selection and purchasing attitudes, as a key factor that is causing passenger demand to increase. That is to say that it is hypothesized that the demand for travel on the KTX has increased due to the train's utility, which is spread by the diffusion effect Therefore, the Bass diffusion model was applied to explain the dramatic increase in KTX passenger demand. Based on this foundation, it was also discussed how certain marketing strategies that incorporate the diffusion effect should be considered variously for sustainable management of rail transportation, while considering a steady passenger demand.