The twin measure for queueing system predictability

David Raz, Hanoch Levy, Benjamin Avi-Itzhak

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Two identical jobs with deterministically identical processing times arrive at a Web server simultaneously (Twins), but leave the system thirty seconds apart. Is the service predictable? Is their sojourn time predictable? This issue arises in modern day networking systems such as call centers and Web servers as well as in other queueing systems. We propose a novel measure based on the principle that in a predictable system, "twin" jobs should not depart the system very far apart. We analyze this measure for a number of common scheduling policies and compare the results. We compare the results to those of other predictability approaches proposed recently and discuss its usefulness.

Original languageEnglish
Title of host publicationVALUETOOLS 2007 - 2nd International ICST Conference on Performance Evaluation Methodologies and Tools
PublisherICST
ISBN (Print)9789639799004
DOIs
StatePublished - 2007
Event2nd International ICST Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2007 - Nantes, France
Duration: 22 Oct 200726 Oct 2007

Publication series

NameVALUETOOLS 2007 - 2nd International ICST Conference on Performance Evaluation Methodologies and Tools

Conference

Conference2nd International ICST Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2007
Country/TerritoryFrance
CityNantes
Period22/10/0726/10/07

Keywords

  • FCFS
  • Job scheduling
  • LAS
  • LCFS
  • LJF
  • LRPT
  • PS
  • Predictability
  • Processor sharing
  • Queue disciplines
  • Round robin
  • SJF
  • SRPT
  • Twin measure

Fingerprint

Dive into the research topics of 'The twin measure for queueing system predictability'. Together they form a unique fingerprint.

Cite this