Scheduling and Optimization of the Delivery of Multimedia Streams Using Query Scripts Presenter: Xuxian Jiang By Scott T. Campbell and Soon M. Chung

Requirement of Multimedia Streams Delivery Network Bandwidth Temporal relationships of multimedia data streams

Observations temporal relationships of multiple multimedia streams in one presentations Gaps exists between multimedia data streams Reason for Gaps: Media server treat different streams even in one presentation as different request. Media server treat different streams even in one presentation as different request. Client behavior is unexpected. Client behavior is unexpected.

Problem Statement How to avoid the interruptions and discontinuities of multimedia streams of one presentation

Their Solution Policy: Resource Reservation Major Resources: Major Resources: Network Bandwidth Disk Access Bandwidth ( <-- Their focus ) Mechanism Client tells server what are needed in what timing Client tells server what are needed in what timing ( Query Script ) Server find whether it can be integrated into current schedule without over-commitment of system resources and sacrifice of ongoing streams Server find whether it can be integrated into current schedule without over-commitment of system resources and sacrifice of ongoing streams ( Schedule)

Query Script Interface between the client and multimedia database Components declaration declaration I need media named A, B, C and D temporal ordering temporal ordering A, B and C, When B stops then stop C, D

A B C D

Schedule Scan Schedule Group Schedule

Scan Schedule Start Admission Test Integration into a test schedule Feasible? Locate next possible start time and update the test schedule Accept the test schedule Reject the request Failed Pass Yes No

Group Schedule Start Apply scan scheduling to find a feasible schedule Select another start time Feasible? Include the test schedule into a set of candidate schedules Apply metric to the candidate schedules and select the best one Yes No

Selection metrics Smallest startup delay Scan scheduling algorithm Scan scheduling algorithm Biggest soonest Highest utilization level early in the schedule Highest utilization level early in the schedule Monotonic decreasing Consistently decreasing utilization level Consistently decreasing utilization level Highest floor Schedule with the highest minimum utilization level Schedule with the highest minimum utilization level Lowest ceiling Schedule with the lowest maximum utilization level Schedule with the lowest maximum utilization level

Contribution The recognition of temporal relationships of multiple multimedia streams in one presentation The resource reservation approach to get sustained and consistent streaming by using query script and scheduling algorithm

Weakness No support of video-like operations: rewind and fast-forward. In their approach, video-like ops should be regarded as a separate request, and its disk bandwidth requirement should be considered to generate a new schedule Not scalable.