Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload

DOI10.1016/j.comnet.2009.11.010zbMath1208.68088OpenAlexW2039316804MaRDI QIDQ605549

Daniel Kofman, Eitan Altman, Tania Jiménez

Publication date: 25 November 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2009.11.010

zbMATH Keywords

resource allocation TCP discriminatory processor sharing overload

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ The fluid limit of the multiclass processor sharing queue ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Processor sharing: a survey of the mathematical theory ⋮ Hierarchical Game and Bi-level Optimization for Controlling Network Usage Via Pricing ⋮ Analysis of alternating-priority queueing models with (cross) correlated switchover times

This page was built for publication: Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload