• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.106-108
• /
• 2012

스마트TV는 스마트폰과 달리 가족이 사용하는 디바이스로 인식되고 있다. 그러나 스마트TV도 SNS(Social Networking Service), 웹 서비스 등 가족인 아닌 개인 단위로 사용하는 앱(application)뿐만 아니라 각 개인마다 선호하는 게임을 포함한 앱(application), VOD 리스트, TV 채널 등이 다르다고 볼 수 있다. 그리하여 스마트TV에서도 개인 맞춤형 사용자 인터페이스가 필요하다. 이에 따라 본 논문에서는 스마트TV 환경에서 기존 윈도우 로그인 시스템처럼 개인만의 맞춤형 사용자 인터페이스를 제시한다. 그리하여 각각의 사용자들은 개인만의 환경에서 앱(application)을 실행하거나 TV를 볼 수 있다. 기존 연구되고 있는 채널 네비게이션 기법을 토대로 VOD list, 게임을 포함한 앱(App)을 개인 맞춤형 인터페이스로 보다 편리하게 사용할 수 있는 방법도 제시한다. 채널 네비게이션은 로그인한 각 자신만의 환경에서 사용자가 과거에 시청한 TV 채널을 조사하여 많이 시청한 TV 채널을 보여 주게 한다. 그리하여 보다 자신이 선호하는 채널을 쉽게 시청할 수 있다. 이와 더불어 VOD 리스트와 게임을 포함한 앱(application)을 과거에 시청하거나 사용했던 패턴을 분석하고 선호하는 VOD 리스트와 앱(application)을 예측하여 보여주어 개인의 맞춤형 인터페이스에서 보다 빠르게 접근이 가능하며 편리하게 사용할 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.951-959
• /
• 2001

Video database has the function that stores videos and retrieves the video informations for the service request of users. Therefore, the purpose of the video database is to provide not only an environment both convenient and efficient for retrieving and storing video, but also to serve the requested video informations with rapid startup latency for more users. But, some users of video database as VOD application might tolerate slow startup latency because they would watch video during one hour or two hours. In this paper, we propose the novel policy of the storage system of video database, which serves efficiently the users by considering the classes of the users in video database. The policy admits the random movements of disk heads for urgent user classes but maintains the sequential or restricted movements of disk heads for less-urgent user classes like VOD application in storage system of video database. So, it can not provide only rapid startup latencies for urgent requests but also it can process more service requests in all.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1661-1664
• /
• 2003

The transcoding is a method which converts a multimedia stream to an adaptive format, such as frame rate and resolution, that can be played in the mobile devices. Due to the heavy consumption of CPU power for transcoding, the server in charge cannot supply all streams requested from clients if it is already occupied by several streams. The load balancing among proxies is a common approach for solving such problem. In addition to collaborative works for load balancing, the mobility must be taken into account in the mobile environments. Thus, the wired-network based algorithm is not suitable for the streams service in the mobile environments. In this paper, we propose an alternative scheme for cooperative proxy architecture that considers the case in which mobile devices are moving over other zones.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.323-329
• /
• 2004

New business model for mobile internet has been developed using multifunction mobile terminal. Multifunction terminal provides mobile multimedia service such as VOD and AOD and personal area network(PAN) service using bluetooth and W-LAN. In this paper, we develop home network WEI application interworking with home network gateway This application controls home appliances and provides still image for home secuirt using the web camera. We further develop the home networking PAN services using multifunction terminal having GigBee and RFID.

• IE interfaces
• /
• v.9 no.3
• /
• pp.202-213
• /
• 1996

Video-on-demand is an interactive service that provides programs (movie, home shopping, etc.) to users connected to a network. This service will require high bandwidth network and video servers with a large amount of storage capacity. From the viewpoint of system analysis, there are optimization problems to be solved. In this paper, we present a dynamic programming method for allocating the storage for programs being served in a multi-level video-on-demand network. In the optimization of the network resource, we consider the three kinds of costs: installation cost for video servers, program storage cost, and transmission (or communication) cost. The factors related to the costs are investigated. An example is shown to illustrate the proposed method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.77-80
• /
• 2002

최근 동영상 데이터를 활용한 교육 프로그램, 오락, 인터넷 방송 등의 서비스는 활성화되고 있으나, 중앙 집중형의 서버로 운영을 할 경우 서버의 고용량화, 고성능화가 요구되어 지며, 또한 여러 관련 기관들의 유대관계로 서로 공유할 수 있는 동영상 자료가 요구되어 지므로 이를 분산화 시켜 통합 관리하는 시스템이 필요하다. 이에 디렉토리 서비스의 표준 프로토콜인 LDAP(Light weight Directory Access Protocol)을 이용하여 네트워크 안에 있는 동영상의 자원을 마치 하나의 사이트에 있는 자원처럼 관리하며, 액세스가 가능하도록 하였다. 구현된 시스템은 실시간 전송 프로토콜인 RTO(Real-time Transport Protocol)를 이용하여 클라이언트에게 분산 되어있는 동영상과 동영상 관련 정보를 적절히 서비스하기 위한 시스템 이다.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.797-809
• /
• 2006

To support the QoS streams for large scale clients, the internal resources of VOD servers should be utilized based on the characteristics of the streaming media service. Among the various resources in the server, the main memory is used for the buffer space to the media data loaded from the disks and the buffer hit ratio has a great impact upon the server performance. However, if the buffer data with high hit ratio are replaced for the new media data as a result of the number of clients and the required movie titles are increased, the negative impact on the scalability of server performance is occurred. To address this problem, the buffer replacement policy considers the intrinsic characteristics of the streaming media such as the sequential access to large volume data and the highly disproportionate preference to specific movies. In this paper, the preference-based segment buffer replacement policy is proposed in the cluster-based VOD server to exploit the characteristics of the streaming media. Since the proposed method reflects both the temporal locality by the clients' preference and the spatial locality by the sequential access to media data, the buffer hit ratio would be improved as compared to the existing buffer replacement policy. The enhanced buffer hit ratio causes the fact that the performance scalability of the cluster-based VOD server is linearly improved as the number of cluster nodes is increased.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.111-122
• /
• 2006

As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.357-367
• /
• 2004

In VOD systems the number of channels available to a video server is limited since the number of channels, the video server can support, is determined by the communication bandwidth of the video server. Multicast techniques such as batching, patching and batch-patching have been proposed to reduce I/O demand on the video server by sharing multicast data. In this paper, we propose a channel reservation batch-patching technique that first applies the batching technique to hot video requests and then applies the patching technique to the batches of the hot video requests. And the proposed technique reserves a part of the channel capacity of the video server for many hot video requests, so that the hot video requests can be served without defection. The performance of the proposed technique is compared with those of Patching and Batch-Patching techniques in terms of average service latency, defection rate, fairness and frame reduction rate by simulations.