Time-average and asymptotically optimal flow control policies in networks with multiple transmitters

DOI10.1007/BF02025184zbMath0759.90030OpenAlexW3037202656MaRDI QIDQ1197767

Demosthenis Teneketzis, Redha M. Bournas, Frederick J. Beutler

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02025184

zbMATH Keywords

optimal time-average policysingle receiverslotted time-multiplexed link

Mathematics Subject Classification ID

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

Cites Work

• On the Characteristics of the General Queueing Process, with Applications to Random Walk
• Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs
• Optimal hop-by-hop flow control in computer networks
• Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
• On Dynamic Programming with Unbounded Rewards
• On the Theory of Queues With Many Servers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Time-average and asymptotically optimal flow control policies in networks with multiple transmitters