完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHuang, Yin-Fu
dc.contributor.authorHo, Hung-Ming
dc.date.accessioned2009-08-23T04:40:56Z
dc.date.accessioned2020-05-25T06:41:56Z-
dc.date.available2009-08-23T04:40:56Z
dc.date.available2020-05-25T06:41:56Z-
dc.date.issued2006-10-24
dc.date.submitted2002-12-18
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2275-
dc.description.abstractIn this paper, we present a novel demand-paging algorithm called PDPAF (i.e., Pinned Demand Paging based on the Access Frequency of video files), to efficiently utilize the limited buffer space in a VOD server. It excludes the limitation of the disk bandwidth, and raises the hit ratio of video pages in the buffer, thereby increasing the total number of concurrent clients. Furthermore, we also propose an admission control algorithm to decide whether a new request can be admitted. Finally, we conduct extensive experiments to compare PDPAF with other algorithms on the average waiting time and the maximal number of concurrent requests, and the simulation results validate the superiority of our approach.
dc.description.sponsorship東華大學,花蓮縣
dc.format.extent19p.
dc.format.extent88940 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2002 ICS會議
dc.subjectVOD
dc.subjectdemand paging algorithms
dc.subjecthit ratios
dc.subjectadmission control
dc.titlePinned Demand Paging Based on the Access Frequency of Video Files in Video Servers
分類:2002年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002002000260.PDF86.86 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。