• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.199-201
• /
• 1998

본 논문에서는 CORBA 분산처리 환경을 갖추기 않은 운영체제 사에서 동작하는 응용들이 CORBA분산환경의 객체 서비스를 이용 가능하도록 하는 통신 플랫폼을 설계하고 구현하였다. CORBA 표준에서는 서로 다른 ORB(Object Request Broker)들간의 상호운용(interoperability)을 위하여GIOP/IIOP(General/Internet Inter-ORB Protocol)프로토콜을 정의하고 있다. 구현된 부산 멀티미디어 플랫폼은 IIOP Engine API를 제공함으로써 Non-CORBA 응용들을 통합하였으며, 디렉토리, 스트림, 파일 서비스 인터페이스를 제공함으로써 분산환경에서 멀티미디어 정보 서비스를 이용할 수 있는 환경을 제공한다.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.225-226
• /
• 2009

최근 센서를 이용한 의료 분야로의 유비쿼터스 시스템 및 서비스 연구가 활발히 진행되고 있다. 그러나 의료 분야 서비스의 기본적 전제인 WBAN 환경에서의 기존의 모니터링 시스템은 매우 수동적이다. 이를 개선해 스트림 데이터에 대해 보다 효율적인 모니터링 시스템을 구축하기 위한, 우선 순위를 표현하기 위한 큐(Queue)와 각 속성에 대한 질의로 구성된 레벨 트리(Level Tree)로 이어지는 질의 색인 구조에 대해 논하고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1525-1530
• /
• 2011

Techniques for processing continuous queries are required to developing the various types of application services (monitoring services) in ubiquitous environment where the real-time data acquisition from a lot of sensors, analysis, and processing are required. In the previous works of the continuous queries, they have represented all of the continuous queries as the interval queries or region queries, and proposed some methods for processing theses queries. The types of continuous queries, however, are very various, and could be presented by combining the attribute conditions, spatial conditions, and temporal conditions. In this paper, I have classify the types of continuous queries, and have proposed the continuous query model which could be presented by combining those conditions. The contributions of this paper include that it proposes the query model representing the continuous queries and suggests future research directions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2B
• /
• pp.352-360
• /
• 2010

Supporting user perceptual QoE-guaranteed IP-based multimedia service such as IPTV and Mobile IPTV, we represent an efficient QoE-aware transport stream assessment schemes to apply realtime mobile IPTV's contents distorted by various network errors such as bandwidth, delay, jitter, and packet loss. This paper proposes in detail an efficient matching and QoE-aware measurement methods. The brightness of the digitized contents per each frames of transport streams is used and applied to reduced-reference method. The hybrid video quality metric is designed by QoE-indicators such as blur, block, edge busyness, and color error. We compare original with processed source to evaluate them in a high precision degree of accuracy.

• Journal of Digital Contents Society
• /
• v.7 no.2
• /
• pp.117-124
• /
• 2006

In ubiquitous computing environment, a user can access their personalized services at anytime, anywhere, through any possible mobile or fixed terminals in a secure way. If the user wants to move to a different location, they need to stop the video play at the current location and makes a new request at the new location. As well, the user needs to manually search for the last frame to be seen at the previous location. In this paper, we proposed an implementation of multimedia contents streaming service mobility by user's location tracking. User can play video seamlessly while moving from one machine to another along the user's moving trail.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.233-241
• /
• 2008

The overlay multicast that has been recently presented as an alternative for the IP multicast needs scheduling method that can apply the system resource and the network bandwidth for the many users. We propose a efficient overlay multicasting network policy for multimedia services with composite stream service topology. And in order to evaluate the ability of the proposed scheme's performance, We test the performance of multi_casting nodes with RTT values, the bandwidth attrition rate for building the network topology and MOR effects with Overcast[5] The result of simulation shows improves about $8{\sim}20%$ of performance.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.208-215
• /
• 2003

For playing a multimedia presentation in a Internet, the case that the presentation QoS(Quality of Services) at a destination nay be different from the QoS of multimedia data at the source occurs frequently. In this case, the process of trancoding the multimedia data at the source Into the multimedia data satisfying the QoS at the destination should be requited. In addition, even the presentation description having the homogeneous QoS at both sides may have different transcoding paths due to the limitation of display terminals or network bandwidth. That is, for a multimedia description, it is required to regenerate a proper transcoding path whenever the displaying terminals or the network environment gets decided. And the delay time required to go through the transcoding path may affect the playability of the give presentation. Therefore it should be checked whether the presentation requiring a transcoding process is able to be played in a real time. In this paper, the algorithm for generating all the possible transcoding paths for a given multimedia description under a fixed set of transcoders and the network environment is proposed. The algorithm adopts the concept of QoS transition diagram to Prevent from a trancoding Path being cycled by the repetition of a cyclic Path which generates the same QoS of multimedia data as its input QoS. By eliminating all the cyclic Paths, the algorithm can guarantee the termination of the process. And for the playability check, a method of computing the transcoding time and the delay lime between logical data units are proposed.Finally all the proposed methods were implemented in the stream engine, called TransCore and the presentation-authoring tool, called VIP, we had developed. And the test results with sample scenarios were presented at the last.

• Journal of Satellite, Information and Communications
• /
• v.8 no.4
• /
• pp.21-25
• /
• 2013

The dual-stream based stereoscopic 3D HDTV broadcasting service was launched recently. Although the dual-stream based HDTV service has been successfully provided, the 3D HDTV broadcasting system requires more bandwidth efficient transmission schemes because it should convey both left and right HD resolution images simultaneously in the finite 6MHz bandwidth. In this paper, we consider more advanced ATSC transmission schemes that use higher modulation such as 16-QAM and concatenated RS code and block LDPC codes. Compared with conventional ATSC system and the modified ATSC system in [2], the proposed system has about 2.97dB and 1.12dB SNR gain at the payload data rate of 19.44Mbps compared with the existing ATSC system and the modified ATSC system [2]. Also, the proposed scheme requires only 1.05dB power increase for the 3D HDTV service, which is reasonable SNR increase value and applicable to the advanced 3D high definition broadcasting realization in limited 6MHz bandwidth.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.