• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.5
• /
• pp.285-290
• /
• 2012

In this paper, we propose a fast encoding algorithm for scalable video encoding without compromising coding performance. Through analysis on multiple motion estimation processes performed at the enhancement layer, we show redundant motion estimations and suggest the condition under which the redundant ones can efficiently be determined without additional memory. Based on the condition, the redundant motion estimation processes are excluded in the proposed algorithm. Simulation results show that the proposed algorithm is faster than the conventional fast encoding method without performance degradation and additional memory.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.352-354
• /
• 2005

As further Studies on 4th generation mobile telecommunication are progressed, the importance of a Cross-Layer is being increased. However, it has focused on coordination model only between MAC layer and PHY layer. It is necessary to expand into II' layer and upper layers. In this paper, we introduce a Cross-layer optimization which can be used to transmit video data with effect by managing resources among layers. It can gives further more adaptive method to solve QoS model problem than single layer.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.402-405
• /
• 2003

본 논문은 인터넷에서 실시간 서비스를 효과적으로 지원하면서도 망의 확장성을 제공하는 방법을 제안하였다. 이를 위해 코어노드에서 각 플로우의 상태 정보를 관리하지 않는 SCORE (Scalable CORE) 네트워크 모델 [1]과 종단간 딜레이 보장이 우수한 QoS (Qualify of Service) 스케줄링 방법중 하나인 WF²Q+ (Worst-case Fair weight Fair Queuing+) [2]에 대해서 기술하고 구현하였다. 이러한 개념을 바탕으로 새로운 망의 구조를 제안하였으며 시뮬레이션을 통한 성능분석을 수행하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.105-107
• /
• 1999

최근 컴퓨터와 제반 기술들의 눈부신 발달로 인해 대용량의 멀티미디어 데이터를 다루는 서비스들이 많이 등장하고 있다. 주문형 비디오 서비스(Video on Demand)가 가장 대표적인 예라고 할 수 있으며, 이를 구현하기 위한 많은 방법들이 제안되고 있다. 본 논문에서는 현재까지 개발되어 있는 VoD 시스템에 관하여 살펴보고, 이를 기반으로 PASS(Parallel and Scalable Server) VoD 시스템을 제안한다. PASS VoD 시스템은 병렬 비디오 서버로서 SAN(System Area Network)로 연결된 independent proxy 구조와 비슷한 구조를 가지는 시스템이다. 본 논문에서는 PASS VoD 시스템에 대하여 설명하고 PASS VoD 시스템이 scalable 함을 시뮬레이션을 통하여 확인하였다.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.113-116
• /
• 2002

It is required to network to make more intelligent packet processing and forwarding for increasing bandwidth and various services. Classification provides these intelligent to network which is acquired by increasing number of rules in classification rule set. In this Paper, we propose a classification algorithm efficient to scalable rule set ahead as well as Present small rule set. This algorithm has competition to existing methods by performance and advantage that it is mixed with another algorithm because il does not change original shape of rule set.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.3
• /
• pp.77-83
• /
• 2000

This paper presents a new modular multiplier for Montgomery multiplication using iterative small carry save adder. The proposed multiplier is more flexible and suitable for long bit multiplication due to its scalable property according to design area and required computing time. We describe the word-based Montgomery algorithm and design architecture of the multiplier. Our analysis and simulation show that the proposed multiplier provides area/time tradeoffs in limited design area such as IC cards.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.441-450
• /
• 2008

The scalable extension of H.264, known as scalable video coding (SVC) has been the main focus of the Joint Video Team's work and was finalized at the end of 2007. Synchronization between media is an important aspect in the design of a scalable video streaming system. This paper proposes an efficient media synchronization mechanism for SVC video transport over IP networks. To support synchronization between video and audio bitstreams transported over IP networks, a real-time transport protocol/RTP control protocol (RTP/RTCP) suite is usually employed. To provide an efficient mechanism for media synchronization between SVC video and audio, we suggest an efficient RTP packetization mode for inter-layer synchronization within SVC video and propose a computationally efficient RTCP packet processing method for inter-media synchronization. By adopting the computationally simple RTCP packet processing, we do not need to process every RTCP sender report packet for inter-media synchronization. We demonstrate the effectiveness of the proposed mechanism by comparing its performance with that of the conventional method.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.227-234
• /
• 2001

In this paper we propose a block-type parallel preconditioner for solving large sparse nonsymmetric linear systems, which we expect to be scalable. It is Multi-Color Block SOR preconditioner, combined with direct sparse matrix solver. For the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with Multi-Color ordering. Since most of the time is spent on the diagonal inversion, which is done on each processor, we expect it to be a good scalable preconditioner. We compared it with four other preconditioners, which are ILU(0)-wavefront ordering, ILU(0)-Multi-Color ordering, SPAI(SParse Approximate Inverse), and SSOR preconditiner. Experiments were conducted for the Finite Difference discretizations of two problems with various meshsizes varying up to $1025{\times}1024$. CRAY-T3E with 128 nodes was used. MPI library was used for interprocess communications, The results show that Multi-Color Block SOR is scalabl and gives the best performances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3096-3117
• /
• 2013

To execute the performance driven Grid applications, an effective and scalable workflow scheduling is seen as an essential. To optimize cost & makespan, in this paper, we propose a Scalable Cost-Time Trade-off (SCTT) model for scheduling workflow tasks. We have developed a heuristic algorithm known as Scalable Cost-Time Trade-off Scheduling (SCTTS) with a lower runtime complexity based on the proposed SCTT model. We have compared the performance of our proposed approach with other heuristic and meta-heuristic based scheduling strategies using simulations. The results show that the proposed approach improves performance and scalability with different workflow sizes, task parallelism and heterogeneous resources. This method, therefore, outperforms other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2268-2283
• /
• 2013

Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.