By Topic

On G-networks and resource allocation in multimedia systems

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)
Gelenbe, E. ; Dept. of Electr. & Comput. Eng., Duke Univ., Durham, NC, USA ; Shachnai, H.

Multimedia systems are gaining importance as novel computer and communication system architectures, which are specialized to the storage and transfer of video documents. Consider a multimedia-on-demand server which transmits video documents through a high-speed network, to geographically distributed clients. The server accumulates requests for specific documents in separate queues. The queues need to share the transmission medium in some fashion, typically in Round-Robin mode. We describe the resulting performance modeling problem, and develop an approximate representation using queuing networks. Our analytic model enables the efficient implementation of a new scheduling scheme, that we call the Local Round-Robin (LRR). We show that LRR yields significant improvement in system performance, compared to the original Round-Robin

Published in:

Research Issues In Data Engineering, 1998. 'Continuous-Media Databases and Applications'. Proceedings., Eighth International Workshop on

Date of Conference:

23-24 Feb 1998