An Efficient Conflict-Resolution Approach to Support Read/Write Operations in a Video Server

In this paper, we propose an efficient conflict-resolution approach based on the multi-disk architecture for the insertion/deletion operations on continuous media that are split up into blocks and placed in various locations on the disk, without reorganizing the whole data. When a new subobject is inserted after subobject i, it will be assigned with an identification number (i + 1) and be inserted into a disk in which the retrieval of the new subobject does not conflict with the retrieval of any other subobject, where a conflict means a pair of two consecutive subobjects that are stored in the same disk have to be retrieved simultaneously. However, a new conflict on the same disk may occur since all the identification numbers of subobjects after subobject i are increased by one. Only when such a new conflict occurs, one movement operation is required, so does the case of a deletion operation. Moreover, to reduce those additional movement cost, a deferring approach is proposed at the cost of an additional buffer. In this approach, n data insertions are deferred and stored in a buffer. Then, the system starts to insert those data after an optimal insertion sequence is determined. Based on this approach, two strategies are proposed: the conflict-resolved-first-deferring strategy (the CRFD strategy) and the conflict-resolved-last-deferring strategy (the CRLD strategy). From our performance analysis, we will prove that the CRLD strategy with an insertion sequence according to the ascending order of identification numbers is an optimal strategy based on the proposed deferring approach.