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

Polling systems in heavy traffic: Exhaustiveness of service policies

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

DOI10.1023/A:1019118232492zbMath0905.90079OpenAlexW166285091MaRDI QIDQ1392503

D. Massart

Publication date: 28 July 1998

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019118232492


zbMATH Keywords

monotonicityheavy-trafficexpected delayexhaustivenesscyclic polling modelsgeneral branching-type service disciplines


Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)


Related Items (8)

Polling systems with periodic server routing in heavy traffic: renewal arrivals ⋮ POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE ⋮ Mathematical methods to study the polling systems ⋮ Towards a unifying theory on branching-type polling systems in heavy traffic ⋮ On global near optimality of special periodic protocols for fluid polling systems with setups ⋮ Polling models with multi-phase gated service ⋮ Polling systems with periodic server routeing in heavy traffic: distribution of the delay ⋮ Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times




This page was built for publication: Polling systems in heavy traffic: Exhaustiveness of service policies

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