Sharing Memory Optimally

DOI10.1109/TCOM.1983.1095819zbMATH Open0504.94037OpenAlexW2096241716MaRDI QIDQ4740495FDOQ4740495

Authors: Gerard J. Foschini, B. Gopinath 

Publication date: 1983

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1983.1095819

zbMATH Keywords

queueing theoryperformance measurescomputer networksservice facilitydata networksnumber of waiting requestssharing of resources

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of design theory to circuits and networks (94C30)

Cited In (9)

• Product Forms for Stochastic Interference Systems
• Finite source blocking systems with multi-level active and idle periods
• Linear programming relaxations and marginal productivity index policies for the buffer sharing problem
• Exponential penalty function control of loss networks
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center.
• Interconnected networks of queues with randomized arrival and departure blocking
• Erlang loss bounds for OT-ICU systems
• Computational algorithms for blocking probabilities in circuit-switched networks

This page was built for publication: Sharing Memory Optimally

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