NSF-CGP Science Fellowship Program: Fluid Flow Approximation in Open Networks

9402505西格曼该奖项资助哥伦比亚大学工业工程与运筹学系的卡尔·西格曼博士于1995年初在日本度过7个月的国外旅行费用。Sigman博士将与东京科学大学信息科学系的Masakiyo Miyazawa教授一起进行开放网络中流体流动近似领域的理论研究。离散对象，如数据位、作业和客户，随着时间的推移到达一个设施，可以近似为流体的流动。本研究的目的是在模型的原语（如到达机制和处理机制）为一般过程的情况下，获得系统性能的近似值和界限。这种近似和边界在电信、制造业和金融等不同领域都很有趣，在这些领域，真实的系统变得越来越复杂，不容易通过经典的排队方法进行分析。离散系统的流体流动模型是很有趣的，因为它为分析那些重要但数学上难以处理的系统提供了工具。该项目将Sigman博士在流体流动近似对排队网络的重要性方面的相关研究兴趣与世界排名前列的排队理论家之一Miyazawa教授的专业知识结合起来。该奖项由日本基金会全球伙伴关系中心（CGP）在NSF-CGP科学奖学金计划的支持下资助。＊＊＊

9402505 Sigman This award supports the foreign travel expenses for Dr. Karl Sigman from the Department of Industrial Engineering and Operations Research at Columbia University to spend seven months in early 1995 in Japan. Dr. Sigman will be conducting theoretical research with Professor Masakiyo Miyazawa of the Department of Information Sciences at the Science University of Tokyo in the area of fluid flow approximation in open networks. Discrete objects such as bits of data, jobs, and customers, arriving over time to a facility can be approximated as a flow of a fluid. The purpose of this study is to obtain approximations and bounds for system performance in the case when primitives of the model, such as the arrival and processing mechanisms, are general processes. Such approximations and bounds are of interest in areas as diverse as telecommunications, manufacturing and finance, where real systems are becoming increasingly complex and are not easily analyzed through classic queuing methods. Fluid flow models of discrete systems are of interest as providing tools for the analysis of systems that are important yet mathematically intractable. This project brings together the related research interests of Dr. Sigman in the importance of fluid flow approximation to queuing networks with the expertise of Prof. Miyazawa, one of the world's ranking queuing theorists. This award is funded under the auspices of the Center for Global Partnership (CGP) of the Japan Foundation under the NSF-CGP Science Fellowship Program. ***