共查询到20条相似文献,搜索用时 15 毫秒
1.
Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers 总被引:17,自引:0,他引:17
Recent technology advances have made multimedia on-demand services, such as home entertainment and home-shopping, important
to the consumer market. One of the most challenging aspects of this type of service is providing access either instantaneously
or within a small and reasonable latency upon request. We consider improvements in the performance of multimedia storage servers
through data sharing between requests for popular objects, assuming that the I/O bandwidth is the critical resource in the system. We discuss a novel approach to data sharing,
termed adaptive piggybacking, which can be used to reduce the aggregate I/O demand on the multimedia storage server and thus
reduce latency for servicing new requests. 相似文献
2.
In this paper, we present a novel approach for multimedia data indexing and retrieval that is machine independent and highly
flexible for sharing multimedia data across applications. Traditional multimedia data indexing and retrieval problems have
been attacked using the central data server as the main focus, and most of the indexing and query-processing for retrieval
are highly application dependent. This precludes the use of created indices and query processing mechanisms for multimedia
data which, in general, have a wide variety of uses across applications. The approach proposed in this paper addresses three
issues: 1. multimedia data indexing; 2. inference or query processing; and 3. combining indices and inference or query mechanism
with the data to facilitate machine independence in retrieval and query processing. We emphasize the third issue, as typically
multimedia data are huge in size and requires intra-data indexing. We describe how the proposed approach addresses various
problems faced by the application developers in indexing and retrieval of multimedia data. Finally, we present two applications
developed based on the proposed approach: video indexing; and video content authorization for presentation. 相似文献
3.
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams
for efficient recovery. Whereas the first method exploits the inherent redundancy in video streams (rather than error-correcting
codes) to approximately reconstruct data stored on failed disks, the second method exploits the sequentiality of video playback
to reduce the overhead of online failure recovery in conventional RAID arrays. For the former approach, we present loss-resilient
versions of JPEG and MPEG compression algorithms. We present an inherently redundant array of disks (IRAD) architecture that combines these loss-resilient compression algorithms with techniques for efficient placement of video streams
on disk arrays to ensure that on-the-fly recovery does not impose any additional load on the array. Together, they enhance
the scalability of multimedia servers by (1) integrating the recovery process with the decompression of video streams, and
thereby distributing the reconstruction process across the clients; and (2) supporting graceful degradation in the quality
of recovered images with increase in the number of disk failures. We present analytical and experimental results to show that
both schemes significantly reduce the failure recovery overhead in a multimedia server. 相似文献
4.
In this paper, we investigate a playout scheduling framework for supporting the continuous and synchronized presentations
of multimedia streams in a distributed multimedia presentation system. We assume a situation in which the server and network
transmissions provide sufficient support for the delivery of media objects. In this context, major issues regarding the enforcement
of the smooth presentation of multimedia streams at client sites must be addressed to deal with rate variance of stream presentations
and delay variance of networks. We develop various playout-scheduling algorithms that are adaptable to quality-of-service
parameters. The proposed algorithms permit the local adjustment of unsynchronized presentations by gradually accelerating
or retarding presentation components, rather than abruptly skipping or pausing the presentation materials. A comprehensive
experimental analysis of the proposed algorithms demonstrates that our algorithms can effectively avoid playout gaps (or hiccups)
in the presentations. This scheduling framework can be readily used to support customized multimedia presentations. 相似文献
5.
K. Selçuk Candan Eric Lemar V.S. Subrahmanian 《The VLDB Journal The International Journal on Very Large Data Bases》2000,9(2):131-153
Abstract. Though there has been extensive work on multimedia databases in the last few years, there is no prevailing notion of a multimedia
view, nor there are techniques to create, manage, and maintain such views. Visualizing the results of a dynamic multimedia
query or materializing a dynamic multimedia view corresponds to assembling and delivering an interactive multimedia presentation
in accordance with the visualization specifications. In this paper, we suggest that a non-interactive multimedia presentation
is a set of virtual objects with associated spatial and temporal presentation constraints. A virtual object is either an object, or the result of a query.
As queries may have different answers at different points in time, scheduling the presentation of such objects is nontrivial.
We then develop a probabilistic model of interactive multimedia presentations, extending the non-interactive model described
earlier. We also develop a probabilistic model of interactive visualization where the probabilities reflect the user profiles,
or the likelihood of certain user interactions. Based on this probabilistic model, we develop three utility-theoretic based
types of prefetching algorithms that anticipate how users will interact with the presentation. These prefetching algorithms
allow efficient visualization of the query results in accordance with the underlying specification. We have built a prototype
system that incorporates these algorithms. We report on the results of experiments conducted on top of this implementation.
Received June 10, 1998 / Accepted November 10, 1999 相似文献
6.
Efficient admission control algorithms for multimedia servers 总被引:3,自引:0,他引:3
In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are providers
of variable-bit-rate media streams. The proposed schemes are based on a slicing technique and use aggressive methods for admission
control. We have developed two types of admission control schemes: Future-Max (FM) and Interval Estimation (IE). The FM algorithm uses the maximum bandwidth requirement of the future to estimate the bandwidth requirement. The IE
algorithm defines a class of admission control schemes that use a combination of the maximum and average bandwidths within
each interval to estimate the bandwidth requirement of the interval. The performance evaluations done through simulations
show that the server utilization is improved by using the FM and IE algorithms. Furthermore, the quality of service is also
improved by using the FM and IE algorithms. Several results depicting the trade-off between the implementation complexity,
the desired accuracy, the number of accepted requests, and the quality of service are presented. 相似文献
7.
We discuss the problem of capturing media streams which occur during a live lecture in class or during a telepresentation.
Instead of presenting yet another method or system for capturing the classroom experience, we introduce some informal guidelines
and show their importance for such a system. We derive from these guidelines a formal framework for sets of data streams and
an application model to handle these sets so that a real-time replay becomes possible. The Authoring on the Fly system is a possible realization of a framework which follows these guidelines. It allows the capture and real-time replay
of data streams captured during a (tele)presentation, including audio, video, and whiteboard action streams. This article
gives an overview of the different AoF system components for the various phases of the teaching and learning cycle. It comprises
an integrated text and graphics editor for the preparation of pages to be loaded by the whiteboard during the presentation
phase. The recording component of the system captures various data streams of the live presentation. They are postprocessed
by the system so that they become instances of the class of media for whose replay the general application model was developed.
From a global point of view, the Authoring on the Fly system allows one to merge three apparently distinct tasks – teaching
in class, telepresentation, and multimedia authoring – into one single activity. The system has been used routinely for recording
telepresentations over the MBone net and has already led to a large number of multimedia documents which have been integrated
automatically into Web-based teaching and learning environments. 相似文献
8.
A large-scale, distributed video-on-demand (VOD) system allows geographically dispersed residential and business users to
access video services, such as movies and other multimedia programs or documents on demand from video servers on a high-speed
network. In this paper, we first demonstrate through analysis and simulation the need for a hierarchical architecture for
the VOD distribution network.We then assume a hierarchical architecture, which fits the existing tree topology used in today's
cable TV (CATV) hybrid fiber/coaxial (HFC) distribution networks. We develop a model for the video program placement, configuration,
and performance evaluation of such systems. Our approach takes into account the user behavior, the fact that the user requests
are transmitted over a shared channel before reaching the video server containing the requested program, the fact that the
input/output (I/O) capacity of the video servers is the costlier resource, and finally the communication cost. In addition,
our model employs batching of user requests at the video servers. We study the effect of batching on the performance of the
video servers and on the quality of service (QoS) delivered to the user, and we contribute dynamic batching policies which
improve server utilization, user QoS, and lower the servers' cost. The evaluation is based on an extensive analytical and
simulation study. 相似文献
9.
Multimedia streams such as audio and video impose tight temporal constraints for their presentation. Often, related multimedia
streams, such as audio and video, must be presented in a synchronized way. We introduce a novel scheme to ensure the continuous
and synchronous delivery of distributed stored multimedia streams across a communications network. We propose a new protocol for synchronized playback and compute the buffer
required to achieve both, the continuity within a single substream and the synchronization between related substreams. The
scheme is very general and does not require synchronized clocks. Using a resynchronization protocol based on buffer level
control, the scheme is able to cope with server drop-outs and clock drift. The synchronization scheme has been implemented
and the paper concludes with our experimental results. 相似文献
10.
Many multimedia presentation applications involve retrieval of objects from more than one collaborating server. Presentations of objects from different collaborating servers might be interdependent. 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. 相似文献
11.
In this paper, we propose and study a dynamic approach to schedule real-time requests in a video-on-demand (VOD) server.
Providing quality of service in such servers requires uninterrupted and on-time retrieval of motion video data. VOD services
and multimedia applications further require access to the storage devices to be shared among multiple concurrent streams.
Most of the previous VOD scheduling approaches use limited run-time,0 information and thus cannot exploit the potential capacity
of the system fully. Our approach improves throughput by making use of run-time information to relax admission control. It
maintains excellent quality of service under varying playout rates by observing deadlines and by reallocating resources to
guarantee continuous service. It also reduces start-up latency by beginning service as soon as it is detected that deadlines
of all real-time requests will be met. We establish safe conditions for greedy admission, dynamic control of disk read sizes,
fast initial service, and sporadic services. We conduct thorough simulations over a wide range of buffer capacities, load
settings, and over varying playout rates to demonstrate the significant improvements in quality of service, throughput and
start-up latency of our approach relative to a static approach. 相似文献
12.
In a multimedia server, multiple media streams are generally serviced in a cyclic fashion. Due to non-uniform playback rates
and asynchronous arrivals of queries, there tends to be spare disk bandwidth in each service cycle. In this paper, we study
the issue of dynamically using spare disk bandwidth and buffer to maximize the system throughput of a multimedia server. We
introduce the concept of minimizing buffer consumption as the criterion to select an appropriate media stream to utilize the spare system resources. Buffer consumption measures
not only the amount of buffer but also the amount of time such buffer space is occupied (i.e., the space-time product). Different
alternatives to utilizing spare disk bandwidth are examined, including different rate-adjustable retrievals of an already
activated stream and prefetching the next waiting stream. For rate-adjustable retrievals, we study buffer consumption-based and remaining-time-based criteria for selecting an active stream to increase retrievals. Simulations are conducted to evaluate and compare different
cases. The results show that (1) minimizing buffer consumption is the right criterion for maximizing the system throughput
with spare disk bandwidth; (2) in general, prefetching a waiting stream incurs more buffer consumption, and thus is less effective
than rate-adjustable retrieval of active streams in maximizing the system throughput; and (3) the advantage of rate-adjustable
retrieval over prefetching is especially significant when service cycle time is small. 相似文献
13.
Over the last few years, there has been a tremendous increase in the number of interactive multimedia presentations prepared
by different individuals and organizations. In this paper, we present an algebra for creating and querying interactive multimedia
presentation databases. This algebra operates on trees whose branches reflect different possible playouts of a set of presentations.
The algebra not only extends all the classical relational operators to such databases, but also introduces a variety of novel
operators for combining multiple presentations. As our algebra supports merging parts or all of existing presentations, this
algebra can also be used as an authoring tool for creating multimedia presentations. We prove a host of equivalence results
for queries in this algebra, which may be used to build query optimizers for interactive presentation databases. 相似文献
14.
As multimedia applications spread widely, it is crucial for programming and design support systems to handle “time” in multimedia
documents effectively and flexibly. This paper presents a set of interactive system support tools for designing and maintaining
the temporal behavior of multimedia documents. The tool set provides mechanisms for anomaly detection, temporal query processing,
and interactive scheduling. It is based on a fast incremental constraint solver we have developed, which can be adapted by
any constraint-based system. The incremental constraint solver provides immediate feedback to the user, supporting a highly
interactive design process. Combined with existing optimal layout generation mechanisms proposed in the literature, our tools
effectively utilize the flexibility provided by constraint-based systems. 相似文献
15.
Nevzat Hurkan Balkir Gultekin Ozsoyoglu 《The VLDB Journal The International Journal on Very Large Data Bases》1998,7(4):294-307
Most multimedia servers reported in the literature are designed to serve multiple and independent video/audio streams. We
think that, in future, multimedia servers will also serve complete presentations. Multimedia presentations provide unique
opportunities to develop algorithms for buffer management and admission control, as execution-time consumption requirements
of presentations are known a priori. In this paper, we examine presentations in three different domains (heavyweight, middleweight,
and lightweight) and provide buffer management and admission control algorithms for the three domains. We propose two improvements
(flattening and dynamic-adjustments) on the schedules created for the heavyweight presentations. Results from a simulation
environment are presented.
Received June 9, 1998 / Accepted October 13, 1998 相似文献
16.
Recent advances in computer technologies have made it feasible to provide multimedia services, such as news distribution
and entertainment, via high-bandwidth networks. The storage and retrieval of large multimedia objects (e.g., video) becomes
a major design issue of the multimedia information system. While most other works on multimedia storage servers assume an
on-line disk storage system, we consider a two-tier storage architecture with a robotic tape library as the vast near-line
storage and an on-line disk system as the front-line storage. Magnetic tapes are cheaper, more robust, and have a larger
capacity; hence, they are more cost effective for large scale storage systems (e.g., video-on-demand (VOD) systems may
store tens of thousands of videos). We study in detail the design issues of the tape subsystem and propose some novel tape-scheduling
algorithms which give faster response and require less disk buffer space. We also study the disk-striping policy and the
data layout on the tape cartridge in order to fully utilize the throughput of the robotic tape system and to minimize the
on-line disk storage space. 相似文献
17.
The next generation of interactive multimedia documents can contain both static media, e.g., text, graph, image, and continuous
media, e.g., audio and video, and can provide user interactions in distributed environments. However, the temporal information
of multimedia documents cannot be described using traditional document structures, e.g., Open Document Architecture (ODA)
and Standard Generalized Mark-up Language (SGML); the continuous transmission of media units also raises some new synchronization
problems, which have not been met before, for processing user interactions. Thus, developing a distributed interactive multimedia
document system should resolve the issues of document model, presentation control architecture, and control scheme. In this
paper, we (i) propose a new multimedia document model that contains the logical structure, the layout structure, and the temporal
structure to formally describe multimedia documents, and (ii) point out main interaction-based synchronization problems, and
propose a control architecture and a token-based control scheme to solve these interaction-based synchronization problems.
Based on the proposed document model, control architecture, and control scheme, a distributed interactive multimedia document
development mechanism, which is called MING-I, is developed on SUN workstations. 相似文献
18.
Without user interactions, multimedia presentations are just fancy slide shows with sound and video supports. User interactions
by themselves do not change the temporal relationships among multimedia objects, such as texts, graphics, images, audio, and
video, but affect the playback schedules. In this paper, we propose a synchronization mechanism to guarantee the quality of
multimedia presentation with user interactions. In our protocol, each presentation site requests media transmission from the
required media servers at certain time intervals prior to the playback deadlines, where these time intervals are the response
times to cover possible experienced end-to-end delays and packet losses, and waits for an initial setup time to ensure intermedia
synchronization before starting the presentation. Users may interact with the presentation. This synchronization mechanism
solves the problems incurred by user interactions by determining the new presentation scenario produced by the interactive
operation, calculating the corresponding setup time, and then rendering the new playback and retrieval schedules. 相似文献
19.
Excessive buffer requirement to handle continuous-media playbacks is an impediment to cost- effective provisioning for on-line
video retrieval. Given the skewed distribution of video popularity, it is expected that often there are concurrent playbacks
of the same video file within a short time interval. This creates an opportunity to batch multiple requests and to service
them with a single stream from the disk without violating the on-demand constraint. However, there is a need to keep data
in memory between successive uses to do this. This leads to a buffer space trade-off between servicing a request in memory mode vs. servicing it in disk-mode. In this work, we develop a novel algorithm to minimize the buffer requirement to support a set of concurrent playbacks.
One of the beauties of the proposed scheme is that it enables the server to dynamically adapt to the changing workload while
minimizing the total buffer space requirement. Our algorithm makes a significant contribution in decreasing the total buffer
requirement, especially when the user access pattern is biased in favor of a small set of files. The idea of the proposed
scheme is modeled in detail using an analytical formulation, and optimality of the algorithm is proved. An analytical framework
is developed so that the proposed scheme can be used in combination with various existing disk-scheduling strategies. Our
simulation results confirm that under certain circumstances, it is much more resource efficient to support some of the playbacks
in memory mode and subsequently the proposed scheme enables the server to minimize the overall buffer space requirement. 相似文献
20.
Managing database server performance to meet QoS requirements in electronic commerce systems 总被引:1,自引:0,他引:1
Patrick Martin Wendy Powley Hoi-Ying Li Keri Romanufa 《International Journal on Digital Libraries》2002,3(4):316-324
The performance of electronic commerce systems has a major impact on their acceptability to users. Different users also demand
different levels of performance from the system, that is, they will have different Quality of Service (QoS) requirements. Electronic commerce systems are the integration of several different types of servers and each server must
contribute to meeting the QoS demands of the users. In this paper we focus on the role, and the performance, of a database server within an electronic commerce system.
We examine the characteristics of the workload placed on a database server by an electronic commerce system and suggest a
range of QoS requirements for the database server based on this analysis of the workload. We argue that a database server
must be able to dynamically reallocate its resources in order to meet the QoS requirements of different transactions as the
workload changes. We describe Quartermaster, which is a system to support dynamic goal-oriented resource management in database
management systems, and discuss how it can be used to help meet the QoS requirements of the electronic commerce database server.
We provide an example of the use of Quartermaster that illustrates how the dynamic reallocation of memory resources can be
used to meet the QoS requirements of a set of transactions similar to transactions found in an electronic commerce workload.
We briefly describe the memory reallocation algorithms used by Quartermaster and present experiments to show the impact of
the reallocations on the performance of the transactions.
Published online: 22 August 2001 相似文献