Delivering presentations from multimedia servers

Most multimedia servers reported in the literature are designed to serve mu ltiple and independent video/audio streams. We think that, in future: multi media servers will also serve complete presentations. Multimedia presentati ons provide unique opportunities to develop algorithms for buffer managemen t and admission control, as execution-time consumption requirements of pres entations are known a priori. In this paper, we examine presentations in th ree different domains (heavyweight, middleweight, and lightweight) and prov ide buffer management and admission control algorithms for the three domain s. We propose two improvements (flattening and dynamic-adjustments) on the schedules created for the heavyweight presentations. Results from a simulat ion environment are presented.