By Topic

Dynamic scheduling techniques for interactive hypermedia servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hamidzadeh, B. ; Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC, Canada ; Tsun-Ping, J.

Future multimedia-on-demand systems will bring interactive applications in education, entertainment, advertisement, and visualisation to a large number of users at homes, offices, classrooms and laboratories. A class of multimedia data, called hypermedia, is represented by graph structures whose branches represent different video and audio segments and whose nodes represent user interactions. To provide satisfactory service in an interactive hypermedia system, disruptions and delays in the concurrent delivery of continuous media data streams from storage devices cannot be tolerated. Slow response to new requests generated by on-line users is also highly undesirable. The frequent arrivals acid completions of user requests can seriously degrade the throughput of typical servers that are designed to maintain performance at the steady state. To address these issues, we propose a dynamic approach to the retrieval of continuous media and sporadic data in an interactive hypermedia server. The throughput and efficiency of our server are improved by observing run-time information to skip or reorder service sequences, as well as maximising disk reads. Through pipelining the admission of new streams with the departure of ongoing streams, the performance is also immune to the presence of transients. User response times under identical loads are reduced significantly with respect to other existing approaches. Furthermore, our scheduler can efficiently redirect disk bandwidth to service sporadic requests when the demand on real-time services decreases. We evaluate our technique by comparing its performance with static techniques via thorough experiments under different buffer capacities, stream lengths and request arrival rates. Results of experiments show that our approach can significantly improve continuous media data throughput, user response time, as well as sporadic data throughput, and is thus a plausible approach for more interactive multimedia applications such as hypermedia

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:45 ,  Issue: 1 )