Retrieval scheduling for collaborative multimedia presentations
暂无分享,去创建一个
[1] Erich M. Nahum,et al. Locality-aware request distribution in cluster-based network servers , 1998, ASPLOS VIII.
[2] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[3] Ellen W. Zegura,et al. A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[4] Daniel M. Dias,et al. A scalable and highly available web server , 1996, COMPCON '96. Technologies for the Information Superhighway Digest of Papers.
[5] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[6] Satish K. Tripathi,et al. Handling QoS negotiations in orchestrated multimedia presentations , 1996, J. High Speed Networks.
[7] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[8] Arif Ghafoor,et al. Scheduling of Bandwidth-Constrained Multimedia Traffic , 1991, NOSSDAV.
[9] Michelle Butler,et al. A Scalable HTTP Server: The NCSA Prototype , 1994, Comput. Networks ISDN Syst..
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] K. Selçuk Candan,et al. CHIMP: a framework for supporting distributed multimedia document authoring and presentation , 1997, MULTIMEDIA '96.