Analysis of a general service nonexhaustive polling system using a heuristic combination method and pseudoconservation law

DOI10.1016/0166-5316(94)00053-0MaRDI QIDQ4332067zbMATH OpenOpenAlexFDO

Authors Chung-Ju Chang, Lain-Chyr Hwang

Publication date 27 February 1997

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(94)00053-0

zbMATH Keywords

General service order sequenceMean waiting timeNonexhaustive service disciplinePseudoconservation law

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Performance analysis of finite capacity polling systems with nonexhaustive service
• scientific article; zbMATH DE number 4151581
• A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals
• On the Stability of Greedy Polling Systems with General Service Policies
• Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks
• Analysis of a batch service polling system in a multi-phase random environment
• Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
• Analysis of a batch service multi-server polling system with dynamic service control
• Pseudo-conservation laws in cyclic-service systems with a class of limited service policies

Cited in

(1)

• A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals

This page was built for publication: Analysis of a general service nonexhaustive polling system using a heuristic combination method and pseudoconservation law

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332067)