|
DRUM >
College of Computer, Mathematical & Natural Sciences >
Computer Science >
Technical Reports from UMIACS >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/873
|
| Title: | Resource Lock Commit Protocol (RLCP) for Multimedia Object Retrieval |
| Authors: | Candan, K. Selcuk Hwang, Eenjun Prabhakaran, B. Subrahmanian, V.S. |
| Type: | Technical Report |
| Issue Date: | 15-Oct-1998 |
| Series/Report no.: | UM Computer Science Department; CS-TR-3746 UMIACS; UMIACS-TR-97-08 |
| Abstract: | Many multimedia presentation applications involve retrieval
of objects from more than one collaborating server. Presentations of
objects from different collaborating servers might be
inter-dependent. For instance, we can consider distributed video
servers where blocks of movies are distributed over a set of
servers. Here, blocks of a movie from different video servers have to
be retrieved and presented continuously without any gaps
in the presentation. Such applications first need an estimate of the
available network resources to each of the collaborating server
in order to identify a schedule for retrieving the objects
composing the presentation. A collaborating server can suggest
modifications of the retrieval schedule depending on its load. These
modifications can potentially affect the retrieval schedule for other
collaborating applications. Hence, a sequence of negotiations have to
be carried out with the collaborating servers in order to commit for
a retrieval schedule of the objects composing the multimedia
presentation. In this paper, we propose an application sub-layer protocol,
Resource Lock Commit Protocol (RLCP), for handling the negotiation
and commitment of the resources required for a collaborative
multimedia presentation application.
(Also cross-referenced as UMIACS-TR-97-08) |
| URI: | http://hdl.handle.net/1903/873 |
| Appears in Collections: | Technical Reports of the Computer Science Department Technical Reports from UMIACS
|
All items in DRUM are protected by copyright, with all rights reserved.
|