Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals

From MaRDI portal
Publication:1984681
Jump to:navigation, search

DOI10.1016/j.orl.2020.01.004OpenAlexW3004386171MaRDI QIDQ1984681

Yanyan Li

Publication date: 7 April 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/29451


zbMATH Keywords

heavy trafficbatch arrivalsdiscriminatory processor sharingjoint queue-length distribution


Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)




Cites Work

  • Unnamed Item
  • The fluid limit of the multiclass processor sharing queue
  • On the transient behavior of the processor sharing queue
  • Waiting-time distributions in polling systems with simultaneous batch arrivals
  • Mean sojourn times for phase-type discriminatory processor sharing systems
  • A survey on discriminatory processor sharing
  • Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
  • Sharing a Processor Among Many Job Classes
  • On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
  • Time-shared Systems
  • Queue-Length Distribution for the Discriminatory Processor-Sharing Queue


This page was built for publication: Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1984681&oldid=14440975"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 17:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki