Dynamic round-based resource management for on-demand multimedia servers

Sheng Tzong Cheng, Chia Mei Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)386-395
Number of pages10
JournalComputer Journal
Volume43
Issue number5
DOIs
Publication statusPublished - 2000 Dec 1

Fingerprint

Servers
Access control
Resource allocation
Quality of service

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{3ae098da67e24083872104d6e60503ea,
title = "Dynamic round-based resource management for on-demand multimedia servers",
abstract = "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.",
author = "Cheng, {Sheng Tzong} and Chen, {Chia Mei}",
year = "2000",
month = "12",
day = "1",
doi = "10.1093/comjnl/43.5.386",
language = "English",
volume = "43",
pages = "386--395",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

Dynamic round-based resource management for on-demand multimedia servers. / Cheng, Sheng Tzong; Chen, Chia Mei.

In: Computer Journal, Vol. 43, No. 5, 01.12.2000, p. 386-395.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic round-based resource management for on-demand multimedia servers

AU - Cheng, Sheng Tzong

AU - Chen, Chia Mei

PY - 2000/12/1

Y1 - 2000/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034478622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034478622&partnerID=8YFLogxK

U2 - 10.1093/comjnl/43.5.386

DO - 10.1093/comjnl/43.5.386

M3 - Article

AN - SCOPUS:0034478622

VL - 43

SP - 386

EP - 395

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -