Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks

V.F. Nicola, T.S. Zaburnenko

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

    19 Downloads (Pure)

    Abstract

    Many of recent studies have proved the tail equivalence result for Egalitarian Processor Sharing system: [EQUATION], where B (resp. V) is service requirement (resp. sojourn time) of a customer; for PS, g = 1 - ρ. In this paper, we consider time-shared systems in which the server capacity is shared by existing customers in proportion to (dynamic) weights assigned to customers. We consider two systems, 1) in which the weight of a customer depends on it Age (attained service), and 2) in which the weight depends on the residual processing time (RPT). We allow for a parameterized family of weight functions such that the weight associated with a customer that has received a service (or, has a RPT) of x units is ω(x) = xα for some -∞ < α < ∞. We then study the sojourn time of a customer under such scheduling discipline and provide conditions on α for tail equivalence to hold true, and also give the value of g as a function of α.
    Original languageEnglish
    Title of host publicationVALUETOOLS '06
    Subtitle of host publicationProceedings of the First International Conference on Performance Evaluation Methodologies and Tools
    Place of PublicationNew York, NY
    PublisherACM Press
    Pages37
    Number of pages12
    ISBN (Print)1-59593-504-5
    DOIs
    Publication statusPublished - Oct 2006
    Event1st International Conference on Performance Evaluation Methodologies and Tools 2006 - Pisa, Italy
    Duration: 11 Oct 200613 Oct 2006
    Conference number: 1
    http://archive.valuetools.org/2006/

    Publication series

    NameACM International Conference Proceeding Series
    PublisherACM Press
    NumberA219
    Volume180

    Conference

    Conference1st International Conference on Performance Evaluation Methodologies and Tools 2006
    Abbreviated titleVALUETOOLS 2006
    CountryItaly
    CityPisa
    Period11/10/0613/10/06
    Internet address

    Fingerprint Dive into the research topics of 'Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks'. Together they form a unique fingerprint.

    Cite this