Investigation of steady-state characteristics in a system with random choice of requests within a packet for servicing

zbMATH Open0533.90036MaRDI QIDQ790035FDOQ790035

Authors: V. F. Matveev, I. G. Kharitontseva 

Publication date: 1983

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Recommendations

• Random-choice discipline in an M/G/1 system
• scientific article; zbMATH DE number 610384
• Some servicing disciplines for a large packet of requests
• scientific article; zbMATH DE number 3992598
• scientific article; zbMATH DE number 3899915

zbMATH Keywords

virtual waiting timedetermination of stationary characteristicspacket sizePacket- service queuing systemsPoisson arrivalvirtual engagement time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (2)

• Proc symp on congestion theory
• Title not available (Why is that?)

This page was built for publication: Investigation of steady-state characteristics in a system with random choice of requests within a packet for servicing

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