大规模VoD服务器负载平衡策略的研究
|
摘要
大规模VoD服务器采用分布式结构,将连续媒体对象的多个副本放置在用户附近的服务器节点上,支持的并发流数大、覆盖的地域广、提供的节目多,可以在任意时间响应任意用户请求。由于每个服务器节点的负载随时间、所处位置与用户请求到达而不断变化,近年来的研究工作更倾向于动态资源管理。在分析讨论国内外研究工作的基础上,从总体上描述了一种分布式VoD服务器的负载平衡机制,针对分布式拓扑结构的多副本定位和动态复制、服务器选择与负载迁移的负载平衡方法,做了如下的研究工作和创新:
构建了一个用于多副本定位的可动态扩展的逻辑层次簇群。针对副本数量与位置随用户请求和服务器节点负载状态不断变化的情形,将相同副本的服务器节点组织为一个逻辑层次簇群,并采用分散式维护机制,将管理开销分摊于所有的节点上,从而满足多副本访问能力、可扩展性、鲁棒性与自适应性的需求。提出以覆盖率作为指标分析逻辑层次簇群的容错性的方法。数学分析表明,当节点数量固定时,逻辑层次簇的容错性主要受单个簇群的尺寸影响。仿真结果表明,用户请求高峰期的逐流管理开销远小于连续媒体对象的投递带宽,逻辑层次簇群的管理开销可以忽略不计。
对象的多个副本散布在网络的不同位置,网络骨干费用昂贵,不能只采用节点负载作为服务器选择的依据。设计了一个基于对象回取周期性与投递连续性的最小延迟服务器选择方法,减轻网络骨干的压力,根据连续媒体对象的回取周期性与投递连续性要求,推导了用户到每个空闲节点之间的端到端的服务器响应时间估计公式。当用户请求对象时,优先选择服务器响应时间最小的空闲节点。仿真表明,当结合使用动态复制与局部负载迁移时,最小延迟服务器选择的请求接受率与启动延迟明显优于最小负载服务器选择;结果还表明最小延迟服务器选择可以明显地提高请求接受率与降低启动延迟。
为了权衡逻辑层次簇群的扩展开销与投递负载,提出了节点根据其负载状态阈值分别采用早期复制和即时复制的动态复制策略。在早期复制中,建立了被请求对象在下一时间间隔的请求概率估计函数,用于目标节点选择与复制触发。即时复制是早期复制的补充,可进一步地平衡服务器节点之间的负载,同时使得节点保留更多的资源服务本地用户。仿真结果表明,动态复制大幅提高了请求接受率和降低启动延迟。结果还表明,复制开销主要受动态复制及其触发阈值影响,对请求接受率和启动延迟有着显著的负面效应。
一个区域可能部署了分属于不同逻辑层次簇群的多个服务器节点,需要通过负载迁移进一步平衡它们之间的负载。提出了一个基于协作能力的局部负载迁移方法,定义了以负载迁移成功和失败次数为参数的协作能力估计函数。随着节点负载状态的变化,不是静态地划分该区域的节点,而是通过协作能力的估计和周期性交换动态地构建协作节点组。根据协作能力的计算结果,源节点选择一个请求次数最多的、尚未被迁移的对象,依次向协作组的其它节点发出请求,直到得到响应。仿真结果表明,局部负载迁移能够有效地提高请求接受率和降低了启动延迟,同时还说明了应合理地设置接受阈值与触发阈值的差值。
The large scale VoD server can support vast concurrent streams, cover wide district and provide cooperative programs with the replicas of multimedia object placed the node near to user so that any program could be viewed at any time and any place. Because the each server load is varying with the server's place and request arrival, the recently research work more focus on the dynamic resource management. Based on the analysis of existed research work, the load balance mechanism is described generally in advanced and then the innovated research work is carried on the replica locating and load balance method about the dynamic replication, server selection and load migration as follows:
Construct a logically hierarchical cluster for the replica locating in the dynamic scalable method. With the number and place of the replica varies with user request and server load, the server nodes which store same replica are organized into a logically hierarchical cluster in the view of replica connection as node connecting and replica as node. With the apportionment of management overhead to all nodes, the decentralized maintenance mechanism can meet the demand for the multi-replica access capacity, scalability, robust and adaptability. The mathematical analysis with cover rate indicates that the fault tolerant of logically hierarchical cluster is affected by the single cluster size as the number of whole node is fixed. The simulation result shows that the per-stream management overhead is extraordinary smaller than the delivery bandwidth of multimedia object, so the management overhead can be neglected.
The node load is insufficient for the server selection because the multi-replica scatter at different place and the backbone is expensive. In order to alleviate the stress of backbone, a minimal latency server selection method is designed base on the retrieve cyclicity and delivery continuity. An end-to-end server response time is deduced according to the demand for retrieve cyclicity and delivery continuity. As the user requests for an object, the idle node with minimal response time is selected. The simulation result indicates the request acceptance rate and startup delay of the minimal latency server selection is superior to the minimal load server selection. It is also show the minimal latency server selection can improve the request acceptance rate and decrease the startup delay.
The dynamic replication trigger policy is proposed where the early replication and instant replication is adopted according to node load state for the tradeoff of the expansion overhead and delivery load of logically hierarchical cluster. A request probability estimation function is derived for the target node selection and object for early replication. As the complement of early replication, the instant replication is used to balance load between nodes with the source node reserves more resource to server the local user. The simulation result shows that the dynamic replication improves the request acceptance rate and decreases the startup delay. The results also can be concluded that the replication overhead is mainly affected by the replication and its trigger threshold and then impacts the request acceptance rate and startup delay.
The cooperative nodes deployed in a local region maybe belong to different logically hierarchical cluster, so the local load migration is used to further balance their load. The local load migration is based on the reciprocity capacity which is defined with the number of successful and failing migration. Not statically partition, the reciprocity node group is formed with the estimation and periodic exchange of reciprocity to adapt the varied node load state. An object which request number is maximal and not in migration process will be selected, then the source node will send message to other group nodes in turn according to cooperative capacity estimation until accept an acknowledgement. The simulation data supports that the local load migration can improve the request acceptance rate and reduce the startup latency. The difference of the accepted threshold and trigger threshold should be proper set indicated by the simulation result.
构建了一个用于多副本定位的可动态扩展的逻辑层次簇群。针对副本数量与位置随用户请求和服务器节点负载状态不断变化的情形,将相同副本的服务器节点组织为一个逻辑层次簇群,并采用分散式维护机制,将管理开销分摊于所有的节点上,从而满足多副本访问能力、可扩展性、鲁棒性与自适应性的需求。提出以覆盖率作为指标分析逻辑层次簇群的容错性的方法。数学分析表明,当节点数量固定时,逻辑层次簇的容错性主要受单个簇群的尺寸影响。仿真结果表明,用户请求高峰期的逐流管理开销远小于连续媒体对象的投递带宽,逻辑层次簇群的管理开销可以忽略不计。
对象的多个副本散布在网络的不同位置,网络骨干费用昂贵,不能只采用节点负载作为服务器选择的依据。设计了一个基于对象回取周期性与投递连续性的最小延迟服务器选择方法,减轻网络骨干的压力,根据连续媒体对象的回取周期性与投递连续性要求,推导了用户到每个空闲节点之间的端到端的服务器响应时间估计公式。当用户请求对象时,优先选择服务器响应时间最小的空闲节点。仿真表明,当结合使用动态复制与局部负载迁移时,最小延迟服务器选择的请求接受率与启动延迟明显优于最小负载服务器选择;结果还表明最小延迟服务器选择可以明显地提高请求接受率与降低启动延迟。
为了权衡逻辑层次簇群的扩展开销与投递负载,提出了节点根据其负载状态阈值分别采用早期复制和即时复制的动态复制策略。在早期复制中,建立了被请求对象在下一时间间隔的请求概率估计函数,用于目标节点选择与复制触发。即时复制是早期复制的补充,可进一步地平衡服务器节点之间的负载,同时使得节点保留更多的资源服务本地用户。仿真结果表明,动态复制大幅提高了请求接受率和降低启动延迟。结果还表明,复制开销主要受动态复制及其触发阈值影响,对请求接受率和启动延迟有着显著的负面效应。
一个区域可能部署了分属于不同逻辑层次簇群的多个服务器节点,需要通过负载迁移进一步平衡它们之间的负载。提出了一个基于协作能力的局部负载迁移方法,定义了以负载迁移成功和失败次数为参数的协作能力估计函数。随着节点负载状态的变化,不是静态地划分该区域的节点,而是通过协作能力的估计和周期性交换动态地构建协作节点组。根据协作能力的计算结果,源节点选择一个请求次数最多的、尚未被迁移的对象,依次向协作组的其它节点发出请求,直到得到响应。仿真结果表明,局部负载迁移能够有效地提高请求接受率和降低了启动延迟,同时还说明了应合理地设置接受阈值与触发阈值的差值。
The large scale VoD server can support vast concurrent streams, cover wide district and provide cooperative programs with the replicas of multimedia object placed the node near to user so that any program could be viewed at any time and any place. Because the each server load is varying with the server's place and request arrival, the recently research work more focus on the dynamic resource management. Based on the analysis of existed research work, the load balance mechanism is described generally in advanced and then the innovated research work is carried on the replica locating and load balance method about the dynamic replication, server selection and load migration as follows:
Construct a logically hierarchical cluster for the replica locating in the dynamic scalable method. With the number and place of the replica varies with user request and server load, the server nodes which store same replica are organized into a logically hierarchical cluster in the view of replica connection as node connecting and replica as node. With the apportionment of management overhead to all nodes, the decentralized maintenance mechanism can meet the demand for the multi-replica access capacity, scalability, robust and adaptability. The mathematical analysis with cover rate indicates that the fault tolerant of logically hierarchical cluster is affected by the single cluster size as the number of whole node is fixed. The simulation result shows that the per-stream management overhead is extraordinary smaller than the delivery bandwidth of multimedia object, so the management overhead can be neglected.
The node load is insufficient for the server selection because the multi-replica scatter at different place and the backbone is expensive. In order to alleviate the stress of backbone, a minimal latency server selection method is designed base on the retrieve cyclicity and delivery continuity. An end-to-end server response time is deduced according to the demand for retrieve cyclicity and delivery continuity. As the user requests for an object, the idle node with minimal response time is selected. The simulation result indicates the request acceptance rate and startup delay of the minimal latency server selection is superior to the minimal load server selection. It is also show the minimal latency server selection can improve the request acceptance rate and decrease the startup delay.
The dynamic replication trigger policy is proposed where the early replication and instant replication is adopted according to node load state for the tradeoff of the expansion overhead and delivery load of logically hierarchical cluster. A request probability estimation function is derived for the target node selection and object for early replication. As the complement of early replication, the instant replication is used to balance load between nodes with the source node reserves more resource to server the local user. The simulation result shows that the dynamic replication improves the request acceptance rate and decreases the startup delay. The results also can be concluded that the replication overhead is mainly affected by the replication and its trigger threshold and then impacts the request acceptance rate and startup delay.
The cooperative nodes deployed in a local region maybe belong to different logically hierarchical cluster, so the local load migration is used to further balance their load. The local load migration is based on the reciprocity capacity which is defined with the number of successful and failing migration. Not statically partition, the reciprocity node group is formed with the estimation and periodic exchange of reciprocity to adapt the varied node load state. An object which request number is maximal and not in migration process will be selected, then the source node will send message to other group nodes in turn according to cooperative capacity estimation until accept an acknowledgement. The simulation data supports that the local load migration can improve the request acceptance rate and reduce the startup latency. The difference of the accepted threshold and trigger threshold should be proper set indicated by the simulation result.
引文
[1] M. M. Buddhikot. Project MARs: Scalable, High Performance, Wen Based Multimedia-on-Demand (MOD) Services and Servers: [Ph.D thesis]. Washington University Department of Computer Science,Server Institute of Technology, 1998.
[2] J. P. Nussbaumer, B. V. Patel, F. Schaffa, et al. Networking Requirements for Interactive Video on Demand. IEEE Journal on Selected Areas in Communications, 1995,13(5): 779-787
[3] W. D. Sincoskie. Video on Demand: Is It Feasible. in: Proc. of IEEE GLOBECOM'90, San Diego,USA, 1990.201-205
[4] H. Kobayashi. Modeling and Analysis: an Introduction to System Performance Evaluation Methodology. Addison Wesley, 1981. 59-77
[5] L. Kleinrock. Queueing Systems: Theory. Wiley, 1975. 63-74
[6] R. L. Axtell. Zipf Distribution of U.S. Firm Sizes. Science, 2001,293(12): 1818-820
[7] A. Dan, D. Sitaram, P. Shahabuddin. Scheduling Policies for an On-Demand Video Server with Batching, in: Proc. of ACM Int. Conf. on Multimedia, San Francisco, USA, 1994. 15-23
[8] Y. N. Doganata, A. N. Tantawi. Making a Cost-Effective Video Server. IEEE Multimedia Magazine,1994, 1(4): 22-30
[9] M. Wu, W. Shu. Efficient Support for Interactive Browsing Operations in Clustered CBR Video Servers. IEEE Transactions on Multimedia, 2002,4(1): 48-58
[10] T. L. Kunii, Y. Shinagawa, R. A. Paul, et al. Issues in Storage and Retrieval of Multimedia Data.Multimedia System, 1995,3(5-6): 298-304
[11] P.J. Denning. Effects of Scheduling on File Memory Operations.in: Proc. of AFIPS Spring Joint Computer Conference, Atlantic City, USA, 1967.9-21
[12] C. L. Liu, J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment. Journal of the ACM, 1973,20(1): 46-61
[13] A. L. N. Reddy, J. Wyllie. I/O Issues in a Multimedia System. IEEE Computer, 1994,27(3): 69-74
[14] P. S. Yu, M. S. Chen, D. D. Kandlur. Grouped Sweeping Scheduling for DASD-Based Multimedia Storage Management. ACM Multimedia Systems, 1993, 1(3): 99-109
[15] H. M. Vin, A. Goyal, P. Goya. Algorithms for Designing Large-scale Multimedia Servers. Computer Communications, 1995, 18(3): 192-203
[16] P. J. Shenoy, H. M. Vin. Cello: A Disk Scheduling Framework for Next Generation Operating Systems.in: Proc. of ACM SIGMETRICS, Madison, USA, 1998.44-55
[17] R. Wijayaratne, A. L. N. Reddy. Integrated QoS Management for Disk I/O. in: Proc. of IEEE Int. Conf.on Multimedia Computing and Systems, Florence, Italy, 1999.487-492
[18] Y. Rompogiannakis, G Nerjes, P. Muth, et al. Disk Scheduling for Mixed-media Workloads in a Multimedia Server, in: Proc. of ACM Multimedia Coneference, Bristol, UK, 1998. 297-302
[19] P. V. Rangan, H. M. Vin. Designing File Systems for Digital Video and Audio. Operating Systems Review, 1991,25(5): 69-79
[20] P. V. Rangan, H. M. Vin. Efficient Storage Techniques for Digital Continuous Media. IEEE Transactions on Knowledge and Data Engineering, 1993, 5(4): 564-573
[21] P. V. Rangan, H. M. Vin, S. Ramanathan. Designing an On-Demand Multimedia Service. IEEE Communications Magazine, 1992,30(7): 56-64
[22] H. J. Chen, T. D. C. Little, D. Venkatesh. A Storage and Retrieval Technique for Scalable Delivery of MPEG-encoded Video. Journal of Parallel and Distributed Computing, 1995,30(2): 180-189
[23] D. J. Gemmell, S. Christodoulakis. Principles of Delay-Sensitive Multimedia Data Storage and Retrieval. ACM Transactions on Information Systems, 1992, 10(1): 51-90
[24] A. Srivastava, A. Kumar, A. Singru. Design and Analysis of a Video-on-Demand Server. Multimedia Systems, 1997, 5: 238-254
[25] D. P. Anderson, Y. Osawa, R. Govindan. A File System for Continuous Media. ACM Transactions on Computer Systems, 1992, 10(4): 311-337
[26] H. M. Vin, P. Goyal, A. Goyal, et el. A Statistical Admission Control Algorithm for Multimedia Servers. in: Proc. of ACM Multimedia Conference, San Francisco, USA, 1994. 33-40
[27] E. Chang, A. Zakhor. Admission Control and Data Placement for VBR Video Servers. in: Proc. of IEEE Int. Conf. on Image Processing, Austin, USA, 1994. 278-282
[28] F. Y. Lin. Optimal Real-Time Admission Control Algorithms for the Video-on-Demand (VoD) Service.IEEE Transactions on Broadcasting, 1998, 44(4): 402-408
[29] G Tan, H. Jin, S. Wu. Clustered Multimedia Servers: Architectures and Storage Systems. Annual Review for Scalable Computing, 2003, 5: 92-132
[30] J. R. Santos, R. Muntz. Performance Analysis of the RIO Multimedia Storage System with Heterogeneous Disk Configurations. in: Proc. of ACM Multimedia Conference, Bristol, England, 1998.303-308
[31] S. A. Barnett, G. J. Anido. Performability of Disk-Array-Based Video Servers. Multimedia Systems,1998, 6(1): 60-74
[32] R. Tewari, R. Mukherjee, D. M. Dias et al. Design and Performance Tradeoffs in Clustered Video Servers. in: Proc. of Int. Conf. on Multimedia Computing and Systems, Hiroshima, Japan, 1996,144-150
[33] J. Hsieh, M. Lin, J. C. L. Liu, et al. Performance of a Mass Storage System for Video-on-Demand.Journal of Parallel and Distributed Computing, 1995,30(2): 147-167
[34] P. Shenoy, Pawan Goyal, S. S. Rao, et al. Symphony: An Integrated Multimedia File System. in: Proc.of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 124-138
[35] P. Shenoy, H. M. Vin. Efficient Striping Techniques for Multimedia File Servers. in: Proc. of Network and Operating System Support for Digital Audio and Video, St. Louis, USA, 1997. 25-36
[36] J. L. Wolf, P. S. Yu, H. Shachnai. Disk Load Balancing for Video-on-Demand Systems. Multimedia Systems, 1997, 5(6): 358-370
[37] Y. Wang, J. C. L. Liu, D. H. C. Du et al. Efficient Video File Allocation Schemes for Video-on-Demand Services. Multimedia Systems, 1995,5(5): 283-296
[38] A. Dan, D. Sitaram. An Online Video Placement Policy Based on Bandwidth to Space Ratio (BSR). in:Proc. of ACM SIGMOD, San Jose, USA, 1995.376-385
[39] A. Dan, M. Kienzle, and D. Sitaram. A Dynamic Policy of Segment Replication for Load-Balancing in Video-on-Demand Servers. Multimedia Systems, 1995,3(3): 93-103
[40] R. Flynn, W. Tetzlaff. Disk Striping and Block Replication Algorithms for Video File Servers. in: Proc.of IEEE Int. Conf. on Multimedia Computing and Systems, Hiroshima, Japan, 1996. 590-597
[41] N. Venkatasubramanian, S. Ramanathan. Load Management in Distributed Video Servers, in: Proc. of Intl. Conf. on Distributed Computing Systems, Baltimore, USA, 1997. 528-535
[42] P. W. K. Lie, J. C. S. Lui, and L. Golubchik . Threshold-Based Dynamic Replication in Large Scale Video-on-Demand Systems.in: Proc. of Int. Workshop on Research Issues in Data Engineering,Orlando, USA, 1998. 52-59
[43] S. Ghandeharizadeh, L. Ramos. Continuous Retrieval of Multimedia Data Using Parallelism. IEEE Transactions on Knowledge and Data Engineering, 1993,5(4): 658-669
[44] L. Golubchik, J. C. S. Lui, R. R. Muntz. Adaptive piggybacking: A novel technique for data sharing in video-on-demand storage servers. Multimedia Systems, 1996,4(3), 140-155.
[45] B. Ozden, R. Rastogi, P. Shenoy et al. Fault-tolerant architectures for continuous media servers. in:Proc. of ACM SIGMOD, Montreal, Canada, 1996, pp. 79-90.
[46] S. Berson, L. Golubchik, R. R. Muntz. Fault tolerant design of multimedia servers. in: Proc. of ACM SIGMOD, San Jose, USA, 1995. 364-375.
[47] F. A. Tobagi, J. Pang, R. Baird et al. Streaming RAID: A Disk Storage System for Video and Audio Files. in Proc. of ACM Multimedia Conference, Anaheim, USA, 1993. 393-400
[48] R. Tewari, D. M. Dias, R. Mukherjee, et al. High Availability in Clustered Multimedia Servers. in:Proc. of the Int. Conf. on Data Engineering, New Orleans, USA, 1996.645-654
[49] Y. Wang, D. H. C. Du. On Providing Highly Available Fault-Tolerant Video-on-Demand Services.in:Proc. of IEEE Int. Conf. on Multimedia Computing and Systems, Austin, USA, 1998. 76-85
[50] I. J. Shyu, S. P. Shieh. A Distributed Fault-Tolerant Design for Multipleserver VoD Systems.Multimedia Tools and Applications, 1999, 8(2): 219-247
[51] R. Krishnan, D. Venkatesh, T. D. C. Little. A Failure and Overload Tolerance Mechanism for Continuous Media Servers. in: Proc. of the ACM Multimedia, Seattle, USA, 1997. 131-142
[52] E. Hwang, K. Kilic, V. S. Subrahmanian. Handling Updates and Crashes in VoD Systems. Multimedia Tools and Applications, 1998,7(1-2): 103-132
[53] Cyrus Shahabi, Farnoush Banaei-Kashani. Decentralized Resource Management for a Distributed Continuous Media Server. IEEE Transactions on Parallel and Distributed Systems. 2002, 13(11):1183-1200
[54] V. O. K. Li, Wanjiun Liao. Distributed Multimedia Systems. Proceeding of the IEEE, 1997, 85(7):1063-1108
[55] R. Ramarao, V. Ramamoorthy. Architectural Design of On-Demand Video Delivery Systems: The Spatio-Temporal Storage Allocation Problem. in: Proc. of IEEE Int. Conf. on Communications, Denver, USA, 1991. 506-510
[56] C. C. Bisdikian, B. V. Patel. Issues on Movie Allocation in Distributed Video-on-Demand Systems. in:Proc. of IEEE ICC, Seattle, USA, 1995. 250-255
[57] R. Luling. Static and Dynamic Mapping of Media Assets on a Network of Distributed Multimedia Information Servers. in: Proc. of IEEE Int. Conf. on Distributed Computing Systems, Austin, USA,1999.253-260
[58] R. H. Hwang, Y. C. Sun. Optimal video placement for hierarchical video-on-Demand systems. IEEE Trans. on Broadcasting, 1998,44(4): 392-401
[59] I. Cidon, S. Kutten, R. Soffer. Optimal Allocation of Electronic Content. in: Proc. of IEEE INFOCOM,Anchorage, USA, 2001. 1773-1780
[60] Konstantinos Kalpakis, Koustuv Dasgupta, Our Wolfson. Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Trans. Parallel Distributed System, 2001, 12(6): 628-637
[61] 周笑波, 谢立, ReinhardLueling. 视频服务器网络中影像对象映射问题的研究.软件学报, 2000,12(12): 1620-1627.
[62] R. Boutaba, A. Hafid. A Generic Platform for Scalable Access to Multimedia-on-Demand Systems.IEEE Journal Selected Areas in Communications. 1999, 17(9): 1599-1613
[63] Y. C. Tay, Hweehwa Pang. Load Sharing in Distributed Multimedia-on-Demand Systems. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(3): 410-428
[64] Cheng-Fu, Chou, L. Golubchik , J.C.S. Lui. Striping Doesn't Scale: How to Achieve Scal-ability for Continuous Media Servers with Replication. in: Proc. of IEEE Int. Conf. on Distributed Computing Systems, Taipei, Taiwan, 2000. 64-71
[65] Jeong-Dong Ryoo, S.S. Panwar. Algorithms for Determining File Distribution in Networks with Multimedia Servers. in: IEEE International Conference on Communications, 1999. 875-879
[66] J. S. Ko, J. W. Lee, H. Y. Yeom. An Alternative Scheme to LRU for Efficient Page Replacement.Journal of KISS (Computer Systems and Theory), 1996,23(5): 478-486
[67] D. Lee, J. Choi, H. Choe et al. Implementation and Performance Evaluation of the LRFU Replacement Policy. in: Proc. of Euromicro Conference New Frontiers of Information Technology, Los Alamitos,USA, 1997. 106-111
[68] E. J. O'Neil, P. E. O'Neil, G Weikum. An Optimality Proof of the LRU-K Page Replacement Algorithm. Journal of the ACM, 1999,46(1): 92-112
[69] A. Kraiss, G. Weikum. Integrated Document Caching and Prefetching in Storage Hierarchies ased on Markov-chain Predictions. VLDB Journal, 1998, 7(3): 141-162
[70] T. Kimbrel, A. R. Karlin. Near-optimal Parallel Prefetching and Caching. SIAM Journal on computing,2000,29(4): 1051-1082
[71] W. W Schilling, Jr. M. Alam. The Impact of Prefetching and Victim Caching on Computer Systems Performance.in: Proc. of Int. Conf. on Parallel and Distributed Computing Systems. Fort Lauderdale,USA, 1999.271-276
[72] H. S. Jeon, S. H Noh. Dynamic Buffer Cache Management Scheme based on Simple and Aggressive Prefetching. in: Proc. of 4th Annual Linux Showcase and Conf., Atlanta, USA, 2000. 27-38
[73] F. Moser, A. Kraiss, W. Klas. L/MRP: a buffer management strategy for interactive continuous data flows in a multimedia DBMS. in: Proc. of. 21st International Conference on Very Large Data Bases,Zurich, Switzerland, 1995.275-286
[74] J. Choi, D. Lee, S. H. Noh, et al. Characterization and Automatic Detection of Block Reference Patterns. Journal of KISS (A) :Computer Systems and Theory, 1999,26 (9): 1083-1095
[75] G. Glass, Pei Cao. Adaptive Page Replacement based on Memory Reference Behavior.in: Proc. of ACM SIGMETRICS'97, Seattle, USA, 1997. 115-126
[76] A. Dan, D. Sitaram. A Generalized Interval Caching Policy for Mixed Interactive and Long Video Workloads. in: Proc. of the SPIE MMCN'96, San Jose, USA, 1996. 344-351
[77] A. Dan, D. Sitaram. Multimedia. Caching Strategies for Heterogeneous Application and Server Environments. Multimedia Tools and Applications, 1997,4(3): 279-312
[78] J. Mogul. Squeezing More Bits Out of HTTP Caches. IEEE Network. 2000, 14(3): 6-14
[79] Reza Rejaie, Haobo Yu, Mark Handely et al. Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet. in: Proc. of IEEE INFOCOM, Tel Aviv, Israel, 2000.980-989
[80] Subhabrata Sen, Jennifer Rexford, Don Towsley. Proxy Prefix Caching for Multimedia Streams. Proc.ofthe IEEE INFOCOM '99. 1999: 1310-1319
[81] Renu Tewari, H. M. Vin, Asit Dan et al. Resource-based Caching for Web Servers. in: Proc. of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 191-204
[82] Eun-Ji Lim, Seong-Ho Park, Hyeon-Ok Hong et al. A Proxy Caching Scheme for Continuous Media Streams on the Internet. in: Proc. of Int. Conf. on Information Networking, Beppu City, Oita, Japan,2001.720-725
[83] R. Rejaie, M. Handley, H. Yu et al. Proxy Caching Mechanism for Multimedia Playback Streams in the Internet. in: Proc. 4th International Web Caching Workshop, 1999. 100-111
[84] Pei Cao, Sandy Irani. Cost-Aware WWW Proxy Caching Algorithms. in: Proc. of Usenix Symposium on Internet Technologies and Systems, 1997. 193-206
[85] F. Yu, Q. Zhang, W. Zhu et al. QoS-adaptive proxy caching for multimedia streaming over the Internet.IEEE Transaction Circuits System Video Technical, 2003, 13(3): 257-269
[86] Qian Zhang, Zhe Xiang, Wenwu Zhu et al. Cost-Based Cache Replacement and Server Selection for Multimedia Proxy Across Wireless Internet. IEEE Trans. on Multimedia, 2004,6(4): 587-598
[87] Pablo Rodriguez, Christian Spanner, E. W. Biersack. Analysis of Web Caching Architectures:Hierarchical and Distributed Caching. IEEE/ACM Transactions on Networking, 2001, 9(4): 404-418
[88] D.Wessels, K. Claffy. Application of Internet cache protocol (ICP), version 2. Internet Engineering Task Force, Internet Draft, 1997.
[89] Xueyan Tang, S. T. Chanson, Coordinated En-Route Web Caching, IEEE Transactions on Computers,2002, 51(6): 595-607
[90] Alec Wolman, G M. Voelker, Nitin Sharma et al. On the Scale and Performance of Cooperative Web Proxy Caching. in: Proc. of ACM symp. on Operating systems principles, Charleston, USA, 1999.16-31
[91] K. A. Hua, Y. Cai, Simon Sheu. Patching: A Multicast Technique for True Video-on-Demand Services.In Proc. of ACM MULTIMEDIA, Bristol, UK, 1998. 191-200
[92] S. Viswanathan, T. Imielinski. Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting. Multimedia Systems, 1996,4(4): 197-208
[93] Y. Cai, Kien A. Hua, Simon Sheu. Optimizing Patching Performance, in: Proc. of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 204-215
[94] S. Sen, L. Gao, J. Rexford et al. Optimal Patching Schemes for Efficient Multimedia Streaming. in:Proc. of NOSSDAV, Basking Ridge, USA, 1999
[95] D. P. Anderson. Metascheduling for Continuous Media. ACM Transactions on Computer Systems.1993, 11(3): 226-252
[96] C.C. Aggarwal, J.L. Wolf, P.S. Yu. A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems. in: Proc. of Int. Conf. Multimedia Computing and Systems, Hiroshima,Japan, 1996. 118-126
[97] K. A. Hua, Simon Sheu. Skyscraper Broadcasting: A New Broadcasting Scheme for Metropolitan Video-on-Demand Systems. in: Proc. of SIGCOMM, Cannes, France, 1997. 89-100
[98] M. Bradshaw, B. Wang, S. Sen et al. Periodic Broadcast and Patching Services - Implementation,Measurement, and Analysis in an Internet Streaming Video Testbed. Multimedia Systems, 2003, 9(1):78-93
[99] J. Y. B. Lee, R. W. T. Leung. Study of a Server-less Architecture for Video-On-Demand Applications.in: Proc. of IEEE Int. Conf. on Multimedia and Expo, 2002. 233-236.
[100] J. Y. B. Lee, R. W. T. Leung. Design and Analysis of a Fault-Tolerant Mechanism for a Server-less Video-on-Demand System.in: Proc. of Parallel and Distributed Systems, 2002. 489-494.
[101] T. K. Ho, Jack Y. B. Lee. A Row-Permutated Data Reorganization Algorithm for Growing Server-less Video-on-Demand Systems. in: Proc. of Cluster Computing and the Grid, 2003.44-51
[102] Yang-hua Chu, S. G Rao, Srinivasan Seshan et al. A Case for End System Multicast. IEEE Journal on Selection Areas in Communications, 2002,20(8): 1456-1471
[103] A. L. Chervenak, D. A. Patterson, R.H. Katz. Storage Systems for Movies-on-Demand Video Servers.in: Proc. of IEEE Symp. on Mass Storage Systems, Monterey, USA, 1995. 246-256
[104] S. A. Barnett, G J. Anido. A Cost Comparison of Distributed and Centralized Approaches to Video-on-Demand. IEEE Journal on Selection Areas in Communications, 1996, 14(6): 1173-1183
[105] Peter Triantafillou, Christos Faloutsos. Overlaying striping for optimal parallel I/O in modern applications. Parallel Computing. 1998, 24(1): 21-43
[106] A. Rowstron, P. Druschel. Pastry: Scalable. Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. in: Proceeding IFIP/ACM Middleware, Heidelberg, Germany, 2001.329-350
[107] S. G Dykes, C. L. Jeffery, S. Das. Taxonomy and Design Analysis for Distributed Web Caching. in:Proc. of IEEE Hawaii Int. Conf. on System Sciences, Maui, USA, 1999. 1-10
[108] E. D. Katz, M. Butler, R. McGrath. A Scalable HTTP server; the NCSA Prototype. Computer Networks and ISDN Systems, 1994, 27(2): 155-164
[109] D. Andresen, T. Yang, V. Holmedahl et al. SWEB: Towards a Scalable World Wide Web Server on Multicomputers. in: Proc. of Int. Parallel Processing Symp., Honolulu, USA, 1996. 850-856
[110] D. M. Dias, W. Kish, R. Mukherjee et al. A Scalable and Highly Available Web Server. in: Proc. of IEEE Computer Society Int. Conf., Santa Clara, USA, 1996. 85-92
[111] M. Sayal, Y. Breitbart, P. Scheuermann et al. Selection Algorithms for Replicated Web Servers. Performance Evaluation Review, 1998,26(3): 44-50
[112] C. Yoshikawa, B. Chun; P. Eastham. Using Smart Clients to Build Scalable Services. in: Proc. of the 1997 USENIX Annual Tech. Conf., Anaheim, USA, 1997. 105-117
[113] R. Tewari, M. Dahlin, H. M. Vin, et al. Design Considerations for Distributed Caching on the Internet.in: Proc. of Int. Conf. on Distributed Computing Systems, Austin, USA, 1999. 275-284
[114]H. Balakrishnam, S. Seshan, M. Stemm et al. Analyzing stability in wide-area network performance. in:Proc. of ACM SIGMETRICS, Seattle, USA, 1997.2-12
[115] M. E. Crovella, A. Bestavros. Self-similarity in world wide web traffic: evidence and possible causes.IEEE/ACM Transactions on Networking, 1997,5(6): 835-846
[116] S. G Dykes, K. A. Robbins, C. L. Jeffery. An Empirical Evaluation of Client-side Server Selection Algorithms. in: Proc. of IEEE INFOCOM, Tel Aviv, Israel, 2000: 1361-1370
[117] E., Chang, A. Zakhor. Scalable Video Data Placement on Parallel Disk Arrays. in: Proc. of the SPIE,San Jose, USA, 1994.208-221
[118] J. D., Salehi, Z. L. Zhang, J. Kurose, et al. Supporting Stored Video: Reducing Rate Variability and End-to-End Resource Requirements through Optimal Smoothing. IEEE/ACM Transactions on Networking, USA, 1998,6(4): 397-410
[119] L., Georgiadis, R. Guerin, V. Peris, et al. Efficient Support of Delay and Rate Guarantees in an Internet.in: Proc. of ACM SIGCOMM, Palo Alto, 1996. 106-116
[120] R. L. Cruz. A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Transactions on Information Theory, 1991,37(1): 114-131
[121] A., Parekh, R. Gallager. A Generalized Processor Sharing Approach to Flow Control - the Single Node Case. IEEE/ACM Transactions on Networking, 1993,1(3): 344-357
[122] B. H. BLOOM. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 1970, 13(7):422-426
[123] Asit Dan, M. G Kienzle, Dinkar Sitaram. A Dynamic Policy of Segment Replication for Load-Balancing in Video-On-Demand Servers. Multimedia System, 1995, 3(3): 93-103
[124] J. M. Aein. A Multi-user-class, Blocked-calls-cleared Demand Access Node. IEEE Transactions on Communications, 1978, 26(3): 378-385
[125] J. S. Kaufman. Blocking in a Shared Resource Environment. IEEE Transactions on Communications,1981,29(10): 1474-1481
[126] J.P. Nussbaumer, B.V. Patel, F. Schaffa. Multimedia Delivery on Demand: Capacity Analysis and Implications. in: Proc. of Local Computer Networks Conf., Minneapolis, USA, 1994. 380-386
[127] E.W., Zegura, K.L., Calvert, S., Bhattacharjee. How to Model an Internetwork. in: Proc. of IEEE Infocom, San Francisco, USA, 1996. 594-602
[128]D.Heckerman.A Tutorial on Learning with Bayesian Networks".Technical Report,MSR-TR-95-06,Microsoft Research Advanced Technology Division,Microsoft Corporation 1995.ftp://ftp.rearch.microsoft.com/pub/tr/tr-95-06.pdf
[129]S.G.Dykes,K.A.Robbins.Limitations and Benefits of Cooperative Proxy Caching.IEEE Journal on Selected Areas in Communications,2002,20(7):1290-1304
[130]Kyoungwon Suh,Christophe Diot,Jim Kurose et al.Push-to-Peer Video-on-Demand System:Design and Evaluation.IEEE Journal on Selected Areas in Communications,2007,25(9):1706-1716
[131]刘亚杰,窦文华.一种P2P环境下的VoD流媒体服务体系.软件学报,2006,17(4):876-884
[132]吴松,王浩,程斌等.P2P VOD中基于多频道重叠网的数据缓存策略研究.小型微型计算机系统,2007,28(10):1747-1749
[133]郑常熠,王新,赵进等.P2P视频点播内容分发策略.软件学报,2007,18(11):2942-2954
[2] J. P. Nussbaumer, B. V. Patel, F. Schaffa, et al. Networking Requirements for Interactive Video on Demand. IEEE Journal on Selected Areas in Communications, 1995,13(5): 779-787
[3] W. D. Sincoskie. Video on Demand: Is It Feasible. in: Proc. of IEEE GLOBECOM'90, San Diego,USA, 1990.201-205
[4] H. Kobayashi. Modeling and Analysis: an Introduction to System Performance Evaluation Methodology. Addison Wesley, 1981. 59-77
[5] L. Kleinrock. Queueing Systems: Theory. Wiley, 1975. 63-74
[6] R. L. Axtell. Zipf Distribution of U.S. Firm Sizes. Science, 2001,293(12): 1818-820
[7] A. Dan, D. Sitaram, P. Shahabuddin. Scheduling Policies for an On-Demand Video Server with Batching, in: Proc. of ACM Int. Conf. on Multimedia, San Francisco, USA, 1994. 15-23
[8] Y. N. Doganata, A. N. Tantawi. Making a Cost-Effective Video Server. IEEE Multimedia Magazine,1994, 1(4): 22-30
[9] M. Wu, W. Shu. Efficient Support for Interactive Browsing Operations in Clustered CBR Video Servers. IEEE Transactions on Multimedia, 2002,4(1): 48-58
[10] T. L. Kunii, Y. Shinagawa, R. A. Paul, et al. Issues in Storage and Retrieval of Multimedia Data.Multimedia System, 1995,3(5-6): 298-304
[11] P.J. Denning. Effects of Scheduling on File Memory Operations.in: Proc. of AFIPS Spring Joint Computer Conference, Atlantic City, USA, 1967.9-21
[12] C. L. Liu, J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment. Journal of the ACM, 1973,20(1): 46-61
[13] A. L. N. Reddy, J. Wyllie. I/O Issues in a Multimedia System. IEEE Computer, 1994,27(3): 69-74
[14] P. S. Yu, M. S. Chen, D. D. Kandlur. Grouped Sweeping Scheduling for DASD-Based Multimedia Storage Management. ACM Multimedia Systems, 1993, 1(3): 99-109
[15] H. M. Vin, A. Goyal, P. Goya. Algorithms for Designing Large-scale Multimedia Servers. Computer Communications, 1995, 18(3): 192-203
[16] P. J. Shenoy, H. M. Vin. Cello: A Disk Scheduling Framework for Next Generation Operating Systems.in: Proc. of ACM SIGMETRICS, Madison, USA, 1998.44-55
[17] R. Wijayaratne, A. L. N. Reddy. Integrated QoS Management for Disk I/O. in: Proc. of IEEE Int. Conf.on Multimedia Computing and Systems, Florence, Italy, 1999.487-492
[18] Y. Rompogiannakis, G Nerjes, P. Muth, et al. Disk Scheduling for Mixed-media Workloads in a Multimedia Server, in: Proc. of ACM Multimedia Coneference, Bristol, UK, 1998. 297-302
[19] P. V. Rangan, H. M. Vin. Designing File Systems for Digital Video and Audio. Operating Systems Review, 1991,25(5): 69-79
[20] P. V. Rangan, H. M. Vin. Efficient Storage Techniques for Digital Continuous Media. IEEE Transactions on Knowledge and Data Engineering, 1993, 5(4): 564-573
[21] P. V. Rangan, H. M. Vin, S. Ramanathan. Designing an On-Demand Multimedia Service. IEEE Communications Magazine, 1992,30(7): 56-64
[22] H. J. Chen, T. D. C. Little, D. Venkatesh. A Storage and Retrieval Technique for Scalable Delivery of MPEG-encoded Video. Journal of Parallel and Distributed Computing, 1995,30(2): 180-189
[23] D. J. Gemmell, S. Christodoulakis. Principles of Delay-Sensitive Multimedia Data Storage and Retrieval. ACM Transactions on Information Systems, 1992, 10(1): 51-90
[24] A. Srivastava, A. Kumar, A. Singru. Design and Analysis of a Video-on-Demand Server. Multimedia Systems, 1997, 5: 238-254
[25] D. P. Anderson, Y. Osawa, R. Govindan. A File System for Continuous Media. ACM Transactions on Computer Systems, 1992, 10(4): 311-337
[26] H. M. Vin, P. Goyal, A. Goyal, et el. A Statistical Admission Control Algorithm for Multimedia Servers. in: Proc. of ACM Multimedia Conference, San Francisco, USA, 1994. 33-40
[27] E. Chang, A. Zakhor. Admission Control and Data Placement for VBR Video Servers. in: Proc. of IEEE Int. Conf. on Image Processing, Austin, USA, 1994. 278-282
[28] F. Y. Lin. Optimal Real-Time Admission Control Algorithms for the Video-on-Demand (VoD) Service.IEEE Transactions on Broadcasting, 1998, 44(4): 402-408
[29] G Tan, H. Jin, S. Wu. Clustered Multimedia Servers: Architectures and Storage Systems. Annual Review for Scalable Computing, 2003, 5: 92-132
[30] J. R. Santos, R. Muntz. Performance Analysis of the RIO Multimedia Storage System with Heterogeneous Disk Configurations. in: Proc. of ACM Multimedia Conference, Bristol, England, 1998.303-308
[31] S. A. Barnett, G. J. Anido. Performability of Disk-Array-Based Video Servers. Multimedia Systems,1998, 6(1): 60-74
[32] R. Tewari, R. Mukherjee, D. M. Dias et al. Design and Performance Tradeoffs in Clustered Video Servers. in: Proc. of Int. Conf. on Multimedia Computing and Systems, Hiroshima, Japan, 1996,144-150
[33] J. Hsieh, M. Lin, J. C. L. Liu, et al. Performance of a Mass Storage System for Video-on-Demand.Journal of Parallel and Distributed Computing, 1995,30(2): 147-167
[34] P. Shenoy, Pawan Goyal, S. S. Rao, et al. Symphony: An Integrated Multimedia File System. in: Proc.of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 124-138
[35] P. Shenoy, H. M. Vin. Efficient Striping Techniques for Multimedia File Servers. in: Proc. of Network and Operating System Support for Digital Audio and Video, St. Louis, USA, 1997. 25-36
[36] J. L. Wolf, P. S. Yu, H. Shachnai. Disk Load Balancing for Video-on-Demand Systems. Multimedia Systems, 1997, 5(6): 358-370
[37] Y. Wang, J. C. L. Liu, D. H. C. Du et al. Efficient Video File Allocation Schemes for Video-on-Demand Services. Multimedia Systems, 1995,5(5): 283-296
[38] A. Dan, D. Sitaram. An Online Video Placement Policy Based on Bandwidth to Space Ratio (BSR). in:Proc. of ACM SIGMOD, San Jose, USA, 1995.376-385
[39] A. Dan, M. Kienzle, and D. Sitaram. A Dynamic Policy of Segment Replication for Load-Balancing in Video-on-Demand Servers. Multimedia Systems, 1995,3(3): 93-103
[40] R. Flynn, W. Tetzlaff. Disk Striping and Block Replication Algorithms for Video File Servers. in: Proc.of IEEE Int. Conf. on Multimedia Computing and Systems, Hiroshima, Japan, 1996. 590-597
[41] N. Venkatasubramanian, S. Ramanathan. Load Management in Distributed Video Servers, in: Proc. of Intl. Conf. on Distributed Computing Systems, Baltimore, USA, 1997. 528-535
[42] P. W. K. Lie, J. C. S. Lui, and L. Golubchik . Threshold-Based Dynamic Replication in Large Scale Video-on-Demand Systems.in: Proc. of Int. Workshop on Research Issues in Data Engineering,Orlando, USA, 1998. 52-59
[43] S. Ghandeharizadeh, L. Ramos. Continuous Retrieval of Multimedia Data Using Parallelism. IEEE Transactions on Knowledge and Data Engineering, 1993,5(4): 658-669
[44] L. Golubchik, J. C. S. Lui, R. R. Muntz. Adaptive piggybacking: A novel technique for data sharing in video-on-demand storage servers. Multimedia Systems, 1996,4(3), 140-155.
[45] B. Ozden, R. Rastogi, P. Shenoy et al. Fault-tolerant architectures for continuous media servers. in:Proc. of ACM SIGMOD, Montreal, Canada, 1996, pp. 79-90.
[46] S. Berson, L. Golubchik, R. R. Muntz. Fault tolerant design of multimedia servers. in: Proc. of ACM SIGMOD, San Jose, USA, 1995. 364-375.
[47] F. A. Tobagi, J. Pang, R. Baird et al. Streaming RAID: A Disk Storage System for Video and Audio Files. in Proc. of ACM Multimedia Conference, Anaheim, USA, 1993. 393-400
[48] R. Tewari, D. M. Dias, R. Mukherjee, et al. High Availability in Clustered Multimedia Servers. in:Proc. of the Int. Conf. on Data Engineering, New Orleans, USA, 1996.645-654
[49] Y. Wang, D. H. C. Du. On Providing Highly Available Fault-Tolerant Video-on-Demand Services.in:Proc. of IEEE Int. Conf. on Multimedia Computing and Systems, Austin, USA, 1998. 76-85
[50] I. J. Shyu, S. P. Shieh. A Distributed Fault-Tolerant Design for Multipleserver VoD Systems.Multimedia Tools and Applications, 1999, 8(2): 219-247
[51] R. Krishnan, D. Venkatesh, T. D. C. Little. A Failure and Overload Tolerance Mechanism for Continuous Media Servers. in: Proc. of the ACM Multimedia, Seattle, USA, 1997. 131-142
[52] E. Hwang, K. Kilic, V. S. Subrahmanian. Handling Updates and Crashes in VoD Systems. Multimedia Tools and Applications, 1998,7(1-2): 103-132
[53] Cyrus Shahabi, Farnoush Banaei-Kashani. Decentralized Resource Management for a Distributed Continuous Media Server. IEEE Transactions on Parallel and Distributed Systems. 2002, 13(11):1183-1200
[54] V. O. K. Li, Wanjiun Liao. Distributed Multimedia Systems. Proceeding of the IEEE, 1997, 85(7):1063-1108
[55] R. Ramarao, V. Ramamoorthy. Architectural Design of On-Demand Video Delivery Systems: The Spatio-Temporal Storage Allocation Problem. in: Proc. of IEEE Int. Conf. on Communications, Denver, USA, 1991. 506-510
[56] C. C. Bisdikian, B. V. Patel. Issues on Movie Allocation in Distributed Video-on-Demand Systems. in:Proc. of IEEE ICC, Seattle, USA, 1995. 250-255
[57] R. Luling. Static and Dynamic Mapping of Media Assets on a Network of Distributed Multimedia Information Servers. in: Proc. of IEEE Int. Conf. on Distributed Computing Systems, Austin, USA,1999.253-260
[58] R. H. Hwang, Y. C. Sun. Optimal video placement for hierarchical video-on-Demand systems. IEEE Trans. on Broadcasting, 1998,44(4): 392-401
[59] I. Cidon, S. Kutten, R. Soffer. Optimal Allocation of Electronic Content. in: Proc. of IEEE INFOCOM,Anchorage, USA, 2001. 1773-1780
[60] Konstantinos Kalpakis, Koustuv Dasgupta, Our Wolfson. Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Trans. Parallel Distributed System, 2001, 12(6): 628-637
[61] 周笑波, 谢立, ReinhardLueling. 视频服务器网络中影像对象映射问题的研究.软件学报, 2000,12(12): 1620-1627.
[62] R. Boutaba, A. Hafid. A Generic Platform for Scalable Access to Multimedia-on-Demand Systems.IEEE Journal Selected Areas in Communications. 1999, 17(9): 1599-1613
[63] Y. C. Tay, Hweehwa Pang. Load Sharing in Distributed Multimedia-on-Demand Systems. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(3): 410-428
[64] Cheng-Fu, Chou, L. Golubchik , J.C.S. Lui. Striping Doesn't Scale: How to Achieve Scal-ability for Continuous Media Servers with Replication. in: Proc. of IEEE Int. Conf. on Distributed Computing Systems, Taipei, Taiwan, 2000. 64-71
[65] Jeong-Dong Ryoo, S.S. Panwar. Algorithms for Determining File Distribution in Networks with Multimedia Servers. in: IEEE International Conference on Communications, 1999. 875-879
[66] J. S. Ko, J. W. Lee, H. Y. Yeom. An Alternative Scheme to LRU for Efficient Page Replacement.Journal of KISS (Computer Systems and Theory), 1996,23(5): 478-486
[67] D. Lee, J. Choi, H. Choe et al. Implementation and Performance Evaluation of the LRFU Replacement Policy. in: Proc. of Euromicro Conference New Frontiers of Information Technology, Los Alamitos,USA, 1997. 106-111
[68] E. J. O'Neil, P. E. O'Neil, G Weikum. An Optimality Proof of the LRU-K Page Replacement Algorithm. Journal of the ACM, 1999,46(1): 92-112
[69] A. Kraiss, G. Weikum. Integrated Document Caching and Prefetching in Storage Hierarchies ased on Markov-chain Predictions. VLDB Journal, 1998, 7(3): 141-162
[70] T. Kimbrel, A. R. Karlin. Near-optimal Parallel Prefetching and Caching. SIAM Journal on computing,2000,29(4): 1051-1082
[71] W. W Schilling, Jr. M. Alam. The Impact of Prefetching and Victim Caching on Computer Systems Performance.in: Proc. of Int. Conf. on Parallel and Distributed Computing Systems. Fort Lauderdale,USA, 1999.271-276
[72] H. S. Jeon, S. H Noh. Dynamic Buffer Cache Management Scheme based on Simple and Aggressive Prefetching. in: Proc. of 4th Annual Linux Showcase and Conf., Atlanta, USA, 2000. 27-38
[73] F. Moser, A. Kraiss, W. Klas. L/MRP: a buffer management strategy for interactive continuous data flows in a multimedia DBMS. in: Proc. of. 21st International Conference on Very Large Data Bases,Zurich, Switzerland, 1995.275-286
[74] J. Choi, D. Lee, S. H. Noh, et al. Characterization and Automatic Detection of Block Reference Patterns. Journal of KISS (A) :Computer Systems and Theory, 1999,26 (9): 1083-1095
[75] G. Glass, Pei Cao. Adaptive Page Replacement based on Memory Reference Behavior.in: Proc. of ACM SIGMETRICS'97, Seattle, USA, 1997. 115-126
[76] A. Dan, D. Sitaram. A Generalized Interval Caching Policy for Mixed Interactive and Long Video Workloads. in: Proc. of the SPIE MMCN'96, San Jose, USA, 1996. 344-351
[77] A. Dan, D. Sitaram. Multimedia. Caching Strategies for Heterogeneous Application and Server Environments. Multimedia Tools and Applications, 1997,4(3): 279-312
[78] J. Mogul. Squeezing More Bits Out of HTTP Caches. IEEE Network. 2000, 14(3): 6-14
[79] Reza Rejaie, Haobo Yu, Mark Handely et al. Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet. in: Proc. of IEEE INFOCOM, Tel Aviv, Israel, 2000.980-989
[80] Subhabrata Sen, Jennifer Rexford, Don Towsley. Proxy Prefix Caching for Multimedia Streams. Proc.ofthe IEEE INFOCOM '99. 1999: 1310-1319
[81] Renu Tewari, H. M. Vin, Asit Dan et al. Resource-based Caching for Web Servers. in: Proc. of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 191-204
[82] Eun-Ji Lim, Seong-Ho Park, Hyeon-Ok Hong et al. A Proxy Caching Scheme for Continuous Media Streams on the Internet. in: Proc. of Int. Conf. on Information Networking, Beppu City, Oita, Japan,2001.720-725
[83] R. Rejaie, M. Handley, H. Yu et al. Proxy Caching Mechanism for Multimedia Playback Streams in the Internet. in: Proc. 4th International Web Caching Workshop, 1999. 100-111
[84] Pei Cao, Sandy Irani. Cost-Aware WWW Proxy Caching Algorithms. in: Proc. of Usenix Symposium on Internet Technologies and Systems, 1997. 193-206
[85] F. Yu, Q. Zhang, W. Zhu et al. QoS-adaptive proxy caching for multimedia streaming over the Internet.IEEE Transaction Circuits System Video Technical, 2003, 13(3): 257-269
[86] Qian Zhang, Zhe Xiang, Wenwu Zhu et al. Cost-Based Cache Replacement and Server Selection for Multimedia Proxy Across Wireless Internet. IEEE Trans. on Multimedia, 2004,6(4): 587-598
[87] Pablo Rodriguez, Christian Spanner, E. W. Biersack. Analysis of Web Caching Architectures:Hierarchical and Distributed Caching. IEEE/ACM Transactions on Networking, 2001, 9(4): 404-418
[88] D.Wessels, K. Claffy. Application of Internet cache protocol (ICP), version 2. Internet Engineering Task Force, Internet Draft, 1997.
[89] Xueyan Tang, S. T. Chanson, Coordinated En-Route Web Caching, IEEE Transactions on Computers,2002, 51(6): 595-607
[90] Alec Wolman, G M. Voelker, Nitin Sharma et al. On the Scale and Performance of Cooperative Web Proxy Caching. in: Proc. of ACM symp. on Operating systems principles, Charleston, USA, 1999.16-31
[91] K. A. Hua, Y. Cai, Simon Sheu. Patching: A Multicast Technique for True Video-on-Demand Services.In Proc. of ACM MULTIMEDIA, Bristol, UK, 1998. 191-200
[92] S. Viswanathan, T. Imielinski. Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting. Multimedia Systems, 1996,4(4): 197-208
[93] Y. Cai, Kien A. Hua, Simon Sheu. Optimizing Patching Performance, in: Proc. of SPIE/ACM Conf. on Multimedia Computing and Networking, San Jose, USA, 1998. 204-215
[94] S. Sen, L. Gao, J. Rexford et al. Optimal Patching Schemes for Efficient Multimedia Streaming. in:Proc. of NOSSDAV, Basking Ridge, USA, 1999
[95] D. P. Anderson. Metascheduling for Continuous Media. ACM Transactions on Computer Systems.1993, 11(3): 226-252
[96] C.C. Aggarwal, J.L. Wolf, P.S. Yu. A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems. in: Proc. of Int. Conf. Multimedia Computing and Systems, Hiroshima,Japan, 1996. 118-126
[97] K. A. Hua, Simon Sheu. Skyscraper Broadcasting: A New Broadcasting Scheme for Metropolitan Video-on-Demand Systems. in: Proc. of SIGCOMM, Cannes, France, 1997. 89-100
[98] M. Bradshaw, B. Wang, S. Sen et al. Periodic Broadcast and Patching Services - Implementation,Measurement, and Analysis in an Internet Streaming Video Testbed. Multimedia Systems, 2003, 9(1):78-93
[99] J. Y. B. Lee, R. W. T. Leung. Study of a Server-less Architecture for Video-On-Demand Applications.in: Proc. of IEEE Int. Conf. on Multimedia and Expo, 2002. 233-236.
[100] J. Y. B. Lee, R. W. T. Leung. Design and Analysis of a Fault-Tolerant Mechanism for a Server-less Video-on-Demand System.in: Proc. of Parallel and Distributed Systems, 2002. 489-494.
[101] T. K. Ho, Jack Y. B. Lee. A Row-Permutated Data Reorganization Algorithm for Growing Server-less Video-on-Demand Systems. in: Proc. of Cluster Computing and the Grid, 2003.44-51
[102] Yang-hua Chu, S. G Rao, Srinivasan Seshan et al. A Case for End System Multicast. IEEE Journal on Selection Areas in Communications, 2002,20(8): 1456-1471
[103] A. L. Chervenak, D. A. Patterson, R.H. Katz. Storage Systems for Movies-on-Demand Video Servers.in: Proc. of IEEE Symp. on Mass Storage Systems, Monterey, USA, 1995. 246-256
[104] S. A. Barnett, G J. Anido. A Cost Comparison of Distributed and Centralized Approaches to Video-on-Demand. IEEE Journal on Selection Areas in Communications, 1996, 14(6): 1173-1183
[105] Peter Triantafillou, Christos Faloutsos. Overlaying striping for optimal parallel I/O in modern applications. Parallel Computing. 1998, 24(1): 21-43
[106] A. Rowstron, P. Druschel. Pastry: Scalable. Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. in: Proceeding IFIP/ACM Middleware, Heidelberg, Germany, 2001.329-350
[107] S. G Dykes, C. L. Jeffery, S. Das. Taxonomy and Design Analysis for Distributed Web Caching. in:Proc. of IEEE Hawaii Int. Conf. on System Sciences, Maui, USA, 1999. 1-10
[108] E. D. Katz, M. Butler, R. McGrath. A Scalable HTTP server; the NCSA Prototype. Computer Networks and ISDN Systems, 1994, 27(2): 155-164
[109] D. Andresen, T. Yang, V. Holmedahl et al. SWEB: Towards a Scalable World Wide Web Server on Multicomputers. in: Proc. of Int. Parallel Processing Symp., Honolulu, USA, 1996. 850-856
[110] D. M. Dias, W. Kish, R. Mukherjee et al. A Scalable and Highly Available Web Server. in: Proc. of IEEE Computer Society Int. Conf., Santa Clara, USA, 1996. 85-92
[111] M. Sayal, Y. Breitbart, P. Scheuermann et al. Selection Algorithms for Replicated Web Servers. Performance Evaluation Review, 1998,26(3): 44-50
[112] C. Yoshikawa, B. Chun; P. Eastham. Using Smart Clients to Build Scalable Services. in: Proc. of the 1997 USENIX Annual Tech. Conf., Anaheim, USA, 1997. 105-117
[113] R. Tewari, M. Dahlin, H. M. Vin, et al. Design Considerations for Distributed Caching on the Internet.in: Proc. of Int. Conf. on Distributed Computing Systems, Austin, USA, 1999. 275-284
[114]H. Balakrishnam, S. Seshan, M. Stemm et al. Analyzing stability in wide-area network performance. in:Proc. of ACM SIGMETRICS, Seattle, USA, 1997.2-12
[115] M. E. Crovella, A. Bestavros. Self-similarity in world wide web traffic: evidence and possible causes.IEEE/ACM Transactions on Networking, 1997,5(6): 835-846
[116] S. G Dykes, K. A. Robbins, C. L. Jeffery. An Empirical Evaluation of Client-side Server Selection Algorithms. in: Proc. of IEEE INFOCOM, Tel Aviv, Israel, 2000: 1361-1370
[117] E., Chang, A. Zakhor. Scalable Video Data Placement on Parallel Disk Arrays. in: Proc. of the SPIE,San Jose, USA, 1994.208-221
[118] J. D., Salehi, Z. L. Zhang, J. Kurose, et al. Supporting Stored Video: Reducing Rate Variability and End-to-End Resource Requirements through Optimal Smoothing. IEEE/ACM Transactions on Networking, USA, 1998,6(4): 397-410
[119] L., Georgiadis, R. Guerin, V. Peris, et al. Efficient Support of Delay and Rate Guarantees in an Internet.in: Proc. of ACM SIGCOMM, Palo Alto, 1996. 106-116
[120] R. L. Cruz. A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Transactions on Information Theory, 1991,37(1): 114-131
[121] A., Parekh, R. Gallager. A Generalized Processor Sharing Approach to Flow Control - the Single Node Case. IEEE/ACM Transactions on Networking, 1993,1(3): 344-357
[122] B. H. BLOOM. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 1970, 13(7):422-426
[123] Asit Dan, M. G Kienzle, Dinkar Sitaram. A Dynamic Policy of Segment Replication for Load-Balancing in Video-On-Demand Servers. Multimedia System, 1995, 3(3): 93-103
[124] J. M. Aein. A Multi-user-class, Blocked-calls-cleared Demand Access Node. IEEE Transactions on Communications, 1978, 26(3): 378-385
[125] J. S. Kaufman. Blocking in a Shared Resource Environment. IEEE Transactions on Communications,1981,29(10): 1474-1481
[126] J.P. Nussbaumer, B.V. Patel, F. Schaffa. Multimedia Delivery on Demand: Capacity Analysis and Implications. in: Proc. of Local Computer Networks Conf., Minneapolis, USA, 1994. 380-386
[127] E.W., Zegura, K.L., Calvert, S., Bhattacharjee. How to Model an Internetwork. in: Proc. of IEEE Infocom, San Francisco, USA, 1996. 594-602
[128]D.Heckerman.A Tutorial on Learning with Bayesian Networks".Technical Report,MSR-TR-95-06,Microsoft Research Advanced Technology Division,Microsoft Corporation 1995.ftp://ftp.rearch.microsoft.com/pub/tr/tr-95-06.pdf
[129]S.G.Dykes,K.A.Robbins.Limitations and Benefits of Cooperative Proxy Caching.IEEE Journal on Selected Areas in Communications,2002,20(7):1290-1304
[130]Kyoungwon Suh,Christophe Diot,Jim Kurose et al.Push-to-Peer Video-on-Demand System:Design and Evaluation.IEEE Journal on Selected Areas in Communications,2007,25(9):1706-1716
[131]刘亚杰,窦文华.一种P2P环境下的VoD流媒体服务体系.软件学报,2006,17(4):876-884
[132]吴松,王浩,程斌等.P2P VOD中基于多频道重叠网的数据缓存策略研究.小型微型计算机系统,2007,28(10):1747-1749
[133]郑常熠,王新,赵进等.P2P视频点播内容分发策略.软件学报,2007,18(11):2942-2954