scientific article; zbMATH DE number 1191592

MaRDI QIDQ3842599zbMATH OpenFDO

Authors L. G. Afanassieva, Franck Delcoigne, Guy Fayolle

Publication date 25 October 1998

zbMATH Keywords

central limit theoremnetworkrecurrencetransience

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 845596
• Queueing systems on a circle
• Ergodicity of a polling network

Cited in

(5)

• A continuous polling system with general service times
• A polling system with `join the shortest -- serve the longest' policy
• Mathematical methods to study the polling systems
• IMPROVING THE PERFORMANCE OF POLLING MODELS USING FORCED IDLE TIMES
• In Memory of L. G. Afanasyeva (14.09.1937--26.08.2022)

This page was built for publication:

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