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

V.F. Nicola; T.S. Zaburnenko

doi:10.1145/1190095.1190142

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 proceeding › Conference contribution › Academic › peer-review

29 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 language	English
Title of host publication	VALUETOOLS '06
Subtitle of host publication	Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools
Place of Publication	New York, NY
Publisher	ACM Press
Pages	37
Number of pages	12
ISBN (Print)	1-59593-504-5
DOIs	https://doi.org/10.1145/1190095.1190142
Publication status	Published - Oct 2006
Event	1st International Conference on Performance Evaluation Methodologies and Tools 2006 - Pisa, Italy Duration: 11 Oct 2006 → 13 Oct 2006 Conference number: 1 http://archive.valuetools.org/2006/

Publication series

Name	ACM International Conference Proceeding Series
Publisher	ACM Press
Number	A219
Volume	180

Conference

Conference	1st International Conference on Performance Evaluation Methodologies and Tools 2006
Abbreviated title	VALUETOOLS 2006
Country/Territory	Italy
City	Pisa
Period	11/10/06 → 13/10/06
Internet address	http://archive.valuetools.org/2006/

Access to Document

10.1145/1190095.1190142

Cite this

Nicola, V. F., & Zaburnenko, T. S. (2006). Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks. In VALUETOOLS '06: Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools (pp. 37). (ACM International Conference Proceeding Series; Vol. 180, No. A219). ACM Press. https://doi.org/10.1145/1190095.1190142

@inproceedings{e03108e39b4e411092f9761a42c355d4,

title = "Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks",

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 α.",

author = "V.F. Nicola and T.S. Zaburnenko",

year = "2006",

month = oct,

doi = "10.1145/1190095.1190142",

language = "English",

isbn = "1-59593-504-5",

series = "ACM International Conference Proceeding Series",

publisher = "ACM Press",

number = "A219",

pages = "37",

booktitle = "VALUETOOLS '06",

note = "1st International Conference on Performance Evaluation Methodologies and Tools 2006, VALUETOOLS 2006 ; Conference date: 11-10-2006 Through 13-10-2006",

url = "http://archive.valuetools.org/2006/",

}

Nicola, VF & Zaburnenko, TS 2006, Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks. in VALUETOOLS '06: Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools. ACM International Conference Proceeding Series, no. A219, vol. 180, ACM Press, New York, NY, pp. 37, 1st International Conference on Performance Evaluation Methodologies and Tools 2006, Pisa, Italy, 11/10/06. https://doi.org/10.1145/1190095.1190142

Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks. / Nicola, V.F.; Zaburnenko, T.S.
VALUETOOLS '06: Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools. New York, NY: ACM Press, 2006. p. 37 (ACM International Conference Proceeding Series; Vol. 180, No. A219).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Nicola, V.F.

AU - Zaburnenko, T.S.

N1 - Conference code: 1

PY - 2006/10

Y1 - 2006/10

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

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

U2 - 10.1145/1190095.1190142

DO - 10.1145/1190095.1190142

M3 - Conference contribution

SN - 1-59593-504-5

T3 - ACM International Conference Proceeding Series

SP - 37

BT - VALUETOOLS '06

PB - ACM Press

CY - New York, NY

T2 - 1st International Conference on Performance Evaluation Methodologies and Tools 2006

Y2 - 11 October 2006 through 13 October 2006

ER -

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

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this