Time-average and asymptotically optimal flow control policies in networks with multiple transmitters
type: Item
instance of: scholarly article
title: Time-average and asymptotically optimal flow control policies in networks with multiple transmitters
zbMATH Open document ID: 0759.90030
DOI: 10.1007/BF02025184
author: Redha M. Bournas
author: Demosthenis Teneketzis
author: Frederick J. Beutler
published in: Annals of Operations Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 91897
zbMATH Keywords: single receiver
zbMATH Keywords: slotted time-multiplexed link
zbMATH Keywords: optimal time-average policy
MaRDI profile type: Publication
cites work: Q5560061
cites work: Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs
cites work: Q5624436
cites work: Q4039795
cites work: On the Theory of Queues With Many Servers
cites work: On the Characteristics of the General Queueing Process, with Applications to Random Walk
cites work: Q5595646
cites work: Q3487241
cites work: Q5811575
cites work: On Dynamic Programming with Unbounded Rewards
cites work: Optimal hop-by-hop flow control in computer networks
cites work: Q4168506
cites work: Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
full work available at URL: https://doi.org/10.1007/bf02025184
OpenAlex ID: W3037202656
description: scientific article; zbMATH DE number 91897