Analysis and Control of Queueing Networks

排队网络的分析与控制

• 批准号: 8421128
• 负责人: Jean Walrand
• 金额: $ 12.5万
• 依托单位: University of California-Berkeley
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1985
• 资助国家: 美国
• 起止时间: 1985-07-01 至 1988-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8421128&HistoricalAwards=false
• 关键词: Analysis; Control; Queueing; Networks

This research concerns the analysis and control of queueing networks. A number of different topics relating to queueing networks will be investigated, including analytical approximation results, optimal control, sub-optimal control, and dalays. Under topics (1) and (3) the aim is to provide analytical justification for approximation methods used for stochastic networks and to quantify sub-optimal control policies. The approach used under topics (2) and (4) is to analyze simplified models to determine optimal control policies and to investigate the effect of delays. It is expected that this research will have significant impact on the theory of queueing networks, a subject which has wide application to communications, computer networks, and manufacturing systems.

本研究涉及排队网络的分析和控制。 将研究与排队网络相关的许多不同主题，包括解析近似结果、最优控制、次优控制和延迟。 主题 (1) 和 (3) 的目的是为随机网络所使用的近似方法提供分析论证并量化次优控制策略。 主题 (2) 和 (4) 下使用的方法是分析简化模型以确定最优控制策略并研究延迟的影响。 预计这项研究将对排队网络​​理论产生重大影响，该理论广泛应用于通信、计算机网络和制造系统。