• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.63-66
• /
• 1998

Recently, a study of Virtual-Reality becomes active. Expectation to 3-D reproduction technology rises with it. Electro-holography using Spatial-light-modulator attracts attention, because natural 3-D animated image is provided. It is important to execute hologram calculation at high speed to realize the real time electro-holography. In other words, a higher-speed computer and a study of calculation algorithm becomes an important subject. This time, we realized to fast calculation of Fresnel-Hologram by networking technology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4087-4107
• /
• 2016

The current cloud computing paradigm is still vulnerable to a significant number of system failures. The increasing demand for fault tolerance and resilience in a cost-effective and device-independent manner is a primary reason for creating an effective means to address system dependability and availability concerns. This paper focuses on online failure prediction for cloud computing systems using system runtime data, which is different from traditional tolerance techniques that require an in-depth knowledge of underlying mechanisms. A 'failure prediction' approach, based on Cloud Theory (CT) and the Hidden Markov Model (HMM), is proposed that extends the HMM by training with CT. In the approach, the parameter ω is defined as the correlations between various indices and failures, taking into account multiple runtime indices in cloud computing systems. Furthermore, the approach uses multiple dimensions to describe failure prediction in detail by extending parameters of the HMM. The likelihood and membership degree computing algorithms in the CT are used, instead of traditional algorithms in HMM, to reduce computing overhead in the model training phase. Finally, the results from simulations show that the proposed approach provides very accurate results at low computational cost. It can obtain an optimal tradeoff between 'failure prediction' performance and computing overhead.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.548-558
• /
• 2014

Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4552-4567
• /
• 2014

A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.183-186
• /
• 2005

WUSB is a new technology which combines the speed and the security of wired USB with the easy use of wireless technology. In this paper, GUI for WUSB is designed and implemented to show the connectivity and contents of the WUSB devices. Also, the proposed GUI shows the log window while content transfers occur between the host and device. The proposed GUI can be used for various wireless technologies which provide wireless function with existing USB hosts and devices.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.475-479
• /
• 2006

In Korea, we witness vivid evidences of changing trend in communication that insist the emergence of new networking architecture. To accommodate the changing trend and to hold current strong position in global IT industry, Korea have launched broadband convergence network (BcN) initiative. BcN vision for Korea is to be the first in the world to realize converged network infrastructure and ubiquitous service environment. In this paper, we have introduced the concept and the vision of BcN with a viewpoint of a new paradigm to prepare future-proof communication environment. And then, we have disclosed BcN research and development (R&D) activities including R&D philosophy, R&D phases, and key technologies required. Also, we have discussed current development issues in three technology branches including service and control technology, unified transport technology, and next-generation access technology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1661-1678
• /
• 2016

Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1466-1470
• /
• 2016

As individuals create many contents anytime and anywhere together with the widespread dissemination of smart devices as well as various social networking services (SNS), content centric networking (CCN) has regarded as a new networking technology. However, CCN is exposed to malicious attacks on the mobility management of mobile content sources during handover and high volume of control messages. Therefore, this paper presents a secure duplicate name detection (SecureDND) mechanism without additional control messages by signed information and secure token. It is shown from the performance evaluation that the proposed scheme can provide low control overhead, which results in the network scalability.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.401-407
• /
• 2007

This paper proposes the ethernet-based in-vehicle networking method for "body" and "multimedia" domains. The ethernet-based in-vehicle networking method should modify the topology and the layer 2 for traffic shaping. In this paper, we simulate the two ring networking systems, the Media Oriented Systems Transport (MOST) and the proposed system with the shaping by the network simulator 2 and evaluate each performance. In addition, we demonstrate the proposed networking system to exchange two kinds of traffic, i.e., QoS data and best-effort data, on the ring network constituting of three nodes. Finally this paper expects to substitute the ethernet-based in-vehicle network for the MOST in advance.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.