The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Design, implementation, and evaluation of a software-based real-time Ethernet protocol
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Design and implementation of the Stony Brook Video Server
Software—Practice & Experience
MPEG-L/MRP: implementing adaptive streaming of MPEG videos for interactive internet applications
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Buffering and caching in large-scale video servers
COMPCON '95 Proceedings of the 40th IEEE Computer Society International Conference
Implementation and Evaluation of a Multimedia File System
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
The design, implementation, and analysis of the stony brook video server
The design, implementation, and analysis of the stony brook video server
The design, implementation and evaluation of rether: a real-time ethernet protocol
The design, implementation and evaluation of rether: a real-time ethernet protocol
Buffer Replacement Algorithms for Multimedia Storage Systems
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Video-on-Demand Networks: Design Approaches and Future Challenges
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The interval caching buffer management scheme uses temporal locality of a group of I/O streams serving videos on demand. A group of I/O streams served by a single stream is called a session. In such cases, all I/O streams in the session, except one, will experience buffer hits. Also, the I/O stream of the client may leave the session resulting in a wastage of memory as the Vldeo-on-Demand (VoD) system provides VCR-like functions e.g. play, pause, rewind and Cast-forward. Our proposed interval-based buffer management technique merges the streams of a number of sessions and returns the same number of sessions with minimum memory wastage. In the MMS buffer management scheme, the number of streams of the sessions are grouped together to form the same number of sessions by using a greedy approach to reduce the memory requirement. An integer constant called block-factor is defined to be a limiting factor for the extra blocks allocated for a new stream to be grouped with the existing session. The simulation study shows that the MMS buffer management scheme reduces memory wastage as the block-factor increases.