Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Performance

arXiv:1102.3703 (cs)
[Submitted on 17 Feb 2011]

Title:Allocation and Admission Policies for Service Streams

Authors:Michele Mazzucco, Isi Mitrani, Mike Fisher, Paul McKee
View PDF
Abstract:A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the rate of their submission is specified. On the other hand, the provider promises a certain quality of service (QoS), measured by the average waiting time of the jobs in the stream. A penalty is paid if the agreed QoS requirement is not met. The objective is to maximize the total average revenue per unit time. Dynamic policies for making server allocation and stream admission decisions are introduced and evaluated. The results of several simulations are described.
Comments: 8 pages, 5 figures, 16th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2008), pp155-162 (Best Paper Award)
Subjects: Performance (cs.PF); Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:1102.3703 [cs.PF]
  (or arXiv:1102.3703v1 [cs.PF] for this version)
  https://doi.org/10.48550/arXiv.1102.3703
Journal reference: 16th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2008), pp155-162

Submission history

From: Michele Mazzucco [view email]
[v1] Thu, 17 Feb 2011 21:20:06 UTC (71 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.PF
< prev   |   next >
new | recent | 2011-02
Change to browse by:
cs
cs.DC

References & Citations

DBLP - CS Bibliography

listing | bibtex
Michele Mazzucco
Isi Mitrani
Mike Fisher
Paul McKee
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)