Abstract
Distributed multimedia document systems and distributed video servers are examples of multimedia presentations involving collaboration among multiple information sources. In such applications, objects have to be retrieved from their sources and presented to users according to specified temporal relationships. Object retrieval in these collaborative applications is influenced by the presentation times, durations and network throughput available to their sources. Replication of objects amongst the set of collaborating systems gives a choice for object retrieval. We present a graph-search based algorithm for computing and negotiating throughput requirements of collaborating multimedia presentations with replicated objects. This algorithm optimizes the number of cached objects (that have already been played) for handling operations like reverse presentation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
