Sharing Memory Optimally
From MaRDI portal
Publication:4740495
DOI10.1109/TCOM.1983.1095819zbMath0504.94037OpenAlexW2096241716MaRDI QIDQ4740495
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
performance measuresqueueing theorycomputer networksservice facilitydata networksnumber of waiting requestssharing of resources
Queues and service in operations research (90B22) Applications of design theory to circuits and networks (94C30)
Related Items (9)
Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center. ⋮ A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks ⋮ Finite source blocking systems with multi-level active and idle periods ⋮ Computational algorithms for blocking probabilities in circuit-switched networks ⋮ Interconnected networks of queues with randomized arrival and departure blocking ⋮ Exponential penalty function control of loss networks ⋮ Erlang loss bounds for OT-ICU systems ⋮ Linear programming relaxations and marginal productivity index policies for the buffer sharing problem ⋮ Product Forms for Stochastic Interference Systems
This page was built for publication: Sharing Memory Optimally
