Segregating the Input to a Series of Buffers

DOI10.1287/MOOR.10.1.33MaRDI QIDQ3682213zbMATH OpenOpenAlexFDO

Authors Frank Kelly

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.1.33

zbMATH Keywords

blockingbuffer nodesextreme valuesmessage transmissionsegregation of long messagesseries of linked communication channelsseries of queuesthroughput

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25) Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 3967617
• scientific article; zbMATH DE number 3870376
• Heavy-Traffic Analysis of a Data-Handling System with Many Sources
• scientific article; zbMATH DE number 3499620
• scientific article; zbMATH DE number 3934920

Cited in

(3)

• Analyzing sharing strategies for finite buffer memory in a router among outgoing channels
• scientific article; zbMATH DE number 3870376 (Why is no real title available?)
• Mathematical theory of queueing networks

This page was built for publication: Segregating the Input to a Series of Buffers

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