DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Joon-Won | - |
dc.contributor.advisor | 이준원 | - |
dc.contributor.author | Hyun, Jong-Woong | - |
dc.contributor.author | 현종웅 | - |
dc.date.accessioned | 2011-12-13T05:58:37Z | - |
dc.date.available | 2011-12-13T05:58:37Z | - |
dc.date.issued | 1998 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=133998&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/34247 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1998.2, [ ii, [39] p. ] | - |
dc.description.abstract | In this paper, we present an effective storage and retrieval scheme of MPEG encoded video to support interactive scan operations such as fast-forward or fast-reverse with viewing in a disk-array-based video sever. Typically, scan operations impose additional disk bandwidth requirements due to inter-frame dependencies of MPEG encoded video. Furthermore, the unpredictable nature in terms of the occurrence and the duration makes it difficult for the server to schedule scan requests. In most conventional schemes, the changes of load caused by normal playback to scan transitions are accommodated by statically reserving some of the disk bandwidth at the expense of throughput. On the contrary, in the proposed scheme based on segment interleaving and peak data rate retrieval, the bandwidth needed for scan operations is dynamically allocated by exploiting frame prefetch effect due to variable bit rate (VBR) characteristics of MPEG video stream. The proposed retrieval scheduling scheme can support a lot of concurrent scan requests with low start-up latency while simultaneously servicing the maximum number of streams that can be supported on the server. It neither degrades the throughput nor violates continuous playback of normal playback streams in progress. The maximum number of supportable streams is rather increased due to employing a fixed-size segment that is an exact multiple of track as the retrieval unit. The effectiveness of retrieval scheduling based on dynamic disk bandwidth allocation is demonstrated through performance evaluation. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Fast-forward/reverse | - |
dc.subject | Dynamic bandwidth allocation | - |
dc.subject | Retrieval scheduling | - |
dc.subject | Video-on-demand | - |
dc.subject | Scan operation | - |
dc.subject | 패스트 포워드 | - |
dc.subject | 화면검색 | - |
dc.subject | 대역폭 동적 할당 | - |
dc.subject | 디스크 리트리벌 스케쥴링 | - |
dc.subject | 주문형비디오 | - |
dc.title | Video-on-demand server retrieval scheduling to support scan operations | - |
dc.title.alternative | VOD 서버에서 고속의 화면 검색 기능을 지원하기 위한 리트리벌 스케쥴링 기법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 133998/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000957089 | - |
dc.contributor.localauthor | Lee, Joon-Won | - |
dc.contributor.localauthor | 이준원 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.