• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.365-368
• /
• 2001

현재 운용중인 NTSC송신시스템을 근거로 가까운 장래에 설치되어 운용될 8-VSD DTV전송시스템의 재원을 설계한다. 먼저 아나로그 NTSC와 디지털 8-VSH DTV의 지상파 방송의 경우 최적의 수신전계를 유지할 수 있는 조건을 검토하고, Longley-Rice의 전계강도 산출법을 이용해서 수신을 위한 최소한의 전계강도의 임계값을 산출한다 8-VSH DTV전송은 NTSC 6MHz대역에서 HDTV가 가능하도록 19.39Mbps의 데이타를 고속으로 전송하는데 그 목표fmf 두고 있으므로 무엇보다 송 · 수신점 사이의 전계강도의 최적화는 중요한 문제이므로 8-VSB DTV전송은 NTSC 서비스 커버리지에 비하여 확장되거나 효율적이어야만 한다. 본 연구에서는 산출결과 NTSC가 8-VSH DTV와 동일한 서비스 커버리지를 유지하기 위하여 NTSC VHF에서 DTV UHF로 전환시 필요한 송신출력과 NTSC UHF에서 DTV UHF로의 전환시 필요한 송신출력을 산출한다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1157-1163
• /
• 2005

In this paper, an efficient and fast method to segment a video in the MPEG(motion picture expert group) video stream is proposed. For the real time processing of large amount of broadcasting data, we use DC images of I-frames in an MPEG compressed video with minimal decoding. Using the modified histogram comparison which counts on not only luminance but also chrominance information, the scene change detection was performed in the fast and accurate way Also, to discriminate anchorperson frame from non-anchor frame, a neural network method was introduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.334-336
• /
• 2001

멀티캐스트를 이용하는 각종 서비스가 증가하고 그중 파일 전송 서비스, 인터넷 방송 등과 같은 응용서비스는 신뢰성 있는 멀티캐스트를 요구한다. 현재의 IP 멀티캐스트 서비스의 특성상 신뢰성 있는 멀티캐스트를 하기 위해서 신뢰전송 프로토콜이 필요하다. 이러한 방법가운데 계층적 트리를 구축하여 신뢰성을 보장하려는 노력이 활발하게 진행되고 있다. 본 논문에서는 라우터 지원방식을 제공하여 멀티캐스트 서비스에서 효율적으로 신뢰성을 보장하는 방법을 제안한다. 기존의 라우팅 지원방식이 복잡한 라우터 기능을 요구하는 반면 제안하는 방법은 간단하게 메시지 타입만 검사하여 네트워크 토폴로지와 병합하는 제어한다. 이로써 링크간의 불필요한 중복데이타를 줄이고 효율적인 링크사용을 통하여 신뢰성 보장의 효율성을 높일 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.326-336
• /
• 2006

Due to the evolution of wired and wireless communication technologies and the Internet, multimedia services such as Internet broadcast and VOD have been prevalent recently. RTP is designed to be suitable for transmission of real-time multimedia data on the Internet by IETF While a variety of applications have utilized different RTPs implemented as a library, embeddedRTP is RTP-based kernel-level protocol that resolved performance issues of this kind of RTPs. This paper proposes the ExtendedERTP protocol based on existing embeddedRTP. This new protocol resolves a couple of issues such as packet processing overhead and buffer requirement and combines its APIs with BSD socket APIs which have been widely utilized in network applications. This paper demonstrates that this integration makes it possible to transmit real-time multimedia data through the accustomed interface of BSD socket APIs with nominal extra overhead. This paper also proposes a scheme for improving packet processing time by 15$\sim$20% and another scheme for reducing memory requirement for packet processing to about 3.5%, comparing with those of embeddedRTP.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.4
• /
• pp.150-157
• /
• 2008

This paper presents a design and implementation of realtime video player that operates on a tiled-display system consisting of multiple PCs to provide a very large and high resolution display. In the proposed system, the master process transmits a compressed video stream to multiple PCs using UDP multicast. All slaves(PC) receive the same video stream, decompress, clip their designated areas from the decompressed video frame, and display it to their displays while being synchronized with each other. A simple synchronization mechanism based on the H/W clock of each slave is proposed to avoid the skew between the tiles of the display, and a flow-control mechanism based on the bit-rate of the video stream and a pre-buffering scheme are proposed to prevent the jitter The proposed system is implemented with Microsoft DirectX filter technology in order to decouple the video/audio codec from the player.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.394-400
• /
• 2000

The main goal of synchronization is to guarantee exclusive access to shared data and critical sections, and then it makes parallel programs work correctly and reliably. Exclusive access restricts parallelism of parallel programs, therefor efficient synchronization is essential to achieve high performance in shared-memory parallel programs. Many techniques are devised for efficient synchronization, which utilize features of systems and applications. This paper shows the simulation results that existing synchronization methods have inefficiency under CC-NUMA(Cache Coherent Non-Uniform Memory Access) system, and then compares the performance of Freeze&Melt synchronization that can remove the inefficiency. The simulation results present that Test-and-Test&Set synchronization has inefficiency caused by broadcast operation and the pre-defined order of Queue-On-Lock-Bit (QOLB) synchronization to execute a critical section causes inefficiency. Freeze&Melt synchronization, which removes these inefficiencies, has performance gain by decreasing the waiting time to execute a critical section and the execution time of a critical section, and by reducing the traffic between clusters.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.287-296
• /
• 2004

Recently, various location-based services are becoming very popular in mobile environments. In this paper, we propose a new concept of a frequent item set, called “associative class set”, for supporting the location-based service which uses a large quantity of a spatial database in mobile computing environments, and then present a new method for efficiently generating the associative class set. The associative class set is generated with considering the temporal relation of queries, the spatial distance of required objects, and access patterns of users. The result of our research can play a fundamental role in efficiently supporting location-based services and in overcoming the limitation of mobile environments. The associative class set can be applied by a recommendation system of a geographic information system in mobile computing environments, mobile advertisement, city development planning, and client cache police of mobile users.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.253-265
• /
• 2001

본 논문은 이동 컴퓨팅 환경에서 연속 부분 질의의 효과적인 처리를 위한 캐시 관리 방안을 제안한다. 연속 부분 부합 질의란 질의의 결과가 클라이언트의 메모리에 일관성을 유지하면서 지속되는 부분 부합 질의이다. 기존의 이동 환경을 위한 캐시 관리 기법은 레코드 식별자를 기반으로 하는 방법들이다. 하지만, 부분 부합 질의는 데이터의 내용을 기반으로 탐색하는 질의이기 때문에 이러한 레코드 식별자를 기반으로 하는 방법들은 캐시 관리를 효율적으로 할 수 없다. 제안하는 캐시 관리 방안에서는, 이동 클라이언트의 캐시 상태를 프레디킷(predicate)으로 기술하고, 서버가 캐시 관리를 위해 클라이언트에게 방송하는 캐시 무효화 정보, 즉 Cache Invalidation Reports(CIR)을 프레디킷으로 구성한다. 이러한 프레디킷 표현을 사용하여, 일련의 캐시 관리 기법-억지 방법(the brute-force method), 빼기 방법(the subtraction method), 교차 방법(the intersection method)-들을 제안한다. 그리고, 제안하는 방법의 계산 복잡도를 계산한다.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.780-791
• /
• 2003

Caching is a useful technique to improve the response time by reducing contention of requests in mobile computing environments with a narrow bandwidth. in the traditional cache-based systems, to improve the hit ratio has been usually one of main concerns for the time. However, in mobile computing environments, it is necessary to consider the cost of cache miss as well as the hit ratio. In this paper, we propose a new cache replacement strategy in pull-based data dissemination systems. Then, we evaluate performance of the proposed strategy by a simulation approach. The proposed strategy considers both the popularity and the wating time together, so the page with the smallest value of multiplying popularity by waiting time is selected as a victim.