Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Vin, P. Goyal, A. Goyal (1994)
A statistical admission control algorithm for multimedia servers
Sheng-Tzong Cheng, Chi-Ming Chen, I. Chen (2000)
Dynamic quota-based admission control with sub-rating in multimedia serversMultimedia Systems, 8
H. Vin, A. Goyal, P. Goyal (1995)
Algorithms for Designing Multimedia ServersComput. Commun., 18
H. Vin, A. Goyal, Anshuman Goyal, P. Goyal (1994)
An observation-based admission control algorithm for multimedia servers1994 Proceedings of IEEE International Conference on Multimedia Computing and Systems
(1994)
Architecture for personalized multimedia
P. Goyal, H. Vin (1996)
Network algorithms and protocol for multimedia serversProceedings of IEEE INFOCOM '96. Conference on Computer Communications, 3
C. Bisdikian, K. Maruyama, D. Seidman, D. Serpanos (1996)
Cable access beyond the hype: on residential broadband data services over HFC networksIEEE Commun. Mag., 34
I. Chen, Chi-Ming Chen (1996)
Threshold-Based Admission Control Policies for Multimedia ServersComput. J., 39
K. Nahrstedt, Jonathan Smith (1995)
The QOS BrokerIEEE Multim., 2
P. Dixit, M. Vouk, D. Bitzer (1997)
Predictive Modeling of End-User Quality of Service for Network-Based Education
(1996)
Cost analysis for VBR video
P. Rangan, H. Vin (1991)
Designing file systems for digital video and audio
A. Vogel, B. Kerhervé, G. Bochmann, J. Gecsei (1995)
Distributed Multimedia and QOS: A SurveyIEEE Multim., 2
(1998)
The implementation of intelligent service navigator for virtual club multimedia service system on CATV network
While multimedia servers become increasingly important, resource management is essential to performance and quality guarantees. In most multimedia servers, each user request is treated independently. However, in some applications, such as training centers or entertainment renting stores, a user may request a sequence of multimedia data retrievals for viewing a series of lecture representations or entertainment song plays. Hence, a user's interaction with such a server, called a session , consists of a sequence of variable length multimedia data access requests. In this paper, we call each such access request, within a session, a round . Each round has its own QoS requirements, and the start and finish times might not be coincident with another user's. Most dynamic resource allocation algorithms reassign resources to all the users only at the same fixed periods, which might not perform well on the systems described above. Hence, we propose a dynamic round-based resource management utilizing the characteristics of sessions and rounds. We develop an admission control algorithm for accepting new users (sessions) and a dynamic resource assignment algorithm that performs at the start of each round, instead of at fixed periods. The simulation results show that the proposed algorithms perform better than conventional methods. Received 7 August, 1998. Revised 23 May, 2000. Copyright 2000 « Previous | Next Article » Table of Contents This Article The Computer Journal (2000) 43 (5): 386-395. doi: 10.1093/comjnl/43.5.386 » Abstract Free Full Text (PDF) Free Classifications Article Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Citing articles via Google Scholar Google Scholar Articles by Cheng, S. T. Articles by Chen, C. M. Search for related content Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue November 2015 58 (11) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 0.787 5-Yr impact factor: 0.962 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read Fast Implementation of Relational Operations Via Inverse Projections What is the Use of Operating Systems? Defining System Requirements to meet Business Needs: a Case Study Example On the Meaning of Safety and Security A Simplex Method for Function Minimization » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis Hierarchical grouping methods and stopping rules: an evaluation Function minimization by conjugate gradients A new approach to variable metric algorithms » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2015 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
The Computer Journal – Oxford University Press
Published: Jan 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.