• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.911-920
• /
• 2004

Intensive studies have been made in the area of VOD server. Multimedia files in the VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Bu11er size and disk bandwidth. we propose a efficient user-grouping policy for multi-casting services with dynamic monitoring and management of VOD sever resources. Simulation results show that the rate of buffer usage and QOS change of proposed scheme are about 23% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1601-1614
• /
• 1997

In this paper, We suggest a technique for delivering frame(CM transfering unit) based CM data streams from MOD servers to clients on ATM-LAN environment. The term 'frame' indicates the CM transferring unit. In detail, each clients try to adapt native ATM-specific service which can be connected directly from application layer to AAL without convening transport and IP layer. Also, we suggest and show result of implementation about transparent browsing mechanism using navigation server, session setting procedures using PVC between server and clients, application, AAL and QoS negotiation and reservation procedure, splitting and reassembling algorithm for frames over MTU size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1652-1660
• /
• 1999

One of the most important goals in VOD servers is to provide services to more clients with services which clients request. In order to provide service efficiently and rapidly, though considering a few of policies, efficient placement of data when they are stored is direct cause to improve efficiency of retrievals. In this paper, we propose a efficient placement policy, encoded video data being stored in clustered VOD servers. In the proposed placement policy, partitioning a large disk array into smaller disk groups which consists of a few of disks with similar performances, specially disk I/O bandwidth. In last chapter, we compare proposed placement policy with conventional policies, and show the results of improved performances with proposed policy.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.293-298
• /
• 2004

To satisfy the requirements for QoS and acceptance ratio of the users using multimedia content service, it is required to control mechanism for QoS assurance and allocation of the stream server' resources based on CoS(Class of Service). To compare performance of the algorithm, we have classified the user by two classes (super class, base class) and control the acceptance ratio of user's requests by user's class information. We have experimented the test of network resources and test of processing time under server/client environment and agent environment. MA-URFA based on agent increases the acceptance ratio of super class and utilization ratio of network resources.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.95-105
• /
• 2005

This paper proposes a new dynamic video adaptation scheme that could generate an adapted video stream customized to the requesting mobile device and current network status without repeated decode-encode cycles. In the proposed adaptation scheme, the characteristics of the video codec such as MPEG-1/-2/-4 are analyzed in advance focused on the relationships between the size and Quality of the encoded video stream, and they are stored in the proxy as a codec-dependent characteristic table. When a mobile device requests a video stream, it is dynamically decoded-encoded in the proxy with the highest quality to extract the contents-dependent attributes of the requested video stream. By comparing these attributes with codec-dependent characteristic table, the size and Quality of the requested video stream when being adapted to the target mobile device could be predicted. With this prediction, a version of adapted video stream, that meets the size constraints of mobile device while keeping the quality of encoded video stream as high as possible, could be selected without repeated decode-encode cycles. Experimental results show that the errors in our proposed scheme are less than 5% and produce an appropriate adapted video stream very quickly. It could be used t(1 build a proxy server for mobile devices that could quickly transcode the video streams widely spread in Internet which are encoded with various video codecs.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.507-514
• /
• 2001

In VOD(Video-on-Demand) system, the real-time interactive service is one of the most important factor to determine the degree of QoS(Quality of Service). In this paper, we propose the head-end system consisted of switching agent and head-end node, which needs to receive the only video stream for multiple users which have requested the same video, to serve the unlimited interactive service which has no service delay and block. The unlimited VCR services can be served by storing the video stream with buffer at client and head-end node. And the proposed algorithm presents the method to enhance the efficiency by buffer, offer the true interactive VOD services to users because all of service requested by clients are processed immediately. In this paper, we implemented the VOD system which has the VCR functions without service delay and block. Simulation results indicate that the proposed algorithm has better performance in the number of service request and time interval.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.361-368
• /
• 2004

This paper proposes an interactive VOD system to serve truly interactive VCR services using multicast delivery, client buffer and web-caching technique which implements the distributed proxy in Head-End- Network(HNET). This technique adopts some caches in the HNET that consists of a Switching Agent(SA), some Head-End-Nodes(HEN) and many clients. In this model, HENs distributively store the requested video under the control of SA. Also, client buffer dynamically expands to support various VCR playback rate. Thus, interactive services are offered with transmitting video streams from network, HENs and stored streams on buffer. Therefore this technique makes the load of network occur In the limited area, minimizes the additional channel allocation from server and restricts the transmission of duplicated video contents

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.87-93
• /
• 2015

Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.43-49
• /
• 2004

SIP Caller Preference is an useful function that allows a caller to express preferences about request handling in servers. It can also feat appropriate call processing according to the callee capabilities. However, only the category of the media is considered as a criteria for target selection in the caller preference. In this case, if the callee's media information such as codec is different from the caller, an additional re­negotiation occurs for SIP call setup. Therefore, in this paper, we have suggested an extended caller preference to solve this problem. In our SIP based VoIP system, a network sewer uses detailed media informations for media stream in the session to select the target for SIP call setup. The sewer gives higher priority to the candidate which do not require re-negotiation for call setup, so that an effective call setup can be achieved in our system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.145-152
• /
• 2010

With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, RTLS(Real-Time Locating Services) dealing with spatio-temporal data is emerging as a promising technology. For these reasons, the ISO/IEC published the RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and implemented Spatio-temporal Query Processing Systems for efficiently managing and searching the incoming Spatio-temporal data stream of moving objects. Spatio-temporal Query Processing Systems's spatio-temporal middleware maintains interoperability among heterogeneous devices and guarantees data integrity in query processing through real time processing of unceasing spatio-temporal data streams and two way synchronization of spatio-temporal DBMSs. Web Server uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatio-temporal middleware. Finally, this thesis proved the utility of the system by applying the spatio-temporal Query Processing Systems to a real-time Locating Services.