Algorithmic Analysis and Congestion Control of Connection-Oriented Services in Large Scale Communication Networks.

大规模通信网络中面向连接的服务的算法分析和拥塞控制。

• 批准号: 9404947
• 负责人: Hisashi Kobayashi
• 金额: $ 12.47万
• 依托单位: Princeton University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-09-01 至 1999-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9404947&HistoricalAwards=false
• 关键词: Algorithmic; Analysis; Congestion; Control; Connection

9404947 Kobayashi Network technologies have been progressing rapidly toward faster and larger networks which are capable of providing integrated services. These technical developments in turn require advances in analytic methodologies that can be effectively used in the design and control of future networks such as ATM-based B-ISDN, all-optical networks and wireless communication networks. Emerging high-speed integrated communication services require us to analyze network systems, in which information loss probabilities range from 10**-2 (e.g., call connection loss) to as small as 10**-10 (e.g., ATM cell loss). In this proposed study we will develop a theoretical foundtion for evaluation and control of connection-oriented services, which in particular will enable us to handle this wide range of loss probabilities. We begin by generalizing the product form solutions obtained for loss networks with fixed routing. Our formulation encompasses a broad range of state-dependent call generation patterns, different types of network services, and the whole range of traffic levels. Using our experience in computational algorithms for closed queueing network models, we will develop new practical methods for estimating loss probabilities in connection-oriented services. In order to insure the accuracy of approximate formulas, we will develop appropriate error bounds. A refinement and a rigorous validation of the reduced load approximation method, also referred to as the Erlang's fixed point method in the case of Poisson arrivals, will be attempted for networks with state dependent arrivals. In parallel with the above algorithmic and asymptotic methods, we will explore a model of connection-oriented network services based on a multi-dimensional Ornstein-Uhlenbeck diffusion process. The diffusion process approach will allow us not only to evaluate more general types of networks (i.e., loss/queueing networks not amenable to product form solutions) but also to obtain time-dependent, i.e., transient, solutions for network behavior. Finally, we will formulate and solve network control policy problems such as call admission control and routing decisions. ***

9404947小林 网络技术已经朝着能够提供集成服务的更快和更大的网络快速发展。 这些技术的发展反过来又要求分析方法的进步，这些方法可以有效地用于设计和控制未来的网络，如基于ATM的B-ISDN，全光网络和无线通信网络。 新兴的高速综合通信服务要求我们分析网络系统，其中信息丢失概率范围从10**-2（例如，呼叫连接损失）小到10**-10（例如， ATM信元丢失）。 在这项拟议的研究中，我们将开发一个理论基础，面向连接的服务，这特别是将使我们能够处理这种广泛的损失概率的评估和控制。我们开始推广的产品形式的解决方案，获得了固定路由损耗网络。 我们的公式包括广泛的依赖于状态的呼叫生成模式，不同类型的网络服务，和整个范围的流量水平。利用我们在封闭式网络模型的计算算法方面的经验，我们将开发新的实用方法来估计面向连接的服务中的丢失概率。 为了保证近似公式的准确性，我们将制定适当的误差范围。 一个细化和严格验证的减少负载近似方法，也被称为厄兰的不动点方法的情况下，泊松到达，将尝试与状态相关的到达网络。 与上述算法和渐近方法并行，我们将探索基于多维Ornstein-Uhlenbeck扩散过程的面向连接的网络服务模型。 扩散过程方法将使我们不仅能够评估更一般类型的网络（即， 损耗/损耗网络不服从乘积形式解），而且还获得时间依赖的，即，网络行为的瞬态解决方案。 最后，我们将制定和解决网络控制策略问题，如呼叫准入控制和路由决策。 ***